Results 131 to 140 of about 5,765,386 (368)

Reset Complexity of Ideal Languages [PDF]

open access: yesarXiv, 2014
We present a new characteristic of a regular ideal language called reset complexity. We find some bounds on the reset complexity in terms of the state complexity of a given language. We also compare the reset complexity and the state complexity for languages related to slowly synchronizing automata and study uniqueness question for automata yielding ...
arxiv  

Complex networks with complex weights

open access: yesPhysical Review E
17 pages, 7 figures, 1 ...
Lucas Böttcher, Mason A. Porter
openaire   +3 more sources

Surfaceome: a new era in the discovery of immune evasion mechanisms of circulating tumor cells

open access: yesMolecular Oncology, EarlyView.
In the era of immunotherapies, many patients either do not respond or eventually develop resistance. We propose to pave the way for proteomic analysis of surface‐expressed proteins called surfaceome, of circulating tumor cells. This approach seeks to identify immune evasion mechanisms and discover potential therapeutic targets. Circulating tumor cells (
Doryan Masmoudi   +3 more
wiley   +1 more source

Conflict complexity is lower bounded by block sensitivity [PDF]

open access: yesarXiv, 2018
We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity.
arxiv  

Clinical applications of next‐generation sequencing‐based ctDNA analyses in breast cancer: defining treatment targets and dynamic changes during disease progression

open access: yesMolecular Oncology, EarlyView.
Circulating tumor DNA (ctDNA) offers a possibility for different applications in early and late stage breast cancer management. In early breast cancer tumor informed approaches are increasingly used for detecting molecular residual disease (MRD) and early recurrence. In advanced stage, ctDNA provides a possibility for monitoring disease progression and
Eva Valentina Klocker   +14 more
wiley   +1 more source

Quadric Complexes [PDF]

open access: yesarXiv, 2017
Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study the basic properties of these complexes.
arxiv  

Circulating tumor cells in metastatic breast cancer patients treated with immune checkpoint inhibitors – a biomarker analysis of the ALICE and ICON trials

open access: yesMolecular Oncology, EarlyView.
In this explorative biomarker analysis, we assessed serial sampling of circulating tumor cells (CTCs) with CellSearch in two randomized trials testing immune checkpoint inhibitors (ICIs) in metastatic breast cancer. Our data demonstrate a prognostic potential of CTCs, most apparent 4 weeks into ICI therapy.
Nikolai Kragøe Andresen   +13 more
wiley   +1 more source

Complex fuzzy Lie Algebras [PDF]

open access: yesarXiv, 2019
A complex fuzzy Lie algebra is a fuzzy Lie algebra whose membership function takes values in the unit circle in the complex plane. In this paper, we deine the complex fuzzy Lie subalgebras and complex fuzzy ideals of Lie algebras. Then, we investigate some of characteristics of complex fuzzy Lie subalgebras.
arxiv  

A comparative study of circulating tumor cell isolation and enumeration technologies in lung cancer

open access: yesMolecular Oncology, EarlyView.
Lung cancer cells were spiked into donor blood to evaluate the recovery rates of the following circulating tumor cell (CTC) enrichment technologies: CellMag™, EasySep™, RosetteSep™, Parsortix® PR1, and Parsortix® Prototype systems. Each method's advantages and disadvantages are described.
Volga M Saini   +11 more
wiley   +1 more source

On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier [PDF]

open access: yesarXiv, 2009
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.
arxiv  

Home - About - Disclaimer - Privacy