Results 21 to 30 of about 33,492 (302)
Precedence probability, prediction interval and a combinatorial identity [PDF]
, 1998 Precedence tests are simple yet useful nonparametric tests based on two specified order statistics from independent random samples or, equivalently, on the count of the number of observations from one of the samples preceding some order statistic of the other sample.
Chakraborti, S., Laan, van der, P.
openaire +2 more sources
BMC Bioinformatics, 2021 Background Systems biology increasingly relies on deep sequencing with combinatorial index tags to associate biological sequences with their sample, cell, or molecule of origin.
Lior Galanti +2 more
doaj +1 more source
Solution of an odds inversion problem [PDF]
Notes on Number Theory and Discrete MathematicsConsider the problem of determining the possible numbers of balls of two different colors in an urn such that if two are drawn out at random, the odds that they are different colors are a given value. We present a general solution of this problem for all
Robert K. Moniot
doaj +1 more source
Event-by-event cumulants of azimuthal angles
European Physical Journal C: Particles and Fields, 2022 We further develop the recently proposed event-by-event cumulants of azimuthal angles. The role of reflection symmetry, permutation symmetry, frame independence, and relabeling of particle indices in the cumulant expansion is discussed in detail.
Ante Bilandzic
doaj +1 more source
Topological Multi-groups and Multi-fields [PDF]
, 2009 Topological groups, particularly, Lie groups are very important in differential geometry, analytic mechanics and theoretical physics. Applying Smarandache multi-spaces, topological spaces, particularly, manifolds and groups were generalized to ...
MAO, Linfan
core +1 more source
Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty [PDF]
, 2008 Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e.
Ramchurn, Sarvapali D. +20 more
core +1 more source
Entropy, 2023 This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. The relations among the statistical, algorithmic, computational, and circuit complexities of states are reviewed.
Bao Gia Bach +3 more
doaj +1 more source
Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits
CoRR, 2023 Motivated by concerns about making online decisions that incur undue amount of risk at each time step, in this paper, we formulate the probably anytime-safe stochastic combinatorial semi-bandits problem. In this problem, the agent is given the option to select a subset of size at most $K$ from a set of $L$ ground items.
Yunlong Hou 0001 +2 more
openaire +3 more sources
Combinatorial library diversity: probability assessment of library populations [PDF]
Nucleic Acids Research, 1998 A method is described for measuring the diversity of combinatorial oligonucleotide libraries that entails extrapolating the base composition of a co-synthesized model library (dNC, N = A, C, G, T) to that of a multibase library template. The base composition of dNC was measured by HPLC.
B, Ward, T, Juehne
openaire +2 more sources
Symmetry, Probabiliy, Entropy: Synopsis of the Lecture at MAXENT 2014
Entropy, 2015 In this discussion, we indicate possibilities for (homological and non-homological) linearization of basic notions of the probability theory and also for replacing the real numbers as values of probabilities by objects of suitable combinatorial ...
Misha Gromov
doaj +1 more source