The brain, rather than being homogeneous, displays an almost infinite topological genus, because is punctured with a very high number of topological vortexes, i.e., .e., nesting, non-concentric brain signal cycles resulting from inhibitory neurons devoid of excitatory oscillations. Starting from this observation, we show that the occurrence of topological vortexes is constrained by random walks taking place during self-organized brain activity. We introduce a visual model, based on the Pascal’s triangle and linear and nonlinear arithmetic octahedrons, that describes three-dimensional random walks of excitatory spike activity propagating throughout the brain tissue. In case of nonlinear 3D paths, the trajectories in brains crossed by spiking oscillations can be depicted as the operation of filling the numbers of the octahedrons in the form of “islands of numbers”: this leads to excitatory neuronal assemblies, spaced out by empty area of inhibitory neuronal assemblies. These procedures allow us to describe the topology of a brain of infinite genus, to assess inhibitory neurons in terms of Betti numbers, and to highlight how non-linear random walks cause spike diffusion in neural tissues when tiny groups of excitatory neurons start to fire.

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.

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.

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.

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 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.

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.

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.

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.

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.

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.

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.

The nonlocality (superdiffusion) of turbulence is expressed in the empiric Richardson t3 scaling law for the mean square of the mutual separation of a pair of particles in a fluid or gaseous medium. The development of the theory of nonlocality of various processes in physics and other sciences based on the concept of Lévy flights resulted in the idea of Shlesinger and colleagues about the possibility of describing the nonlocality of turbulence using a linear integro-differential equation with a slowly falling kernel. The close approach developed by us made it possible to establish the closeness of the superdiffusion parameter of plasma density fluctuations moving across a strong magnetic field in a tokamak to the Richardson law. In this paper, we show the possibility of a universal description of the characteristics of nonlocality of transfer in a stochastic medium (including turbulence of gases and fluids) using the Biberman-Holstein approach to the transfer of excitation of a medium by photons, generalized to take into account the finiteness of the velocity of excitation carriers. This approach enables us to propose a scaling that generalizes Richardson's t3 scaling law to the combined regime of Lévy flights and Lévy walks.

Finding a good MIMO system model also major issue in Wireless Communication system. It is facing with so many problem, one of the major problem is finding good system model in terms of capacity and transmitting antenna system. In this paper, we analyze the channel capacity of various MIMO system model with some constant SNR level and outage probability. We establish a novel idea for MIMO system models as consider as 2^N- MIMO system model and find-out change in channel capacity when different transmitting antennas with constant SNR and outage probability. The channel capacity ratio CC_R is presented here on the basis of 2^N- MIMO channel capacity model. Number of transmitted antenna presented in MIMO system is increases is well-known however paper shows change in capacity in simple form.

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.

L\'evy walks represent important modeling tools for variety of real life processes. Their natural scaling limits are known to be described by the so-called material fractional derivatives. So far these scaling limits were derived for spatially homogeneous walks, where Fourier and Laplace transforms represent natural tools of analysis. Here we derive the corresponding limiting equations in the case of position depending times and velocities of walks, where Fourier transforms cannot be effectively applied. In fact, we derive three different limits (specified by the way the process is stopped at an attempt to cross the boundary), leading to three different multi-dimensional versions of Caputo-Dzherbashian derivatives, which correspond to different boundary conditions for the generators of the related Feller semigroups and processes. Some other extensions and generalisations are analysed.

We consider fractional integral operators $(I-T)^d, d \in (-1,1)$ acting on functions $g: \mathbb{Z}^{\nu} \to \mathbb{R}, \nu \ge 1 $, where $T $ is the transition operator of a random walk on $\mathbb{Z}^{\nu}$. We obtain sufficient and necessary conditions for the existence, invertibility and square summability of kernels $\tau (\mathbf{s}; d), \mathmb{s} \in \mathbb{Z}^{\nu}$ of $(I-T)^d $. Asymptotic behavior of $\tau (\mathbf{s}; d)$ as $|\mathbf{s}| \to \infty$ is identified following local limit theorem for random walk. A class of fractionally integrated random fields $X$ on $\mathbb{Z}^{\nu}$ solving the difference equation $(I-T)^d X = \varepsilon$ with white noise on the right-hand side is discussed, and their scaling limits. Several examples including fractional lattice Laplace and heat operators are studied in detail.

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.

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.

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 this paper, we introduce a novel controlled quantum communication protocol utilizing a quantum random walk involving one sender, one receiver, and multiple controllers. Inspired by classical random walk theory, quantum random walk serves as the foundation of our proposed protocol. With this protocol, we demonstrate the ability to transfer any n- dimensional quantum state to any party facilitated by any m number of controllers. Furthermore, any of the (m+1) individuals has the freedom to accept the role of the receiver. Rigorous testing of the protocol’s performance is conducted through quantum state tomography. We have run different variations of the circuits in IBMQ QASM simulator. Additionally, we explore the effectiveness of a weak measurement-based protocol designed to mitigate amplitude-damping noise’s detrimental effects on quantum states. By analyzing fidelity versus amplitude damping noise-strength plots for scenarios with and without the weak measurement protocol, we provide valuable insights into its protective capabilities across various levels of noise. These find- ings illuminate the protocol’s potential applications in quantum information processing

We propose a new ensemble classification algorithm, named Super Random Subspace Ensemble (Super RaSE), to tackle the sparse classification problem. The proposed algorithm is motivated by the Random Subspace Ensemble algorithm (RaSE). The RaSE method was shown to be a flexible framework that can be coupled with any existing base classification. However, the success of RaSE largely depends on the proper choice of the base classifier, which is unfortunately unknown to us. In this work, we show that Super RaSE avoids the need to choose a base classifier by randomly sampling a collection of classifiers together with the subspace. As a result, Super RaSE is more flexible and robust than RaSE. In addition to the vanilla Super RaSE, we also develop the iterative Super RaSE, which adaptively changes the base classifier distribution as well as the subspace distribution. We show the Super RaSE algorithm and its iterative version perform competitively for a wide range of simulated datasets and two real data examples. The new Super RaSE algorithm and its iterative version are implemented in a new version of the R package RaSEn.

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.

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, 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).

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.

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.

Automated machine classifications of galaxies are necessary because the size of upcoming surveys will overwhelm human volunteers. We improve upon existing machine classification methods by adding the output of SpArcFiRe to the inputs of a machine learning model. We use the human classifications from Galaxy Zoo 1 (GZ1) to train a random forest of decision trees to reproduce the human vote distributions of the Spiral class. We prefer the random forest model over other black box models like neural networks because it allows us to trace post hoc the precise reasoning behind the classification of each galaxy. We find that, across a sample of 470,000 Sloan galaxies that are large enough that details could be seen if they were there, the combination of SpArcFiRe outputs with existing SDSS features provides a better machine classification than either one alone on comparison to Galaxy Zoo 1. We suggest that adding SpArcFiRe outputs as features to any machine learning algorithm will likely improve its performance.

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.

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.

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.

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.

Categorical variables are common in spatial data analysis. Traditional analytical methods for deriving probabilities of class occurrence, such as kriging-family algorithms, have been hindered by the discrete characteristics of categorical fields. This study introduces the theoretical backgrounds of linear Bayesian updating (LBU) approach for spatial classification through expert system. Transition probabilities are interpreted as expert opinions for updating the prior marginal probabilities of categorical response variables. The main objective of this paper is to present the solid theoretical foundations of LBU and provide a categorical random field prediction method which yields relatively higher classification accuracy compared with conventional Markov chain random field (MCRF) approach. A real-world case study has also been carried out to demonstrate the superiority of our method. Since the LBU idea is originated from aggregating expert opinions and not restricted to conditional independent assumption (CIA), it may prove to be reasonably adequate for analyzing complex geospatial data sets, like remote sensing images or area-class maps.

In this study, we investigate the behavior of randomly moving particles with a defined average energy, focusing on their biased motion around a specific point. These particles' velocity magnitudes follow a Maxwell distribution with a specific scale parameter. Our analysis derives the stochastic rotation rules for these particles and introduces the Ito equation conditions for biased stochastic rotation at a given curl value. We also consider the special relativistic-like effects in this context. The findings are validated through a representative example.

We address the process of discounting in random environments which allows to value the far future in economic terms. We review several approaches to the problem regarding different well-established stochastic market dynamics in the continuous-time context and include the Feynman-Kac approach. We also review the relation between bond pricing theory and discount and introduce the market price of risk and the risk neutral measures from an intuitive point of view devoid of excessive formalism. We provide the discount for each economic model and discuss their key results. We finally present a summary of our previous empirical studies on several countries of the long-run discount problem.

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.

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.

Groundwater represents a pivotal asset in conserving natural water reservoirs for potable consumption, irrigation, and diverse industrial uses. Nevertheless, human activities intertwined with industry and agriculture contribute significantly to groundwater contamination, highlighting the critical necessity to appraise water quality for safe drinking and effective irrigation. This research primarily focused on employing the Water Quality Index (WQI) to gauge water's appropriateness for these purposes. However, the generation of an accurate WQI can prove time-intensive owing to potential errors in sub-index calculations. In response to this challenge, an artificial intelligence (AI) forecasting model was devised, aiming to streamline the process while mitigating errors. The study collected 422 data samples from Mirpurkash, a city nestled in the province of Sindh, for a comprehensive exploration of the region's WQI attributes. Furthermore, the study probed into unraveling the interdependencies amidst variables in the physiochemical analysis of water. Diverse machine learning classifiers were employed for WQI prediction, with findings revealing that random forest and gradient boosting eclipsed other algorithms, achieving an accuracy rate of 99%. In close pursuit were SVM and XGBoost, registering accuracy scores of approximately 95% and 93%, respectively, while KNN and Decision Trees garnered accuracy rates of 88% and 87%, respectively. In addition to WQI prediction, the study conducted an uncertainty analysis of the models using the R-factor, providing insights into the reliability and consistency of predictions. This dual approach, combining accurate WQI prediction with uncertainty assessment, contributes to a more comprehensive understanding of water quality in Mirpurkash and enhances the reliability of decision-making processes related to groundwater utilization

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.

This work seeks to approach the comparative analysis of the distribution of POFs (polymeric optical fibers) arranged in a random and sorted manner in the manufacture of translucent concretes. The following characteristics were analyzed: compressive strength, flexural tensile strength, capillary water absorption and light transmittance. Portland cement, water, fine aggregate (sand), silica fume, polycarboxylate ether-based superplasticizer and polymeric optical fiber were used in the production of the composites. Except the fiber content, the mixture of all other inputs was kept as a fixed parameter. Groups with the following levels of POFs were produced: 0%, 2%, 3.5% and 5%. The POF content is the sum of the areas of the fiber sections in the composite with the total area of the translucent surface. The results showed that for the analysis of mechanical behavior (flexural tensile and compressive strength) and durability (capillary water absorption), composites with random and sorted fibers within the 2% POF presented to belong to statistically distinct groups. For the other fiber contents, there was no pattern of behavior, that is, it cannot be said that there is a difference within 3.5% or 5% POF between sorted and random fibers in relation to the mechanical and durability characteristics analyzed. As for the light transmittance, it was attributed that the statistical difference between the fiber arrangements only within the 5% POF content can be a consequence of their accumulation in certain points of the material, thus influencing this characteristic measured by a light meter.

Land use and land cover (LULC) datasets for Jinan in 1992, 1998, 2002, 2006, 2011, 2017, and 2022 were developed from Landsat images using the Random Forest (RF) classification approach. The relationships between social-economic, political factors and time-series LULC data were exam-ined for the periods between 1992 and 2022. The results showed the effectiveness of using the RF classification method for LULC classification with time series of Landsat images. Combined with driving forces analysis, our research can effectively explain the detailed LULC change tra-jectories corresponding to different stages and give new insights into Jinan LULC change pat-terns. The results show a significant increase in impervious surface which opposite change to bare land which experienced a huge decline declined by 95%, due to urbanization and rapid in-crease of population. The driving forces behind these changes are related to population growth, economic development, and climate change. Moreover, the present research employed Principal Components Analysis (PCA) methodology in order to understand the relative significance of disparate driving factors. The analysis results prove that the economy (population, GDP) and climate change were the primary factors that have an obvious impact on land use/land cover changes and that the driving factors for impervious surface, bare land, woodland, farmland, and water were distinct. Government policies also have a substantial impact on LULC change as well, such as the Construction of Harmonious Jinan (COHJ). The results were helpful for better understanding the mechanisms of LULC change and can provide useful knowledge for effective land resource management and planning.

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.

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

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 evolutionary origin of the genome remains elusive. Here, I hypothesize that its first iteration, the protogenome, was a multi-ribozyme RNA. It evolved, likely within liposomes (the protocells) forming in dry-wet cycling environments, through the random fusion of ribozymes by a ligase and was amplified by a polymerase. The protogenome thereby linked, in one molecule, the information required to seed the protometabolism (a combination of RNA-based autocatalytic sets) in newly forming protocells. If this combination of autocatalytic sets was evolutionarily advantageous, the protogenome would have amplified in a population of multiplying protocells. It likely was a quasispecies with redundant information, e.g., multiple copies of one ribozyme. As such, new functionalities could evolve, including a genetic code. Once one or more components of the protometabolism were templated by the protogenome (e.g., when a ribozyme was replaced by a protein enzyme), and/or addiction modules evolved, the protometabolism became dependent on the protogenome. Along with increasing fidelity of the RNA polymerase, the protogenome could grow, e.g., by incorporating additional ribozyme domains. Finally, the protogenome could have evolved into a DNA genome with increased stability and storage capacity. I will provide suggestions for experiments to test some aspects of this hypothesis.

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.

The use of risk measures such as the Value at Risk (VaR) or Tail Conditional Expectation (TCE) is required by the Basel Committee on Banking Supervision in determining a bank’s risk profile. However, both measures can be shown to have shortcomings in the information that they provide to regulators and investors. In this paper we present an introduction to risk measure calculations before demonstrating the weaknesses of these measures. Through the exploration of specific cases we show how familiar yet differing risk profiles have identical values for combinations of these measures. From this evidence we recommend that a sequence of several risk measures should be used to give a more accurate representation of the risk contained on banking balance sheet.

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.

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.

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.

In recent years, different deep learning frameworks were introduced for hyperspectral image (HSI) classification. However, the proposed network models have a higher model complexity and do not provide high classification accuracy if few-shot learning is used. This paper pre-sents an HSI classification method that combines random patches network (RPNet) and re-cursive filtering (RF) to obtain informative deep features. The proposed method first convolves image bands with random patches to extract multi-level deep RPNet features. Thereafter, the RPNet feature set is subjected to dimension reduction through principal component analysis (PCA) and the extracted components are filtered using the RF procedure. Finally, HSI spectral features and the obtained RPNet-RF features are combined to classify the HSI using a support vector machine (SVM) classifier. In order to test the performance of the proposed RPNet-RF method, some experiments were performed on three widely known datasets using a few training samples for each class and classification results were compared with those obtained by other advanced HSI classification methods adopted for small training samples. The comparison showed that the RPNet-RF classification is characterized by higher values of such evaluation metrics as overall accuracy and Kappa coefficient (https://github.com/UchaevD/RPNet-RF).

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.

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.

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.

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.

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.

Here we are concerning with two problems of a coupled system of random and stochastic nonlinear differential equations with two coupled systems of nonlinear nonlocal random and stochastic integral conditions. The existence of solutions will be studied. The sufficient condition for the uniqueness of the solution will be given. The continuous dependence of the unique solution on the nonlocal conditions will be proved.

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

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.

Vibration signal analysis is regarded as a fundamental approach in diagnosing faults in rolling bearings, and recent advancements have shown notable progress in this domain. However, the presence of substantial background noise often results in the masking of these fault signals, posing a significant challenge for researchers. In response, an Adaptive Denoising Autoencoder (ADAE) approach is proposed in this paper. The data representations are learned by the encoder through convolutional layers, while the data reconstruction is performed by the decoder using deconvolutional layers. Both the encoder and decoder incorporate adaptive shrinkage units to simulate denoising functions, effectively removing interfering information while preserving sensitive fault features. Additionally, dropout regularization is applied to sparsify the network and prevent overfitting, thereby enhancing the overall expressive power of the model. To further enhance ADAE's noise resistance, shortcut connections are added. Evaluation using publicly available datasets under scenarios with known and unknown noise demonstrates that ADAE effectively enhances the signal-to-noise ratio in strongly noisy backgrounds, facilitating accurate diagnosis of faults in rolling bearings.

The challenge of missing data in scientific research prompts researchers to decide between imputing incomplete data or discarding observations, where discarding can lead to information loss. Various methods exist, from simple deletion to sophisticated approaches like Multiple Imputation (MI). However, these methods often fall short with high-dimensional datasets. Multiple Imputation by Chained Equations (MICE) and Random Forest (RF) proximity imputation offer promising alternatives. Therefore, in this paper, we propose integrating MICE with Bayesian random forest (BRF) to enhance imputation accuracy and predictive power, particularly in high-dimensional analyses. Our approach combines MICE’s efficiency with BRF’s robustness, offering a comprehensive solution to missing data challenges. By way of example, we provide empirical evaluations to validate its effectiveness using synthetic data of various missing data scenarios. The results from the simulations showed that the combination of BRF and MICE offered a promising strategy for high-dimensional analysis in the presence of missing data.

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.

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 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.

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 presents a non-random weight initialization method in convolutional layers of neural networks examined with the Fast Gradient Sign Method (FSGM) attack. This paper's focus is convolutional layers, and are the layers that have been responsible for better than human performance in image categorization. The proposed method induces earlier learning through the use of striped forms, and as such has less unlearning of the existing random number speckled methods, consistent with the intuitions of Hubel and Wiesel. The proposed method provides a higher performing accuracy in a single epoch, with improvements of between 3-5% in a well known benchmark model, of which the first epoch is the most relevant as it is the epoch after initialization. The proposed method is also repeatable and deterministic, as a desirable quality for safety critical applications in image classification within sensors. That method is robust to Glorot/Xavier and He initialization limits as well. The proposed non-random initialization was examined under adversarial perturbation attack through the FGSM approach with transferred learning, as a technique to measure the affect in transferred learning with controlled distortions, and finds that the proposed method is less compromised to the original validation dataset, with higher distorted datasets.

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.

Heart disease is one of the most common diseases in middle-aged citizens. Among the vast number of heart diseases, coronary artery disease (CAD) is considered a common cardiovascular disease with a high death rate. The most popular tool for diagnosing CAD is the use of medical imaging, e.g., angiography. However, angiography is known for being costly and also associated with a number of side effects. Hence, the purpose of this study is to increase the accuracy of coronary heart disease diagnosis by selecting significant predictive features in order of their ranking. In this study, we propose an integrated method using machine learning. The machine learning methods of random trees (RTs), the decision tree of C5.0, support vector machine (SVM), the decision tree of Chi-squared automatic interaction detection (CHAID) are used in this study. The proposed method shows promising results and the study confirms that the RTs model outperforms other models.

VHF Data Exchange System (VDES) is considered as an important component of the future maritime communication system by the International Maritime Organization (IMO). On the basis of existing Automatic Identification System (AIS), VDES adds the other two higher capacity subsystems: Application Specific Message (ASM) and VHF Data Exchange (VDE). The Random Access Channel (RACH) of VDE was first introduced in the International Telecommunication Union (ITU) Recommendation M.2092-0. As the slot planning of RACH in VDE is interval, which is significantly different from the continuous slot map for access algorithms in AIS, the existing slot access algorithms cannot meet the requirements of VDE. The simulation results show that the VDE slot map can reduce the normalized throughput of the existing algorithm by 39%. A novel random access algorithm called Adaptive Traffic Load Contention Resolution Diversity Slotted ALOHA (ATL-CRDSA) is proposed in this paper. The algorithm combines the load control strategy and contention resolution scheme to overcome the challenges of the new RACH of VDE. Simulation results show that ATL-CRDSA has remarkable improvement on RACH, and makes RACH very efficient and provides low latency of the packets. The insights gained from this study may be of assistance to the Media Access Control (MAC) layer design for upcoming versions of VDES standard.

Deep learning methods have been widely used in PolSAR image classification. To learn the polarimetric information, many deep learning methods expect to learn high-level semantic features from original PolSAR data. However, only original data cannot learn multiple scattering features and complex structures for extremely heterogeneous terrain objects. In addition, deep learning methods always cause edge confusion due to the high-level features. To overcome these shortages, we propose a double-channel CNN network combined with an edge-preserving MRF model(DCCNN-MRF) for PolSAR image classification. Firstly, to combine complex matrix data and multiple scattering features together, a double-channel convolution network(DCCNN) is developed, which consists of a Wishart-based complex matrix and multi-feature subnetworks. The Wishart-based complex matrix network can learn the statistical characteristics and channel correlation well, and the multi-feature network can learn high-level semantic features well. Then, a unified network framework is designed to fuse two kinds of features to enhance advantageous features and reduce redundant ones. Finally, an edge preserving MRF model is designed to combine with the DCCNN network. In the MRF model, a sketch map-based edge energy function is designed by defining adaptive weighted neighborhood for edge pixels. Experiments are conducted on four real PolSAR data sets with different sensors and bands. Experimental results demonstrate the effectiveness of the proposed DCCNN-MRF method.

Coded aperture 3D imaging techniques have been rapidly evolving in the recent years. The two main directions of evolution are in aperture engineering to generate the optimal optical field and in development of computational reconstruction to reconstruct the object’s image from the intensity distribution with a minimal noise. The goal is to find the ideal aperture-reconstruction method pair and if not, to optimize one to match the other for designing an imaging system with required 3D imaging characteristics. Lucy-Richardson-Rosen algorithm (LR²A), a recently developed computational reconstruction method was found to perform better than its predecessors such as matched filter, Weiner filter, phase-only filter, Lucy-Richardson algorithm and non-linear reconstruction (NLR) for certain apertures when the point spread function (PSF) is a real and symmetric function. For other cases of PSF, NLR performed better than the rest of the methods. In this tutorial, LR²A has been presented as a generalized approach for any optical field along with MATLAB codes for reconstruction of any image when the PSF is known. The common problems and pitfalls in using LR²A has been discussed. Simulation and experimental studies for common optical fields such as spherical, Bessel, vortex beams and exotic optical fields such as Airy, scattered and self-rotating beams have been presented. From this study, it can be seen that it is possible to transfer the 3D imaging characteristics from non-imaging type exotic fields to indirect imaging systems faithfully using LR²A. The application of LR²A to medical images such as colonoscopy images and cone beam computed tomography images with synthetic PSF has been demonstrated. We believe that the tutorial will provide a deeper understanding of computational reconstruction using LR²A.

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%.

The process of establishing secure communication between devices in the Internet of Things (IoT) can be approached by using a One-time-Pad (OTP) protocol. We propose using a known secure multiparty sum protocol for generating a One-time-Pad key using true (physical) random numbers in each device (party). We implemented the proposal using ZeroC-Ice, a middleware for distributed computing. The protocol security properties were analyzed under the assumptions of the Dolev-Yao threat model.

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.

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.

Open-cell metallic foams used as catalyst supports exhibit excellent transport properties. In this work, a unique application of metallic foam, as pelletized catalyst in a packed bed reactor, is examined. By using a wall-segment Computational Fluid Dynamics (CFD) setup, parametric analyses are carried out to investigate the influence of foam morphologies (cell size ϕ=0.45-3 mm and porosity ε=0.55-0.95) and intrinsic conductivity on flow and heat transport characteristics in a slender packed bed (N=Ddp=6.78) made of cylindrical metallic foam pellets. The transport processes have been modeled using an extended version of conventional particle-resolved CFD, i.e., flow and energy in inter-particle spaces are fully resolved, whereas porous-media model is used for the effective transport processes inside highly-porous foam pellets. Simulation inputs include the processing parameters relevant to Steam Methane Reforming (SMR), analyzed for low (Rep~100) and high (Rep~5000) flow regimes. The effect of foam morphologies on packed beds has shown that the desired requirements contradict each other, i.e., increase in cell size and porosity favor the reduction in pressure drop, however lowering the heat transfer efficiency. A design study is also conducted to find the optimum foam morphology of a cylindrical foam pellet at higher Rep~5000, which yields ϕ = 0.45, ε = 0.8. Suitable correlations to predict the friction factor and the overall heat transfer coefficient in a foam packed bed have been presented, which considers the effect of different foam morphologies over a range of particle Reynolds number, 100≤Rep≤5000.

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.

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.

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.

. 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.

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.

To solve the problem that sampling-based Rapidly-exploring Random Tree (RRT) method is difficult to guarantee optimality. This paper proposed the Post Triangular Processing of Midpoint Interpolation method minimized the planning time and shorter path length of the sampling-based algorithm. The proposed Post Triangular Processing of Midpoint Interpolation method makes a closer to the optimal path and somewhat solves the sharp path problem through the interpolation process. The experiments were conducted to verify the performance of the proposed method. Applying the method proposed in this paper to the RRT algorithm increases the efficiency of optimization compared to the planning time.

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.

Indirect imaging methods involve at least two steps, namely optical recording, and computational reconstruction. The optical recording process uses an optical modulator that transforms the light from the object into a typical intensity distribution. This distribution is numerically processed to reconstruct the object’s image corresponding to different spatial and spectral dimensions. There have been numerous optical modulation functions and reconstruction methods developed in the past years for different applications. In most cases, a compatible pair of optical modulation function and reconstruction method gives optimal performance. A new reconstruction method termed non-linear reconstruction (NLR) was developed in 2017 to reconstruct the object image in the case of optical scattering modulators. During the years, it was revealed that the NLR could reconstruct an object’s image modulated by an axicons, bifocal lenses and even exotic spiral diffractive elements, which generate deterministic optical fields. Apparently, NLR seems to be a universal reconstruction method for indirect imaging. In this review, the performance of NLR has been investigated for many deterministic and stochastic optical fields. Simulation and experimental results for different cases are presented and discussed.

This article takes an approach to explaining the behavioral manifestations of the decision making in US companies’ offer of health insurance that is grounded not only on their cost minimizing behavior, but also in a humanness dimension based on the African concept of Ubuntu. In this way, we define an Ubuntu based Random Utility modeling framework, describing the choice process as a tripartite decision making, and implemented using a nationally representative random sample of 1,061 American companies from the Dunn and Bradstreet Business data, supplied by Survey Sampling International to the Associated Press-NORC Center for Public Affairs Research. The results from the three sequentially implemented specifications showed that the relationship between management culture and health plan offering strategy is dependent on other relevant co-variates, which when left out, leads to the problem of omitted variables bias. However, when all variables are included but assumed to enter the relationship exogenously, this results in management culture not having any statistically significant effect on companies' decisions about scope of health plan offering. When the exogeneity assumption is relaxed through a recursively Bivariate Probit model, the system of two equations produces a highly significant management culture effect. In fact, in this later case we see that companies with groups and formal committee management culture are 1.58 times less likely to choose a multiple plan strategy over a single plan strategy, hence failing to show the more wholesome plan offering that would theoretically prevail under Ubuntu style management.

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.

Particulate organic carbon (POC) is a pivotal component within the marine carbon cycle, actively involved in diverse biogeochemical processes. This study focuses on Mediterranean as the research region, selecting the most influential factors from 47 potential ones influencing surface POC. Using geographic detector for factor identification, ten primary influencers were identified. Preliminarily optimized random forest (BRF), backpropagation neural network, adaptive boosting, and extreme gradient boosting were utilized to construct POC assessment models. Notably BRF exhibited superior performance in estimating the sea surface POC. Further optimization of RF using the tuneRanger R package resulted in R² of 0.868, mean squared error of 1.119 (mg/m³) ², and mean absolute error of 1.041 (mg/m³). Surface POC concentrations in the Mediterranean for May and June 2017 were estimated. Spatial distribution analysis unveiled higher concentrations in the west, lower in the east, higher in the north, lower in the south, with higher levels near the coast and lower far from the coast. Additionally, the study deliberated on the impact of human activities on surface POC in the Mediterranean. This research contributes a high-precision method for satellite retrieval of surface POC concentrations in the Mediterranean, thereby enriching the understanding of POC dynamics in the area.

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 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.

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.

The underlying physical concept of computing out-of-time-ordered correlation (OTOC) is a significant new tool within the framework of quantum field theory, which now-a-days is treated as a measure of random fluctuations. In this paper, by following the canonical quantization technique we demonstrate a computational method to quantify the two different types of Cosmological auto-correlated OTO functions during the epoch when the non-equilibrium features dominates in Primordial Cosmology. In this formulation, two distinct dynamical time scales are involved to define the quantum mechanical operators arising from cosmological perturbation scenario. We have provided detailed explanation regarding the necessity of this new formalism to quantify any random events generated from quantum fluctuations in Primordial Cosmology. We have performed an elaborative computation for the two types of two-point and four-point auto-correlated OTO functions in terms of the cosmological perturbation field variables and its canonically conjugate momenta to quantify random auto-correlations in the non-equilibrium regime. For both the cases we found significantly distinguishable non-chaotic, but random behaviour in the OTO auto-correlations, which was not pointed before in this type of studies. Finally, we have also demonstrated the classical limiting behaviour of the mentioned two types of auto-correlated OTOC functions from the thermally weighted phase space averaged Poisson Brackets, which we found exactly matches with the large time limiting behaviour of the auto-correlations in the super-horizon regime of the cosmological scalar mode fluctuation.

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.

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.

A multi-server parallel system dispatches the incoming job, which contains kn tasks into n servers. A job is considered to be computed if all the tasks associated with the job are processed. One job’s tasks can be encoded into at least kn “replicas” such that the job is considered to be served if any kn replicas finishing computation. In this paper, we analyze the random scheduling policy of a multi-server computing system under discrete time model in terms of Quality of Exponent (QoE), which is defined as the probability exponent that a typical job can be computed within a given number of time slots. We let kn/n be a constant. Assuming that any task of any job can be randomly dispatched by a “scheduler” to any server, and computing each task takes exactly one time slot. We divide the calculation of probability exponent into two parts, exponent of numerator and exponent of denominator. For the denominator, we give the almost exact exponent using Lagrange multiplier method, while for the numerator, an upper bound of the numerator’s exponent is provided. In addition, we also express the exponent in terms of information theoretical quantities and reconsider both of exponents in the context of large deviation theory.

HPV vaccine induces a herd immunity effect in genital warts when a large number of the population is vaccinated. That aspect should be taken into account when devising new vaccine strategies, like vaccination at older ages or male vaccination. Therefore it is important to develop mathematical models with good predictive capacities. We devised a sexual contact network that was calibrated to simulate the Spanish epidemiology of different HPV genotypes. Through this model we simulated the scenario that occurred in Australia in 2007, where 12-13 year-old girls where vaccinated with a three-dose schedule of a vaccine containing genotypes 6 and 11, that protect against genital warts, and also a catch-up program in women up to 26 years of age. Vaccine coverage were 73 % in girls with three doses and with coverage rates decreasing with age until 52 % for 20-26 year-olds. A fast 59 % reduction in the genital warts diagnoses occurred in the model in the first years after the start of the program, similar to what was described in the literature.

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.

Solar flares are characterized by sudden bursts of electromagnetic radiation from the Sun’s surface, and caused by the changes in magnetic field states in solar active regions. Earth and its surrounding space environment can suffer from various negative impacts caused by solar flares ranging from electronic communication disruption to radiation exposure-based health risks to the astronauts. In this paper, we address the solar flare prediction problem from magnetic field parameter-based multivariate time series (MVTS) data using multiple state-of-the-art machine learning classifiers that include MINImally RandOm Convolutional KErnel Transform (MINIROCKET), Support Vector Machine (SVM), Canonical Interval Forest (CIF), Multiple Representations SEQuence Learner (Mr-SEQL), and Long Short-Term Memory (LSTM)-based deep learning model. Our experiment is conducted on the on the Space Weather ANalytics for Solar Flares (SWAN-SF) benchmark data set, which is a partitioned collection of MVTS data of active region magnetic field parameters spanning over 9 years of operation of the Solar Dynamics Observatory (SDO). The MVTS instances of the SWAN-SF dataset are labeled by GOES X-ray flux-based flare class labels, and attributed to extreme class imbalance because of the rarity of the major flaring events (e.g., X and M). As a performance validation metric in this class-imbalanced dataset, we used the true skill statistic (TSS) score. Finally, we demonstrate the advantages of the MVTS learning algorithm MINIROCKET, which outperformed the aforementioned classifiers without the need for essential data preprocessing steps such as normalization, statistical summarization, and class imbalance handling heuristics.

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.