Results 51 to 60 of about 12,979 (182)
Predicting Non-linear Cellular Automata Quickly by Decomposing Them into Linear Ones
, 1997 We show that a wide variety of non-linear cellular automata (CAs) can be decomposed into a quasidirect product of linear ones. These CAs can be predicted by parallel circuits of depth O(log^2 t) using gates with binary inputs, or O(log t) depth if ``sum ...
Ajtai +28 more
core +3 more sources
R ( 5 , 5 ) ≤ 46 $R(5,5)\le 46$
Journal of Graph Theory, EarlyView.ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) $R(5,5)$ is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley +1 more source
Data‐Independent Acquisition Mass Spectrometry in Tumor Classification and Cancer Biomarker Research
Mass Spectrometry Reviews, EarlyView.Abstract Cancer treatment is far from optimal also because current classification systems do not reflect the complex molecular status of the tumor and its phenotype in sufficient detail. To construct molecular tumor classifiers, omics tools provide complex molecular data reflecting many aspects from genotype to phenotype.
Jan Simonik +3 more
wiley +1 more source
International Journal of Osteoarchaeology, EarlyView.ABSTRACT This paper presents the first documented case of a fixed bone dental bridge in Portugal. This item was recovered alongside the remains of a young adult individual of indeterminate sex from the 19th century burial site of the 3rd Order of Our Lady of Carmo in Porto, Portugal.
Steffi Vassallo +8 more
wiley +1 more source
Branching-time model checking of one-counter processes [PDF]
, 2009 One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from the modal mu-calculus
Göller, Stefan, Lohrey, Markus
core +4 more sources
Timed k-Tail: Automatic Inference of Timed Automata
, 2017 Accurate and up-to-date models describing the be- havior of software systems are seldom available in practice. To address this issue, software engineers may use specification mining techniques, which can automatically derive models that capture the ...
Mariani, Leonardo +2 more
core +1 more source
People and Nature, EarlyView.Abstract The current ‘UN Decade on Restoration’ calls for collaboration between scientists and practitioners to formulate guidelines for ecosystem restoration, within which transdisciplinary approaches are imperative to rethink the diverse values associated with nature, paving the way for sustainable ecosystem restoration.
Miguel A. Cebrián‐Piqueras +7 more
wiley +1 more source
Spatial pattern evolution and prediction scenario of habitat quality in typical fragile ecological region, China: A case study of the Yellow River floodplain area. [PDF]
Heliyon, 2023 Zhao H, Xu X, Tang J, Wang Z, Miao C.
europepmc +1 more source
On the Expressivity and Applicability of Model Representation Formalisms
, 2019 A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models.
Teucke, A., Voigt, M., Weidenbach, C.
core
SPROUTS_DB: An Implemented Database of Contaminants for Extracellular Vesicle Proteomics Studies
PROTEOMICS, EarlyView.ABSTRACT Current proteomics techniques allow rapid identification and quantification of proteins within any given biological source. However, LC–MS/MS proteomics is vulnerable to laboratory and sample‐associated contaminants. Therefore, accurate identification and annotation of such contaminants is crucial for development of reliable databases ...
Maria Gaetana Giovanna Pittalà +10 more
wiley +1 more source