Results 51 to 60 of about 193,490 (288)
经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
A review was given of the principal probability limit theorems of solutions to classical combinatorial optimization problems.The emphasis was on the travelling salesman problems,minimal spanning trees,matching and lengths of the longest increasing ...
SUZhong-gen(苏中根)
doaj +1 more source
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
Sampling with removal in LP-type problems
Random sampling is an important tool in optimization subject to finitely or infinitely many constraints. Here we are interested in obtaining solutions of low cost that violate only few constraints.
Bernd Gärtner
doaj +1 more source
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
Distance-based exponential probability models on constrained combinatorial optimization problems [PDF]
Estimation of distribution algorithms have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvements when approaching constrained type problems. The great majority of works in the literature implement external repairing or penalty schemes, or use ad-hoc sampling
Ceberio, J., Mendiburu, A., Lozano, J.A.
openaire +2 more sources
In this paper, a new probability mechanism based particle swarm optimization (PMPSO) algorithm is proposed to solve combinatorial optimization problems.
Shuai Li +3 more
doaj +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
Amenability of groups and $G$-sets
This text surveys classical and recent results in the field of amenability of groups, from a combinatorial standpoint. It has served as the support of courses at the University of G\"ottingen and the \'Ecole Normale Sup\'erieure.
A. Hulanicki +72 more
core +1 more source
The Concepts of Pseudo Compound Poisson and Partition Representations in Discrete Probability
The mathematical/statistical concepts of pseudo compound Poisson and partition representations in discrete probability are reviewed and clarified. A combinatorial interpretation of the convolution of geometric distributions in terms of a variant of ...
Werner Hürlimann
doaj +1 more source
SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
Let $M_{n}$ denote a random symmetric $n\times n$ matrix whose upper-diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely conjectured that $M_{n}
ASAF FERBER, VISHESH JAIN
doaj +1 more source

