Results 51 to 60 of about 97,350 (281)
We study the enumeration of all d-minimal paths in a multistate two-terminal network, where each arc has a specific capacity limit. Classical approaches based on generating functions or incremental enumeration tend to suffer from severe combinatorial ...
Yasser Lamalem +2 more
doaj +1 more source
Storing Set Families More Compactly with Top ZDDs
Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size.
Kotaro Matsuda +2 more
doaj +1 more source
This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns +10 more
wiley +1 more source
Integrated Methodology for Software Reliability Analysis [PDF]
The most used techniques to ensure safety and reliability of the systems are applied together as a whole, and in most cases, the software components are usually overlooked or to little analyzed.
Marian Pompiliu CRISTESCU +2 more
doaj
Symbolic vs. Bounded Synthesis for Petri Games [PDF]
Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction to a
Bernd Finkbeiner +3 more
doaj +1 more source
Comparing BDD and SAT based techniques for model checking Chaum's Dining Cryptographers Protocol [PDF]
We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity
Kacprzak, M. +5 more
core
Optimization Bounds from Binary Decision Diagrams
We explore the idea of obtaining bounds on the value of an optimization problem from a discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a BDD that represents a relaxation of a 0-1 optimization problem, and how to obtain a bound for a separable objective function by solving a shortest (or longest) path problem in ...
Bergman, David +3 more
openaire +2 more sources
Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers
This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel +6 more
wiley +1 more source
Conformant Planning via Symbolic Model Checking
We tackle the problem of planning in nondeterministic domains, by presenting a new approach to conformant planning. Conformant planning is the problem of finding a sequence of actions that is guaranteed to achieve the goal despite the nondeterminism of ...
Cimatti, A., Roveri, M.
core +1 more source
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source

