Results 231 to 240 of about 62,622 (269)
Some of the next articles are maybe not open access.
“To Randomize, or Not to Randomize, That is the Question”
Arthritis & Rheumatology, 2021Until the end of the last century there were no drugs approved for the treatment of juvenile idiopathic arthritis (JIA). This situation was revolutionized in the past 20 years thanks to 3 factors: the introduction in the USA and in Europe of paediatric legislations(1, 2), the availability of biologic disease-modifying anti-rheumatic drugs (b-DMARDs ...
Nicolino Ruperto +2 more
openaire +3 more sources
Random Relations, Random Utilities, and Random Functions
Journal of Mathematical Psychology, 2001The aim of the paper is to extend the first author's earlier results, and to complement and reformulate closely related work, by analyzing the relationship between three fundamental ways of mathematically representing judgements and preferences. The paper significantly extends the following three approaches considered in the paper to modelling the ...
Regenwetter, M., Marley, A. A. J.
openaire +1 more source
Random Thoughts on Randomization
JAMA: The Journal of the American Medical Association, 1978In their informative assessment of 13 years of aortocoronary bypass surgery, DeBakey and Lawrie (p 837), dispute the necessity of prospective randomized studies for the evaluation of surgical diagnostic and therapeutic techniques. They point out that certain time-honored criteria, particularly clinical experience, have proved reliable in assessing ...
openaire +2 more sources
2009
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs.
Cooper, Colin, Frieze, Alan
openaire +1 more source
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs.
Cooper, Colin, Frieze, Alan
openaire +1 more source
Randomization Among: The Other Randomization
Ethics & Human Research, 2019ABSTRACTA valid informed consent process for a randomized controlled trial requires the disclosure to potential participants that they will be randomized to receive the study intervention or a control intervention. This is a case of randomizationwithina trial, a type of randomization that has received significant attention in research ethics.
openaire +2 more sources
Geometric and Functional Analysis, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
“Random” random matrix products
Journal d'Analyse Mathématique, 2001This paper studies compositions of independent random bundle maps \(F(x,a)=f_Fx,T_F(x)a\), \(x\in X\), \(a\in \mathbb R^d\), where \(X\) is a Borel subset of a Polish space, whose distributions form a stationary process. This specializes to the case of products of independent random matrices evolving by a stationary process and generalizes many results
openaire +2 more sources
Random Multiclass Classification: Generalizing Random Forests to Random MNL and Random NB [PDF]
Random Forests (RF) is a successful classifier exhibiting performance comparable to Adaboost, but is more robust. The exploitation of two sources of randomness, random inputs (bagging) and random features, make RF accurate classifiers in several domains.
Anita Prinzie, Dirk Van den Poel
openaire +1 more source
Local Randomness in Polynomial Random Number and Random Function Generators
SIAM Journal on Computing, 1993Summary: A distribution on \(n\)-bit strings is called \((\varepsilon,e)\)-locally random, if for every choice of \(e \leq n\) positions the induced distribution on \(e\)-bit strings is in the \(L_ 1\)-norm at most \(\varepsilon\) away from the uniform distribution on \(e\)-bit strings. Local randomness in polynomial random number generators (RNG) that
Harald Niederreiter, Claus-Peter Schnorr
openaire +2 more sources

