Showing 301 - 320 results of 17,304 for search '"randomness"', query time: 0.06s Refine Results
  1. 301

    Random fixed point theorems for asymptotic 1-set contraction operators by P. Vijayaraju

    Published 2002-01-01
    “…Random fixed point theorems for condensing, 1-set contraction selfless are known. …”
    Get full text
    Article
  2. 302

    The Largest Component of Near-Critical Random Intersection Graph with Tunable Clustering by Shiying Huang, Bin Wang

    Published 2021-01-01
    “…In this paper, we study the largest component of the near-critical random intersection graph Gn,m,p with n nodes and m elements, where m=Θn which leads to the fact that the clustering is tunable. …”
    Get full text
    Article
  3. 303
  4. 304
  5. 305
  6. 306

    Convergence Rates for Probabilities of Moderate Deviations for Multidimensionally Indexed Random Variables by Dianliang Deng

    Published 2009-01-01
    “…Let {X,Xn¯;n¯∈Z+d} be a sequence of i.i.d. real-valued random variables, and Sn¯=∑k¯≤n¯Xk¯, n¯∈Z+d. Convergence rates of moderate deviations are derived; that is, the rates of convergence to zero of certain tail probabilities of the partial sums are determined. …”
    Get full text
    Article
  7. 307
  8. 308

    On-Line Selection of c-Alternating Subsequences from a Random Sample by Robert W. Chen, Larry A. Shepp, Justín Ju-Chen Yang

    Published 2013-01-01
    “…In this paper, we present an optimal on-line procedure to select a -alternating subsequence from a symmetric distributed random sample. We also give the optimal selection rate when the sample size goes to infinity.…”
    Get full text
    Article
  9. 309
  10. 310

    Construction and Analysis of Hepatocellular Carcinoma Prognostic Model Based on Random Forest by Yikai Wang, Le Ma, Pengjun Xue, Bianni Qin, Ting Wang, Bo Li, Lina Wu, Liyan Zhao, Xiongtao Liu

    Published 2023-01-01
    “…Screen important genes based on the random forest method, combined with differential expression genes (DEGs) to screen out important DEGs. …”
    Get full text
    Article
  11. 311

    The Hausdorff dimension and exact Hausdorff measure of random recursive sets with overlapping by Hongwen Guo, Dihe Hu

    Published 2002-01-01
    “…We weaken the open set condition and define a finite intersection property in the construction of the random recursive sets. We prove that this larger class of random sets are fractals in the sense of Taylor, and give conditions when these sets have positive and finite Hausdorff measures, which in certain extent generalize some of the known results, about random recursive fractals.…”
    Get full text
    Article
  12. 312

    Pressure Methods for Primary Hemorrhage Control: A Randomized Crossover Trial

    Published 2019-02-01
    “…Methods: In this tri-phase randomized crossover trial of medical personnel, a standardized bleeding simulator with a flat force sensitive resistor on the surface was used to measure force. …”
    Get full text
    Article
  13. 313

    Second-Order Moment Convergence Rates for Spectral Statistics of Random Matrices by Junshan Xie

    Published 2013-01-01
    “…This paper considers the precise asymptotics of the spectral statistics of random matrices. Following the ideas of Gut and Spătaru (2000) and Liu and Lin (2006) on the precise asymptotics of i.i.d. random variables in the context of the complete convergence and the second-order moment convergence, respectively, we will establish the precise second-order moment convergence rates of a type of series constructed by the spectral statistics of Wigner matrices or sample covariance matrices.…”
    Get full text
    Article
  14. 314

    Electricity Theft Detection in Power Grids with Deep Learning and Random Forests by Shuan Li, Yinghua Han, Xu Yao, Song Yingchen, Jinkuan Wang, Qiang Zhao

    Published 2019-01-01
    “…In order to help utility companies solve the problems of inefficient electricity inspection and irregular power consumption, a novel hybrid convolutional neural network-random forest (CNN-RF) model for automatic electricity theft detection is presented in this paper. …”
    Get full text
    Article
  15. 315

    An Analytical Solution for Predicting the Vibration-Fatigue-Life in Bimodal Random Processes by Chaoshuai Han, Yongliang Ma, Xianqiang Qu, Mindong Yang

    Published 2017-01-01
    “…Predicting the vibration-fatigue-life of engineering structures subjected to random loading is a critical issue for. Frequency methods are generally adopted to deal with this problem. …”
    Get full text
    Article
  16. 316

    Application of Random Dynamic Grouping Simulation Algorithm in PE Teaching Evaluation by Haitao Hao

    Published 2021-01-01
    “…The probability ranking conclusion is an extension of the absolute form evaluation conclusion. Firstly, the random simulation evaluation model is introduced; then, the general idea of converting the traditional evaluation method to the random simulation evaluation model is analyzed; on this basis, based on the rule of “further ensuring the stability of the ranking chain on the basis of increasing the possibility of the ranking chain,” two methods of solving the probability ranking conclusion are given. …”
    Get full text
    Article
  17. 317

    ROAD SIMULATION TEST RANDOM SPECRTRUM PLUS WINDOWS RECONSTRUCTION METHOD by WANG YiRong, YU JiaWei, LUAN ShiJie, ZHENG SongLin, LI YuXiao, JIN Qing

    Published 2020-01-01
    “…Using the damage editing theory,the random spectrum of road simulation test can be compiled to achieve the purpose of removing the small load and achieving the accelerated test. …”
    Get full text
    Article
  18. 318

    Semi-random and semi-algebraic structural design for IRA-LDPC codes by Li PENG, Qi ZHANG, Bo WANG, Tao CHEN

    Published 2014-03-01
    “…A method of semi-random and semi-algebraic structure was presented for constructing the low-density parity-check matrix that corresponds to the information bits of the IRA codes.Compared with the existing structural LDPC codes,the distinct advantage of the presented compact structural array for information-bit-corresponding matrix is that the position coordinate of each 1 element in this matrix can be calculated by a determinate algebraic expression,which not only reduces the consumption of memory resource for the random parity-check matrix,but also provides the potential probability for designing low complexity hardware circuit of the LDPC encoder/decoder.In addition,compared with the existing practical LDPC codes in industrial standard,the presented IRA-LDPC code is also slight preponderance in the performance of simulation in bit error rate and signal noise ratio (BER-SNB).…”
    Get full text
    Article
  19. 319

    Limit distribution for the k-th maxima of nonindentically distributed random variables by Arvydas Jokimaitis

    Published 2000-12-01
    “… In this paper the limit distribution for k-th maxima of independent nonidentically distributed random variables is obtained. …”
    Get full text
    Article
  20. 320