Influence of random shrinkage porosity on equivalent elastic modulus of casting: A statistical and numerical approach by Wei Liu, Feng Li, Fuhua Yan

“…In this paper, the influences of random shrinkage porosity on the equivalent elastic modulus of QT400-18 casting were studied by a numerical statistics approach. An improved random algorithm was applied into the lattice model to simulate the “cloud-like” morphology of shrinkage porosity. …”
Get full text

Sorting and Selection in Posets by Daskalakis, Constantinos, Karp, Richard M, Mossel, Elchanan, Riesenfeld, Samantha J, Verbin, Elad

“…We give efficient deterministic and randomized algorithms for finding the minimal elements with query complexity and total complexity O(wn). …”
Get full text

Computational geometry through the information lens by Pătrașcu, Mihai

Get full text

Dimensionality reduction for sparse and structured matrices by Musco, Christopher Paul

Get full text

Metrical service systems with transformations by Bubeck, S, Buchbinder, N, Coester, C, Sellke, M

“…Here, the upper bound is achieved by a deterministic algorithm and the lower bound holds even for randomized algorithms. For the 𝑘-taxi problem, we prove a competitive ratio of <i>Õ</i>((𝑛 log 𝑘)²). …”

Neural response after a single ECT session during retrieval of emotional self-referent words in depression: a randomized, sham-controlled fMRI study by Miskowiak, K, Macoveanu, J, Jørgensen, M, Støttrup, M, Ott, C, Jensen, H, Jørgensen, A, Harmer, C, Paulson, O, Kessing, L, Siebner, H

“…The functional magnetic resonance imaging data were analyzed using the FMRIB Software Library randomize algorithm, and the Threshold-Free Cluster Enhancement method was used to identify significant clusters (corrected at P &lt; .05). …”

Minimize average tasks processing time in satellite mobile edge computing systems via a deep reinforcement learning method by Shanchen Pang, Jianyang Zheng, Min Wang, Sibo Qiao, Xiao He, Changnan Gao

“…The simulation results confirm the effectiveness of our proposed scheduling algorithm, which reduces the average task processing time by 22.1 $$\%$$ % , 30.6 $$\%$$ % , and 41.3 $$\%$$ % , compared to the genetic algorithm(GA), the greedy algorithm, and the random algorithm, respectively.…”
Get full text

Optimizations for Computing Relatedness in Biomedical Heterogeneous Information Networks: SemNet 2.0 by Anna Kirkpatrick, Chidozie Onyeze, David Kartchner, Stephen Allegri, Davi Nakajima An, Kevin McCoy, Evie Davalbhakta, Cassie S. Mitchell

“…Additionally, two randomized algorithms were built to optimize the HeteSim metric calculation for computing metapath similarity. …”
Get full text

An Online Task Assignment Based on Quality Constraint for Spatio-Temporal Crowdsourcing by Qingxian Pan, Tingwei Pan, Hongbin Dong, Yingjie Wang, Shan Jiang, Zengxuan Yin

“…There are three algorithms: <italic>Random Algorithm</italic>, <italic>Random-Threshold-Based Algorithm</italic> (RT) and <italic>Adaptive random-threshold-based Algorithm</italic> (Adaptive RT) for maximizing the total utility in the online task assignment of three types of objects, tasks, workers and workplaces. …”
Get full text

Probabilistic Programming with Stochastic Probabilities by Lew, Alexander K., Ghavamizadeh, Matin, Rinard, Martin C., Mansinghka, Vikash K.

“…At the heart of our approach is a new technique for compiling these expressive probabilistic programs into randomized algorithms for unbiasedly estimating their densities and density reciprocals. …”
Get full text

Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time by Chan, Timothy M., Patrascu, Mihai

“…As a consequence, we obtain the first o(n lg n) (randomized) algorithms for many fundamental problems in computational geometry for arbitrary integer input on the word RAM, including: constructing the convex hull of a three-dimensional (3D) point set, computing the Voronoi diagram or the Euclidean minimum spanning tree of a planar point set, triangulating a polygon with holes, and finding intersections among a set of line segments. …”
Get full text

Shooting Utility Maximization in UAV-Assisted Wireless Camera Sensor Networks by Yulei Wu, Simeng Feng, Chao Dong, Weijun Wang

“…Simulation results show that the algorithm outperforms both the random algorithm (RAN) and the maximum shooting utility point selection algorithm (MSU) in terms of shooting utility and time utilization efficiency, improving shooting utility by 51% and 21% compared to the RAN and MSU algorithms, respectively, and achieving at least 88.2% of the OPT algorithm in terms of time utilization efficiency.…”
Get full text

Comparison of Gully Erosion Susceptibility Mapping Using Weight of Evidence and Frequency Ratio Models at Sanganeh Kalat Basin by Majid Ebrahim, Abolghasem Amir Ahmadi, Mohammad Ali Zangeneh Asadi

“…In total, of the 46 gullies which have been identified, 32 (70 %) cases are random algorithm selected to build gully susceptibility models, while the remaining 14 (30 %) cases are used to validate the models. …”
Get full text

The Influence of Matrix Size on Statistical Properties of Co-Occurrence and Limiting Similarity Null Models. by Thomas Michael Lavender, Brandon S Schamp, Eric G Lamb

“…For trait-based limiting similarity null models, we used the mean nearest neighbour trait distance (NN) and the standard deviation of nearest neighbour distances (SDNN) as test statistics, and considered two common randomization algorithms: abundance independent trait shuffling (AITS), and abundance weighted trait shuffling (AWTS). …”
Get full text

Ideal vs. real: a systematic review on handling covariates in randomized controlled trials by Jody D. Ciolino, Hannah L. Palac, Amy Yang, Mireya Vaca, Hayley M. Belli

“…Abstract Background In theory, efficient design of randomized controlled trials (RCTs) involves randomization algorithms that control baseline variable imbalance efficiently, and corresponding analysis involves pre-specified adjustment for baseline covariates. …”
Get full text

Quadratic time-space lower bounds for computing natural functions with a random oracle

“…Through a series of succinct reductions, we prove that the following problems require randomized algorithms where the product of running time and space usage must be Ω(n2/poly(log n)) to obtain correct answers with constant nonzero probability, even for algorithms with constant-time access to a uniform random oracle (i.e., a uniform random hash function): ▬ Given an unordered list L of n elements from [n] (possibly with repeated elements), output [n] − L. ▬ Counting satisfying assignments to a given 2CNF, and printing any satisfying assignment to a given 3CNF. …”
Get full text

Propositional proof systems : efficiency and automatizability by Alekhnovitch, Mikhail, 1978-

Get full text

Solar PV forecasting with missing data by Peng, Shuyuan

“…For hybrid forecasting model, decision-making scheme still provides significance to mitigate the negative impact of uncertainty found in the performance of randomized algorithms. Finally, real-time photovoltaic data can be used to predict the subsequent photovoltaic power generation situation.…”
Get full text

Pseudo-derandomizing learning and approximation by Oliveira, I, Santhanam, R

“…Our goal is to simulate known randomized algorithms in these settings by pseudo-deterministic algorithms in a generic fashion - a goal we succinctly term pseudo-derandomization. …”

Lattice Boltzmann simulation of cathode catalyst layer degradation on transport reaction process within a proton exchange membrane fuel cell by Yulin Wang, Xiangling Liao, Haokai Xu, Wei He, Hua Li, Lei Xing, Xiaodong Wang

“…To reveal the catalyst layer degradation impact, the microscopic porous structure of the cathode catalyst layer was reconstructed by a random algorithm in this work. Consequently, Lattice Boltzmann method was used to study the oxygen transport and electrochemical reaction processes at the limiting current density condition with considering the degradation of platinum, carbon particles, and ionomers under uniform and exponential degradation rates, respectively. …”
Get full text