The advancement of autonomous capabilities in maritime navigation has gained significant attention, with a trajectory moving from decision support systems to full autonomy. This push towards autonomy has led to extensive research focusing on collision avoidance, a critical aspect of safe navigation. Among the various possible approaches, Dynamic Programming is a promising tool for optimizing collision avoidance maneuvers. This paper presents a DP formulation for collision avoidance of autonomous vessels. We set up the problem framework, formulate it as a multi-stage decision process, define cost functions and constraints focusing on the actual requirements a marine maneuver must comply with, and propose a solution algorithm leveraging parallel computing. Additionally, we present a greedy approximation to reduce algorithm complexity. Through case studies, we demonstrate the effectiveness of the proposed approach in navigating complex scenarios, contributing to the future of autonomous maritime navigation. Through case studies, we show the efficacy of our approach in navigating complex scenarios.

In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

Advancements in computing technology have resulted in significant changes in education, healthcare, and manufacturing fields. Thus, personnel training in computer-related fields is directly related to national competitiveness. Therefore, the importance of programming education has been emphasized worldwide. Programming education has been conducted since the 1980s, however beginners often find programming tedious and difficult because of the cognitive burden of using text commands. Therefore, block-based programming environments, such as Scratch and Code.org, and beginner-oriented programming environments, such as Blockly and Pencil Code, have been de-veloped. However, they have limitations when transitioning from block to text-based programming. In this study, we conducted one semester of classes for 128 middle school, high school, and uni-versity students to determine whether an environment that allows using a text-based programming language in a block-based programming environment aids beginners’ understanding of program-ming instructions, command usage confidence, and programming usefulness. The results confirm that the usability of a block-based environment positively influences programming perception. This study is significant because it verifies the necessity and effectiveness of a block-based environment that employs a text-based programming language in programming education for beginners.

We suppose that a Cooper pair (CP) will experience a damping force exerted by the condensed matter. A Langevin equation of a CP in two dimensional condensed matter is established. Following a method similar to Nelson's stochastic mechanics, generalized Schr\"{o}dinger equation of a CP in condensed matter is derived. If the CPs move with a constant velocity, then the corresponding direct current (DC) electrical conductivity can be calculated. Therefore, a Drude like formula of resistivity of CPs is derived. We suppose that the damping coefficient of CPs in two dimensional cuprate superconductors is a linear function of temperature. Then the resistivity and scattering rate of CPs turn out to be also linear-in-temperature. The origin of linear-in-temperature resistivity and Planckian dissipation in cuprate superconductors may be the linear temperature dependence of the damping coefficient of CPs.

The article presents a model for optimizing biomass supply chains using the linear programming framework integrated with a Geographic Information System. Based on the distance from a given type of biomass resource, its calorific value, price, and transportation costs, the model identifies the optimal source of biomass, allowing it to cover the demand for the required total energy value with the lowest possible costs. The case study includes the Połaniec power plant in southeastern Poland and potential sources of forest biomass and agricultural straw within 100 km of the plant. Unit costs of biomass varied depending on biomass availability and energy demands. For energy demand on the level of 1 PJ yearly, the lowest unit costs of biomass (4.08 €/MJ) were when all kinds of biomass were available, and the highest (5.47 €/MJ) was when only stacked wood was available. As energy demand increased, unit costs increased, and the ability to meet this demand with just one type of biomass decreased. The energy biomass sector can utilize the model to benefit both biomass producers and their final buyers.

The article is devoted to the new results of the author, which add his previously published ones, of studying hidden rules and symmetries in structures of long single-stranded DNA sequences in eukaryotic and prokaryotic genomes. The author uses the existence of different alphabets of n-plets in DNA: the alphabet of 4 nucleotides, the alphabet of 16 douplets, the alphabet of 64 triplets, etc. Each of such DNA alphabets of n-plets can serve for constructing a text as a chain of these n-plets. Using this possibility, the author represents any long DNA nucleotide sequence as a bunch of many so-called n-texts, each of which is written on the basis of one of these alphabets of n-plets. Each of such n-texts has its individual percents of different n-plets in its genomic DNA. But it turns out that in such multi-alphabetical or multilayer presentation of each of many genomic DNA, analyzed by the author, universal rules of probabilities and symmetry exist in interrelations of its different n-texts regarding their percents of n-plets. In this study, the tensor product of matrices and vectors is used as an effective analytical tool borrowed from the arsenal of quantum mechanics. Some additions to the topic of algebra-holographic principles in genetics are also presented. Taking into account the described genomic rules of probability, the author puts also forward a concept of the important role of stochastic resonances in genetic informatics.

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.

Some physicists surmise that gravity lies outside of quantum mechanics. Thus theories like the standard semiclassical theory of quantum to gravity coupling (that of Rosenfeld and Møller) are possible real models of interaction, rather than a mere approximation of a theory of quantum gravity. Unfortunately, semiclassical gravity creates inconsistencies such as superluminal communication. Alternatives by authors such as Diósi, Martin, Penrose, and Wang often use the term 'stochastic' to set themselves apart from the standard semiclassical theory. These theories couple to fluctuations caused by for instance continuous spontaneous localization, hence the term 'stochastic'. This paper looks at stochastic gravity in the framework of a class of emergent or ontological quantum theories, such as those by Bohm, Cetto, and de Broglie. It is found that much or all of the trouble in connecting gravity with a microscopic system falls away, as Einstein's general relativity is free to react directly with the microscopic beables. The resulting continuous gravitational wave radiation by atomic and nuclear systems does not, in contrast to Einstein's speculation, cause catastrophic problems. The small amount of energy exchanged by gravitational waves may have measurable experimental consequences. A very recent experiment by Vinante et al. performed on a small cantilever at mK temperatures shows a surprising non-thermal noise component, the magnitude of which is consistent with the stochastic gravity coupling explored here.

This report discusses the application of approximate dynamic programming (ADP) and Krylov subspace methods in solving sequential decision-making problems in machine learning. ADP is used when dealing with large state spaces or when the exact dynamics are unknown. The paper explores various ADP methods such as temporal difference learning and least-squares policy evaluation. The authors also focus on the use of Krylov subspace methods for solving the Bellman equation in ADP. The report provides insights into linear approximation, stochastic algorithms, and the Arnoldi algorithm for orthonormal basis. Overall, the paper highlights the theoretical foundation provided by ADP and its connection with Krylov subspace methods, shedding light on their application in computer science.

The Vacuum Energy Parameter (VEP) of standard cosmology denotes the fraction of the critical density attributed to the accelerated expansion of the Universe. Astrophysical evidence sets the numerical range of VEP at 0.692 +, - 0.012, yet the root cause of these values is currently unknown. Drawing from the stochastic interpretation of early-Universe cosmology, we develop here a derivation of the VEP based on classical diffusion theory and the Langevin equation. Predictions are shown to be in reasonable agreement with observations.

Memristor has attracted a lot of interest due to its high processing speed, low power consumption and high integration ability, which is critical for electronic systems and memory-centric computing. However, the memristor programming circuit and strategy are still inflexible and complex, since the signal generator/collector and stimulate pulse must be carefully matched and designed based on memristor intrinsic characteristics without reconfigurable. Here, a simple and effective circuit only consists a parallel reference-resistor-and-NMOS is designed to program memristor with a more than 99% memristance precision. And the amplitude and width of stimulate pulse are fixed to ±4V and 5ms, respectively. In order to cope with the device variation, such as ±10% tolerance of transition voltage, an optimized programming strategy was proposed and demonstrated great robustness. Additionally, a set of reference resistors and NMOSs have been added to facilitate multi-level memristance operation without requiring any changes to the circuit structure. This program circuit was also employed to program memristor crossbar remains 99% precision. In the end, a memristor-based convolutional neural network which controlled by our optimized programming circuit was used for image recognition, and 89.36% accuracy can be achieved even under 15.8% memristance tolerance. This novel circuit demonstrates a simple and flexible strategy in memristor programming, providing a new way to control memristor crossbar for practical application.

This paper introduces the implementation of a genetic programming (GP)-based procedure to the automatic design and tuning of process controllers. The proposed approach makes a significant contribution to the field of artificial intelligence (AI) in control engineering. Unlike other controller design methods, the GP-based program handles the entire design in the time domain, including differential operations like derivatives and integrals, without the need for intermediate inverse Laplace transformation. This approach not only simplifies the design process but also ensures that all generated controllers are implementable in physical systems. Furthermore, GP’s functions set includes various mathematical operations beyond basic arithmetic operators, such as trigonometric, exponential, and logarithmic operators. The performance and validity of the resulting controllers generated by the proposed GP-based approach are evaluated by verifying whether the generator can replicate the structure and performance of those produced by traditional controller design methods and, in some cases, achieve even better results. As a result, the GP-based approach presents a promising solution for automating the controller design process and addressing control problems in various engineering applications.

Different organisms, cell types, and even similar cell lines can dramatically differ in resistance to genotoxic stress. This testifies to the wide opportunities for genetic and epigenetic regulation of stress resistance. These opportunities could be used to increas the effectiveness of cancer therapy, develop new varieties of plants and animals, and search for new pharmacological targets to enhance human radioresistance, for example, for -manned deep space expeditions. Based on the comparison of transcriptomic studies in cancer cells, in this review we propose that there is a high diversity of genetic mechanisms of development of genotoxic stress resistance. This review focused onpossibilities and limitations of the proposed regulation of the resistance of normal cells whole organisms to genotoxic and oxidative stress by overexpressing of stress-response genes. Moreover, the existing experimental data on the effect of such overexpression on the resistance of cells and organisms to various genotoxic agents has been analyzed and systematized. We suggest that the recent advances in the development of multiplex and highly customizable gene overexpression technology that utilizes the mutant Cas9 protein and the wealth of available data on gene functions and their signal networks open new opportunities for research in this field.

The main sources of intrinsic noise in excitable cells at the microcircuit and network levels are the stochastic characteristics of ion channel gating and activation of the synaptic conductance. Studies using in vivo, in vitro, and in silico methods to examine the effects of synaptic background activity were not adequately investigated in non-neuronal excitatory cells, where neurotransmitter-based innervation also occurs. We created a mathematical model to replicate the background synaptic noise dynamics in a non-neuronal cell. We utilized the stochastic Ornstein-Uhlenbeck process to represent excitatory synaptic conductance, which was incorporated into a whole-cell model to produce spontaneous and evoked cellular electrical activities. The single-cell model includes many biophysically detailed ion channels represented by a set of ordinary differential equations in Hodgkin-Huxley and Markov formalisms. This paradigm effectively induced irregular spontaneous depolarizations (SDs) and spontaneous action potential (sAP) resembling in vitro-like electrical activity in the cells. The input resistance decreased by multiple factors, and the spontaneous action potential firing rate elevated. The potential to reach the action potential threshold is altered. Background synaptic activity can alter the input/output characteristics of non-neuronal excitatory cells. Suppressing these baseline activities would facilitate the discovery of new pharmaceutical targets for different clinical diseases.

Prior studies have focused on the overall behavior of randomly moving particle swarms. However, the characteristics of the stochastic-constrained particles that form ubiquitously within these swarms remain oblivious. This study demonstrates a generalized diffusion equation for stochastic-constrained particles that considers the velocity and location aggregation effects observed from their parent particle swarm (i.e., a completely random particle swarm). This equation can be approximated as the form of Schr\"odinger equation in the microcosmic case (low relative density) and describe the dynamics of the total mass distribution in the macrocosmic case (high relative density). The predicted density distribution of the particle swarm in the stable aggregation state is consistent with the total mass distribution of massive, relaxed galaxy clusters (at least in the range of r < r_s), preventing cuspy problems in the empirical Navarro-Frenk-White (NFW) profile. This study opens a window to observe the dynamics of stochastic-constrained particles from a third perspective, from which the aggregation effect of particles without gravitation can be saw.

We apply the stochastic thermodynamics formalism to describe the dynamics of systems of complex Langevin and Fokker-Planck equations. We provide in particular a simple and general recipe to calculate thermodynamical currents, dissipated and propagating heat for networks of nonlinear oscillators. By using the Hodge decomposition of thermodynamical forces and fluxes, we derive a formula for entropy production that generalises the notion of non-potential forces and makes transparent the breaking of detailed balance and of time reversal symmetry for states arbitrarily far from equilibrium. Our formalism is then applied to describe the off-equilibrium thermodynamics of a few examples, notably a continuum ferromagnet, a network of classical spin-oscillators and the Frenkel-Kontorova model of nano friction.

Capsule endoscopy, which uses a wireless camera to take images of the digestive tract, is emerging as an alternative to traditional colonoscopy. The diagnostic values of these images depend on the quality of revealed underlying tissue surfaces. In this paper, we consider the problem of enhancing the visibility of detail and shadowed tissue surfaces for capsule endoscopy images. Using concentric circles at each pixel for random walks combined with stochastic sampling, the proposed method enhances the details of vessel and tissue surfaces. The framework decomposes the image into two detail layers that contain shadowed tissue surfaces and detail features. The target pixel value is recalculated for the smooth layer using similarity of the target pixel to neighboring pixels by weighting against the total gradient variation and intensity differences. In order to evaluate the diagnostic image quality of the proposed method, we used clinical subjective evaluation with a rank order on selected KID image database and compared to state of the art enhancement methods. The result showed that the proposed method provides a better result in terms of diagnostic image quality and objective quality contrast metrics and structural similarity index.

This paper presents a case study on using Emacs and Org-mode for literate programming in undergraduate data science courses. Over three academic terms, the author mandated these tools across courses in R, Python, C++, SQL, and more. Onboarding relied on simplified Emacs tutorials and starter configurations. Students gained proficiency after initial practice. Live coding sessions demonstrated the flexible instruction enabled by literate notebooks. Assignments and projects required documentation alongside functional code. Student feedback showed enthusiasm for learning a versatile IDE, despite some frustration with the learning curve. Skilled students highlighted efficiency gains in a unified environment. However, uneven adoption of documentation practices pointed to a need for better incorporation into grading. Additionally, some students found Emacs unintuitive, desiring more accessible options. This highlights a need to match tools to skills levels, potentially starting novices with graphical IDEs before introducing Emacs. Key takeaways include literate programming aids comprehension but requires rigorous onboarding and reinforcement; Emacs excels for advanced workflows but has a steep initial curve. With proper support, these tools show promise for data science education.

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyper-feature from satellite bands to improve the classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.

The exact, non perturbative, response theory developed within the field of nonequilibrium molecular dynamics, also known as TTCF (Transient Time Correlation Function) applies to quite general dynamical systems. Its key element is called dissipation function, because it represents the power dissipated by external fields acting on the particle system of interest, whose coupling with the environment is given by deterministic thermostats. This theory has been initially developed for time independent external perturbations, and then it has been extended to time dependent perturbations. It has also been applied to dynamical systems of different nature, and to oscillator models undergoing phase transitions, which cannot be treated withe.g. linear response theory. The present work includes time dependent stochastic perturbations, in the theory, using the Karhunen-Loeve theorem. This leads to three different investigations of a given process. One in which a single realization of the stochastic coefficients is fixed, and averages are taken only over the initial conditions, as in a deterministic process. In the second, the initial condition is fixed, and averages are taken with respect to the distribution of stochastic coefficients. In the last investigations, one averages over both initial conditions and stochastic coefficients. We conclude illustrating the applicability of the resulting exact response theory with simple examples.

This study investigates the stochastic dynamics of hepatitis B virus (HBV) infection using a newly proposed stochastic model. Contrary to deterministic models that fail to encapsulate the inherent randomness and fluctuations in biological processes, our stochastic model provides a more realistic representation of HBV infection dynamics. It incorporates random variability, thereby acknowledging the changes in viral and cellular populations and uncertainties in parameters such as infection rates and immune responses. We examine the solution's existence, uniqueness, and positivity for the proposed model, followed by a comprehensive stability analysis. We provide the necessary and sufficient conditions for local and global stability, offering deep insight into the infection dynamics. Furthermore, we utilize numerical simulations to corroborate our theoretical results. This research provides a robust tool for understanding the complex behavior of HBV dynamics, contributing significantly to the ongoing quest for more effective HBV control and prevention strategies.

An exploding demand for processing capabilities related to the emergence of the IoT, AI and big data, has led to the quest for increasingly efficient ways to expeditiously process the rapidly increasing amount of data. These ways include different approaches like improved devices capable of going further in the more Moore path, but also new devices and architectures capable of going beyond Moore and getting more than Moore. Among the solutions being proposed, Stochastic Computing has positioned itself as a very reasonable alternative for low-power, low-area, low-speed, and adjustable precision calculations; four key-points beneficial to edge computing. On the other hand, chaotic circuits and systems appear to be an attractive solution for (low-power, green) secure data transmission in the frame of edge computing and IoT in general. Classical implementations of this class of circuits require intensive and precise calculations. This paper discusses the use of the SC framework for the implementation of nonlinear systems, showing that it can provide results comparable to those of classical integration, with much simpler hardware, paving the way for relevant applications.

The paper presents the author’ original modification of the residual method in order to construct an efficient tool for assessing the condition of photovoltaic cells, in particular – panels made of amorphous cells which are characterized by significant random operation parameter changes. The solution constructed has been verified through experiments, which show the usefulness of the proposed methodology as it allows to minimize the risk of obtaining false diagnostic information in the process of assessing the condition of photovoltaic panels.

This paper is regarding design and program an Micro-controller Arduino Uno board by using Arduino software to work as a photo-sensor(Active) single axial solar tracker system(SASTS). A solar panel, two photo-resistors (LDR) in two sides (north/south) of the photo-voltaic(PV) and a servo motor are connected to the Uno board, which is running a code that prepared by Arduino software IDE in advanced then it works as a tracking system. Here, the LDRs send the signal of presence or absence of the light to the board and based on that sent signal the Uno reflects a new signal to the servo motor to rotate and finds the light source. Lastly, the photo-sensor single axis tracker is made while Continuously, the system tries to face the panel to the sun and whilst changing the irradiance intensity it starts searching to find the angle of highest irradiance. Based on results that are extracted from the data, the tracker system significantly boosts the output efficiency of the solar panel. By using the Micro-controller Uno board, LDRs, servo motor and special designed mechanical base, the tracking system is constructed, based on acquired data the influence of the STS on the increasing the solar panel efficiency is more obvious. Significantly, the tracker system rises the efficiency of the PV .

Vulnerability is the big issue of the small inland urban centers exposed to the risk of depopulation. In the climate and in the context of an increasing seismic risk in the center-northern part of Italy, seismic vulnerability can become the determinant cause of the final abandonment of a small town. In some Italian regions, as well as Emilia Romagna, municipalities are implementing seismic vulnerability reduction policies based on the Emergency Limit Condition that has become a basic reference for ordinary land planning. This study proposes a valuation planning approach to the seismic vulnerability reduction carried out within the general planning framework concerning the Faentina Union, a group of five small towns located in the south-western part of the Province of Ravenna, Italy. The approach consists of three main stages: knowledge – the typological, constructive and technological description of the buildings specifically concerning their vulnerability degree; interpretation – the analyses aimed to outline a range of hypotheses about the damages in case of seism; planning – identifying the works intended to definitely reduce the vulnerability of the buildings. This stage includes a cost modelling tools aimed at outlining the trade-off between the extension and the intensity of the vulnerability reduction works, given the budget.

The fitting and modeling of skewed, complex, symmetric, and asymmetric datasets is an exciting research topic in many fields of applied sciences, notably lifetime, medical, and financial sciences. The Heavy tailed Nadarajah Haghighi model is introduced by compounding the heavy tailed family and Nadarajah Haghighi distribution in this paper. The so obtained model has three parameters accounting for the scale and shape of the distribution. The proposed distribution's fundamental characteristics such as probability density, cumulative distribution, hazard rate, and survival functions are provided, and several key statistical properties are established, and several entropy information measures are proposed. The estimation of model parameter is performed via the ML procedure. Further, different simulation experiments are conducted to demonstrate the performance of proposed estimator’s using some measure, like the average estimate, the average bias, and associated mean square error. Finally, we are applied our proposed model to analyze three different real datasets. In our illustration, we are compared the practicality of the recommended model with several well-known competing models.

Students in their first year of computer science (CS1) at universities typically struggle to grasp programming concepts. This paper covers research using a Java programming language-guided visual execution environment (VEE) to teach CS1 students about programming concepts. The topics covered include input and output, conditionals, loops, functions, arrays, recursion, and files, all of which are covered in an introductory programming course. The VEE walks beginner programmers through the fundamentals of programming, utilizing visual metaphors to explain and direct interactive Java tasks. The primary goal of this study is to determine whether a cohort of 105 CS1 students from four different groups who are enrolled in two universities—one in Madrid, Spain, and the other in Galway, Ireland—can advance their programming abilities under the guidance of the VEE. Second, does the improvement vary depending on the programming concept? The findings demonstrate that students' programming knowledge has greatly increased. This improvement is significant for all programming concepts, while it is more pronounced for some topics than others, such as operators, conditionals, and loops. Additionally, it demonstrates that students had little prior understanding of files and recursion. The most well-known concept to them was the sequence concept.

The focus of this paper is on analyzing the role and the choice of parameters in sociophysics diffusion models, by leveraging the potentialities of sociophysics from a mathematical programming perspective. We first present a generalised version of Galam’s opinion diffusion model (see, e.g. , ). For a given selection of the coefficients in our model, this proposal yields the original Galam’s model. The generalised model suggests guidelines for possible alternative selection of its parameters that allow to foster diffusion. Examples of the parameters selection process as steered by numerical optimisation, taking into account various objectives, are provided.

Harnessing Quantum Energy States for Unprecedented Computing Capabilities In this proposal, we advocate for the use of energy states as fundamental units of quantum computer programming. Each unit of programming is conceptualized as an energy state, manifested as an essence-unit. An essence-unit, defined as the minimal form encapsulating complete uniqueness or specificity, serves as the cornerstone of this paradigm. This approach enables the recording of various forms of matter on quantum computers in essence-units, portraying their energy states. The recording of energy states is achieved through the creation of four distinct coherent potentials, facilitated by quantum dots or crystals. Crucially, these energy states embodied in essence-units resist subdivision. The study explores the intricate relationship among similarity, fractals, and uniqueness in quantum dot operations, revealing their profound implications for information transfer efficiency. Normalized entropy characterizes charge localized in quantum dot impurities in systems that have distortions. Through the utilization of N-level recording and entropy-fractal dimension equivalence, the paper elucidates the potential of quantum dots in reducing transmission time and modeling complex systems. The proposed methodology signifies a paradigm shift in quantum computing, presenting unparalleled possibilities for tackling hitherto insurmountable challenges.

This research work focused on the risks we are faced with on our day to day activities, either directly or indirectly, which can gradually accumulates and results to communal crisis, religious crisis, socio-economic agitations and tribal crises. Nasarawa Eggon Local Government Area of Nasarawa State was used as case study and a well structure close–ended questionnaire was used for data collection as it relates to Controlled Self Risk Assessment (CSRA) and linear programming technique was used to analyze. The results proved that many of this processes were neglected in these communities, making them to be prone to incessant communal crisis. The study recommend that Government should strongly, as a matter of urgency address the unemployment rate, distribution of political position, schools, primary health care and equip security personnel with the modern technology facilities, which happen to record the highest risk level.

Real assets in the energy market are subject to ecological uncertainty due to the penetration of renewables. We illustrate this point by analysing electrolysers, a class of assets which recently became the subject of a large interest, as they lead to the production of the desirable green hydrogen and green ammonia. The latter has the advantage of being easily stored and has huge potential in decarbonising both the fertilizer and shipping industries. We consider the optimization of green ammonia production with different types of electricity procurement in the context of stochastic power and ammonia markets, a necessary assumption to translate the features of renewable, hence intermittent, electricity. We emphasise the importance of using stochastic prices to effectively model the volatile nature of the price dynamics, illustrating the project risks that can be mitigated by hedging activities. This study shows the pivotal role of flexibility when dealing with fluctuating renewable production and volatile electricity prices to maximise profits and better manage risks.

Dealing with randomness is a crucial aspect that cost-effectiveness analysis (CEA) tools need to address, but existing stochastic CEA tools have rarely examined risk and return from the perspective of global benefits. This paper proposes a stochastic CEA tool that supports medical decision-making from the perspective of global benefits of risk and return, the risk-adjusted incremental cost-effectiveness ratio (ICER). The tool has a traditional form of ICER but uses the risk-adjusted expected cost. Theoretically, we prove that the tool can provide marginal medical decisions that promote the risk-return level on global benefits within any intervention structure and can also serve as a discriminating condition for the optimal intervention structure. Numerical simulations within a framework of mean-variance support the conclusions in this paper.

We outline and test a new methodology for genuine simulation of stochastic processes with any dependence and any marginal distribution. We reproduce time dependence with a generalized, time symmetric or asymmetric, moving-average scheme. This implements linear filtering of non-Gaussian white noise, with the weights of the filter determined by analytical equations in terms of the autocovariance of the process. We approximate the marginal distribution of the process, irrespective of its type, using a number of its cumulants, which in turn determine the cumulants of white noise in a manner that can readily support the generation of random numbers from that approximation, so that it be applicable for stochastic simulation. The simulation method is genuine as it uses the process of interest directly without any transformation (e.g. normalization). We illustrate the method in a number of synthetic and real-world applications with either persistence or antipersistence, and with non-Gaussian marginal distributions that are bounded, thus making the problem more demanding. These include distributions bounded from both sides, such as uniform, and bounded form below, such as exponential and Pareto, possibly having a discontinuity at the origin (intermittence). All examples studied show the satisfactory performance of the method.

In line with Pomeau’s conjecture about the relevance of directed percolation (DP) to turbulence onset/decay in wall-bounded flows, we propose a minimal stochastic model dedicated to the interpretation of the spatially intermittent regimes observed in channel flow before its return to laminar flow. Numerical simulations show that a regime with bands obliquely drifting in two stream-wise symmetrical directions bifurcates into an asymmetrical regime, before ultimately decaying to laminar flow. The model is expressed in terms of a probabilistic cellular automaton evolving von Neumann neighbourhoods with probabilities educed from a close examination of simulation results. It implements band propagation and the two main local processes: longitudinal splitting involving bands with the same orientation, and transversal splitting giving birth to a daughter band with orientation opposite to that of its mother. The ultimate decay stage observed to display one-dimensional DP properties in a two-dimensional geometry is interpreted as resulting from the irrelevance of lateral spreading in the single-orientation regime. The model also reproduces the bifurcation restoring the symmetry upon variation of the probability attached to transversal splitting, which opens the way to a study of the critical properties of that bifurcation, in analogy with thermodynamic phase transitions.

Partial differential representation of self-similarity feature has been derived from notion of the homogenous function in general sense. This representation allows consideration of stochastic self-similar systems. As well as the partial differential representation allows consideration of Stochastic Partial Differential Equation.

Obesity is a complex chronic disease characterized by excess of body fat. It represents a significant public health problem due to the health-related risk factors. There are growing evidences showing that maternal obesity can program the offspring, which influence neonatal phenotype and predispose offspring to a higher prevalence of metabolic disorders such as obesity. This increased risk may also be epigenetically transmitted across generations. Thus, there is an urgent need to find effective reprogramming approaches in order to resume normal fetal development. Polyphenols are bioactive compounds found in fruits and vegetables that exert their anti-obesity effect through its powerful anti-oxidant and anti-inflammatory activities. Polyphenols supplementation has been proven to counteract the deleterious effects of maternal obesity programming on offspring. Indeed, some polyphenols can cross the placenta and protect the fetal predisposition against obesity. The present review summarizes the effects of dietary polyphenols on obesity-induced maternal reprogramming as an offspring anti-obesity approach.

As a model for economic and ecological systems, replicator dynamics represents a basic form of agent competition for finite resources. Here, we investigate the effects of stochastic resetting in this kind of processes. Random reset events abruptly lead individual resources to a small value from which dynamics must start anew. Numerical results show that resource distribution over the population of competing agents develops highly nonuniform profiles, exhibiting clustering and fluctuations with anomalous dependence on the population size. This non-standard statistical behavior jeopardizes an analytical treatment based on mean-field assumptions. We propose alternative simplified analytical approaches which provide a stylized description of entropy evolution for the clustered distribution of resources and explain the unusually slow decrease of fluctuations.

Intratumoral heterogeneity can exist along multiple axes: Cancer Stem Cells (CSCs)/non-CSCs, drug-sensitive/drug-tolerant states and a spectrum of epithelial-hybrid-mesenchymal phenotypes. Further, these diverse cell-states can switch reversibly among one another, thereby posing a major challenge to therapeutic efficacy. Therefore, understanding the origins of phenotypic plasticity and heterogeneity remains an active area of investigation. While genomic components (mutations, chromosomal instability) driving heterogeneity have been well-studied, recent reports highlight the role of non-genetic mechanisms in enabling both phenotypic plasticity and heterogeneity. Here, we discuss various processes underlying phenotypic plasticity such as stochastic gene expression, chromatin reprogramming, asymmetric cell division and the presence of multiple “attractors”. These processes can facilitate a dynamically evolving cell population such that a subpopulation of (drug-tolerant) cells can survive lethal drug exposure and recapitulate population heterogeneity on drug withdrawal, leading to relapse. These drug-tolerant cells can be both pre-existing and also induced by the drug itself through cell-state reprogramming. The dynamics of cell-state transitions both in absence and presence of the drug can be quantified through mathematical models. Such a dynamical systems approach to elucidating patterns of intratumoral heterogeneity by integrating longitudinal experimental data with mathematical models can help design effective combinatorial and/or sequential therapies for better clinical outcomes.

In this paper, we compare the performance between systems of ordinary and (Caputo) fractional differential equations depicting the susceptible-exposed-infectious-recovered (SEIR) models of diseases. In order to understand the origins of both approaches as mean-field approximations of integer and fractional stochastic processes, we introduce the fractional differential equations as approximations of some type of fractional nonlinear birth--death processes. Then, we examine validity of the two approaches against empirical courses of epidemics; we fit both of them to case counts of three measles epidemics that occurred during the pre-vaccination era in three different locations. While FDEs appear more flexible in fitting empirical data, our ODEs offered better fits to two out of three data sets. Important differences in transient dynamics between these modeling approaches are discussed.

In the paper is described the control electronics for an industrial pneumatic – hydraulic system based on a low-cost PLC. The developed system is a hydraulic pulse system and it generates series of high pressure hydraulic pulses (max. 200 bar). We describe requirements, an overall concept of the embedded control system, user interface, security features and network connectivity. In the description of the software solution we describe implementation of hierarchical ordered program threads (multithreaded program) and main control state machine. At the conclusion, we describe the calibration method of the system and calibration curves and we present the schematic diagram and a photo of a functional prototype of the system.

This paper aims to demonstrate how the detection of communities for epidemiological networks can be used to reduce the dimensionality of optimal control problems. A range of planted partition stochastic blockmodels are generated, where the underlying communities in the model vary in detectability. A high-performance computing workflow is then used to simulate and estimate reduced model dynamics for the networks, which in turn is used to find optimal control solutions.

The present paper reports an alternative solution of the measurement problem in quantum theory. The measurement problem can be characterized as that the U-procedure verses the R-procedure. The R-procedure is tested by the Yes/No measurement originally proposed by von Neuman and discussed in details by Penrose. We propose a novel stochastic sampling method to tackle the measurement paradox. Each testing sample produces a pair of Yes-number c and No-number d, which in turn generates a sample phase with respect to the exponential form of (c+id). All the sample phases forms a group G_R. Taking G_R as the sampling potential, combined with the dynamic phase group G_U，we establish a unified model of U-procedure and R-procedure for the evolution of wavefunction. Based on the Born rule, the probability of a sample is given by the squared magnitude of （c+id）. Some metaproperties of the new U-R model, such as natural transformation, consistency, and completeness, are presented. The present work provides a new picture of quantum mechanics and alike. The measurement problem widely exists in dynamic analysis, higher cognition, and large data modeling. Thus, the work reported here has a wide range of applications. Keywords: The measurement problem; U-R procedures; the Yes/No type measurement; stochastic sampling; sample phase; Born probability.

It is known that the source of a tectonic earthquake in the framework of the theory of elasticity and viscoelasticity is considered as a displacement along a certain fault surface. Usually, when describing the source, the geometry of the fault surface is simplified to a flat rectangular area. The displacement vector is assumed to be constant. In this paper, we propose a model of an earthquake source in the form of a displacement with a constant vector along a stochastic surface. A number of standard assumptions were made when modeling. We take into account only the elastic properties of the medium. We consider the Earth’s crust as a half-space and assume that the medium is homogeneous and isotropic. For the mathematical description of the earthquake source, we use the classical force equivalent of displacement along the fault. This is the distribution of double pairs of forces. The field of displacements under the action of body forces is found through a combination of Mindlin nuclei of strain. The paper presents solutions for strike-slip fault. To obtain a stochastic fault surface, we propose to introduce a random deformation of a rectangular flat surface. The paper presents the results of a computational experiment comparing the levels and regions of relative deformations of the Earth’s crust in the case of displacement along a flat rupture surface and along a stochastic one. In the case of a stochastic surface, the regions of relative deformations become asymmetric. The developed model will help to indirectly take into account various mechanical properties of the Earth’s crust when modeling deformations caused by earthquakes.

In this paper, we first establish upper stochastic bounds on the lifetime of a used cold standby system with arbitrary age, using the likelihood ratio order and the usual stochastic order. Then, stochastic comparisons are made between the lifetime of a used cold standby system with age t and the lifetime of a cold standby system consisting of used components with age t using the likelihood ratio order and the usual stochastic order. We use illustrative examples to explore the results presented.

A stochastic dominance (SD) relation can be defined by two different perspectives: One from the view of distributions, and the other one from the view of expected utilities. In early days, Fishburn investigated SD from the view of distributions and we refer this perspective as Fishburn’s SD. One of his many results was the development of fractional-order SD for continuous distributions. However, discrete fractional-order SD may not be generalized directly since some properties of fractional calculus do not have a discrete counterpart. In this paper, we develop a discrete analogue of fractional-order SD from the view of distributions. We generalize the order of SD by Lizama’s fractional delta operator, show the preservation of SD hierarchy, and formulate the utility classes that are congruent with our SD relations. This work brings a message that some results of discrete SD cannot be generalized directly from continuous SD. We characterize the difference between discrete and continuous fractional-order SD, as well as the way to handle them.

Due to the increased use of memristors, and its many applications, the use of emulators has grown in parallel to avoid some of the difficulties presented by real devices such as variability and reliability. In this paper, we present a memristive emulator designed using a Switched Capacitor (SC), this is, an analog component/ block and a control part or block implemented using stochastic computing (SCo) and therefore fully digital. Our design is thus a mixed signal circuit. Memristor equations are implemented using stochastic computing to generate the control signals necessary to work with the controllable resistor implemented as switched capacitor.

Cellular Nonlinear Networks (CNN) are a concept introduced in 1988 by Leon Chua and Lin Yang as a bio-inspired architecture, capable of massively parallel computation. Later on, CNN have been enhanced by incorporating designs that incorporate memristors to profit from their processing and memory capabilities. In addition, Stochastic Computing (SC) can be used to optimize the quantity of required processing elements; thus it provides a lightweight approximate computing framework, quite accurate and effective, though. In this work, we propose utilization of SC in designing and implementing a memristor-based CNN. As a proof of the proposed concept, an example of application is presented. This application combines Matlab and a FPGA in order to create the CNN. The implemented CNN has then been used to perform three different real-time applications on a 512x512 gray-scale and a 768x512 color image: storage of the image, edge detection, and image sharpening. It has to be pointed out that the same CNN has been used for the three different tasks, with the sole change of some programmable parameters. Results show an excellent capability with significant accompanying advantages, like the low number of needed elements further allowing for a low cost FPGA-based system implementation, something confirming the system’s ability for real time operation.

We present a class of efficient parametric closure models for 1D stochastic Burgers equations. Casting it as statistical learning of the flow map, we derive the parametric form by representing the unresolved high wavenumber Fourier modes as functionals of the resolved variables’ trajectory. The reduced models are nonlinear autoregression (NAR) time series models, with coefficients estimated from data by least squares. The NAR models can accurately reproduce the energy spectrum, the invariant densities, and the autocorrelations. Taking advantage of the simplicity of the NAR models, we investigate maximal and optimal space-time reduction. Reduction in space dimension is unlimited, and NAR models with two Fourier modes can perform well. The NAR model’s stability limits time reduction, with a maximal time step smaller than that of the K-mode Galerkin system. We report a potential criterion for optimal space-time reduction: the NAR models achieve minimal relative error in the energy spectrum at the time step where the K-mode Galerkin system’s mean CFL number agrees with the full model’s.

In recent years, the field of deep learning achieved considerable success in pattern recognition, image segmentation and may other classification fields. There are a lot of studies and practical applications of deep learning on images, video or text classification. In this study, we suggest a method for changing the architecture of the most performing CNN models with the aim of designing new models to be used as stand-alone networks or as a component of an ensemble. We propose to replace each activation layer of a CNN (usually a ReLu layer) by a different activation function stochastically drawn from a set of activation functions: in this way the resulting CNN has a different set of activation function layers.

Regression models form the core of the discipline of econometrics. One of the basic assumptions of classical linear regression model is that the values of the explanatory variables are fixed in repeated sampling. However, in most of the real life cases, particularly in economics the assumption of fixed regressors is not always tenable. Under a non-experimental or uncontrolled environment, the dependent variable is often under the influence of explanatory variables that are stochastic in nature. There is a huge literature related to stochastic regressors in various aspects. In this paper, a historical perspective on some of the works related to stochastic regressor is being tried to pen down based on literature search.

Today, computer programming is an essential pillar in the education of individuals. Even though technological evolution has eased the massive need for computer programming, a systematic lit-erature review shows some problems remain with teaching computer programing. To address such issues, in this paper we propose an adapted theory, a method, and a model for teaching some knowledge objects associated with the concepts of variables, expressions, comparisons, loops, and functions in programming fundamentals in computer sciences. The main contribution of this study comprises the extension of the concept of didactic transposition to improve teaching in context; in this paper, the idea is called didactic transposition in extensa sensu. The proposal involves the development of a linguistic corpus based on syllabi, textbooks, reference manuals, and a survey applied to experts in teaching programming fundamentals based on seventy-eight universities worldwide. An adapted theory, a method, and a model for teaching programming fundamentals using computational linguistics are produced. In addition, a template is created for designing teaching practices in this regard. The proposal generates an important alternative for the devel-opment of teaching strategies where the conditions of the context are addressed as a priority; ad-ditionally, several aspects are considered for elaborating teaching strategies using computational linguistic techniques from written documents.

The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of linear programming problem. The optimal path refers to a path of minimum length according to the Euclidean metric. The apex method is based on the predictor-corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. Also, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented.

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in a dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature etc). Simulation results exhibit the benefits of proposed HEMS by showing the reduction of up to 47% in electricity cost and up to 48% in peak power consumption.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

This study presents review of 7580 papers in 13 academic journals, published from January 2015 to January 2020. After a detailed analysis of all papers, 46 papers were further selected showing research on a student population aged between 6 and 15 years old. In order for the paper to be included in the research, the condition was that the paper deals with teaching at least one of the following content areas: programming languages, game design, computer thinking (CT), algorithmic thinking and robotics programming. This study shows the representation of the listed content area in reviewed papers for the specified time period as well as a detailed analysis of the selected papers. Available data about study, participants and education level, country (first author), learning domain, teaching tools, research questions, hypothesis, pre/post-test results, interviews, control groups, course duration, research design, previous experience, project or grant and re-search purpose in detected papers were analysed. In addition, impact of studying some of the listed content areas on student learning performance, motivation, attitude and perception were investigated.

Photogrammetry involves aerial photography of the earth’s surface and subsequently processing the images to provide a more accurate depiction of the area (Orthophotography). It’s used by the Spanish Instituto Geográfico Nacional to update road cartography but requires a significant amount of manual labor due to the need to perform visual inspection of all tiled images. Deep Learning techniques (artificial neural networks with more than one hidden layer) can perform road detection but it is still unclear how to find the optimal network architecture. Our system applies grammar guided genetic programming to the search of deep neural network architectures. In this kind of evolutive algorithm all the population individuals (here candidate network architectures) are constrained to rules specified by a grammar that defines valid and useful structural patterns to guide the search process. Grammar used includes well-known complex structures (e.g. Inception-like modules) combined with a custom designed mutation operator (dynamically links the mutation probability to structural diversity). Pilot results show that the system is able to design models for road detection that obtain test accuracies similar to that reached by state of the art models when evaluated over a dataset from the Spanish National Aerial Orthophotography Plan.

Analyzing the records of Advanced LIGO and Virgo gravitational observatories, we found a specific time-domain asymmetry inherent only to the signals of their gravitational detectors. Experiments with different periodic signals, Gaussian and non-Gaussian noises, made it possible to conclude that the noise of gravitational detectors is an unusual mixture of signals. We also developed a specialized Pearson correlation analyzer to recognize the gravitational-wave events. It turned out that the LIGO detectors’ output signals include a significant (– 6 dB) component, which has the properties of records of reliably recognized gravitational waves. It allows us to argue that the gravitational background noise is largely due to the processes of merging astronomical objects. Since the specific signal is registered by the detectors continuously, we can consider the sub-kilohertz band gravitational oscillations field as detected. Our analysis method also allows us to estimate the contribution of the gravitational background component to the total signal energy. With its help, it will be possible not only to provide the radio-frequency estimation of the magnitude of gravitational disturbances but also, possibly, to construct a map of the gravitational noise of the sky.

As the demands in reliability and high-degree of automation in industrial applications are increasing exponentially, the current Industry 4.0 trend lies in migrating towards smarter technologies that increase flexibility and provide autonomous operation. To tackle this, manufacturers shifted towards Real-Time Ethernet communication which supports autonomous operation, faster sensor/actuator configuration and high degree of determinism. Nevertheless, the uninterrupted operating principle of legacy industrial systems as well as the system complexity and heterogeneity constitutes the transition to Real-Time Ethernet very challenging. This article proposes a novel method allowing to automate the generation of executable code for Real-Time Ethernet architectures based on high-level programming models. The method is based on a programming model and modular code artifacts for the hardware architecture, employing Real-Time Ethernet communication. Through an tool-supported algorithm the high-level model is linked to the architecture's communication primitives and interfaces. The tool-support reduces significantly the development and debugging effort for Real-Time Ethernet applications and increases the application reliability, since the generated code is based on verified programming models. Additionally, the tool creates dedicated files, which allow automated industrial network configuration without any human intervention. Finally, by embedding firewall policies into the code generation process, the method guarantees cyber-resilience for the Real-Time Ethernet architecture. We demonstrate the proposed method in Programmable Logic Controllers (PLCs) of a Public Power Corporation's Hydroelectric Power Plant, which control the temperature and rotor speed of a power generator. The results demonstrate the method's ability to generate rapidly trustworthy and fault-tolerant code for the autonomous plant operation. The hurdles in time and effort for developing, configuring and debugging Real-Time Ethernet applications can be minimized through a high-level programming model that allows automated generation of executable code that is reusable for similar applications. Such time and effort reduction may pave the way towards the Industry 4.0 area.

Studies have shown that in many practical applications, data interpolation by splines leads to better approximation and higher computational efficiency as compared to data interpolation by a single polynomial. Data interpolation by splines can be significantly improved if knots are allowed to be free rather than at a priori fixed locations such as data points. In practical applications, the smallest possible curvature is often desired. Therefore, optimal splines are determined by minimizing a derivative of continuously differentiable functions comprising the spline of the required order. The problem of obtaining an optimal spline is tantamount to minimizing derivatives of a nonlinear differentiable function over a Banach space on a compact set. While the problem of data interpolation by quadratic splines has been accomplished analytically, interpolation by splines of higher orders or in higher dimensions is challenging. In this paper, to overcome difficulties associated with the complexity of the interpolation problem, the interval over which data points are defined, is discretized and continuous derivatives are substituted by their discrete counterparts. It is shown that as the mesh of the discretization approaches zero, a resulting near-optimal spline approaches an optimal spline. Splines with the desired accuracy can be obtained by choosing an appropriate mesh of the discretization. By using cubic splines as an example, numerical results demonstrate that the linear programming (LP) formulation, resulting from the discretization of the interpolation problem, can be solved by linear solvers with high computational efficiency and resulting splines provide a good approximation to the optimal splines.

This paper proposes a model based on gene expression programming for predicting discharge coefficient of triangular labyrinth weirs. The parameters influencing discharge coefficient prediction were first examined and presented as crest height ratio to the head over the crest of the weir (p/y), crest length of water to channel width (L/W), crest length of water to the head over the crest of the weir (L/y), Froude number (F=V/√(gy)) and vertex angle () dimensionless parameters. Different models were then presented using sensitivity analysis in order to examine each of the dimensionless parameters presented in this study. In addition, an equation was presented through the use of nonlinear regression (NLR) for the purpose of comparison with GEP. The results of the studies conducted by using different statistical indexes indicated that GEP is more capable than NLR. This is to the extent that GEP predicts the discharge coefficient with an average relative error of approximately 2.5% in such a manner that the predicted values have less than 5% relative error in the worst model.

This paper introduces an application of R programming language for geostatistical data processing with a case study of the Mariana Trench, Pacific Ocean. The formation of the Mariana Trench, the deepest among all hadal oceanic depth trenches, is caused by complex and diverse geomorphic factors affecting its development. Mariana Trench crosses four tectonic plates: Mariana, Caroline, Pacific and Philippine. The impact of the geographic location and geological factors on its geomorphology has been studied by methods of statistical analysis and data visualization using R libraries. The methodology includes following steps. Firstly, vector thematic data were processed in QGIS: tectonics, bathymetry, geomorphology and geology. Secondly, 25 cross-section profiles were drawn across the trench. The length of each profile is 1000-km. The attribute information has been derived from each profile and stored in a table containing coordinates, depths and thematic information. Finally, this table was processed by methods of the statistical analysis on R. The programming codes and graphical results are presented. The results include geospatial comparative analysis and estimated effects of the data distribution by tectonic plates: slope angle, igneous volcanic areas and depths. The innovativeness of this paper consists in a cross-disciplinary approach combining GIS, statistical analysis and R programming.

The paper presents the problem of damage detection in steel girders. Static displacements at the selected point of the structure play the role of measured variables. Structural response signal decomposition is performed according to the Mallat pyramid algorithm, which is used to perform the discrete wavelet transform (DWT). This procedure allows us to quite well determine the location of structural damage. The geometry and the placement of any defective part of the structure may have a random character. It can be assumed that the random processes occurring in the broadly understood structure mechanics are Gaussian in nature. The first four probabilistic moments are estimated using three approaches independent: semi-analytical (SAM), perturbative (SPT), and Monte-Carlo simulations (MCS). The semi-analytical random approach seems to be the most optimal due to the necessary computation time. The incorporation of the mathematical stochastic apparatus into the classical (deterministic) analysis of the statics of the structure makes it possible to estimate the reliability measures of the analyzed girder.

In this paper we present a successful implementation of the Hindmarsh–Rose model within a SC environment. The merits of the proposed approach are design simplicity, due to stochastic computing, and the ease of implementation. Simulation results showed that the approximation achieved is equivalent to introducing a noise source into the original model. A study for the level of noise introduced, according to the number of bits in the stochastic sequence, has been performed. Additionally, we demonstrate that such an approach, even though it is noisy, it reproduces the behaviour of biological systems, which are intrinsically noisy. It is also demonstrated that a speedup of x2 compared to biological systems is easily achievable, with a very small number of gates, thus paving the road for the in silico implementation of large neuron networks.

Semantic segmentation is a very popular topic in modern computer vision and it has applications to many fields. Researchers proposed a variety of architectures over time, but the most common ones exploit an encoder-decoder structure that aims to capture the semantics of the image and it low level features. The encoder uses convolutional layers, in general with a stride larger than one, to extract the features, while the decoder recreates the image by upsampling an using skip connections with the first layers. In this work, we use DeepLab as architecture to test the effectiveness of creating an ensemble of networks by randomly changing the activation functions inside the network multiple times. We also use different backbone networks in our DeepLab to validate our findings. We manage to reach a dice coefficient of 0.888, and a mean Intersection over Union (mIoU) of 0.825, in the competitive Kvasir-SEG dataset. Results in skin detection also confirm the performance of the proposed ensemble, which is ranked first with respect to other state-of-the-art approaches (including HardNet) in a large set of testing datasets. The developed code will be available at https://github.com/LorisNanni.

Water is essential to all life-forms including various ecological, geological, hydrological, and climatic processes/activities. With changing climate, associated El Nino/Southern Oscillation (ENSO) events appear to stimulate highly uncertain patterns of precipitation (P) and evapotranspiration (EV) processes across the globe. Changes in P and EV patterns are highly sensitive to temperature variation and thus also affecting natural streamflow processes. This paper presents a novel suite of stochastic modelling approaches for associating streamflow sequences with climatic trends. The present work is built upon a stochastic modelling framework HMM_GP that integrates a Hidden Markov Model with a Generalised Pareto distribution for simulating synthetic flow sequences. The GP distribution within HMM_GP model is aimed to improve the model's efficiency in effectively simulating extreme events. This paper further investigated the potentials of Generalised Extreme Value Distribution (EVD) coupled with an HMM model within a regression-based scheme for associating impacts of precipitation and evapotranspiration processes on streamflow. The statistical characteristic of the pioneering modelling schematic has been thoroughly assessed for their suitability to generate/predict synthetic river flows sequences for a set of future climatic projections. The new modelling schematic can be adapted for a range of applications in the area of hydrology, agriculture and climate change.

In this paper, we introduce the evolve-then-filter (EF) regularization method for reduced order modeling of convection-dominated stochastic systems. The standard Galerkin projection reduced order model (G-ROM) yield numerical oscillations in a convection-dominated regime. The evolve-then-filter reduced order model (EF-ROM) aims at the numerical stabilization of the standard G-ROM, which uses explicit ROM spatial filter to regularize various terms in the reduced order model (ROM). Our numerical results based on a stochastic Burgers equation with linear multiplicative noise. It shows that the EF-ROM is significantly better results than G-ROM.

This study purposes the use of plug-in electric vehicles for demand side management (DSM) considering uncertainties in demand as well as uncertainties due to mobility of PEV to mitigate peak demand. The solution also seeks to reduce electric cost in addition to reducing the effects of greenhouse gases. In recent years DSM using distributed storage system such as battery energy management system (BESS) and plugged-in electric vehicles (PEV) have become very prevalent with most implementations resorting to deterministic load forecast. These methods do not consider the potential growth in demand making their solutions less robust. In this study we propose a real-time density demand forecast and stochastic optimization for robust operation of PEV for a building. This method accounts for demand uncertainties in addition to uncertainties in mobile energy storage as found in PEV, making the resulting solution robust as compared to the deterministic case. A case study on a real site in South Korea is used for verification and testing. The proposed study is verified and tested against existing algorithms. The result verifies the effectiveness of the proposed approach

A Demand-side management technique are deployed along with battery energy-storage systems (BESSs) to lower the electricity cost by mitigating the peak load of a building. Most of the existing methods rely on manual operation of the BESS, or even an elaborate building energy-management system resorting to a deterministic method that is susceptible to unforeseen growth in demand. In this study we propose a real-time optimal operating strategy for BESS based on density demand forecast and stochastic optimization. This method takes into consideration uncertainties in demand when accounting for an optimal BESS schedule, making it robust compared to the deterministic case. The proposed method is verified and tested against existing algorithms. Data obtained from a real site in South Korea is used for verification and testing. The results show that the proposed method is effective, even for the cases where the forecasted demand deviates from the observed demand

The feasibility of recovering bioactive antioxidants from Phyllantus emblica leaves using ethanol -water mixture (0 – 100%) and heat-assisted extraction technology (HAE-T) was investigated in this present study. To this effect, the process parameter of operating temperature (OT: 30 -50 oC), solid -to-liquid ratio (S:L: 1:20 - 1:60 g/mL) and extraction time (ET: 45 - 180 min) were investigated on the extract total phenolic content (TPC, mg GAE/g d.w), yield (EY, %) and antioxidant activity (μM AAE/g d.w) by employing the Box-Behnken experimental design (BBD) available in response surface methodology (RSM). Multi-objective process optimization using the desirability function algorithm to determine set of process variables that simultaneously optimize process responses of TPC, EY and AA was also investigated. The recovery process was thereafter modeled with BBD-RSM and multi gene genetic programming (MGGP) algorithm and model reliability assessment via Monte Carlo simulation were conducted for the best performing set of models for predicting TPC, EY and AA values. The HPLC characterization of the recovered extract was carried out to ascertain the phenolic compound constituents of the Phyllantus emblica leaf extract. The 50% ethanol solution was found to be the best for the optimal extraction of antioxidants from Phyllantus emblica leaves. The HAE-T was suitable for recovering bioactive extract from Phyllantus emblica leaves and investigated process parameters have impacts on the recovery process. The process parameters that simultaneously gave the optimum EY of 21.6565%, TPC of 67.116 mg GAE/g and AA of 3.68583 µM AAE/g were OT of 41.61 oC, S:L of 1:60 g/mL and ET of 180 min. The HPLC extract profiling revealed that the bioactive constituents present in the recovered extract were betulinic acid, gallic acid, chlorogenic acid, caffeic acid, ellagic acid, and ferulic acid. Both the developed BBD-RSM and evolved MGGP-based models predicted the observed process response of TPC, EY and AA satisfactorily with BBD-RSM models marginally better in their predictions. The reliability results showed that the BBD-RSM models predicted TPC, EY and AA values with high certainty of 99.985%, 97.569% and 98.661%, respectively.

The connectivity level of last-generation vehicles is constantly on the rise. The combined use of Vehicle-To-Everything (V2X) connectivity and autonomous driving can provide remarkable benefits through the optimization of the route and speed trajectory. In this framework, this paper focuses on vehicle eco-driving optimization in a connected environment. The virtual test rig of a premium segment passenger car was used for generating the simulation scenarios. The benefits, in terms of energy and time savings, that the introduction of V2X communication, integrated with cloud computing, can have in a real-world scenario were assessed. The Reference Scenario is a pre-defined Real Driving Emissions (RDE) compliant route, while the simulation scenarios were generated by assuming two different penetration levels of V2X technologies. The associated energy minimization problem is formulated and solved by means of a global optimization algorithm, i.e., Dynamic Programming (DP). The optimization framework includes information coming from the surrounding environment, e.g., traffic lights state, speed limits, distance to travel, etc. The simulations show that introducing a smart infrastructure along with optimizing the vehicle speed in a real-world route can potentially reduce the required energy by 54% while shortening the travel time by 38%. Finally, a sensitivity analysis is performed on the bi-objective optimization cost function to find a set of Pareto optimal solutions, between energy and travel time minimization.

The classical Lotka-Volterra predator-prey model is globally stable and uniformly persistent. However, in real-life biosystems extinction of species due to stochastic effects is possible. In this paper, we consider the classical Lotka-Volterra predator-prey model under stochastic perturbations. For this model, using an analytical technique based on the direct Lyapunov method and a development of the ideas of R.Z. Khasminskii, we find the precise sufficient conditions for the stochastic extinction of one and both species and the precise necessary conditions for the stochastic system persistence. The stochastic extinction occurs via a process known as the stabilization by noise of the Khasminskii type, and, in order to establish the sufficient conditions for extinction, we found the conditions for the stabilization. The analytical results are illustrated by numerical simulations. {\bf Keywords:} stochastic perturbations, white noise, Ito's stochastic differential equation, the Lyapunov functions method, stability in probability, stabilization by noise, stochastic extinction, persistence.

Using multi-color flow cytometry analysis, we studied the immunophenotypical differences between leukemic blasts/LSCs from patients with AML/MDS and hematopoietic stem and progenitor cells (HSPCs) from patients in complete remission (CR) following their successful treatment. The panel of markers included CD34, CD38, CD45RA, CD123 as representatives for a hierarchical hematopoietic stem and progenitor cell (HSPC) classification as well as programmed death ligand 1 (PD-L1). Rather than restricting the evaluation on a 2- or 3-dimensional analysis, we applied a t-distributed stochastic neighbor embedding (t-SNE) approach to get a deeper insight and segregation between leukemic and normal HPSCs. For that purpose, we created a t-SNE map, which resulted in the visualization of 27 cell clusters based on their similarity concerning the composition and intensity of antigen expression. Two of these clusters were “leukemia-related” containing a great proportion of CD34⁺/CD38^- hematopoietic stem cells (HSCs) or CD34⁺ cells with a strong coexpression of CD45RA/CD123, respectively. CD34⁺ cells within the latter cluster were also highly positive for PD-L1 reflecting their immunosuppressive capacity. Beyond this proof of principle study, the inclusion of additional markers will be helpful to refine the differentiation between normal HSPCs and leukemic cells, particularly in the context of minimal disease detection and antigen-targeted therapeutic interventions. Furthermore, we suggest a protocol for the assignment of new cell ensembles in quantitative terms, via a numerical value, the Pearson coefficient, based on a similarity comparison of the t-SNE pattern with a reference.

In this paper, we propose a method to find all efficient solutions of an interval multiple objective linear programming (IMOLP) problem with interval coefficients in the objective functions, the constraint matrix and the right-hand side vector. The set of all efficient solutions of an IMOLP problem can completely supply information to the decision makers in finding their most preferred solutions but, up to now, not all efficient solutions of an IMOLP problem can be found by known methods. A numerical example is given to illustrate the working of the proposed method.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

The study sought to investigate the effect of Multi-choice Goal programming in project Portfolio Analysis, using Lagos State Project Portfolio from between 2017-2021 as a study case. Specifically, the objectives examined the effectiveness of multi-choice goal programming in analyzing the project Portfolio of Lagos State Government and investigated the possible lapses in the use of Multi-choice Goal programming in analyzing the project Portfolio of Lagos State Government. Data were gathered from the State financial Statements and analyzed using Lingo-17 Software. Based on the analysis, the study discovered that the goals formulated can be optimally and minimally attained as the positive deviational and negative deviational variables depict zero. This indicates that the cost incurred on the project portfolio was absolutely minimized during the period and at the same time; Lagos State Government derived the most preferred benefits from it. The study therefore concluded that the State minimized the project costs and at the same time maximized benefits while meeting its overall objectives.

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices for weighted voting games we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e. the Owen index, the Banzhaf-Owen index and the Symmetric Coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times as well as storage requirements.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (Cc) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, Cc was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e0). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate Cc such as Oedometer test. This study presents a novel prediction model for Cc of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate Cc based on LL, PL, and e0. The performance of developed GEP-based model was evaluated through coefficient of determination (R2), root mean squared error (RMSE), and mean average error (MAE). High R2 and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R2, RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining Cc of fine-grained soils.

Dislocation is one of the major challenges in unmanned aerial vehicle (UAV) image stitching. In this paper, we propose a new dynamic programming for seamlessly stitching UAV images using optical flow. Our solution consists of two steps: Firstly, an image-matching algorithm is used to correct the images so that they are in the same coordinate system. Secondly, a new dynamic programming algorithm is develop based on the concept of a stereo dual-channel energy accumulation using optical flow. A new energy aggregation and traversal strategy is adopted in our solution, which can find a more optimal seam line for adjacent image stitching. Our algorithm overcomes the theoretical limitation of the classical Duplaquet algorithm. Experiments show that the algorithm can effectively solve the dislocation problem in UAV image stitching. Beyond that, our solution is also direction-independent, which has more adaptability and robustness for UAV images.

This study explores the potential trajectories of human civilization influenced by the development and competition of advanced artificial intelligence (AI) systems. Using a system of stochastic partial differential equations (SPDEs), we model the probability density function representing the state of civilization in a phase space defined by prosperity and knowledge. The model incorporates diffusion, growth, saturation, and drift terms, alongside stochastic noise to reflect the uncertainties and random fluctuations in AI impacts.The simulation results are visualized in a probability density graph, revealing the likelihood of various outcomes ranging from extinction and regression, to prosperity and technological advancement. The analysis highlights the balanced prospects of human future, with significant probabilities in both positive and negative directions. Positive scenarios suggest potential for increased prosperity and knowledge, emphasizing the importance of effective AI management and international cooperation. Conversely, the notable risks of regression and extinction underline the need for strategic interventions to mitigate adverse impacts. Our findings stress the stochastic nature of future developments and the critical role of adaptive and flexible policies in steering human civilization towards favorable outcomes. This study provides a simple yet comprehensive framework for understanding the complex dynamics at play and underscores the importance of proactive strategies in the age of AI.

The container relocation problem (CRP) is one of the important topics in container terminals, which aims to find the optimal sequence of movements to minimize the total number of relocations needed to retrieve all the containers within a bay according to a given specific layout and retrieval order. However, determining such an order may be difficult due to uncertainty. Various CRP solution methods proposed so far show a common pitfall concerning the complexity of the solving process, whose scale grows exponentially with the number of containers. Considering the retrieval operation process of the inbound containers in a bay consists of several operation rounds, this paper focuses on the real-time operation scenario of each round to minimize the actual number of relocations during the pick-up process, i.e., starting from the initial layout of the bay, we minimize the sum of the incremental number of blocking containers due to the layout change and the number of reallocated containers unrelated to the target container. We present a heuristic algorithm (called SPFH) based on the three rules (LL, MSS, and FSS), considering the adjustment of the pick-up order of containers. Numerical experiments on a set of instances generated from the literature are performed. The proposed methodology excels in both execution efficiency and solution quality and is capable of solving instances that were impossible to solve before. This also makes our methods appealing for being applied in practice. The source codes are available at https://github.com/zhou-sf/rt-scrp.

Iterative Stochastic decoding is an alternative to standard fixed-point decoding of Low-density parity check codes (LDPC) to reduce inter-node routing. In this paper, we propose a Flexible Field-Programmable Gate Array (FPGA)-Based Stochastic decoding (SD) hardware architecture for LDPC codes in the Fifth-Generation (5G) New Radio (NR) Standard that supports decoding of set of various code rates. This decoder’s runtime flexibility is desirable to switch a better performing code rate automatically based on the channel conditions without the extra time needed for reprogramming of FPGA. An offline design method is implemented to generate the hardware description language (HDL) code description of the decoder for the required code-rate set, which is further synthesized and integrated into the Xilinx Kintex-7 series FPGA board to determine the hardware resource utilisation and processing throughput. The Synopsys design tools were employed during both the simulation and synthesis stages, in combination with TSMC 65-nm CMOS standard cell technology, to facilitate comparative analysis. Compared with state-of-the-art designs, the proposed architecture reduces hardware utilization by up to 26% and achieved energy efficiency by 52%.

The need to find the global minimum in multi-dimensional functions is a critical problem in many fields of science and technology. Effectively solving this problem requires the creation of initial solution estimates, which are subsequently used by the optimization algorithm to search for the best solution in the solution space. In the context of this article, a novel approach to generating the initial solution distribution is presented which is applied to a genetic optimization algorithm. Using the k-means clustering algorithm, a distribution based on data similarity is created. This helps in generating initial estimates that may be more tailored to the problem. Additionally, the proposed method employs a rejection sampling algorithm to discard samples that do not yield better solution estimates in the optimization process. This allows the algorithm to focus on potentially optimal solutions, thus improving its performance. Finally, the article presents experimental results from the application of this approach to various optimization problems, providing the scientific community with a new method for addressing this significant problem.

Machinery parts gradually wear out over time due to regular usage. To improve machinery health and prevent critical issues, a reliable prognosis framework can be implemented by monitoring the behaviour of machinery parts and issuing warnings before they reach a critical state. To achieve this, vibration data from roller bearings experiencing various fault conditions have been collected. Different techniques from the literature were combined to analyze the distinct configurations in the vibration data sets and identify the main defects in roller bearings. The significant features extracted from this analysis were then used to create optimized stochastic model equations, separately regressing inner and outer race fault features to healthy bearing features under random conditions. These models can help engineers design more dependable systems, optimize their performance, and minimize the risk of failures and downtime.

In this paper we consider a failed cold standby systems and obtain some stochastic bounds on the idle time of such systems. It is assumed that, at a time t the failure of a cold standby system is observed, but the actual time of the failure is a time before t. The idle time of the inactive cold standby system is measured as the time between the exact time of failure, which is a random variable, and time t. We use the idle times of the components of the system to obtain lower and upper bounds on the lifetime of the standby system to which they are assembled. We bring some examples to show that the results and the conditions imposed to get them are achievable.

A thermal load dispatch problem minimizes the number of objectives viz operating cost and emission of gaseous pollutants together while allocating the power demand among the committed generating units subject to physical and technological system constraints. A stochastic thermal load dispatch problem is undertaken while taking into consideration, the uncertainties, errors in data measurements and nature of load demand which is random. Owing to uncertain load demand, variance due to mismatch of power demand termed as risk, is considered as another conflicting objective to be minimized. Generally multiobjective problems generate a set of non-inferior solutions are generated and supplied to a decision maker to select the best solution from the set of non-inferior solutions. This paper proposes opposition-based greedy heuristic search (OGHS) method to generate a set of non-inferior solutions. Opposition-based learning is applied to generate initial population to select good candidates. Migration to maintain diversity in the set of feasible solutions is also based on opposition-based learning. Mutation strategy is implemented by perturbing the genes heuristically in parallel and better one solution is sought for each member. Feasible solutions are achieved heuristically by modifying the generation-schedules in such a manner that violation of operating generation limits are avoided. The OGHS method is simple to implement and provides global solutions derived from the randomness of the population generated without tuning of parameters. Decision maker exploits fuzzy membership functions to decide the final decision. Validity of the method has been demonstrated by analysing systems in different scenarios consisting of six generators and forty generators.

It is quite easy to stochastically distort an original count variable to obtain a new count variable with relatively more variability than in the original variable. Many popular overdispersion models (variance greater than mean) can indeed be obtained by mixtures, compounding or randomlystopped sums. There is no analogous stochastic mechanism for the construction of underdispersed count variables (variance less than mean), starting from an original count distribution of interest. This work proposes a generic method to stochastically distort an original count variable to obtain a new count variable with relatively less variability than in the original variable. The proposed mechanism, termed condensation, attracts probability masses from the quantiles in the tails of the original distribution and redirect them toward quantiles around the expected value. If the original distribution can be simulated, then the simulation of variates from a condensed distribution is straightforward. Moreover, condensed distributions have a simple mean-parametrization, a characteristic useful in a count regression context. An application to the negative binomial distribution resulted in a distribution allowing under, equi and overdispersion. In addition to graphical insights, fields of applications of special cases of condensed Poisson and condensed negative binomial distributions were pointed out as an indication of the potential of condensation for a flexible analysis of count data

Dams design and their operation cause strong environmental alteration and therefore a long-term debate is ongoing for the scale of these projects. At the same time, the concept of Environmental Flow Assessment (EFA) is a crucial element of modified ecosystems featuring large infrastructure such as dams and reservoirs for mitigating potential environmental degradation while they operate. Nowadays, integrated scientific frameworks are required to quantify the risks caused by large infrastructure. Through the use of stochastic analysis, it is possible to quantify these uncertainties, and present a solution that incorporates long-term persistence and environmental sustainability into a balanced reservoir simulation model. In this work, an attempt is made to determine a benchmark reservoir size incorporating hydrological and ecological criteria though stochastic analysis. The primary goal is to ensure the best possible conditions for the ecosystem, and then secondarily to allow a steady supply of water for other uses. Using a synthetic timeseries based on historical inputs, it is possible to determine and preserve essential statistical characteristics of a river’s streamflow, and use these to detect the optimal reservoir capacity that maximizes environmental and local water demand reliability.

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

This article deals with a finite-source stock-dependent stochastic inventory system with heterogeneous servers and retrial facility. The system can store up to S number of items, and the lifetime of each item follows an exponential distribution. The primary customers arrive in a finite waiting hall from a finite source and get service from the multi-channel (c-heterogeneous servers). The customer’s arrival rate depends on the present stock level. Those customers who arrive while the waiting hall is full enter into the finite orbit. Also, customers in the waiting hall can become impatient and enter the orbit. The (s,Q) ordering policy is adopted for the replenishment of stocks. In the steady state, the joint probability distribution of a number of items in the inventory, busy servers, customers in the waiting hall, and orbit is computed. The comparative numerical analysis of heterogeneous and homogeneous servers on the expected total cost, the average number of customers in the waiting hall and orbit, the fraction of successful retrial rate, and the average impatient customer rate are also carried out.

Continuous greenhouse gas emissions are causing global warming and impacting the habitats of many animals. Researchers in the field of electric power are making efforts to mitigate this situation. Operating and maintaining the power grid in an economic, low-carbon, and stable is challenging. To address the issue, we propose a grid dispatching technique that combines prediction technology, reinforcement learning, and optimization technology. Prediction technology can forecast future power demand and solar power generation, while reinforcement learning and optimization technology can make charging and discharging decisions for energy storage devices based on current and future grid conditions. In the power system, the aggregation of distributed energy resources increases uncertainty, particularly due to the fluctuating generation of renewable energy. This requires the use of advanced predictive control techniques to ensure long-term economic and decarbonization goals. In this paper, we present a real-time dispatching framework that integrates deep learning-based prediction, reinforcement learning-based decision-making, and stochastic optimization techniques. The framework can rapidly adapt to target uncertainty caused by various factors in real-time data distribution and control processes. The proposed framework achieved global Champion in the NeurIPS Challenge 2022 competition and demonstrated its effectiveness in practical scenarios of intelligent building energy management.

A plant’s health and productivity is influenced by its associated microbes. Although the common microbiome is often thought to be the most influential, significant numbers of rare or uncommon microbes (eg. specialized endosymbionts) may also play an important role in the health and productivity of certain plants in certain environments. To help identify rare/specialized bacteria and fungi in the most important angiosperm plants, we contrasted microbiomes of the shoots, roots and rhizospheres of Arabidopsis, Brachypodium, maize, wheat, sugarcane, rice, tomato, coffee, common bean, cassava, soybean, switchgrass, sunflower, Brachiaria, barley, sorghum, and pea. Plants were grown inside sealed jars on sterile sand or field soil. About 95% and 86% of fungal and bacterial diversity inside plants was uncommon, however judging by read abundance, up to half of the mycobiome consists of uncommon fungal cells, while less than 11% of bacterial endophytes are rare. Uncommon seed transmitted microbiomes consisted mostly of Proteobacteria, Firmicutes, Bacteriodetes, Ascomycetes and Basidiomycetes that most heavily colonized shoots, to a lesser extent roots and least of all rhizospheres. Soil served as a more diverse source of rare microbes than seeds, replacing or excluding the majority of the uncommon seed transmitted microbiome. With the rarest microbes, their colonization pattern could either be the result of stringent biotic filtering by most plants, or uneven/stochastic inoculum distribution in seeds or soil. Several strong plant-microbe associations were observed such as seed transmission to shoots, roots and/or rhizospheres of Sarocladium zeae (maize), Penicillium (pea and Phaseolus), and Curvularia (sugarcane), while robust bacterial colonization from cassava field soil occurred with the cyanobacteria Leptolyngbya into Arabidopsis and Panicum roots, and Streptomyces into cassava roots. Some abundant microbes such as Sakaguchia in rice shoots or Vermispora in Arabidopsis roots appeared in no other samples, suggesting they were infrequent, stochastically deposited propagules from either soil or seed (impossible to know based on the available data). Future experiments with culturing and cross inoculation of these microbes between plants may help us better understand host preferences and their role in plant productivity, perhaps leading to their use in crop microbiome engineering and enhancement of agricultural production.

In this paper, we propose a new mathematical model based on the association between susceptible and recovered individual, where the association between susceptible and recovered individual is disturbed by white noise. This model is based on demographic changes and is used for long term behavior. We study the stability of equilibria of the deterministic model and prove the conditions for the extinction of diseases. Then, we investigate and obtain the critical condition of the stochastic epidemic model for the extinction and the permanence in mean of the disease with the white noise. To verify our results, we present some numerical simulations for real data related to disease.

The vibration feature of weak gear fault is often covered in strong background noise, which makes it necessary to establish weak feature enhancement methods. Among the enhancement methods, stochastic resonance (SR) has the unique advantage of transferring noise energy to weak signals and has a great application prospection in weak signal extraction. But the traditional SR potential model cannot form a richer potential structure and may lead to system instability when the noise is too great. To overcome these shortcomings, the article presents a periodic potential underdamping stochastic resonance (PPUSR) method after investigating the potential function and system signal-to-noise ratio (SNR). In addition, system parameters are further optimized by using ant colony algorithm. Through simulation and gear experiments, the effectiveness of the proposed method was verified. We concluded that compared with the traditional underdamped stochastic resonance (TUSR) method, the PPUSR method had a higher recognition degree and better frequency response capability.

Dynamic hedging has been adopted by many insurance companies to mitigate the financial risks associated with variable annuity guarantees. In order to simulate the performance of dynamic hedging for variable annuity products, insurance companies rely on nested stochastic projections, which is highly computationally intensive and often prohibitive for large variable annuity portfolios. Metamodeling techniques have recently been proposed to address the computational issues. However, it is difficult for researchers to obtain real datasets from insurance companies to test metamodeling techniques and publish the results in academic journals. In this paper, we create synthetic datasets that can be used for the purpose of addressing the computational issues associated with the nested stochastic valuation of large variable annuity portfolios. The runtime used to create these synthetic datasets would be about 3 years if a single CPU were used. These datasets are readily available to researchers and practitioners so that they can focus on testing metamodeling techniques.

Experimental and epidemiological evidence has shown that modifications of the intrauterine environment can have deleterious consequences for individuals, expressed as an increased risk of suffering non-communicable pathologies in adult life, which is known as the hypothesis of the early origin of diseases or programming fetal. On the other hand, changes in gene expression patterns through epigenetic modifications can be the basis for long-term maintenance of the effects of fetal programming. In this sense, epigenetics comprises the study of intrauterine disturbances, which develop diseases in the adult, including Celiac Disease (CD). In addition, early feeding practices could influence the risk of CD development, such as breastfeeding timing and duration and age at gluten introduction in the diet. Gluten acts as a trigger for CD in genetically predisposed subjects, although approximately 30% of the world population has HLA DQ2 or DQ8, the prevalence of the disease is only 1-3%. It is not known what factors act to modify the risk of disease in genetically at risk subjects. Taking into account all these considerations, the aim of the current review is to elucidate the role of early programming and the effect of early nutrition on the development and progression of CD.

In this work, optimal consumption and investment strategies are derived for risk-averse investors under the 4/2 stochastic volatility class of models. We work under an expected utility (EUT) framework and consider a Constant Relative Risk Aversion (CRRA) investor, who might also be ambiguity-averse. The corresponding Hamilton-Jacobi-Bellman (HJB) and HJB-Isaacs (HJBI) equations are solved in closed-form for a subset of the parametric space and under some restrictions on the portfolio setting, for complete markets. Conditions for proper changes of measure and well defined solutions are provided. These are the first analytical solutions for the 4/2 stochastic volatility model and the embedded 3/2 model for the type of excess returns established in .

The fast pace development of the Internet and the Coronavirus Disease (COVID-19) pandemic have impacted considerably on the educative sector; encouraging the constant transformation of the teaching-learning strategies and more in technological areas as Educational Software Engineering. Web programming, a fundamental topic in Software Engineering and Cloud-based applications, deals with various critical challenges in education, such as learning continuous emerging technological tools, plagiarism detection, generating innovative learning environments, among others. Continual change and more with the current digitization becomes a challenge for teachers and students who cannot depend on traditional educational methods. The article presents a sustainable teaching-learning methodology for web programming courses in Engineering Education using a project-based integrated approach adaptable to the continuous web technological advances. The methodology has been developed and improved for 9 years, 15 groups, and 3 different universities. Our results demonstrate that the methodology is 100% adaptable with new technologies that might arise; it also presents the advantages of avoiding plagiarism in the best case and a personalized induction for every specific student in the learning process.

In this paper we deal with the resolution of a fuzzy multiobjective programming problem using the level sets optimization. We compare it to other optimization strategies studied until now and we propose an algorithm to identify possible Pareto efficient optimal solutions.