Results 91 to 100 of about 7,855,956 (309)
Selecting a distributed agreement algorithm [PDF]
Proceedings of the 2007 ACM symposium on Applied computing, 2007 When component parts of distributed systems need to reach agreement, arriving at consensus is difficult if some components don't behave properly. The Byzantine Generals Problem described by Lamport and others exemplifies the difficulty.In a real situation, components don't know which of their peers are faulty and hence they cannot apply the algorithms ...
Robert John Walters +2 more
openaire +1 more source
Liquid biopsy‐based diagnostic evaluation of hypermethylated CpG sites for ovarian cancer diagnosis
Molecular Oncology, EarlyView.This schematic outlines the workflow from biomarker identification to duplex MethyLight assay validation for epithelial ovarian cancer diagnosis using cfDNA‐based liquid biopsy. Initial screening of hypermethylated CpG candidates (cg02957270, cg10061138 cg00480298, COL2A1) was performed in tissue using ARMS‐PCR, COBRA, qPCR and image analysis. Selected
Deepa Bisht +3 more
wiley +1 more source
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
IEEE Open Journal of Signal ProcessingWe consider a cell-free massive multiple-input multiple-output (CF-MaMIMO) communication system in the uplink transmission and propose a novel algorithm for blind or semi-blind joint channel estimation and data detection (JCD).
Alexander Karataev +2 more
doaj +1 more source
Computing Fault-Containment Times of Self-Stabilizing Algorithms Using Lumped Markov Chains
Algorithms, 2018 The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time starting from an arbitrary state, i.e., a state resulting from a sequence of faults.
Volker Turau
doaj +1 more source
Distributed convex optimization based on zero‐gradient‐sum algorithm under switching topology
IET Control Theory & Applications, 2023 This paper designs a finite‐time convergence protocol and an event‐triggered control protocol based on Zero‐Gradient‐Sum (ZGS) algorithm under stochastic switching undirected topology, respectively, which greatly expands the theory of continuous‐time ...
Manchun Tan +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cansell, Dominique, Méry, Dominique
openaire +2 more sources
Descriptive Combinatorics and Distributed Algorithms
Notices of the American Mathematical Society, 2022 This is a draft of an article to appear in the October 2022 issue of the Notices of the AMS. In this survey article we explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed algorithms -- a fundamental part of computer science that is becoming increasingly important in the modern era of ...
openaire +2 more sources
Molecular Oncology, EarlyView.Detecting circulating tumor cells (CTCs) in blood before surgery may help predict outcomes in patients with head and neck squamous cell carcinoma (HNSCC). Here, we show when combined with tumor size and lymph node involvement from routine imaging, CTC status identifies high‐risk patients with poorer survival—offering a simple, minimally invasive tool ...
Susanne Flach +9 more
wiley +1 more source