Results 101 to 110 of about 22,643,313 (377)

Circulating histones as clinical biomarkers in critically ill conditions

open access: yesFEBS Letters, EarlyView.
Circulating histones are emerging as promising biomarkers in critical illness due to their diagnostic, prognostic, and therapeutic potential. Detection methods such as ELISA and mass spectrometry provide reliable approaches for quantifying histone levels in plasma samples.
José Luis García‐Gimenez   +17 more
wiley   +1 more source

Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity

open access: yes, 2021
The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents.
Sharf, Miel, Zelazo, Daniel
core  

A Mixed-Critical Consistent Update Algorithm in Software Defined Time-Triggered Ethernet Using Time Window

open access: yesIEEE Access, 2020
Software Defined Networking (SDN) presents a tremendous opportunity for developing abstract management of network updates. However, network updates introduce challenges in terms of consistency. Many consistent update algorithms are proposed for Ethernet,
Jun Lu   +4 more
doaj   +1 more source

Single‐cell insights into the role of T cells in B‐cell malignancies

open access: yesFEBS Letters, EarlyView.
Single‐cell technologies have transformed our understanding of T cell–tumor cell interactions in B‐cell malignancies, revealing new T‐cell subsets, functional states, and immune evasion mechanisms. This Review synthesizes these findings, highlighting the roles of T cells in pathogenesis, progression, and therapy response, and underscoring their ...
Laura Llaó‐Cid
wiley   +1 more source

Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity

open access: yes, 2007
The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For
Rajan, B. Sundar, Rajan, G. Susinder
core   +1 more source

Biological and technical complexities in analyzing extracellular vesicle immune interactions in B‐cell malignancies

open access: yesFEBS Letters, EarlyView.
Extracellular vesicles (EVs) mediate intercellular communication in tumor immune microenvironments. However, their role in B‐cell malignancies remains poorly defined, owing to biological complexity and technical challenges in EV isolation and analysis.
Daniel Bachurski, Michael Hallek
wiley   +1 more source

Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results

open access: yes, 2013
We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods.
Boland, Natashia   +3 more
core   +1 more source

Intron‐oriented HTLV‐1 integration in an adult T‐cell leukemia/lymphoma cell line sustains expression of intact ift81 mRNA

open access: yesFEBS Letters, EarlyView.
In the adult T‐cell leukemia/lymphoma (ATL) cell line ED, the human T‐cell leukemia virus type 1 (HTLV‐1) provirus was integrated into the intron of the ift81 gene in the antisense orientation. Despite this integration, both the intact ift81 and the viral oncogene hbz were simultaneously expressed, likely due to the functional insufficiency of viral ...
Mayuko Yagi   +5 more
wiley   +1 more source

On the measurements of algorithms in big data era

open access: yes大数据, 2016
The ability to store and analyze big data is a crucial capability of a powerful country in the new century.The current research of big data contains weakness on common scientific questions,general methodology,and theoretical analysis of real-time ...
Jialin ZHANG, Xiaoming SUN
doaj  

Average case analysis of marking algorithms [PDF]

open access: yes, 1984
The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n^2) in all cases, but it has been assumed that the average case time complexity O(n lg n). It is proven that the average case time complexity is H(n^2).
Hirschberg, D. S., Larmore, L. L.
core   +1 more source

Home - About - Disclaimer - Privacy