In this paper, we prove some random fixed point theorems for generalized random $\alpha-\psi-$contractive mappings in a Polish space and, as some applications, we show the existence of random solutions of second order random differential equation.

In recent years, there has been a wave of research on complex networks. The purpose of this paper is to study the graph theoretic mathematical properties of random cyclooctatetraene chain. We obtain the explicit analytical expressions for the variances of the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random cyclooctatetraene chain with $n$ octagons, which plays a crucial role in the research and application of topological indices.

In a particle swarm with a fixed kinetic energy, the constituent particles move randomly and their velocity magnitudes follow a Maxwell distribution characterized by specific parameters. Within a certain time frame, particles in a sub-swarm may exhibit a bias in their movement direction. Thus, the particles may exhibit a special characteristic (biased random motion), where the group velocity in a particular direction remains constant u. For this biased particle swarm, composed of randomly moving particles with a fixed average speed c, particles have a higher probability of moving in a specific direction. Conversely, their likelihood of moving in all other directions is equally reduced. This study starts from the perspective of biased random walks and using Mathematica software proves that the diffusion rate of particles (in the reference frame R_u observed from R₀) in all directions is slower than that of an unbiased particle swarm with the same average speed c. Specifically, the degree of reduction is determined by the Lorentz-like factor. Lastly, we present the Ito equation for this biased random motion and provide associated verification examples. This study aims to serve as a reference for comprehending the underlying principles of the special relativity effect.

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only absorption of particles can occur. The asymptotic behavior of the integer moments of both the total number of particles and the number of particles at a lattice point is studied depending on the relationship between the model parameters. In the case of the existence of an isolated positive eigenvalue of the evolution operator of the average number of particles, a limit theorem is obtained on the exponential growth of both the total number of particles and the number of particles at a lattice point.

Different variants of thinning for discrete random variables are studied. The thinning procedure allows to introduce an analog of scale parameter for positive integer-valued random variables. Sufficient and necessary conditions for the existence of such a scale are given.

We consider a discrete-time random walk (xt) which at random times is reset to the starting position and performs a deterministic motion between them. We show that the quantity Prxt+1=n+1|xt=n,n→∞ determines if the system is averse, neutral or inclined towards resetting. It also classifies the stationary distribution. Double barrier probabilities, first passage times and the distribution of the escape time from intervals are determined.

Investigating the network response to node removal and the efficacy of the node removal strategies are related and fundamental questions in network science. Research studies proposed many node centralities based on the network structure ranking node to remove. The random walk (RW) on networks describes a stochastic process in which a walker travels among nodes. RW can be a model of transport, diffusion, and search on networks, and an essential tool for studying the importance of network nodes. In this manuscript, we propose four new measures of node centrality based on RW. Then, we compare the efficacy of the new RW node removal strategies to network dismantle with effective node removal strategies from the literature, such as betweenness and closeness node removal over synthetic and real-world networks. We evaluate the network dismantle along node removal using the size of the largest connected component (LCC). We find that, hence the betweenness nodes attack is the best strategy overall, the new node removal strategies based on RW show the highest efficacy in peculiar network topology. Specifically, RW strategies based on covering times emerge as the most effective strategy on a synthetic lattice network and two real-world road networks. Our results may be useful in selecting the best node attack strategies in a specific class of networks and in building more robust network structures.

Cellular automata are mathematical models that represent systems with complex behavior through simple interactions between their individual elements. These models can be used to study unconventional computational systems and complexity. One notable aspect of cellular automata is their ability to create structures known as gliders, which move in a regular pattern to represent the manipulation of information. This paper introduces the modification of mean-field theory applied to cellular automata, using random perturbations based on the system’s evolution rule. The original aspect of this approach is that the perturbation factor is tailored to the nature of the rule, altering the behavior of the mean-field polynomials. By combining the properties of both the original and perturbed polynomials, it is possible to detect when a cellular automaton is more likely to generate gliders without having to run evolutions of the system.This methodology is a useful approach to finding more examples of cellular automata that exhibit complex behavior. We start by examining elementary cellular automata, then move on to examples of automata that can generate gliders with more states. To illustrate the results of this methodology, we provide evolution examples of the detected automata.

this paper we present approaches for generating random numbers along with potential applications. Rather than trying to provide extensive coverage of several techniques or algorithms that have appeared in the scientific literature, we focus on some representative approaches presenting their workings and properties in detail. Our goal is to delineate their strengths and weaknesses as well as their potential application domains so as the reader can judge what would be the best approach for the application in hand, possibly a combination of the available approaches. For instance, a physical source of randomness can be used for the initial seed, then suitable preprocessing can enhance its randomness and then the output of the preprocessing can feed different types of generators, e.g. a linear congruential generator, a cryptographically secure one and one based on the combination of one way hash functions and shared key cryptoalgorithms in various modes of operation. Then, if desired, the outputs of the different generators can be combined giving the final random sequence. Moreover, we present a set of practical randomness tests which can be applied on the outputs of random number generators in order to assess their randomness characteristics. In order to demonstrate the importance of unpredictable random sequences, we present an application of cryptographically secure generators in domains where unpredictability is one of the major requirements, i.e. eLotteries and cryptographic key generation.

Vegetation indexes help perform precision farming because they provide useful information regarding moisture, nutrient content, and crop health. Primary sources of those indexes are satellites and unmanned aerial vehicles equipped with expensive multispectral sensors. Reducing the price of obtaining such information would increase the availability of precision farming for small farms. Several studies have proposed deep neural network methods to estimate the indexes from RGB color images. However, these methods report relatively large errors for mature plants when highly non-linear relationships of images and vegetation indexes arise. One could apply multilayer random forest-based models (Deep Forests) to solve this problem, but the discriminative power of such models is limited: they cannot catch complex dependencies between image features. In this paper, we propose a method that combines ideas of deep forests, random forests of kernel trees, and global pruning of random forests to tackle the problem. As a result, the method considers the properties of objects with a complex structure: the presence of relationships between groups of features, displacement, and scaling of objects. The experimental results show that the proposed method outperforms neural network-based solutions in several datasets.

In this paper, we introduce two discrete degenerate random variables, namely the degenerate binomial and degenerate Poisson random variables. We deduce the expectations of the degenerate binomial random variables. We compute the generating function of the moments of the degenerate Poisson random variables, which leads us to define the new type degenerate Bell polynomials, and hence obtain explicit expressions for the moments of those random variables in terms of such polynomials. We also get the variances of the degenerate Poisson random variables. Finally, we illustrate two examples of the degenerate Poisson random variables.

In this paper, we derive Jeffreys divergence, generalized Fisher divergence and corresponding De Bruijn identities on space-time random field. First, we determine the relation between Fisher information on the space-time random field in one of the space-time points and the ratio of Jeffreys divergence on a space-time random field at distinct space-time positions to the square of coordinate difference. In addition, we also find identities between the partial derivative of the Jeffreys divergence and the generalized Fisher divergence with respect to space-time variables, i.e. the De Bruijn identities, between two space-time random fields obtained by different parameters under the same Fokker-Planck equations. At the end of this paper, we present three examples of the Fokker-Planck equations on space-time random fields, identify their density functions, and derive the Jeffreys divergence, generalized Fisher information, generalized Fisher divergence, and accompanying De Bruijn identities.

The evaluation of deforestation by optical remote sensing remains a challenge in the humid tropical region due to high cloud cover. This paper develops a simple and reproducible method for mapping deforestation of the old-growth forest using open access software. A map of old-growth forest depletion was created using composites from three different dates (2003, 2010, 2016). Four models were tested: the first model using spectral bands (nir, swir1, swir2 and red), the second model was based on the association of spectral bands and spectral indices (NDVI, B54R, NDWI and NBR), the third model was constructed using spectral bands and geomorphological indices (DEM, Slope and Roughness) and the last model combined spectral bands, spectral indices and geomorphological indices. The optimal random forest ntrees and Mtry parameters were determined for each model to optimize the mapping in each model. The out-of-bag error for these four models was 2.15 %, 2.05 %, 1.86 % and 1.85 %, respectively. The fourth model had the lowest error and was hence used to predict deforestation of the old-growth forest. The annual rates of deforestation amounted 0.26 % (69861 ha) and 0.66 % (145768 ha) between 2003 – 2010 and 2010 – 2016, respectively. The area of the old-growth forest in 2016 was 3601607 ha and 215629 ha of forest lost between 2003 and 2016. These results showed that the Random Forest Classification (RFC) model was able to effectively map the reduction of old-growth forests.

The efficient generation of high-quality random numbers is essential in the operation of cryptographic modules. The quality of a random number generator is evaluated by the min-entropy of its entropy source. Typical method used to achieve high min-entropy of the output sequence is an entropy accumulation based on a hash function. This is grounded in the famous Leftover Hash Lemma which guarantees a lower bound on the min-entropy of the output sequence. However, the hash function based entropy accumulation has slow speed in general. For a practical perspective we need a new efficient entropy accumulation with the theoretical background for the min-entropy of the output sequence. In this work, we obtain the theoretical bound for the min-entropy of the output random sequence through the very efficient entropy accumulation using only bitwise XOR operations, where the input sequences from the entropy source are independent. Moreover we examine our theoretical results by applying to the quantum random number generator that uses dark noise arising from image sensor pixels as its entropy source.

In this work we study the following problem, from a computational point of view: If three points are selected in the unit square at random, what is the probability that the triangle obtained is obtuse, acute or right? We provide two convergent strategies: the frst derived from the ideas introduced in [2] and the second built on the combinatorics theory. The combined use of these two methods allows us to address the random triangle theory from a new perspective and, we hope, to work out a general method of dealing with some classes of computational problems.

As people's consumption habits change, loan plays a crucial role in our modern society. It provides individuals who do not have sufficient money with funds to purchase residential property or start a business. However, for avoiding unpleasant loan defaults, all financial institutions will first assess the borrower's risk index. By predicting the default risk of the borrower to decide whether to lend money. Machine learning algorithms, including random forest, linear regression and so on, have been benefited most of the real-world applications. With the development of machine learning methods, this paper, based on the personal history loan data of an institution studies the loan default risk, and uses the random forest classification model to predict the possibility of loan default. The result showed that the accuracy of this method was 85.62%, which show its application ability of real-world loan prediction and benefits the manager to decide the degree of risk for loan grant.

In this paper, we derive the distribution of eigenvalues for a 2×2 random confusion matrix stemming from a machine learning (ML) evaluation problem. Additionally, we present the distributions of both the matrix’s trace and the difference between the two traces of random confusion matrices. We also illustrate the application of these derived distributions in calculating the superiority probability of four baseline ML models.

Predicting electricity prices is a very important issue in modern society, because the associated decision process under uncertainty requires accurate forecasts for the economic agents involved. In this paper, we apply the decision tree extension of Random Forests to the prediction of electricity prices in Spain, but with the novelty of modeling prices jointly with demand, with the purpose of achieving greater accuracy than with univariate response Random Forests, particularly in price prediction, as well as understanding the effect of the input variables (lagged values of price and demand, current production levels of available energy sources) on the joint of the two outputs. The results are very encouraging, providing significant increase in price prediction accuracy. Also, interesting methodological challenges appear as far as the appropriate choice of the relative weights of price and demand in the joint modeling is concerned and a new procedure to provide the importance variable ranking is proposed. The partykit (package of R software) library allowing for multivariate Random Forests has been used.

We talk about random when it is not possible to determine a pattern on the observed outcomes. A computer follows a sequence of fixed instructions to give any of its output, hence the difficulty of choosing numbers randomly from algorithmic approaches. However, some algorithms based on mathematical formulas like the Linear Congruential algorithm and the Lagged Fibonacci generator appear to produce "true" random sequences to anyone who does not know the secret initial input [1]. Up to now, we cannot rigorously answer the question on the randomness of prime numbers [2, page 1] and this highlights a connection between random number generator and the distribution of primes. From [3] and [4] one sees that it is quite naive to expect good random reproduction with prime numbers. We are, however, interested in the properties underlying the distribution of prime numbers, which emerge as sufficient or insufficient arguments to conclude a proof by contradiction which tends to show that prime numbers are not randomly distributed. To achieve this end, we use prime gap sequence variation. The algorithm that we produce makes possible to deduce, in the case of a binary choice, a uniform behavior in the individual consecutive occurrence of primes, and no uniformity trait when the occurrences are taken collectively.

In this paper, we study the existence of the random -pullback attractor of a non-autonomous local modified stochastic Swift-Hohenberg equation with multiplicative noise in stratonovich sense. It is shown that a random -pullback attractor exists in when its external force has exponential growth. Due to the stochastic term, the estimate are delicate, we overcome this difficulty by using the Ornstein-Uhlenbeck(O-U) transformation and its properties.

We construct admissible circulant Laplacian matrix functions as generators for strictly increasing random walks on the integer line. These Laplacian matrix functions refer to a certain class of Bernstein functions. The approach has connections with biased walks on digraphs. Within this framework, we introduce a space-time generalization of the Poisson process as a strictly increasing walk with discrete Mittag-Leffler jumps subordinated to a (continuous-time) fractional Poisson process. We call this process ‘space-time Mittag-Leffler process’. We derive explicit formulae for the state probabilities which solve a Cauchy problem with a Kolmogorov-Feller (forward) difference-differential equation of general fractional type. We analyze a “well-scaled” diffusion limit and obtain a Cauchy problem with a space-time convolution equation involving Mittag-Leffler densities. We deduce in this limit the ‘state density kernel’ solving this Cauchy problem. It turns out that the diffusion limit exhibits connections to Prabhakar general fractional calculus. We also analyze in this way a generalization of the space-time fractional Mittag-Leffler process. The approach of construction of good Laplacian generator functions has a large potential in applications of space-time generalizations of the Poisson process and in the field of continuous-time random walks on digraphs.

This paper explores the application of Random Matrix Theory (RMT) as a methodological enhancement for portfolio selection within financial markets. Traditional approaches to portfolio optimization often rely on historical estimates of correlation matrices, particularly susceptible to instability. To address this challenge, we combine a data preprocessing technique based on the Hilbert transformation of returns with RMT to refine the accuracy and robustness of correlation matrix estimation. By contrasting empirical correlations with those derived from random matrices, we uncover non-random properties and underlying relationships within financial data. We then utilize this methodology to construct the correlation network dependence structure used in portfolio optimization. The empirical analysis presented in this paper validates the effectiveness of RMT in enhancing portfolio diversification and risk management strategies. This research contributes by offering investors and portfolio managers with methodological insights to construct portfolios that are more stable, robust, and diversified. At the same time, it advances our comprehension of the intricate statistical principles underlying multivariate financial data.

The article continues the exposition of the results obtained in the research of an agricultural machine for processing soil, designed for research with applications including exploitation. The MCLS complex cultivator was designed for the research of the working processes of the instruments intended for soil processing. The MCLS cultivator is a modulated machine (it can work for three working widths: 1, 2, and 4 m, with tractors of different powers) that is designed to use a wide range of working bodies. The experimental data obtained with the structure with a working width of 1 m and the results of their processing within the framework of the theory of random vibrations are presented in this article. The experimental results are analysed as random vibrations of the supports of the active body. As a result, the main characteristics of random vibrations are exposed: the distribution function, the average value, the autocorrelation, and the frequency spectrum. These general results regarding random vibrations are used for several critical applications in the design, execution, and exploitation of some subassemblies and assemblies of agricultural machines of this type. The main applications are: estimating the probability of the occurrence of dangerous load peaks, counting and selecting the load peaks that produce fatigue accumulation in the material of the supports of the working bodies, identifying some design deficiencies or defects in the work regime, estimating the effects of vibrations on the quality of soil processing. All the outcomes are comprised of applications in MCLS research and exploitation. The applications pursue well-known objectives of modeling the working processes of agricultural machines: safety at work, increasing the quality of work, optimizing energy consumption, and increasing productivity, all in a broad context to obtain a compromise situation

Ependymoma is responsible for 8–10% of all pediatric brain tumors and constitutes the third most common brain tumor in children. No robust molecular markers are yet in routine clinical use. Surgical resection and adjuvant radiotherapy cure approximately 40-70% of pediatric patients with ependymoma. In our centre, we have been using prophylactic valproic acid treatment for brain tumor patients. Initial observations indicated that valproate could have a beneficial effect in the survival of patients. Recent observations by other authors have shown that patients with glioblastoma benefited from the treatment with valproic acid, a histone deacetylase inhibitor. We have used random survival forest, a novel ensemble survival modelling method to study a single- center, small number cohort of pediatric patients with ependymoma. This analysis has confirmed surgery resection extent and treatment with radiotherapy as independent predictors of overall survival. Treatment with valproic acid was also a predictor of higher survival in this cohort. These results highlight the potential usefullness of the random survival forest model in gathering information from retrospective data. More data is needed about the possible influence of histone deacetylase inhibition by valproic acid in the survival of patients with ependymoma.

The Universe, rather than being homogeneous, displays an almost infinite topological genus, because it is punctured with a countless number of gravitational vortexes, i.e., black holes. Starting from this view, we aim to show that the occurrence of black holes is constrained by geometric random walks taking place during cosmic inflationary expansion. At first, we introduce a visual model, based on the Pascal’s triangle and linear and nonlinear arithmetic octahedrons, which describes three-dimensional cosmic random walks. In case of nonlinear 3D paths, trajectories in an expanding Universe can be depicted as the operation of filling the numbers of the octahedrons in the form of “islands of numbers”: this leads to separate cosmic structures (standing for matter/energy), spaced out by empty areas (constituted by black holes and dark matter). These procedures allow us to describe the topology of an universe of infinite genus, to assess black hole formation in terms of infinite Betti numbers, to highlight how non-linear random walks might provoke gravitational effects also in absence of mass/energy, and to propose a novel interpretation of Beckenstein-Hawking entropy: it is proportional to the surface, rather than the volume, of a black hole, because the latter does not contain information.

The aim of this paper is to study a semi-functional partial linear regression model (SFPLR) for spatial data with responses missing at random. The estimators are constructed by the kernel method, and some asymptotic properties such as probability convergence rates of the nonparametric component and asymptotic distribution of the parametric and nonparametric components are established under certain conditions. Next, the performances and the superiority of these estimators are presented and examined using a study on simulated data and on real data by carrying out a comparison between our semi-functional partially linear model with MAR estimator (SFPLRM), the semi-functional partially linear model with the full-case estimator (SFPLRC) and the nonparametric functional model estimator with MAR (FNPM). The results show that the proposed estimators outperform existing estimators as the number of random missing data increases.

This paper introduces an innovative Particle Swarm Optimization (PSO) Algorithm in-corporating Sobol and Halton Random number samplings. It evaluates the enhanced PSO's performance against conventional PSO employing Monte Carlo Random Number Samplings. The comparison involves assessing the algorithms across nine benchmark problems and the renowned Travelling Salesman Problem (TSP). The re-sults reveal consistent enhancements achieved by the enhanced PSO utilizing Sob-ol/Halton samplings across the benchmark problems. Particularly noteworthy are the substantial improvements demonstrated by the enhanced PSO in solving the Travel-ling Salesman Problem. These findings underscore the efficacy of employing Sobol and Halton random number generation methods in enhancing algorithm efficiency.

A random variable X that is base b Benford will not in general be base c Benford when c is not equal to b. This paper builds on two of my earlier papers and is an attempt to cast some light on the issue of base dependence. Following some introductory material, the “Benford spectrum” of a positive random variable is introduced and known analytic results about Benford spectra are summarized. Some standard machinery for a “Benford analysis” is introduced and combined with my method of “seed functions” to yield tools to analyze the base c Benford properties of a base b Benford random variable. Examples are generated by applying these general methods to several families of Benford random variables. Berger and Hill's concept of “base-invariant significant digits” is discussed. Some potential extensions are sketched.

Particle size can pose a challenge to random embankment compaction control methods, where practical techniques have hardly been developed and procedural control is used instead. In order to develop new quality control procedures for slate random fill, the necessary fieldwork and laboratory tests were carried out. This involved the revision of certain methods such as the wheel-tracking or topographic settlement tests. More than six hundred in-situ density and moisture content measurements were carried out for this research. In addition, more three hundred topographic settlements and three hundred wheel-tracking carriage tests were performed. The quality control processes were completed with more than thirty plate bearing tests. Possible evidence of statistical correlations between compaction control tests were identified. An analysis of variance (ANOVA) was performed. When testing proved relationships between them, the replacement of one of them by the other was assessed by deduction. Finally, the study suggests new procedures for compaction quality control of random slate fill used in crown area.

In this paper, by extending some results of informational genomics, we present a new randomness test based on the empirical entropy of strings and some properties of repeatability and unrepeatability of substrings of certain lengths. We give the theoretical motivations of our method and some experimental results of its application to a wide class of strings: decimal representations of real numbers, roulette outcomes, logistic maps, linear congruential generators, quantum measurements, natural language texts, and genomes. It will be evident that the evaluation of randomness resulting from our tests does not distinguish among the different sources of randomness (natural, or pseudo-casual).

The performance in terms of minimal Bayes’ error probability for detection of a high-dimensional random tensor is a fundamental under-studied difficult problem. In this work, we consider two Signal to Noise Ratio (SNR)-based detection problems of interest. Under the alternative hypothesis, i.e., for a non-zero SNR, the observed signals are either a noisy rank-R tensor admitting a Q-order Canonical Polyadic Decomposition (CPD) with large factors of size Nq  R, i.e, for 1  q  Q, where R, Nq ! ¥ with R1/q/Nq converge towards a finite constant or a noisy tensor admitting TucKer Decomposition (TKD) of multilinear (M1, . . . ,MQ)-rank with large factors of size Nq  Mq, i.e, for 1  q  Q, where Nq,Mq ! ¥ with Mq/Nq converge towards a finite constant. The detection of the random entries (coefficients) of the core tensor in the CPD/TKD is hard to study since the exact derivation of the error probability is mathematically intractable. To circumvent this technical difficulty, the Chernoff Upper Bound (CUB) for larger SNR and the Fisher information at low SNR are derived and studied, based on information geometry theory. The tightest CUB is reached for the value minimizing the error exponent, denoted by s?. In general, due to the asymmetry of the s-divergence, the Bhattacharyya Upper Bound (BUB) (that is, the Chernoff Information calculated at s? = 1/2) can not solve this problem effectively. As a consequence, we rely on a costly numerical optimization strategy to find s?. However, thanks to powerful random matrix theory tools, a simple analytical expression of s? is provided with respect to the Signal to Noise Ratio (SNR) in the two schemes considered. A main conclusion of this work is that the BUB is the tightest bound at low SNRs. This property is, however, no longer true for higher SNRs.

In this paper, a Markov random field model is proposed to determine a site’s light pollution risk level. The specific data of 12 indicators of five typical cities in China is first collected to establish a hierarchical indicator system using an R-type clustering algorithm. Then, the entropy weight method is used to filter, determine 10-factor indicators, three potential impact indicators, and a light pollution risk index, and establish an undirected probability map model. A light pollution measurement based on Markov random field is obtained, and a location-based light pollution risk assessment index (LBLPRAI) is proposed. LBLPRAI of different types of sites is analyzed, and three possible intervention strategies are proposed to solve the light pollution problem: road lighting system planning, increasing vegetation coverage, and building system planning. Finally, the simulated annealing algorithm is used to determine the best intervention strategy, and it is concluded that the use of strategy 1 in the urban community 2 is the most effective measure, which can reduce the risk level of light pollution by 17.2%.

The assessment outcomes of regional susceptibility to geological disasters can directly indicate the extent and intensity of risks within the study area, thus, providing targeted guidance for disaster management efforts. This study selects eight evaluation indicators, namely elevation, gradient, terrain relief, lithology of strata, normalized difference vegetation index, distance from the fault, distance from road, and distance from the river. The study focuses on Huize County in Yunnan Province as the research area, utilizing the certainty factor (CF) and random forest (RF) models for evaluating the susceptibility to geological disasters. The non-geological disaster points in the study area are determined using the deterministic coefficient prior model, and the deterministic coefficient values for each evaluation factor serve as the classification data for the random forest model. The optimal parameters for the random forest are selected through iterative calculations of bag error in PyCharm, while the weight of the evaluation factor is determined based on the ran-dom forest model with the optimal parameters. The results of geological disaster susceptibility zoning in Huize County are obtained by overlaying the weighted deterministic coefficients of each evaluation factor. The accuracy of the evaluation results is verified using zoning statistics and ROC curves with a test sample of 30% of the points. The results demonstrate the high accuracy of the model in evaluating the susceptibility to geological disasters in Huize County. Compared to the single deterministic coefficient model, this approach offers advantages in terms of reliability and accuracy. The evaluation results can serve as a scientific reference for related work in Huize County.

To deal with the uncertainties in modeling offshore wind turbines, we proposed a parameter inversion method for the pile-soil interaction model based on structural health monitoring results and the numerical model. The proposed parameter inversion method has a numerical model, an objective function selected using both the numerical and identified results, and an inverse optimization using a random search algorithm in the assumed parameter space. The parameter results in the minimum optimization objective function are identified as the in-situ parameter. The proposed method is confirmed to converge after some iterations, whatever the initial parameter values are. However, different initial parameter cases may converge to slightly different optimal parameters, implying the pile results are sensitive to geological parameters. Moreover, a comparison with the original design results shows design redundancy or risks. Though the proposed method has several flaws, it can shed some light on the influence of uncertainties in offshore wind turbines, such as soil parameters in geological surveys.

The interest in random fiber lasers (RFLs), first demonstrated one decade ago, is still growing and their basic characteristics have been studied by several authors. RFLs are open systems that present instabilities in the intensity fluctuations due to the energy exchange among their non-orthogonal quasi-modes. In this work, we present a review of the recent investigations on the output characteristics of a continuous-wave erbium-doped RFL, with emphasis on the statistical behavior of the emitted intensity fluctuations. A progression from the Gaussian to Lévy and back to the Gaussian statistical regime was observed by increasing the excitation laser power from below to above the RFL threshold. By analyzing the RFL output intensity fluctuations, the probability density function of emission intensities was determined, and its correspondence with the experimental results was identified, enabling a clear demonstration of the analogy between the RFL phenomenon and the spin-glass phase transition. A replica-symmetry-breaking phase above the RFL threshold was characterized and the glassy behavior of the emitted light was established. We also discuss perspectives for future investigations on RFL systems.

The spatial formation of coherent random laser modes in strongly scattering disordered random media is a central feature in the understanding of the physics of random lasers. We derive a quantum field theoretical method for random lasing in disordered samples of complex amplifying Mie resonators which is able to provide self-consistently and free of any fit parameter the full set of transport characteristics at and above the laser phase transition. The coherence length and the correlation volume respectively is derived as an experimentally measurable scale of the phase transition at the laser threshold. We find that the process of stimulated emission in extended disordered arrangements of active Mie resonators is ultimately connected to time-reversal symmetric multiple scattering in the sense of photonic transport while the diffusion coefficient is finite. A power law is found for the random laser mode diameters in stationary state with increasing pump intensity.

Substances that can modify the androgen receptor pathway in humans and animals are entering the environment and food chain with the proven ability to disrupt hormonal systems and leading to toxicity and adverse effects on reproduction, brain development, and prostate cancer, among others. State-of-the-art databases with experimental data of human, chimp, and rat effects by chemicals have been used to build machine learning classifiers and regressors and evaluate these on independent sets. Different featurizations, algorithms, and protein structures lead to dif- ferent results, with deep neural networks (DNNs) on user-defined physicochemically-relevant features developed for this work outperforming graph convolutional, random forest, and large featurizations. The results show that these user-provided structure-, ligand-, and statistically-based features and specific DNNs provided the best results as determined by AUC (0.87), MCC (0.47), and other metrics and by their interpretability and chemical meaning of the descriptors/features. In addition, the same features in the DNN method performed better than in a multivariate logistic model: validation MCC = 0.468 and training MCC = 0.868 for the present work compared to evalu- ation set MCC = 0.2036 and training set MCC = 0.5364 for the multivariate logistic regression on the full, unbalanced set. Techniques of this type may improve AR and toxicity description and predic- tion, improving assessment and design of compounds. Source code and data are available at https://github.com/AlfonsoTGarcia-Sosa/ML

This paper proposes an encryption scheme for high pixel density images. Based on the application of the quantum random walk algorithm, the Long short-term memory (LSTM) can effectively solve the problem of low efficiency of the quantum random walk algorithm in generating large-scale pseudorandom matrices, and further improve the statistical properties of the pseudorandom matrices required for encryption. The LSTM is then divided into columns and fed into the LSTM in order for training. Due to the randomness of the input matrix, the LSTM cannot be trained effectively, so the output matrix is predicted to be highly random. The LSTM prediction matrix of the same size as the key matrix is generated based on the pixel density of the image to be encrypted, which can effectively complete the encryption of the image. In the statistical performance test, the proposed encryption scheme achieves an average information entropy of 7.9992, an average number of pixels changed rate (NPCR) of 99.6231%, an average uniform average change intensity (UACI) of 33.6029% and an average correlation of 0.0032. Finally, various noise simulation tests are also conducted to verify its robustness in real-world applications where common noise and attack interference are encountered.

Finding an optimal combination of features and classifier is still an open problem in the development of automatic heartbeat classification systems, especially when applications that involve resource-constrained devices are considered. In this paper, a novel study of the selection of informative features and the use of a random forest classifier while following the recommendations of the Association for the Advancement of Medical Instrumentation (AAMI) and an inter-patient division of datasets is presented. Features were selected using a filter method based on the mutual information ranking criterion on the training set. Results showed that normalized R-R intervals and features relative to the width of the QRS complex are the most discriminative among those considered. The best results achieved on the MIT-BIH Arrhythmia Database were an overall accuracy of 96.14% and F1-scores of 97.97%, 73.06%, and 90.85% in the classification of normal beats, supraventricular ectopic beats, and ventricular ectopic beats respectively. In comparison with other state of the art approaches tested under similar constraints, this work represents one of the highest performances reported to date while relying on a very small feature vector.

Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction. Quantum entropy in the measurements decides the quality and security of the random number generator (RNG). At the same time, it directly determines the extraction ratio of true randomness from the raw data, in other words, it obviously affects quantum random bits generating rate. In this work, we commit to enhancing quantum entropy content in the vacuum noise based quantum RNG. We have taken into account main factors in this proposal to establish the theoretical model of quantum entropy content, including the effects of classical noise, the optimum dynamical analog-digital convertor (ADC) range, the local gain and the electronic gain of the homodyne system. We demonstrate that by amplifying the vacuum quantum noise, abundant quantum entropy is extractable in the step of post-processing even classical noise excursion, which may be deliberately induced by an eavesdropper, is large. Based on the discussion and the fact that the bandwidth of quantum vacuum noise is infinite, we propose large dynamical range and moderate TIA gain to pursue higher local oscillator (LO) amplification of vacuum quadrature and broader detection bandwidth in homodyne system. High true randomness extraction ratio together with high sampling rate is attainable. Experimentally, an extraction ratio of true randomness of 85.3% is achieved by finite enhancement of the laser power of the LO when classical noise excursions of the raw data is obvious.

. Various elements such as evolutions in IoT services resulting from sensoring by vehicle parts and advances in small communication technology devices have significantly impacted the mass spread of mobility services that are provided to users in need of limited resources. In particular, business models are progressing away from one-off cost towards longer term cost as represented by shared services utilizing kick-boards or bicycles and subscription services for vehicle software. Advances in shared mobility services as described are calling for solutions that can enhance reliability of data aggregate by users leveraging mobility services in the next-generation mobility areas. However, mining process to renew status, ensures continued network communication and block creation demands high performance in public block chain. This thesis proposes random certificate node selection mechanism in block network that creates blocks via node that has tokens issued for block creation and lets only specific nodes selected by encrypting token information acquires token.

Adjustable frequency converters are widely used in modern automated asynchronous drives due to their high efficiency and high responsiveness control strategies. Control algorithms for frequency converters are divided into two main groups: constant frequency commutation and random frequency commutation. Research results on various commutation frequencies, conducted using Matlab/Simulink software, show that the use of random frequency commutation provides better efficiency by significantly reducing the amplitude of harmonic oscillations at different frequencies, with a reduction in switching losses in transistors. Currently, a converter with random frequency commutation is being researched and applied in the direct torque control system. The traditional direct control system, based on a two-level inverter, is widely used due to its simplicity and ease of implementation. However, this method results in the output current of the two-level converter, supplied to the motor stator, having many harmonic distortions, leading to strong torque fluctuations regardless of the rotation speed and ultimately causing additional losses in the stator windings and reducing the motor's lifespan. To enhance the efficiency of automated asynchronous drives, this article presents an algorithm for a direct control system based on a three-level NPC inverter using a PI speed regulator. The proposed algorithm's research is validated in the Matlab/Simulink environment. The research results show that in the absence of harmonic filtering, the stator current harmonic distortion coefficient is approximately 11%, and torque fluctuations are less than 5% of the resistive torque. The fluctuations between the two capacitors remain almost unchanged throughout the entire process.

In heterogeneous networks, the random walks based on meta-path requires prior knowledge and lacks flexibility. And the random walks based on non-meta-path only considers the number of node types, but does not consider the influence of schema and topology between node types in real networks. To solve the above problems, this paper proposes a novel model HNE-RWTIC (Heterogeneous Network Embedding Based on Random Walks of Type & Inner Constraint). Firstly, to realize the flexible walks, we design a Type strategy, which is the node type selection strategy based on the co-occurrence probability of node types. Secondly, to achieve the uniformity of node sampling, we design an Inner strategy, which is the node selection strategy based on the adjacency relationship between nodes. The Type & Inner strategy can realize the random walks based on meta-path, the flexibility of the walks, and can sample the node types and nodes uniformly in proportion. Thirdly, based on the above strategy, a transition probability model is constructed; then, we obtain the nodes embedding based on the random walks and Skip-Gram. Finally, in classification and clustering tasks, we conducted a thorough empirical evaluation of our method on three real heterogeneous networks. Experimental results shown that F1-Score and NMI of HNE-RWTIC outperform state-of-the-art approaches.

This study utilizes the Random Forest technique to investigate risk management practices and concerns in Islamic banks using survey data from 2016 to 2021. Findings reveal that larger banks provide more consistent survey responses, driven by their confidence and larger survey budgets. Moreover, a positive link is established between a country's development, characterized by high GDPs and low inflation and interest rates, and the precision of Islamic banks' survey responses. Analyzing risk-related concerns, the study notes a significant reduction in credit portfolio risk, attributed to improved risk management practices, global economic growth, stricter regulations, and diversified asset portfolios. Concerns related to terrorism financing and cybersecurity risks have also decreased due to better enforcement of anti-money laundering regulations and investments in cybersecurity infrastructure and education. This research enhances our understanding of risk management in Islamic banks, highlighting the impact of bank size and country development. Additionally, it emphasizes the need for ongoing analysis beyond 2021 to account for potential COVID-19 effects and evolving risk management and regulatory practices in Islamic banking.

Exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a number of new opportunities for optimizing video delivery across both 5G core and radio access network. One of the promising approaches for video quality adaptation, throughput enhancement and erasure protection is the use of packet-level random linear network coding (RLNC). In this work, we discuss the integration of RLNC into the 5G NR standard, building upon the ideas and opportunities identified in 4G LTE. We explicitly identify and discuss in detail novel 5G NR features that provide support for RLNC-based video delivery in 5G, thus pointing out to the promising avenues for future research.

Railway has been used as one of the most crucial means of transportation in public mobility and economic development. For efficiently operating railways, the electrification system in railway infrastructure, which supplies electric power to trains, is essential facilities for stable train operation. Due to its important role, the electrification system needs to be rigorously and regularly inspected and managed. This paper presents a supervised learning method to classify Mobile Laser Scanning (MLS) data into ten target classes representing overhead wires, movable brackets and poles, which are recognized key objects in the electrification system. In general, the layout of railway electrification system shows a strong regularity of spatial relations among object classes. The proposed classifier is developed based on Conditional Random Field (CRF), which characterizes not only labeling homogeneity at short range, but also the layout compatibility between different object classes at long range in the probabilistic graphical model. This multi-range CRF model consists of a unary term and three pairwise contextual terms. In order to gain computational efficiency, MLS point clouds is converted into a set of line segments where the labeling process is applied. Support Vector Machine (SVM) is used as a local classifier considering only node features for producing the unary potentials of CRF model. As the short-range pairwise contextual term, Potts model is applied to enforce a local smoothness in short-range graph. While, long-range pairwise potentials are designed to enhance spatial regularities of both horizontal and vertical layouts among railway objects. We formulate two long-range pairwise potentials as the log posterior probability obtained by Naïve Bayes classifier. The directional layout compatibilities are characterized in probability look-up tables which represent co-occurrence rate of spatial relations in horizontal and vertical directions. The likelihood function is formulated by multivariate Gaussian distributions. In the proposed multi-range CRF model, the weight parameters to balance four sub-terms are estimated by applying the Stochastic Gradient Descent (SGD). The results show that the proposed multi-range CRF can effectively classify detailed railway elements, representing the average recall of 97.66% and the average precision of 97.07% for all classes.

In actuarial practice, the modeling of total losses tied to a certain policy is a non-trivial task. Traditional parametric models to predict total losses have limitations due to complex distributional features such as extreme skewness, zero inflation, multi-modality, etc., and the lack of explicit solutions for log-normal convolution. In the recent literature, the application of the Dirichlet process mixture for insurance loss has been proposed to eliminate the risk of model misspecification biases; however, the effect of covariates as well as missing covariates in the modeling framework is rarely studied. In this article, we propose novel connections among covariate-dependent Dirichlet process mixture, log-normal convolution, and missing covariate imputation. Assuming an individual loss is log-normally distributed, we develop a log skew-normal Dirichlet process to approximate the log-normal sum. As a generative approach, our framework models the joint of outcome and covariates, which allows to impute missing covariates under the assumption of missingness at random. The performance is assessed by applying our model to several insurance datasets, and the empirical results demonstrate the benefit of our model compared to the existing actuarial models such as the Tweedie-based generalized linear model, generalized additive model, or multivariate adaptive regression spline.

The TROPOMI XCH4 data product requires rigorous cloud filtering to achieve a product accuracy of <1%. To this end, the operational XCH4 data processing has been based on SUOMI-NPP VIIRS cloud observations. However, SUOMI-NPP is nearing at the end of its operational life and has encountered malfunctions in 2022 and 2023. In this study, we introduce a novel machine learning cloud clearing approach based on a random forest classifier (RFC). The RFC is trained on collocated TROPOMI and SUOMI-NPP VIIRS data to emulate VIIRS-like cloud clearing. After training, cloud masking requires only TROPOMI data, and so becomes operationally independent of SUOMI-NPP. We demonstrate the RFC approach by applying cloud clearing to operational TROPOMI XCH4 data for August 2022, a period in which VIIRS was not operational. For validation, we analyze the TROPOMI XCH4 data at 12 TCCON stations. Comparison of cloud clearing using the RFC and the original VIIRS method reveals excellent agreement with a similar station-to-station bias (-7.4 ppb versus -5.6 ppb), a similar standard deviation of the station-to-station bias (11.6 ppb versus 12 ppb), and the same Pearson correlation coefficient of 0.9. Remarkably, the RFC cloud clearing provides a slightly higher volume of data (2182 versus 2035 daily means) and appears to have fewer outliers. Since November 21, 2023, the RFC approach is part of ESA’s operational processing chain. For now the default practice is to utilize SNPP-VIIRS when accessible. Only in cases where VIIRS data is unavailable do we resort to the RFC cloud mask.

High PM10 concentrations are still a significant problem in many parts of the world. In many countries, including Poland, 50μg/m3 is the permissible threshold for a daily averaged PM10 concentration. The number of people affected by this threshold’s exceedance is challenging to estimate and requires high-resolution concentration maps. This paper presents an application of random forests for downscaling regional model air quality results. As policymakers and other end users are eager to receive a detailed resolution PM10 concentration maps, we propose a technique which utilizes the results of regional CTM (GEM-AQ, with 2.5km resolution) and local Gaussian plume model. As a result, we receive a detailed, 250-meter resolution PM10 distribution, which resembles the complex emission pattern in a foothill area in southern Poland. The random forest results are highly consistent with the GEM-AQ and observed concentration. We also discuss different strategies of data training random forest - using additional features and selecting target variables.

As time progresses and technology improves, biological data sets are continuously increasing in size. New methods and new implementations of existing methods are needed to keep pace with this increase. In this paper, we present a high performance computing(HPC)-capable implementation of Iterative Random Forest (iRF). This new implementation enables the explainable-AI eQTL analysis of SNP sets with over a million SNPs. Using this implementation we also present a new method, iRF Leave One Out Prediction (iRF-LOOP), for the creation of Predictive Expression Networks on the order of 40,000 genes or more. We compare the new implementation of iRF with the previous R version and analyze its time to completion on two of the world's fastest supercomputers Summit and Titan. We also show iRF-LOOP's ability to capture biologically significant results when creating Predictive Expression Networks. This new implementation of iRF will enable the analysis of biological data sets at scales that were previously not possible.

The influence of a background vortex flow on clustering of floating tracer is addressed. The vortex flow considered is induced by an ellipsoidal vortex evolving in a deformation. The system exhibits various vortex motion regimes: (i) steady state, (ii) oscillation and (iii) rotation of the ellipsoidal vortex core. The latter two induce unsteady velocity field for the tracer thus leading to irregular (chaotic) tracer motion. Superimposing a stochastic divergent velocity field onto the deterministic vortex flow allows us to observe significantly different tracer evolution. We use the method of characteristics to integrate the floating tracer density evolution equation and the Euler-Ito scheme for obtaining the floating tracer trajectories with the random velocity field. The cluster area and cluster mass from the statistical topography were used as the quantitative diagnostics of floating-tracer’s clustering. For the case of the steady ellipsoidal vortex embedded into the deformation flow with a random velocity field component we found that clustering characteristics are weakened by the steady vortex. For the cases of an unsteady ellipsoidal vortex, we observed clustering in the floating-tracer density field if the contribution of the divergent component is higher or equal to that of the rotational (nondivergent) component. Even when the initial floating tracer patch was set on the boundary of oscillating ellipsoidal vortex, we observed formation of clusters. In the case of a rotating ellipsoidal vortex, we also observed pronounced clustering. Thus, we argue that unsteady ellipsoidal vortex regimes (oscillation and rotation), which induce chaotic motion of the nearby passive tracer’s trajectories, are still conducive to clustering of floating tracer observed in the density field despite the intense deformation introduced by strain and shear.

In this study, we investigate the performance of the saddlepoint approximation of the probability mass function and the cumulative distribution function for the weighted sum of independent Poisson random variables. The goal is to approximate the hazard rate function for this complicated model. The better performance of this method is shown by numerical simulations and comparison with a performance of other approximation methods.

Presently power control and management play a vigorous role in information technology and power management. Instead of non-renewable power manufacturing, renewable power manufacturing is preferred by every organization for controlling resource consumption, price reduction and efficient power management. Smart grid efficiently satisfies these requirements with the integration of machine learning algorithms. Machine learning algorithms are used in a smart grid for power requirement prediction, power distribution, failure identification etc. The proposed Random Forest-based smart grid system classifies the power grid into different zones like high and low power utilization. The power zones are divided into number of sub-zones and map to random forest branches. The sub-zone and branch mapping process used to identify the quantity of power utilized and the non-utilized in a zone. The non-utilized power quantity and location of power availabilities are identified and distributed the required quantity of power to the requester in a minimal response time and price. The priority power scheduling algorithm collect request from consumer and send the request to producer based on priority. The producer analysed the requester existing power utilization quantity and availability of power for scheduling the power distribution to the requester based on priority. The proposed Random Forest based sustainability and price optimization technique in smart grid experimental results are compared to existing machine learning techniques like SVM, KNN and NB. The proposed random forest-based identification technique identifies the exact location of the power availability, which takes minimal processing time and quick responses to the requestor. Additionally, the smart meter based smart grid technique identifies the faults in short time duration than the conventional energy management technique is also proven in the experimental results.

Polymers in highly confined geometries can display complex morphologies including ordered phases. A basic component of a theoretical analysis of their phase behavior in confined geometries is the knowledge of the number of possible single-chain conformations compatible with the geometrical restrictions and the established crystalline morphology. While the statistical properties of unrestricted self-avoiding random walks (SAWs) both on and off-lattice are very well known, the same is not true for SAWs in confined geometries. The purpose of this contribution is a) to enumerate the number of SAWs on the simple cubic (SC) and face-centered cubic (FCC) lattices under confinement for moderate SAW lengths, and b) to obtain an approximate expression for their behavior as a function of chain length, type of lattice, and degree of confinement. This information is an essential requirement for the understanding and prediction of entropy-driven phase transitions of model polymer chains under confinement. In addition, a simple geometric argument is presented that explains, to first order, the dependence of the number of restricted SAWs on the type of SAW origin.

In this paper, a kind of single-walled carbon nanotube nonlinear model is developed, and the strongly nonlinear dynamic characteristics of such carbon nanotubes subjected to random magnetic field are studied. The nonlocal effect of microstructure is considered based on the theory of nonlocal elasticity. The natural frequency of the strongly nonlinear dynamic system is obtained by the energy function method, the drift coefficient and the diffusion coefficient are verified. The stationary probability density function of the system dynamic response is given and the fractal boundary of the safe basin is provided. Theoretical analysis and numerical simulation show that stochastic resonance occurs when varying the random magnetic field intensity. The boundary of safe basin has fractal characteristics and the area of safe basin decreases when the intensity of the magnetic field permeability increases.

Random Forest (RF) is a widely used data prediction and variable selection technique. However, the variable selection aspect of RF can become unreliable when there are more irrelevant variables than relevant ones. In response, we introduced the Bayesian Random Forest (BRF) method specifically designed for high-dimensional datasets with a sparse covariate structure. Our research demonstrates that BRF possesses the oracle property, which means it achieves strong selection consistency without compromising efficiency or bias.

In recent years, data providers are generating and streaming a large number of images. More particularly, processing images that contain faces have received great attention due to its numerous applications, such as entertainment and social media apps. The enormous amount of images shared on these applications presents serious challenges and requires massive computing resources to ensure efficient data processing. However, images are subject to a wide range of distortions in real application scenarios during the processing, transmission, sharing, or combination of many factors. So, there is a need to guarantee acceptable delivery content, even though some distorted images do not have access to their original version. In this paper, we present a framework developed to estimate the images' quality while processing a large number of images in real-time. Our quality evaluation is measured using an integration of a deep network with random forests. In addition, a face alignment metric is used to assess the facial features. Experimental results have been conducted on two artificially distorted benchmark datasets, LIVE and TID2013. We show that our proposed approach outperforms the state-of-art methods, having a Pearson Correlation Coefficient (PCC) and Spearman Rank Order Correlation Correlation Coefficient (SROCC) with subjective human scores of almost 0.942 and 0.931 while minimizing the processing time from 4.8ms to 1.8ms.

Due to production space and operating environment requirements, mine production equipment often breaks down, which seriously affects the mine’s production schedule. To ensure the smooth completion of the haulage operation plan under abnormal conditions, a model of the haulage equipment rescheduling plan based on the random simulation of equipment breakdowns is established in this paper. The model aims to accomplish both the maximum completion rate of the original mining plan and the minimum fluctuation of the ore grade during the rescheduling period. This model is optimized by improving the wolf colony algorithm and changing the location update formula of the individuals in the wolf colony. Then, the optimal model solution can be used to optimize the rescheduling of the haulage plan by considering equipment breakdowns. The application of the proposed method in an underground mine revealed that the completion rate of the mine’s daily mining plan reached 83.40% without increasing the number of the equipment, while and the ore quality was stable. Moreover, the improved optimization algorithm converged fast and was characterized by high robustness.

Lodging is a common problem in maize production that seriously impacts yield, quality, and the capacity for mechanical harvesting. Evaluation of site-specific lodging risks requires establishment of a method for multi-year monitoring. In this study, spectral images collected by the Sentinel-2 satellite were processed to obtain three types of data: gray-level co-occurrence matrix texture (GLCM), vegetation indices (VIs), and spectral reflectance (SR). Lodging classification models were then established with Random Forest (RF) using each of the three data types separately (the GLCM, VI, and SR models) and in combination (SR+VI model, SR+GLCM model, VI+GLCM mod-el, and SR+VI+GLCM model). By gradually removing features with low importance scores from the SR+VI+GLCM model and analyzing the changes in the overall accuracy (OA), the optimal set of predictive variables was identified and used to construct the optimal model. A model built us-ing data from a single timepoint in 2021 was tested on data collected at a similar timepoint in 2019 and vice versa to assess interannual model generalizability. The results of this study demon-strate that for monitoring maize lodging, models constructed with a single feature type, the GLCM model had significantly lower accuracy compared to the VI and SR models. During certain growth stages, the model constructed with combined features had significantly higher accuracy in monitoring maize lodging compared to models constructed with a single feature. During the pro-cess of selecting the optimal predictive variables, it was found that the accuracy of the model did not increase as the number of predictive variables increased. The results show that the positive and negative validation models had an accuracy of 96.55% and 95.18%, with kappa values of 0.93 and 0.83, respectively. This indicates that the model has strong generality for the same repro-ductive stage between years. This study provides a detailed method for large-scale maize lodging monitoring, allowing for identification of optimal planting practices to reduce the probability of lodging and ultimately improving regional maize yield and quality.

Object segmentation on remotely-sensed images: aerial (or very high resolution, VHS) images and satellite (or high resolution, HR) images, has been applied to many application domains, especially road extraction in which the segmented objects are served as a mandatory layer in geospatial databases. Several attempts in applying deep convolutional neural network (DCNN) to extract roads from remote sensing images have been made; however, the accuracy is still limited. In this paper, we present an enhanced DCNN framework specifically tailored for road extraction on remote sensing images by applying landscape metrics (LMs) and conditional random fields (CRFs). To improve DCNN, a modern activation function, called exponential linear unit (ELU), is employed in our network resulting in a higher number of and yet more accurate extracted roads. To further reduce falsely classified road objects, a solution based on an adoption of LMs is proposed. Finally, to sharpen the extracted roads, a CRF method is added to our framework. The experiments were conducted on Massachusetts road aerial imagery as well as THEOS satellite imagery data sets. The results showed that our proposed framework outperformed Segnet, the state-of-the-art object segmentation technique on any kinds of remote sensing imagery, in most of the cases in terms of precision, recall, and F1.

The special affine Fourier transform (SAFT) is a useful and powerful analyzing tool in signal processing, optics and communications. In this paper, we mainly discuss the randomized nonuniform sampling and reconstruction for random signals bandlimited in the SAFT domain. First, we show that the nonuniform sampling is identical to the uniform sampling after a pre-filter in the sense of second order statistic characters. Then, we propose an approximate reconstruction based on sinc interpolation for the nonuniform sampling of random signals bandlimited in the SAFT domain. Finally, we give the mean square error estimate for the proposed approximate recovery approach.

We consider a coded compressed sensing protocol for unsourced massive random access (URA) that concatenates a shared Patterned Reed-Muller (PRM) inner codebook to an outer error-correction code. In this paper, an iterative list PRM projection algorithm is proposed to supplant the signal detector associated with the inner PRM sequences. In particular, we first propose an enhanced paths-saving algorithm called list PRM projection detection for the single-user scenario that keeps multiple candidates for the first few layers to remedy the risk of spreading errors. On this basis, we further propose an iterative list PRM projection algorithm for the multi-user scenario. The vectors for PRM codes and channel coefficients are jointly detected in an iterative manner, which offers significant improvements regarding the convergence rate for signal recovery. Furthermore, the performances of the proposed algorithms are analyzed mathematically, and we verified that the theoretical simulations are consistent with the numerical simulations. Finally, we concatenate the inner PRM codes that employ the iterative list detection to two practical error-correction outer codes. According to the simulation results, we conclude that the packetized URA with the proposed iterative list projection detection works better than benchmarks in terms of the number of active users it can support in each slot and the amount of energy needed per bit to meet an expected error probability.

The interpretation of land use and land cover (LULC) is an important issue in the fields of high-resolution remote sensing (RS) image processing and land resource management. Fully training a new or existing convolutional neural network (CNN) architecture for LULC classification requires a large amount of remote sensing images. Thus, fine-tuning a pre-trained CNN for LULC detection is required. To improve the classification accuracy for high resolution remote sensing images, it is necessary to use another feature descriptor and to adopt a classifier for post-processing. A fully connected conditional random fields (FC-CRF), to use the fine-tuned CNN layers, spectral features, and fully connected pairwise potentials, is proposed for image classification of high-resolution remote sensing images. First, an existing CNN model is adopted, and the parameters of CNN are fine-tuned by training datasets. Then, the probabilities of image pixels belong to each class type are calculated. Second, we consider the spectral features and digital surface model (DSM) and combined with a support vector machine (SVM) classifier, the probabilities belong to each LULC class type are determined. Combined with the probabilities achieved by the fine-tuned CNN, new feature descriptors are built. Finally, FC-CRF are introduced to produce the classification results, whereas the unary potentials are achieved by the new feature descriptors and SVM classifier, and the pairwise potentials are achieved by the three-band RS imagery and DSM. Experimental results show that the proposed classification scheme achieves good performance when the total accuracy is about 85%.

As intercity buses are a mode that moves large scaled occupancy between regions, it accounts for the mode share-means for mid to long-distance movement in South Korea. However, the study on intercity bus safety needs to be more extensive, and safety policies are carried out based on traditional probability models without considering the data characteristics of bus accidents. Therefore, in this study, the Random Parameter Ordered Logit model was applied to derive fixed parameter factors that have the same effect on the severity of intercity bus accidents and random parameters that consider the heterogeneity of unique attributes by accident. It also analyzed the marginal effect of intercity bus accident severity. As a result of the study discovered that the influencing factors that reflect heterogeneity with Random Parameters were driver’s condition: drowsiness, vehicle size: medium, crash type: vehicle-pedestrian accident, road condition: wet pavement, and log form of AADT. The random parameter ordered logit model was traditionally found to be more suitable than the ordinal logit model, which only reflects fixed factors and more reliable predictions considering the heterogeneity of accident characteristics for each observation.

Diesel engines, as power equipment, are widely used in the fields of automobile industry, ship and power equipment. Due to wear or faulty adjustment, the valve train clearance abnormal fault is a typical failure of diesel engines, which may result in the performance degradation, even valve fracture and cylinder hit fault. However, the failure mechanism features mainly in time domain and angular domain, on which the current diagnosis methods based, are easily affected by working conditions or hard to extract accurate enough, as the diesel engine keeps running in transient and non-stationary process. This work arms at diagnosing this fault mainly based on frequency band features which would change when the valve clearance fault occurs. For the purpose of extracting a series of frequency band features adaptively，a decomposition technique based on improved variational mode decomposition is investigated in this work. As the connection between the features and the fault is fuzzy, the random forest algorithm is used to analyze the correspondence between features and faults. In addition, the feature dimension is reduced to improve the operation efficiency according to importance score. The experimental results under variable speed condition show that the method based on variational mode decomposition and random forest is capable to detect valve clearance fault effectively.

Wireless Sensor Networks (WSN) are the core of Internet of Things and require cryptographic protection due to the increase number of attacks. Cryptographic methods for WSN should be fast and consume low power as these networks consist of battery-powered devices and constrained microcontrollers. NTRU, the fastest and secure public key cryptosystem, uses high degree polynomials, and is susceptible to the lattice basis reduction attack (LBRA). CPKC, proposed by NTRU authors, works on integers modulo $q$ and is easily attackable by LBRA since it uses small numbers for the sake of the correct decryption. Herein, RCPKC, a random congruential public key cryptosystem working on integers modulo $q$ is proposed, such that the norm of a two-dimensional vector formed by its private key is greater than $\sqrt{q}$. RCPKC works similar to NTRU, and it is a secure version of insecure CPKC. RCPKC specifies a range from which the random numbers shall be selected, and it provides correct decryption for valid users and incorrect decryption for an attacker using LBRA by Gaussian lattice reduction. Because of its resistance to LBRA, RCPKC is more secure. Simultaneously, due to the use of big numbers instead of high degree polynomials, RCPKC is about 24 (7) times faster in encryption (decryption) than NTRU. Also, RCPKC is more three times faster than the most effective known NTRU variant, BQTRU. Compared to NTRU, RCPKC reduces energy consumption at least seven times that allows increasing life-time of unattended WSN more than seven times.

During the COVID-19 lockdown in Wuhan, transportation, industrial production and other human activities declined significantly, as did the NO2 concentration. In order to assess the relative contributions of different factors to reductions of air pollutants, sensitivity experiments were implemented by random forest (RF) model, with the comparison of contributions of meteorology, road traffic, and emission sources between different periods. Besides, an emulator was operated to suggest an appropriate limit for control of transportation. The RF models showed different mechanisms for air pollutants. Within-city Migration index (WMI) was more important in the normal, pre-lockdown and post-pandemic model while Out-Migration Index (OMI) was emphasized in the lockdown model. In the COVID-19 lockdown period, 73.3% of the reduction can be attributed to the decreased road traffic, showing massive impact of road traffic on the air quality. In the post-pandemic period, meteorology controlled about 42.2% of the decrease and emissions from industry and household controlled 40.0% while road traffic only contributed to 17.8%. It was suggested that priority of restriction should be given to road traffic within the city. A limit of less than 40% on the control of the road traffic can get a better effect, especially for cities with severe traffic pollution.

The stator winding insulation system is the most critical and weak part of the EMU's (electric multiple unit) traction motor. The effective diagnosis for stator ITSC (inter-turn short-circuit) faults can prevent the fault from expanding into phase-to-phase or ground short-circuits. The TCU(traction control unit) controls the traction inverter to output SPWM (sine pulse width modulation) excitation voltage when the traction motor is stationary. Three ITSC fault diagnostic conditions are based on different IGBTs control logic. The Goertzel algorithm is used to calculate the fundamental current amplitude difference Δi and phase angle difference Δθ of equivalent parallel windings under the three diagnostic conditions. The six parameters under the three diagnostic conditions are used as features to establish an ITSC fault diagnostic model based on random forest. The proposed method was validated using a simulation experimental platform for ITSC fault diagnosis of EMU traction motors. The experimental results indicate that the current amplitude features Δi and phase angle features Δθ change obviously with the increase of ITSC fault extent if the ITSC fault occurs at the equivalent parallel windings. The accuracy of the ITSC fault diagnosis model based on the random forest for ITSC fault detection and location both in train and test samples are 100%.

Election Algorithm (EA) is a powerful metaheuristics model motivated by phenomena of the socio-political mechanism of the presidential election conducted in many countries. EA is selected as a topic of discussion due to its capability and robustness to carry out complex problems in the random-2SAT logic program. This paper utilizes a hybridized EA assimilated with the Hopfield neural network (HNN) in carrying out random logic program (HNN-R2SATEA). The efficiency of the proposed method was compared with the existing traditional exhaustive search (HNN-R2SATES) model and the recently introduced HNN-R2SATICA model. From the result obtained, clearly proven that based on our proposed hybrid model outperformed other existing model based on the Global Minima Ratio (ZM), Mean Absolute Error (MAE), Bayesian Information Criterion (BIC) and Execution Time (ET). The expected outcome portrays that the EA algorithm outperformed the other two algorithms in doing random-kSAT logic program. The results proved the robustness, effectiveness, and compatibility of the HNN-R2SATEA model.

Mobility models are used to evaluated the network protocols of the ad hoc network using the simulation. The random waypoint model is a model for mobility which is usually used for performance evaluation of ad-hoc mobile network. Mobile nodes have the dynamic mobility in the ad hoc network so the mobility model plays an important role to evaluate the protocol performance.In this article, we developed modify random waypoint mobility (MRWM) model based on random waypoint for the mobile ad hoc network. In this article, the comparative analysis of modifying random waypoint mobility and random waypoint model on the ad hoc On-Demand Distance Vector (AODV) routing protocol has been done for large wireless ad hoc network (100 nodes) with the random mobile environment for the 1800s simulation time. To enhance the confidence on the protocol widespread simulations were accomplished under heavy traffic (i.e. 80 nodes) condition. The proposed model protocol has been investigated with the performance metrics: throughput; packet delivery ratio; packet dropping ratio; the end to end delay and normalized routing overhead. The obtained results revealed that proposed modify random waypoint mobility model reduces the mobility as compared to the random waypoint mobility model and it is trace is more realist.

The early-season area estimation of the winter wheat crop as a strategic product is important for decision makers. Classification of multi-temporal images is an approach which is affected by many factors like appropriate training sample size, proper frequency and acquisition times, vegetation indices (VIs) type, temporal gradient of spectral bands and VIs, appropriate classifier and missed values because of cloudy conditions. This paper addresses the impact of appropriate frequency and acquisition times and VIs type along with the spectral and VI gradient on random forest (RF) classifier when missed values exist in multi-temporal images. To investigate the appropriate temporal resolution for image acquisition, the study area was selected on an overlapping area between two LDCM paths. In our developed method, the miss values of cloudy bands for each pixel are retrieved by the mean of k-nearest ordinary pixels. Then the multi-temporal image analysis is performed by considering different scenarios provided by decision makers in terms of desired crop types that should be extracted at early-season in the study areas. The classification results obtained by the RF decrease by 1.6% when temporally missed values retrieved by the proposed method, which is an acceptable result. Moreover, the experimental results demonstrated that if temporal resolution of Landsat 8 increased to one week the classification task can be conducted earlier with almost better results in terms of OA and kappa. The impact of incorporating VIs along with the temporal gradients of spectral bands and VIs as new features in RF demonstrated that the OA and Kappa are improved 3.1% and 6.6%, respectively. Furthermore, the obtained result showed that if only one image from seasonal changes of crops is available, the temporal gradient of VIs and spectral bands play the main role to discriminate remarkably wheat from barley. The experiments also demonstrated that if both wheat and barley merge to a single class the crop area can be estimated two months earlier with 97.1 and 93.5 in terms of OA and kappa, respectively.

This paper has a twofold objective. The first aim is to present a comprehensive bibliographical analysis of journal articles and book chapters on fuzzy-random option pricing (FROP) over the WoS and SCOPUS databases. It follows PRISMA criteria and takes special care of developments in continuous time. Thus, we described the principal findings about the research streams, outlets and authors of this topic and lets us suggest further research. The second contribution is motivated by the fact that the bibliographical revision has identified a lack of developments on equilibrium models on the yield curve. This question motivates extending Vasicek’s yield curve equilibrium model to introduce fuzziness in the parameters that govern interest rate movements (speed of reversion, equilibrium short-term interest rate, and volatility). Likewise, this paper develops an empirical application on the term structure of fixed income public bonds with the highest credit rating in the Euro area.

This article is devoted to methods of processing random processes. Of particular relevance is the task of processing broadband non-stationary random processes. The processing of random processes is usually related to the assessment of their probabilistic characteristics. Very often, a non-stationary broadband random process is represented by a single implementation in a priori uncertainty about the type of distribution function. Such random processes occur in information and measuring communication systems in which information is transmitted at a real time pace (for example, radio telemetry systems of spacecraft). The use of methods of traditional mathematical statistics, for example, maximum likelihood methods to determine probability characteristics, in this case is not possible. The article discusses a method of processing non-stationary broadband random processes based on the use of non-parametric methods of decision theory. An algorithm for dividing the observation interval into stationary intervals using non-parametric Kendall statistics is considered, as well as methods for estimating probabilistic characteristics on the stationary interval using ordinal statistics. The article presents the results of statistical modeling using the Mathcad program.

A swarm based nature-inspired optimization algorithm namely fruit fly optimization algorithm (FOA) has simple structure and ease of implementation. However, FOA has a low success rate and a slow convergence because FOA generates new positions around the best location using fixed search radius. Several improved FOAs have been proposed. But their exploration ability is questionable. To make the search process to transit from the exploration phase to the exploitation phase smoothly, this paper proposes a new FOA constructed from a cooperation of the multileader and the probabilistic random walk strategies (CPFOA). It has two population types working together. CPFOA's performance is evaluated by 18 well-known standard benchmark, and 30 CEC’2017 functions. The results showed that CPFOA outperforms both the original FOA and its variants in terms of convergence speed and performance accuracy. The results base on CEC’2017 show that CPFOA can achieve a very promising accuracy when compared with the well-known competitive algorithms. CPFOA is applied to optimize two applications; the MLPs classifying real datasets and extracting parameters of T-S fuzzy system for modelling Box and Jenkins gas furnace data set. CPFOA can find parameters having a very high quality compared with the best known competitive algorithms.

The construction of random fillings from the excavation of medium hardness rocks, with high particle sizes, presents limitations in compaction control. This research applies new control techniques with revised test procedures in the construction of the random fillings core, which constitutes the main part of the embankment, with the bigger volume and provides the geotechnical stability to the infrastructure. The maximum layer thickness researched was 800mm. As there are many types of rocks, this research is applied to metamorphic slates. Quality control has been carried out by applying new research associated with the revision of wheel impression test, topographic settlements and plate bearing test (PBT). A statistical analysis of the core of 16 slate random fillings has been carried out, with a total of 2250 in situ determination of density and moisture content, 75 wheel impression tests, 75 topographic settlement control and 75 PBT. The strong associations found between different tests have allowed to simplify the quality control.

To establish simulated micro-gravity conditions, biological organisms are placed on a simulated microgravity system, which primarily rotate in two or three dimensions and rely on slow sedimentation with latency to detect gravity. Fluid dynamics arise as a consequence of rotation of the chambers with in which the cells are filled. To minimize the effects of centrifugal forces, it is necessary to position the samples as close to the center of rotation as possible. Strong shear forces and velocities within the vessel can have an adverse impact on cells, making this a critical topic in cell biology. During experimental investigation, this specific phenomenon is not apparent, but numerical modelling readily illustrates and is not widely analyzed in literature's. Furthermore, bulk flask are frequently employed on random positioning machines (RPM), not merely because they demand a substantial quantity of reagents. The flask presented in the study can be easily developed and fitted in conventional cell culture plates containing medium and reagents similar to those used in ground experiments, thus allowing it to remain close to the center of rotation. In the present study, a series of fluid dynamics simulations are performed to examine the impact of shear forces within the microvessel presented under varying conditions using a foreign medium condition, and these results are compared with existing vessels by observing the effects of shear forces and maximum velocity zones.

Breast cancer is the most common malignancy in women worldwide. The pathogenesis of this disease is closely related to the estrogen receptor alpha subtype (ERα). Therefore, it is of great importance to develop effective inhibitors of ERα activity for the treatment of breast cancer. In this paper, we propose a novel ensemble machine learning model for quantitative structure-activity relationship of anti-breast cancer drugs, which can effectively predict drug activity in small samples with multiple characteristic variables. To avoid the problem of over-fitting caused by low-correlation independent variables, the scoring mechanism of random forest was improved by incorporating three relevance indicators, including the maximum mutual information number, Pearson correlation coefficient and distance correlation coefficient, and 20 optimal molecular descriptors were selected. The Bayesian hyperparameter optimization method was used to optimize the parameters of multiple linear regression (MLR), support vector regression (SVR), and extreme gradient boosting (XGBoost), respectively. The AdaBoost strong learner was constructed by combining the weak learner with the weighted linear addition method. The results show that the proposed ensemble learning model has the best prediction performance compared to the three basic learner models and the CNN-LSTM combination prediction model. The root mean square error was reduced by 7.60%-26.51%. The mean relative error was reduced by 6.46%-30.92%. Goodness of fit increased by 9.57%-36.94%. Finally, the biological activities of 50 candidate compounds for ERα inhibitors were predicted, and it was found that 4-[2-benzyl-1-[4-(2-pyrrolidin-1-ylethoxy)phenyl]but-1-enyl]phenol had an excellent biological activity value pIC50, which had the potential to be an ERα inhibitor. The model proposed in this paper has good prediction accuracy, which can provide an effective reference for the discovery and development of anti-breast cancer drugs.

Recent simulation studies have revealed a wealth of distinct crystal polymorphs encountered in the self-organization of polymer systems driven by entropy or free energy. The present analysis, based on the concept of self-avoiding random walks on crystal lattices, is useful to calculate upper bounds for the entropy difference of the crystals that are formed during polymer crystallization and thus provide predictions on polymorph thermodynamic stability. Here, we compare two pairs of crystals sharing the same coordination number, ncoord: hexagonal close packed (HCP) and face centered cubic (FCC), both having ncoord = 12 and the same packing density, and the less dense hexagonal (HEX) and body centered cubic (BCC) lattices, with ncoord = 8. In both cases, once a critical step length is reached, one of the crystals shows a higher number of SAWs compatible with the crystal. We explain the observed trends in terms of the bending and torsion angles corresponding to the different chain geometry as imposed by the geometric constraints of the crystal lattice.

Non-Linear Simulation by Harmonic Balance Techniques of Load Modulated Power Amplifier Driven by Random Modulated Signals. Comparison with measured results.

We present results of the detected voltage distribution of a quantum random number generator based on the photonic integration of semiconductor laser, delay interferometer and photodetector. We find that the integrated system behaves as expected for random number generation from gain-switched laser sources. The biggest advantage is that only electrical connections are needed to operate the system without the need for tricky and expensive optical alignment to external circuitry. We supply results showing that random bit stream created from the random numbers passes the NISTS statistical test suite tests; thus demonstrating the feasibility to generate random number via quantum means at gigabit/s rates from a single photonic integrated circuit. The results are backed by numerical simulations.

This paper explores the capability of various machine learning algorithms, including Random Forests and advanced gradient boosting techniques such as XGBoost, LightGBM, and CatBoost, to predict customer churn in the telecommunications sector. For this analysis, a dataset available to the public was employed. The performance of these algorithms was assessed using recognized metrics, including Accuracy, Precision, Recall, F1-score, and the Receiver Operating Characteristic Area Under Curve (ROC AUC). These metrics were evaluated at different phases: subsequent to data preprocessing and feature selection; following the application of SMOTE and ADASYN sampling methods; and after conducting hyperparameter tuning on the data that had been adjusted by SMOTE and ADASYN. The outcomes underscore the notable efficiency of upsampling techniques such as SMOTE and ADASYN in addressing the imbalance inherent in customer churn prediction. Notably, the application of random grid search for hyperparameter optimization did not significantly alter the results, which remained comparatively unchanged. The algorithms' performance post- ADASYN application marginally surpassed that observed after SMOTE application. Remarkably, LightGBM achieved an exceptional F1-score of 89% and an ROC AUC of 95% subsequent to the ADASYN sampling technique. This underlines the effectiveness of advanced boosting algorithms and upsampling methods like SMOTE and ADASYN in navigating the complexities of imbalanced datasets and intricate feature interdependencies.

Human leptospirosis cannot be investigated without studying zoonotic and environmental as-pects of the disease. The objectives of this study are to explore the abundance of Leptospira in dif-ferent climate zones of Sri Lanka and to describe the presence of Leptospira in same water source at different time points. First, water and soil samples were collected from whole-island, secondly, water sampling continued only in dry-zone, finally serial sampling of water from ten open wells was performed at five different time points. Quantitative PCR for water and metagenomic se-quencing for soil were used to detect Leptospira. In first component, 2 out of 12 water sites were positive and both are situated in wet-zone. Very small quantities of Genus Leptospira was detect-ed by metagenomic analysis of soil. Only 5 out of 26 samples were positive in the second compo-nent. Six, five, four, five, six wells were positive respectively in serial measurements of third component. All wells were positive at least one measurement while only one well was positive in all measurements. Closer to tank and higher distance from main road were significant risk fac-tors associated with well positivity. Presence of Leptospira seems not consistent indicating ran-dom abundance of Leptospira in natural environment.

Aiming at the prediction of environmental vibrations induced by elevated high-speed railway, a machine-learning method is developed by combining random forest algorithm and Bayesian optimization, which using the dataset from on-site experiments . When it comes to achieving a rapid and effective prediction of environmental vibration, there is few research on com-parisons and verifications of different algorithms, and neither on parameter tuning and optimi-zation of machine learning algorithms. In this paper, a field experiment is firstly carried out to measure the ground vibrations caused by high-speed trains running on bridge, and then the en-vironmental vibration characteristics are analyzed in view of ground accelerations and weighted vibration levels. Subsequently, three machine-learning algorithms of linear regression, support vector machine and random forest are developed by using experimental database, and their prediction performance are discussed. Finally, two optimization models for the hyperparameter set of random forest algorithm are further compared. It turns out that the integrated random forest algorithm has higher accuracy in predicting environmental vibration than linear regression and support vector machine; the Bayesian optimization has excellent performance and high efficiency in achieving efficient and in-depth optimization of parameters, and can be combined with the RF machine learning algorithm to effectively predict the environmental vibrations induced by the high-speed railway.

In recent years, how to combine intelligent prospecting algorithms such as random forest with a large number of geological and mineral data for quantitative prediction of exploration geochemistry has become an important topic of concern to quantitatively improve the accuracy of target delineation. The ore-forming geological conditions in the central Kunlun area of Xinjiang are great and have good prospecting prospects. However, due to the exhaustion of shallow deposits and the lag of geological prospecting work in the past ten years, there has been no expected breakthrough in the search for large and super-large metal deposits for many years. There has been a serious shortage of reserve resources. The use of new theories, new methods and new technologies for mineral resources investigation and evaluation has become an urgent need in the current prospecting work. In view of this, based on the existing spatial database of geological and mineral resources in the central Kunlun of Xinjiang, combined with the geological characteristics, genesis and metallogenic regularity of the area, this paper carried out a series of studies on gold polymetallic minerals with the help of geographic information system and data science programming software platform. The researchers integrated geological and regional geochemical data, and constructed a random forest metallogenic discriminant model based on two different sampling methods (integrated random undersampling and selection of training samples) to predict the mineralization of gold polymetallic minerals in the central Kunlun area of Xinjiang and delineate the metallogenic target area. The quantitative prediction of gold polymetallic mineral resources in the central Kunlun area of Xinjiang by two random forest models is compared and discussed: the known ore spots, fault structures and geochemical information are extracted, and the known gold polymetallic ore spots and geochemical data are used to form a training set and a prediction set to construct a machine learning random forest model. The results of prediction evaluation and metallogenic prospect division show that for different sampling methods, the performance evaluation parameters of the training process show that the prediction accuracy of the selected training samples is higher, and the selected training samples are more reliable because they can fully learn the complex information of the original data. In the metallogenic prospect prediction and metallogenic potential division, the random forest model of selecting training samples has more reference value and further exploration research significance in the production problem considering the actual exploration cost because of its small area of high potential prediction area and high proportion of ore bearing per unit area. At the same time, this study innovatively improves the prediction accuracy, reduces the exploration risk, and expands the prospecting idea of machine learning algorithm in mathematical geology in the central Kunlun area of Xinjiang. The delineated metallogenic potential area has positive guiding significance for the actual gold polymetallic prospecting work in this area.

In this work, a hybrid component Fault Detection and Diagnosis (FDD) approach for industrial sensor systems is established and analyzed, to provide a hybrid schema that combines the advantages and eliminates the drawbacks of both model-based and data-driven methods of diagnosis. Moreover, it shines the light on a new utilization of Random Forest (RF) together with model-based diagnosis, beyond its ordinary data-driven application. RF is trained and hyperparameter tuned using three-fold cross validation over a random grid of parameters using random search, to finally generate diagnostic graphs as the dynamic, data-driven part of this system. This is followed by translating those graphs into model-based rules in the form of if-else statements, SQL queries or semantic queries such as SPARQL, in order to feed the dynamic rules into a structured model essential for further diagnosis. The RF hyperparameters are consistently updated online using the newly generated sensor data to maintain the dynamicity and accuracy of the generated graphs and rules thereafter. The architecture of the proposed method is demonstrated in a comprehensive manner, and the dynamic rules extraction phase is applied using a case study on condition monitoring of a hydraulic test rig using time-series multivariate sensor readings.

In this work, A hybrid component Fault Detection and Diagnosis (FDD) approach for industrial sensor systems is established and analyzed, to provide a hybrid schema that combines the advantages and eliminates the drawbacks of both model-based and data-driven methods of diagnosis. Moreover, spotting the light on a new utilization of Random Forest (RF) together with model-based diagnosis, beyond its ordinary data-driven application. RF is trained and hyperparameter tuned using 3-fold cross-validation over a random grid of parameters using random search, to finally generate diagnostic graphs as the dynamic, data-driven part of this system. Followed by translating those graphs into model-based rules in the form of if-else statements, SQL queries or semantic queries such as SPARQL, in order to feed the dynamic rules into a structured model essential for further diagnosis. The RF hyperparameters are consistently updated online using the newly generated sensor data, in order to maintain the dynamicity and accuracy of the generated graphs and rules thereafter. The architecture of the proposed method is demonstrated in a comprehensive manner, as well as the dynamic rules extraction phase is applied using a case study on condition monitoring of a hydraulic test rig using time series multivariate sensor readings.

A land cover map of two arctic catchments, nearby the Abisko Scientific Research Station, was obtained from a classification of a Sentinel-2 satellite image and a ground survey performed in July 2022. The two contiguous catchments, Miellajokka and Stordalen, are covered by various ecotypes, from boreal forest to alpine tundra and peatland. The random forests algorithm correctly identified 88% of polygon pixels reserved for testing. The developed workflow relied solely on open source software and acquired ground observations. Space organization was directed by the altitude as demonstrated by the intersection of the land cover with the topography. Comparison between this new land cover map and previous ones based on data acquired between 2008 and 2011 shows some trends of vegetation cover evolution in response to climate change in the considered area.

The out-of-time-ordered correlation (OTOC) function is an important new probe in quantum field theory which is treated as a significant measure of random quantum correlations. In this paper, with the slogan "Cosmology meets Condensed Matter Physics" we demonstrate a formalism using which for the first time we compute the Cosmological OTOC during the stochastic particle production during inflation and reheating following canonical quantization technique. In this computation, two dynamical time scales are involved, out of them at one time scale the cosmological perturbation variable and for the other the canonically conjugate momentum is defined, which is the strict requirement to define time scale separated quantum operators for OTOC and perfectly consistent with the general definition of OTOC. Most importantly, using the present formalism not only one can study the quantum correlation during stochastic inflation and reheating, but also study quantum correlation for any random events in Cosmology. Next, using the late time exponential decay of cosmological OTOC with respect to the dynamical time scale of our universe which is associated with the canonically conjugate momentum operator in this formalism we study the phenomena of quantum chaos by computing the expression for {\it Lyapunov spectrum}. Further, using the well known Maldacena Shenker Stanford (MSS) bound, on Lyapunov exponent, λ≤2π/β, we propose a lower bound on the equilibrium temperature, T=1/β, at the very late time scale of the universe. On the other hand, with respect to the other time scale with which the perturbation variable is associated, we find decreasing but not exponentially decaying behaviour, which quantifies the random correlation at out-of-equilibrium. Finally, we have studied the classical limit of the OTOC to check the consistency with the large time limiting behaviour.

Crop-type mapping is an important intermediate step for cost-effective crop management at the field level, as an overview of all fields with a particular crop type can be used for monitoring or yield forecasting, for instance. Our study used a data set with 2400 fields and corresponding satellite observations from the federal state of Bavaria, Germany. The study classified corn, winter wheat, winter barley, sugar beet, potato, and winter rapeseed as the main crops grown in Upper Bavaria. We additionally experimented with a rejection class "Other", which summarised further crop types. Corresponding Sentinel-2 data included the normalised difference vegetation index (NDVI) and raw bands from 2016 to 2018 for each selected field. The influence of raw bands compared to NDVI was analysed and the classification algorithms, i.e. support vector machine (SVM) and random forest (RF), were compared. The study showed that the use of an index should be critically questioned and that raw bands provided a wider spectral bandwidth, which significantly improved the mapping of crop types. The results underline the use of RF with raw bands and achieved overall accuracies (OA) of up to 92%. We also predicted crop types in an unknown year with significantly different weather conditions and several months before the end of the growing season. Thus, the influence of climate anomalies and the accuracy depending on the time of prediction were assessed. The crop types of a test site and year without labels could be determined with an OA of up to 86%. The results demonstrate the usefulness of the proof-of-concept and its readiness for use in real applications.

Reliable estimates of poplar plantations area are not available at the French national scale due to the unsuitability and low update rate of existing forest databases for this short-rotation species. While supervised classification methods have been shown to be highly accurate in mapping forest cover from remotely sensed images, their performance depends to a great extent on the labelled samples used to build the models. In addition to their high acquisition cost, such samples are often scarce and not fully representative of the variability in class distributions. Consequently, when classification models are applied to large areas with high intra-class variance, they generally yield poor accuracies. In this paper, we propose the use of active learning (AL) to efficiently adapt a classifier trained on a source image to spatially distinct target images with minimal labelling effort and without sacrificing classification performance. The adaptation consists in actively adding to the initial local model, new relevant training samples from other areas, in a cascade that iteratively improves the generalisation capabilities of the classifier, leading to a global model tailored to different areas. This active selection relies on uncertainty sampling to directly focus on the most informative pixels for which the algorithm is the least certain of their class labels. Experiments conducted on Sentinel-2 time series showed that when the same number of training samples was used, active learning outperformed passive learning (random sampling) by up to 5% of overall accuracy and up to 12% of class F-score. In addition, and depending on the class considered, the random sampling required up to 50% more samples to achieve the same performance of an active learning-based model. Moreover, the results demonstrate the suitability of the derived global model to accurately map poplar plantations among other tree species with overall accuracy values up to 14% higher than those obtained with local models. The proposed approach paves the way for national-scale mapping in an operational context.

The finding of important explanatory variables for the location parameter and the scale parameter of the generalized extreme value (GEV) distribution, when the latter is used for the modelling of annual streamflow maxima, is known to have reduced the uncertainties in inferences, as estimated through regional flood frequency analysis frameworks. However, important explanatory variables have not been found for the GEV shape parameter, despite its critical significance, which stems from the fact that it determines the behaviour of the upper tail of the distribution. Here we examine the nature of the shape parameter by revealing its relationships with basin attributes. We use a dataset that comprises information about daily streamflow and forcing, climatic indices, topographic, land cover, soil and geological characteristics of 591 basins with minimal human influence in the contiguous United States. We propose a framework that uses random forests and linear models to find (a) important predictor variables of the shape parameter and (b) an interpretable model with high predictive performance. The process of study comprises of assessing the predictive performance of the models, selecting a parsimonious predicting model and interpreting the results in an ad-hoc manner. The findings suggest that the shape parameter mostly depends on climatic indices, while the selected prediction model results in more than 20% higher accuracy in terms of RMSE compared to a naïve approach. The implications are important, since incorporating the regression model into regional flood frequency analysis frameworks can considerably reduce the predictive uncertainties.

We study epidemic spreading in complex networks by a multiple random walker approach. Each walker performs an independent simple Markovian random walk on a complex undirected (ergodic) random graph where we focus on Barabási-Albert (BA), Erdös-Rényi (ER) and Watts-Strogatz (WS) types. Both, walkers and nodes can be either susceptible (S) or infected and infectious (I) representing their states of health. Susceptible nodes may be infected by visits of infected walkers, and susceptible walkers may be infected by visiting infected nodes. No direct transmission of the disease among walkers (or among nodes) is possible. This model mimics a large class of diseases such as Dengue and Malaria with transmission of the disease via vectors (mosquitos). Infected walkers may die during the time span of their infection introducing an additional compartment D of dead walkers. Infected nodes never die and always recover from their infection after a random finite time. This assumption is based on the observation that infectious vectors (mosquitos) are not ill and do not die from the infection. The infectious time spans of nodes and walkers, and the survival times of infected walkers, are represented by independent random variables. We derive stochastic evolution equations for the mean-field compartmental populations with mortality of walkers and delayed transitions among the compartments. From linear stability analysis, we derive the basic reproduction numbers R M , R 0 with and without mortality, respectively, and prove that R M < R 0 . For R M , R 0 > 1 the healthy state is unstable whereas for zero mortality a stable endemic equilibrium exists (independent of the initial conditions) which we obtained explicitly. We observe that the solutions of the random walk simulations in the considered networks agree well with the mean-field solutions for strongly connected graph topologies, whereas less well for weakly connected structures and for diseases with high mortality. Our model has applications beyond epidemic dynamics, for instance in the kinetics of chemical reactions, the propagation of contaminants, wood fires, among many others.

Global change is affecting vegetation cover and processes through multiple pathways. Long time series of surface land surface properties derived from satellite remote sensing offer a unique abilities to observe these changes, particularly in areas with complex topography and limited research infrastructure. Here, we focus on Nepal, a biodiversity hotspot where vegetation productivity is limited by moisture availability (dominated by a summer monsoon) at lower elevations and by temperature at high elevations. We analyze normalized difference vegetation index (NDVI) from 1981 to 2015 semimonthly, at 8 km spatial resolution. We use a random forest (RF) of regression trees to generate a statistical model of NDVI as a function of elevation, land use, CO2 level, temperature, and precipitation. We find that NDVI has increased over the studied period, particularly at low and middle elevations and during fall (post-monsoon). We infer from the fitted RF model that the NDVI linear trend is primarily due to CO2 level (or another environmental parameter that is changing quasi-linearly), and not primarily to temperature or precipitation trends. On the other hand, interannual fluctuation in NDVI is more correlated with temperature and precipitation. RF accurately fits the available data and shows promise for estimating trends and testing hypotheses about their causes.

The main aim of this study is to predict whether the type of breast cancer is “benign” or “malignant” by classical generalized linear model (GLM) approach and an extended family of GLM called generalized linear mixed model (GLMM) approach for binomially distributed response variable with binary link functions. In this study, an advanced statistical modeling approach based on the GLMM to the traditional statistical modeling approach based on the GLM for binomially distributed response variable with various binary link functions is proposed to investigate the relationships between the “malignant or benign diagnosis of the BC in patients” and “nine attributes” of 699 BC diagnosed patients. This study also focuses on the statistical significance of the accurate classification of the BC diagnosed patients in cancer studies in medicine in “benign” or “malignant” type based on the WBC dataset. In this study, the superiority of the GLMM approach over the GLM approach for the binary response variable especially belonging to the WBC dataset is emphasized in the field of cancer diagnosis in medicine. Also the importance and the power of the IC and performance metrics as the goodness-of-fit test statistics are strongly emphasized for accurate statistical inferences from the “best” fitted model. In this study, from the main findings, the best fitted model among the GLM and GLMM approaches for the binary response variable is determined as the GLMM under “logit” link function with “id” random effect with the most statistically significant odds of the occurance of the BC being “malignant” as 7.9104, 5.6888, 5.6643, 4.9842, 4.1212, 2.0679, 1.8755, and 1.3970 times more than being “benign” for every one-unit increase in the quantities of “clump thickness”, “bland chromatin”, “mitoses”, “bare nuclei”, “cell shape”, “marginal adhesion”, “epithelial cell size”, and “cell size”, respectively.

Landslides impact on human activities and socio-economic development especially in mountainous areas. This study focuses on the comparison of the prediction capability of advanced machine learning techniques for rainfall-induced shallow landslide susceptibility of Deokjeokri catchment and Karisanri catchment in South Korea. The influencing factors for landslides i.e. topographic, hydrologic, soil, forest, and geologic factors are prepared from various sources based on availability and a multicollinearity test is also performed to select relevant causative factors. The landslide inventory maps of both catchments are obtained from historical information, aerial photographs and performing field survey. In this study, Deokjeokri catchment is considered as a training area and Karisanri catchment as a testing area. The landslide inventories content 748 landslide points in training and 219 points in testing areas. Three landslide susceptibility maps using machine learning models i.e. Random Forest (RF), Extreme Gradient Boosting (XGBoost) and Deep Neural Network (DNN) are prepared and compared. The outcomes of the analyses are validated using the landslide inventory data. A receiver operating characteristic curve (ROC) method is used to verify the results of the models. The results of this study show that the training accuracy of RF is 0.757 and the testing accuracy is 0.74. Similarly, training accuracy of XGBoost is 0.756 and testing accuracy is 0.703. The prediction of DNN revealed acceptable agreement between susceptibility map and the existing landslides with training and testing accuracy of 0.855 and 0.802, respectively. The results showed that, the DNN model achieved lower prediction error and higher accuracy results than other models for shallow landslide modeling in the study area

Motivated by empirical observations, we propose a possible extension of Gibrat's law. By applying it into the random growth theory of income distribution (Gabaix, 2009), we find that the income distribution is described by a generalized Pareto-type distribution (GPD) with three parameters. We observe that there is a parameter /elta in the GPD that plays a key role in determining the shape of income distribution. By using the Kolmogorov-Smirnov test, we empirically show that, for typical market-economy countries, /elta is close to 0 significantly, such that the income distribution is characterized by a two-class pattern in which the bottom 90% of the population is approximated by an exponential distribution and the richest 1%~3% is approximated by an asymptotic power law. However, we empirically find that, for China both in planned economy period and in early stages of market reformation (from 1978 to 1990), /elta is significantly deviated from 0, such that the bottom of the population no longer conforms to an exponential distribution.

Displacement mapping is a computer graphics technique that enables the design of components with regularly or randomly textured surfaces that can be quickly materialized on a three-dimensional (3D) printer when needed. This approach is in principle more flexible, faster and more economical compared to conventional texturing methods, but the accuracy of the texture depends heavily on the parameters used. The purpose of this study is to demonstrate how to produce a surface-textured part using polygonal (mesh) modeling software and a photopolymerizable resin, and to develop a universal methodology to predict the dimensional accuracy of the model file log combined with a resin 3D printer. The printed components were characterized on a scanning confocal microscope. In the setup used in this study, the mesh size had to be reduced to 10% of the smallest feature size and the textured layer had to be heavily (x4) overexposed to achieve the desired accuracy. As a practical application, two functional stamps with a regular (honeycomb) and a random texture, respectively, were successfully manufactured. The insights gained will be of great benefit in quickly and cost-effectively producing components with innovative patterns and textures for a variety of hobby, industrial and biomedical applications.

In this paper, we demonstrate that fixed-weight layers, generated from random distribution or logistic functions, can effectively extract significant features from input data, resulting in high accuracy on a variety of tasks, including Fisher’s iris, Wisconsin Breast Cancer, and MNIST datasets. We have observed that logistic functions yield high accuracy with less dispersion in results. We have also assessed the precision of our approach under conditions of minimizing spikes number generated in the network, it is a practically useful for reducing energy consumption in spiking neural networks. Our findings reveal that the proposed method demonstrates a highest accuracy on Fisher’s iris and MNIST datasets with logistic regression. Furthermore, they surpass the accuracy of the conventional (non-spiking) approach using logistic regression in the case of Wisconsin Breast Cancer. We have also investigated the impact of non-stochastic spike generation on accuracy.

Garlic, as an important economic crop in China, still has room for improvement in terms of identification using remote sensing technology, Among them, high-precision classification of garlic has become an important subject. The Erhai Lake is an important freshwater lake in China. Under the influence of technology and policies, significant changes have occurred in the cultivation of garlic crops. this study constructed multidimensional features for crop classification suitable for Google Earth Engine, and Propose a method for identifying garlic crops using sample and feature datasets under limited conditions. The results indicate that: 1) In the land-use classification of the Erhai Lake Basin, the importance ranking of characteristic bands, from high to low, is as follows: spectral features, vegetation features, texture features, and terrain features. 2) The Random Forest method based on feature selection demonstrates high classification accuracy in land-use classification within the Erhai Lake Basin in Yunnan Province. The overall classification accuracy reaches 95.79%, with a Kappa coefficient of 0.9481. 3) The expansion direction of garlic cultivation in the Erhai Lake Basin initially strengthened and then weakened from 1999 to 2023. The vertical development of garlic cultivation reached saturation, showing a slow trend towards horizontal expansion between 2005 and 2018. The planting distribution in various townships in the Erhai Lake Basin gradually shifted from a relatively uniform distribution to an upstream development in the basin. This study utilizes the Google Earth Engine (GEE) cloud computing platform and machine learning algorithms to compensate for the lack of statistical data on garlic cultivation in the Erhai Lake Basin. Simultaneously, it accurately, rapidly, and efficiently extracts planting information, demonstrating significant potential for practical applications.

Although the Slicing Method (SM) is effective for calculating the volume of point cloud objects (PCOs), it is restricted in terms of applicability and practicability because of a certain contingency and directional defects. The Co-Opposite-Direction Slicing Method (CODSM) proposed in this paper is an improved method for calculating PCO volume by increasing parallel (co-opposite-direction) observation and considering the two-way mean as the result. This method takes full advantage of the mutual offsetting of random errors and the compensation of systematic directional errors, which can effectively overcome (or mitigate) the effect of random errors and reduce the effect of systematic errors in SM. In this paper, two typical objects, a cone model and a stone lion base, are the examples for calculating PCO volume using CODSM. The results show that CODSM has all the inherent advantages of SM and effectively weakens the volatility of random errors and the directionality of systematic errors from SM. Therefore, CODSM is a robust configuration upgrade of SM.