RF-SVR-based prediction methodology for metal tube-bending rebound: Handling non-uniformity and limited sample challenges. [PDF]
PLoS ONEThis paper explores a prediction algorithm for determining the rebound angle of non-uniform and small-sample tubes. To address the issues of non-uniform and small-sample data, this paper proposes an algorithm based on Random Forest-Support Vector ...
Ziluo Fang +3 more
doaj +2 more sources
Uniform Generation of Random Regular Graphs [PDF]
SIAM Journal on Computing, 2015 We develop a new approach for uniform generation of combinatorial objects, and apply it to derive a uniform sampler REG for d-regular graphs. REG can be implemented such that each graph is generated in expected time O(nd^3), provided that d=o(n^{1/2}).
Pu Gao, Nicholas Wormald
exaly +4 more sources
Watermelon uniform random generation with applications
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Bonichon, Mohamed Mosbah
exaly +3 more sources
Delay-Doppler Domain Time-Hopping Key Generation and Security Analysis for Orthogonal Time Frequency Space Satellite Communication Systems [PDF]
SensorsPhysical-layer key generation (PLKG) is a technique that produces symmetric encryption keys by exploiting the inherent characteristics of wireless channels.
Wei Li +4 more
doaj +2 more sources
History of uniform random number generation [PDF]
2017 Winter Simulation Conference (WSC), 2017 Random number generators were invented before there were symbols for writing numbers, and long before mechanical and electronic computers. All major civilizations through the ages found the urge to make random selections, for various reasons. Today, random number generators, particularly on computers, are an important (although often hidden) ingredient
exaly +3 more sources
Controlled non-uniform random generation of decomposable structures
Theoretical Computer Science, 2010 Consider a class of decomposable combinatorial structures, using different types of atoms $\Atoms = \{\At_1,\ldots ,\At_{|{\Atoms}|}\}$. We address the random generation of such structures with respect to a size $n$ and a targeted distribution in $k$ of its \emph{distinguished} atoms. We consider two variations on this problem. In the first alternative,
Yann Ponty
exaly +6 more sources
On the Use of Uniform Random Generation of Automata for Testing
Electronic Notes in Theoretical Computer Science, 2009 AbstractDeveloping efficient and automatic testing techniques is one of the major challenges facing software validation community. In this paper, we show how a uniform random generation process of finite automata, developed in a recent work by Bassino and Nicaud, is relevant for many faces of automatic testing.
Frédéric Dadeau
exaly +4 more sources
Random generation of combinatorial structures from a uniform distribution
Theoretical Computer Science, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leslie G Valiant, Vijay V Vazirani
exaly +2 more sources
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and algorithmic tools to refine our understanding of the classical combinatorial explosion phenomenon ...
OLivier Bodini +3 more
doaj +1 more source
Fundamentals of Neutrosophical Simulation for Generating Random Numbers Associated with Uniform Probability Distribution [PDF]
Neutrosophic Sets and Systems, 2022 The simulation process depends on generating a series of random numbers subject to the uniform probability distribution in the interval [0, 1]. The generation of these numbers is starting from the cumulative distribution function of the uniform ...
Maissam Jdid +2 more
doaj +1 more source