Results 201 to 210 of about 2,481,598 (245)
This work presents a multifunctional ionic liquid, [SO3H‐PMIm][OTf], that addresses A‐site cation inhomogeneity and lead toxicity in pure‐iodide wide‐bandgap perovskite solar cells. The additive enables homogeneous cation distribution, achieving 22.02% efficiency with 90% retention after 3000 h and reducing lead leakage by over 58%, thereby ...
Kai Wu +8 more
wiley +1 more source
The mechanobiological basis of atherosclerotic progression and its contribution to spatial and temporal heterogeneity remain incompletely understood. Spatially resolved AFM measurements revealed that plaque formation and distinct regions (cap fibrosis, intimal fibrosis, and lipid‐rich core) exhibit heterogeneous elastic modulus and viscoelastic ...
Yidan Zhou +13 more
wiley +1 more source
This study employs a spouse‐pair cohort design and an idopNetwork model that integrates evolutionary game theory, predator‐prey dynamics, and developmental modularity theory to reconstruct maximally informative microbial interaction networks. This approach reveals how interspecies interactions drive the phenotypic plasticity of the gut microbiota in ...
Huizhen Li +15 more
wiley +1 more source
Our paper proposes an implementable procedure for using the method of quasi-random sequences in software debug testing. In random testing, the sequence of tests (if considered as points in an n-dimensional unit hypercube) will give rise to regions where ...
Robert Merkel, Tsong Yueh Chen
exaly +6 more sources
Quasi-Random Sequences and Their Discrepancies [PDF]
Quasi-random (also called low discrepancy) sequences are a deterministic alternative to random sequences for use in Monte Carlo methods, such as integration and particle simulations of transport processes. The error in uniformity for such a sequence of N
William J. Morokoff, Russel E. Caflisch
exaly +3 more sources
Randomized Quasi-Random Testing [PDF]
Random testing is a fundamental testing technique that can be used to generate test cases for both hardware and software systems. Quasi-random testing was proposed as an enhancement to the cost-effectiveness of random testing: In addition to having similar computation overheads to random testing, it makes use of quasi-random sequences to generate low ...
Huai Liu, Tsong Yueh Chen
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1991
AbstractWe introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all.
Fan R. K. Chung, Ronald L. Graham
openaire +3 more sources
AbstractWe introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all.
Fan R. K. Chung, Ronald L. Graham
openaire +3 more sources
Communication Complexity and Quasi Randomness
SIAM Journal on Discrete Mathematics, 1993The multiparty communication complexity concerns the least number of bits that must be exchanged among a number of players to collaboratively compute a Boolean function $f ( x_1 , \ldots ,x_k )$, while each player knows at most t inputs for some fixed $t < k$.
Fan R. K. Chung, Prasad Tetali
openaire +2 more sources
Combinatorica, 2002
Let \(G_{1/2}(n)\) denote a random graph with \(n\) vertices in which each pair is selected to be an edge independently with probability \(1/2\). Almost all of them satisfy several basic properties which turn out to be equivalent. Families of graphs satisfying this equivalence class of properties are called quasi-random, see e.g. \textit{F. R. K. Chung}
Fan R. K. Chung, Ronald L. Graham
openaire +3 more sources
Let \(G_{1/2}(n)\) denote a random graph with \(n\) vertices in which each pair is selected to be an edge independently with probability \(1/2\). Almost all of them satisfy several basic properties which turn out to be equivalent. Families of graphs satisfying this equivalence class of properties are called quasi-random, see e.g. \textit{F. R. K. Chung}
Fan R. K. Chung, Ronald L. Graham
openaire +3 more sources
Reinforced quasi-random forest
Pattern Recognition, 2019Abstract We propose a reinforced quasi-random forest for classification task. Reinforcement is performed iteratively by adding new trees to the forest. Our method assigns an importance to each of the attributes and identifies the attributes that causes the mis-classification of data points during training.
Angshuman Paul, Dipti Prasad Mukherjee
openaire +1 more source

