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

Coal gasification with carbon dioxide is a process for generating clean gaseous fuels and relieving greenhouse effect. Zhundong coal has high alkali and alkali earth metals (AAEMs) content, medium volatile and low ash in nature. Isothermal CO₂ gasification of char derived from Zhundong coal (R-char) and char from acid washing R-char (AR-char) are performed in thermo-gravimetric analyzer (TGA). The effect of AAEMs is investigated on the gasification behavior in the range of temperatures 1073 K to 1273 K. The carbon conversion increases rapidly with increasing reaction temperature and CO₂ concentration. R-char has high gasification rate and carbon conversion compared with AR-char. The accuracy of the free-model approach for calculating activation energy at different conversions is validated by compared with different kinetic models (volume reaction model, distributed activation energy model). Moreover, R-char gasification with CO₂ shows a compensation effect as the Arrhenius parameters (EA and k0) increase or decrease simultaneously.

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

Three kinds of inorganic alkali are introduced into tetraethylenepentamine (TPEA) and polyethyleneimine (PEI) modified MCM-41 as the CO2 adsorbents. FT-IR and TGA are used to characterize the surface groups and the thermal stability of adsorbents. Chemical titration method is used to measure the alkali amounts of adsorbents. Thermo-gravimetric analysis with 10%CO2/N2 as the simulated flue gas is used to test the CO2 adsorption performance of adsorbents. The results show that all three kinds of inorganic alkali containing adsorbents exhibit promoted CO2 adsorption capability than traditional TPEA and PEI modified samples. Ca(OH)2 and PEI modified samples exhibit the highest adsorption capacity and stable regeneration property. The introduction of inorganic alkali changes the chemical adsorption mechanism between CO2 and increases the effective alkali amounts due to its hydroxyl groups. The CO2 adsorption capacities have a linear dependence relation with the alkali amounts of adsorbents, indicating that alkali amount is a critical factor for novel adsorbents exploring.

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

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

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

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

Background: Acute kidney disease (AKD) is a known risk factor for increased mortality and evolution towards chronic kidney disease (CKD) in adults. The data regarding children are scarce. The purpose of our study is to explore the risk factor for AKD and impact of AKD following an acute kidney injury (AKI) episode in children on mortality and new-onset CKD. Methods: We retrospectively evaluated 736 children with ages between 2 and 18 years old with AKI admitted in a tertiary care hospital from the west Romania over a 9 years period. Results: AKD incidence following AKI was 17%. Patients that developed AKD were older, with higher baseline serum creatinine values, urea, C reactive protein and lower proteins, haemoglobin and sodium. They were more often exposed to sepsis, critical illness and nephrotoxic medications and presented certain susceptibilities like CKD, neoplasia, anemia, heart failure, arterial hypertension, stem cell transplant and female gender. AKI causes that increased the risk of AKD were intrinsic ones. AKD increased the overall mortality by three times. The factors that independently increased the risk of evolution towards CKD were AKD, acute tubular necrosis and higher baseline serum creatinine values. Conclusions: AKD is an independent risk factor for mortality and new-onset CKD in children.

New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assigns to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using strong edge to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute neutrosophic chromatic number. This specific relation amid edges is necessary to compute both chromatic number concerning the number of representative in the set of representatives and neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no strong edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

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

: Tunnel instability and lining integrity are intimately tied to the creep properties of the surrounding rock. The acquisition of rock mass creep parameters is critical in ascertaining the appropriate timing for lining construction. Nevertheless, creep tests on rock specimens conducted in a controlled setting cannot be straightforwardly extrapolated to rock mass creep analysis. This study performs laboratory-based creep tests on mudstone samples and establishes the corresponding creep constitutive model. Integration of a Mohr-Coulomb element with the Burgers model in series serves to characterise the yield creep behaviour of the rock mass. Additionally, the research outlines a series of 100 orthogonal experiments utilising randomised creep parameters, and formulates a GA-BP neural network inversion model. Employing long-term deformation measurements from the crown and sidewalls of the project site, this study deduces the creep parameters of the mudstone in the investigated tunnel section and examines the prolonged deformation traits of the surrounding rock. Drawing on the deformation traits of the surrounding rock and the forces impacting the primary support and lining structures, this paper evaluates the earliest and latest viable lining casting periods and pinpoints an optimal timing interval for lining implementation. The methodologies employed herein can serve as a benchmark for analogous endeavors internationally.

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

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

This study aims to examine the non-volatile Particle Number (PN) emissions of a retrofitted Heavy-Duty Spark-Ignition (HD-SI) engine powered by liquefied petroleum gas (LPG) under both steady-state and transient conditions. The engine was tested under seven steady-state operating points to investigate the PN behavior and Particle Size Distribution (PSD) upstream and down-stream of the Three-Way Catalyst (TWC). This analysis intends to assess the impact of including particles with diameters ranging from 10 nm to 23 nm in the total particle count, a consideration for future regulations. The study employed the World Harmonized Transient Cycle (WHTC) for transient conditions to encompass the same engine working region used in the steady-state analysis. A Dekati FPS-4000 diluted the exhaust sample to measure the PSD and PN for particle diameters between 5.6 nm and 560 nm using the TSI-Engine Exhaust Particle Sizer (EEPS) 3090. Findings indicate that PN levels tend to increase downstream of the TWC under steady-state conditions in operating points with low exhaust gas temperatures and flows (equal to or less than 500 °C and 120 kg/h). Furthermore, the inclusion of particles with diameters between 10 nm and 23 nm leads to an increase in PN emissions by 17.70% to 40.84% under steady conditions and by an average of 40.06% under transient conditions, compared to measurements that only consider particles larger than 23 nm. Notably, in transient conditions, most PN emissions occur during the final 600 seconds of the cycle, linked to the most intense phase of the WHTC.

The purpose of this paper is to explore the implementation of Retrieval-Augmented Gen- 14 eration (RAG) technology with open-source Large Language Models (LLMs). For this purpose, a 15 web-based application named PaSSER that integrates RAG with three models - Mistral:7b, 16 Llama2:7b: Orca2:7b, is developed. In its development various technologies are used, including 17 Blockchain for managing and storing assessment results of built-in testing modules. PaSSER em- 18 ploys a set of evaluation metrics for LLMs’ performance - METEOR, ROUGE, BLEU, Perplexity, 19 Cosine similarity, Pearson correlation, and F1 score. The specialized knowledge base is in the smart 20 agriculture domain. As an illustration, the paper presents results and analysis of two tests. First one 21 is assessing the performance of LLMs across different hardware configurations, the other is deter- 22 mining the model that delivers most accurate and contextually relevant responses within the RAG. 23 The paper also discusses the integration of blockchain technology with LLMs to manage and store 24 assessment results within a blockchain environment. The tests revealed that Mistral:7b demon- 25 strates the best results across most of the evaluated metrics. The discussion section comments on 26 technical and hardware considerations that affect the performance of LLMs. Future development 27 will focus in leveraging new larger pre-trained open-source LLMs, exploring different finetuning 28 approaches, and further integration with Blockchain and IPFS.

This paper performs a comprehensive analysis of the wind energy potential of onshore regions in Greece with emphasis on quantifying the volume risk and the spatial covariance structure. Optimization techniques are employed to derive efficient wind capacity allocation plans (also known as generation portfolios) incorporating different yield aspirations. The generation profile of minimum variance and other optimal portfolios along the efficient frontier are subject to rigorous evaluation using a fusion of descriptive and statistical methods. In particular, principal component analysis is employed to estimate factor models and investigate the spatiotemporal properties of wind power generation, providing valuable insights into the persistence of volume risk. The overarching goal of the study is to employ a set of statistical and mathematical programming tools guiding investors, aggregators and policy makers in their selection of wind energy generating assets. The findings of this research challenge the effectiveness of current policies and industry practices, offering a new perspective on wind energy harvesting with a focus on the management of volume risk.

High resolution information on nucleotide arrangement in the genome of any or-ganism is critical to understand its genetic makeup, function, and evolutionary his-tory. For years, DNA sequencing has provided crucial breakthroughs in the field of genomics and molecular biology. With the advent of technology, Next Generation Sequencing has now transformed the whole genome sequencing prospects, thus unveiling the novel and interesting features of an organism genome that can behold. Next generation sequencing platforms offer realistic approach to identify and anal-yses whole genome with high throughput, accuracy, scalability in a very short time span. Information obtained can be further used in improving our existing healthcare systems, designing novel and personalized therapeutic modules, making the envi-ronment sustainable and proactively preparing ourselves for future pandemics and outbreaks. This article discusses the various NGS technologies and approaches, their advantages, drawbacks, and futuristic usage in different fields. Though still in nascent stages and marred with flaws, with ongoing advancement, NGS will indeed have promising impacts in the future.

A novel approach was developed that combined LP-based row generation with optimization-based sorting to tackle computational challenges posed by budget allocation problems with combinatorial constraints. The proposed approach dynamically generated constraints using row generation and prioritized them using optimization-based sorting to ensure a high-quality solution. Computational experiments and case studies revealed that as the problem size increased, the proposed approach outperformed simplex solutions in terms of solution search time. Specifically, for a problem with 50 projects (N = 50) and 2,251,799,813,685,250 constraints, the proposed approach found a solution in just 1.4 seconds, while LP failed due to the problem size. The proposed approach demonstrated enhanced computational efficiency and solution quality compared to traditional LP methods.

This paper introduces an innovative energy circuit that challenges conventional understandings of energy conservation, marking a significant departure from traditional frameworks. Seeking to enhance energy generation within existing paradigms, this innovation holds promise for addressing pressing global issues such as the energy crisis and environmental sustainability, while also stimulating scientific inquiry. In contrast to prevalent misconceptions rooted in philosophical and scientific constraints, this study refutes the notion of generating energy from nothing and questions the viability of perpetual motion machines as conceptual models. Instead, it proposes a novel circuit design derived from an unconventional electrical short circuit, which is shown to disrupt the established principles of energy conservation. This circuit offers a transformative approach with diverse applications, including self-recharging capabilities for electric vehicles, bolstering microgrid infrastructure, and facilitating the integration of renewable energy sources. Transcending conventional scientific boundaries, this paper prompts philosophical reflections on the evolving nature of scientific exploration. Ultimately, the energy circuit represents a pivotal step towards mitigating the global energy crisis by reducing reliance on finite resources and fostering sustainability. The paper concludes by illustrating the circuit's potential to revolutionize energy systems and contribute to a more resilient and sustainable future.

In this essay, the new notion concerning longest path is introduced. Longest path has a close relation with the notion of diameter in graph. The classes of graph are studied in the terms of having the vertex with longest path. Valued number is the number of edges belong to the longest path in the matter of vertex. For every vertex, there’s a valued number and new notion of valued set is the generalization of valued number for the vertex when all vertices of the graphs are corresponded to a vertex which has the greater valued number. For any positive integer, there’s one graph in that, there’s vertex which its valued number is that. By deleting the vertices which don’t belong to valued set, new notion of new graph is up. It’s called valued graph. The comparison amid valued graph and initial graph is up, too.

In this article, some notions about set, weight of set, number, number's position, special vertex are introduced. Some classes of graph under these new notions have been opted as if the study on the special attributes of these new notion when they've acted amid each other is considered. Internal and external relations amid these new notions have been obtained as if some classes of graphs in the matter of these notions are been pointed out.

This study considers an application of the first-order Grey Markov Model to foresee the values of Italian power generation in relation to the available energy sources. The model is used to fit data from the Italian energy system from 2000 to 2022. The integration of Markovian error introduces a random element to the model, which is able now to capture inherent uncertainties and misalignments between the Grey model predictions and the real data. This application provides valuable insights for strategic planning in the energy sector and future developments. The results show good accuracy of the predictions, which provides powerful information for the effective implementation of energy policies concerning the evolution of energy demand in the country. Despite advancements, Italy’s 2032 energy mix will still significantly rely on fossil fuels, emphasizing the need for sustained efforts beyond 2032 to enhance sustainability.

Dynamic optical structural color is always desired in various display applications and usually involves active materials. Full-color generation, especially bi-directional full-color generation in both reflective and transmissive modes, without any active materials included has been rarely investigated. Herein, we demonstrate a scheme of bi-directional full-color generation based on a plasmonic metasurface modulated by rotation of the polarization angle of the incident light without varying the geometry and the optical properties of the materials and the environment where the metasurface resides. The metasurface unit cell consists of plasmonic modules aligning in three directions and is patterned in a square array. The metasurface structural color device generates full colors in both reflection and transmission. Based on the proposed polarization-dependent structural color, information encoding of three multiplexed animal images and quick-responsive (QR) codes is demonstrated to verify the efficient information encoding and decoding of the proposed scheme. The animals can be seen under different polarization incidence and the QR codes can be successfully decoded by the polarization rotation in transmission. The proposed bi-directional full-color generation metasurface has great potential in applications such as kaleidoscope generation, anti-counterfeiting, dynamic color display, and optical information encoding.

In this research, catalytic steam reforming acetic acid derived from the aqueous portion of bio-oil for hydrogen production was investigated by using different Ni/ATC (Attapulgite Clay) catalysts prepared by precipitation, impregnation and mechanical blending methods. The fresh and reduced catalysts were characterized by XRD, N₂ adsorption-desorption, TEM and H₂-TPR. The comprehensive results demonstrated that the interaction between active metallic Ni and ATC carrier was significantly improved in Ni/ATC catalyst prepared by precipitation method, and in which the mean Ni particle size was the smallest (~13 nm) resulted in the highest metal dispersion (7.5%). The catalytic performance of the three catalysts was evaluated through the process of steam reforming of acetic acid in a fixed-bed reactor under atmospheric pressure at two different temperatures, such as 550 ℃ and 650 ℃. Results showed that the Ni/ATC (PM-N/ATC) prepared by precipitation method, achieved the highest H₂ yield of ~82% and little lower acetic acid conversion efficiency of ~85% than that (~95%) of Ni/ATC (IM-NATC) prepared by impregnation method. In addition, the deactivation catalysts after reaction for 4 h were analyzed by XRD, TGA-DTG and TEM, which demonstrated that the catalyst deactivation was not caused by the amount of carbon deposition, but owed to the significant agglomeration and sintering of Ni particles in the carrier.

In this work, satellite data from the Clouds and Earth’s Radiant Energy System (CERES) and Moderate Resolution Imaging Spectroradiometer (MODIS) instruments is analyzed to determine how the global absorbed sunlight and global entropy generation rate have changed during the time period from 2002 to 2023. The data is used to test hypotheses derived from the Maximum Power Principle (MPP) and Maximum Entropy Production Principle (MEP) about the evolution of earth’s surface and atmosphere. The results indicate that the amount of absorbed sunlight has increased over the last 20 years but rising surface temperatures have caused the entropy generation rate to remain approximately constant despite that decrease in albedo. The results are simpler to explain using the MPP but do not completely rule out the MEP. Given the acceptance of the MPP or MEP, some extensions and nuances are discussed.

Extensive genome structure variation, such as copy number variations (CNVs) and presence/absence variations, is the basis for the remarkable maize genetic diversity; however, the effect of CNVs on maize herbivory defense remains largely underexplored. Here, we report that the naturally occurring duplication of the maize 9-lipoxygenase gene, ZmLOX5, leads to increased resistance of maize to herbivory by fall armyworms (FAW). Previously, we showed that ZmLOX5-derived oxylipins are required for defense against chewing insect herbivores and identified several inbred lines, including Yu796, that contained duplicated CNVs of ZmLOX5, referred to as Yu796-2×LOX5. To test whether introgression of the Yu796-2×LOX5 locus into the herbivore-susceptible B73 background that contains a single ZmLOX5 gene is a feasible approach to increase resistance, we generated a series of near-isogenic lines that contained either 2, 1 or 0 copies of the Yu796-2×LOX5 locus in the B73 background by six back crosses (BC6). Droplet digital PCR (ddPCR) confirmed the successful introgression of the Yu796-2×LOX5 locus in B73. The resulting B73-2×LOX5 inbred line displayed increased resistance against FAW associated with increased expression of ZmLOX5, increased wound-induced production of its primary oxylipin product, the α-ketol, 9-hydroxy-10-oxo-12(Z),15(Z)-octadecadienoic acid (9,10-KODA), and the downstream defense hormones regulated by this molecule, 12-oxo-phytodienoic acid (12-OPDA) and abscisic acid (ABA). Surprisingly, wound-induced JA-Ile production was not increased in B73-2×LOX5, resulting from the increased JA catabolism. Furthermore, B73-2×LOX5 displayed enhanced drought tolerance likely due to increased ABA and 12-OPDA content. Taken together, this study revealed that the duplicated CNV of ZmLOX5 quantitively contributes to maize antiherbivore defense and presents proof-of-concept evidence that the introgression of naturally occurring duplicated CNVs of a defensive gene into the productive, but susceptible, crop varieties is a feasible breeding approach for enhancing plant resistance to herbivory and tolerance to abiotic stress.

Electricity consumption is often the hotspot of life cycle assessment (LCA) of products, industrial activities, or services. The objective of this paper is to provide a consistent, scientific, region-specific electricity-supply-based inventory of electricity generation technology for national and regional power grids. Marginal electricity generation technology is pivotal in assessing impacts related to additional consumption of electricity. China covers a large geographical area with regional supply grids; these are arguably equally or less integrated. Meanwhile, it is also a country with internal imbalances in regional energy supply and demand. Therefore, we suggest an approach to achieve a geographical subdivision of the Chinese electricity grid, corresponding to the interprovincial regional power grids, namely the North, the Northeast, the East, the Central, the Northwest, and the Southwest China Grids, and the China Southern Power Grid. The approach combines information from the Chinese national plans on for capacity changes in both production and distribution grids, and knowledge of resource availability. The results show that nationally, marginal technology is coal-fired electricity generation, which is the same scenario in the North and Northwest China Grid. In the Northeast, East, and Central China Grid, nuclear power gradually replaces coal-fired electricity and becomes the marginal technology. In the Southwest China Grid and the China Southern Power Grid, the marginal electricity is hydropower towards 2030.

In this paper, we suggest an expansion of the Planck distribution function derived from the Boltzmann principle. Thereby, we consider expanding Planck's law with a new distribution function, and discuss fine structure constant. Furthermore, using ideas applied to the expansion of the Planck distribution function, we show that Von Koch's inequality can be derived without using the Riemann Hypothesis, that is, the Riemann Hypothesis is true, and that the abc conjecture is not true. Furthermore, we define a generalization of Entropy and discuss that Entropy is relevant to dynamical systems described by logistic function models, such as the growth of bacteria and populations.

In this outlet, I’ve devised the concept of relation amid two points where these points are coming up to make situation which in that the set of objects are greed to represent the story of how to be in whatever situations when these two points have the styles of being everywhere in the highlights of the concept which are coming from the merits of these points where are eligible to make capable situation to overcome every situation when they’re participant in the hugely diverse situations which mean too styles of graphs with have the name or the general results for the general situation as possible as are.

This paper proposes a novel single-stage buck-boost three-Level neutral-point-clamped (NPC) inverter with two independent dc sources coupled for the grid-tied photovoltaic (PV) application, which can effectively solve the unbalanced operational conditions generally appeared between two coupled independent PV sources induced by the unequal irradiation and temperature distribution. The proposed control scheme can simultaneously guarantee the maximum power point (MPP) operation of both PV sources and maintain the output waveform quality. Compared to the traditional two-stage PV inverter, the proposed NPC inverter could reduce the PV array voltage requirement and dc-link capacitors’ voltage rating, meanwhile show the advantage in operational efficiency. MATLAB simulations and the captured experimental results are presented to show the performance of the proposed three-level inverter.

The numerical simulation of entropy generation at mixed natural free and forced convection flow in a square lid-driven cavity filled with an eletrically conducting binary fluids saturated porous media in the presence of a magnetic field is performed in this investigation. Both the top and bottom horizontal walls of the cavity are kept at constant and different temperatures while the left and right vertical walls are adiabatic and insulated. The magnetic field is applied in normal direction to the cavity. The Darcy model, including Brinkman term relative to viscous effects and Forchheimer term due to inertial forces, is used for the momentum equations, and the SIMPLER algorithm, based on the control volume finite-element method approach is used to solve the pressure –velocity coupling. The flow pattern and the heat transfer characteristics inside the cavity are presented in the form of isotherms, streamlines and isentropic lines and average Nusselt number trend. The entropy generation rate is determined for various values of Darcy number (10^-3 ≤ Da ≤ 1) and for a range of Hartmann number (0 ≤ Ha ≤ 10²). This study is limited to Pr = 7 which corresponds to water. It is observed that entropy generation is very affected by the variations of dimensionless control parameters considered.

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

We develop a primality test for Mersenne numbers and investigate the primality of the sequence of Catalan-Mersenne numbers. We use induction as a proof to show that the 5th Catalan-Mersenne number is a prime number, thus demonstrating the infinitude of Mersenne primes.

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

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

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

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

The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. This is known as the strong Goldbach's conjecture. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A principal complexity class is NSPACE(S(n)) for some S(n). We show if the weak Goldbach's conjecture is true, then the problem PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n). This proof is based on the assumption that if some language belongs to NSPACE(S(n)), then the unary version of that language belongs to NSPACE(S(log n)) and vice versa. However, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. Since Harald Helfgott proved that the weak Goldbach's conjecture is true, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples, where the case of infinite number of counterexamples statistically seems to be unlikely. In addition, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Twin prime conjecture is true. Moreover, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Beal's conjecture is true. Since the Beal's conjecture is a generalization of Fermat's Last Theorem, then this is also a simple and short proof for that Theorem. In mathematics, the Riemann hypothesis is consider to be the most important unsolved problem in pure mathematics. If PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the Riemann hypothesis is true.

The UNUSUAL FLORAL ORGANS (UFO) gene is an essential regulatory factor of class B genes and plays a vital role in the process of inflorescence primordial and flower primordial development. We investigated the role of UFO genes in soybean to better understand the development of floral organs through gene cloning, expression analysis, and gene knockout. In situ hybridization demonstrated predominant expression of the GmUFO1 gene in the flower primordium. Phenotypic observation of GmUFO1 knockout mutant lines (Gmufo1) showed obvious alteration in floral organ number and shape, and mosaic organ formation. In contrast, GmUFO2 knockout mutant lines (Gmufo2) showed no obvious difference in floral organs. However, the GmUFO1 and GmUFO2 double knockout lines (Gmufo1ufo2) showed a more severe mutant phenotype than the Gmufo1 lines. Gene expression analysis also showed differences in the expression of major ABC function genes in the knockout lines. Based on the phenotypic and expression analysis, our results suggest the major role of GmUFO1 in the regulation of flower organ formation in soybean and that GmUFO2 does not have any direct effect, but it might have an interaction role with GmUFO1 in the regulation of flower development. In conclusion, the present study identified UFO genes in soybean and improved our understanding of floral development that could be useful for flower design in hybrid soybean breeding.

In this paper, we introduce hybrid numbers with Fibonacci and Lucas hybrid number coefficients. We give the Binet formulas, generating functions, exponential generating functions for these numbers. Then we define an associate matrix for these numbers. In addition, using this matrix, we present two different versions of Cassini identitiy of these numbers.

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

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

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

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

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

A bacterium known as Akkermansia muciniphila (AkkermansiaA. muciniphila) was detected in human feces in 2004. It is defined as a gram-negative, anaerobic, and mucin-degrading microbe belonging to the Verrucomicrobia species. Although the majority of A. muciniphila is found in the human intestinal tract playing a role in the gut microbiome, there are also smaller levels detected in breast milk and oral cavities as well as in the pancreas and appendix.Evidence suggests that having A. muciniphila present in the gut microbiome has positive effects on human health. As a result, A. muciniphila has been shown to have health benefits when taken as a dietary supplementation where it is considered a promising next-generation probiotic. However, the large-scale production of A. muciniphila remains a challenge due to its need for a stable environment. While culturing A. muciniphila in a mucin-based medium is one option, other strategies that use plate-based mediums have also been explored. Currently, both live and pasteurized forms of A. muciniphila are available on the market and shown to have promising outcomes in animal models. Additionally, researchers are investigating various prebiotics to increase the abundance of A. muciniphila in the human gut. This article presents a detailed summary of the phenotypic characteristics of A. muciniphila and its associations with various human health condition illnesses. Finally, the paper explores A. muciniphila's potential as an effective next-generation probiotic.

This paper proposes two fully-automatic machine-extracted linguistic features from an unlimited text input for Mandarin prosody generation. One is the punctuation confidence (PC) which measures the likelihood of inserting a major punctuation mark (PM) at a word boundary. Another is the quotation confidence (QC) which measures the likelihood of a word string to be quoted as a meaningful or emphasized unit in text. Because a major PM in a text is highly correlated with a prosodic break, and a quoted word string plays an important role in human language understanding, the two features potentially could provide useful information for prosody generation. The idea is first realized by employing conditional random field (CRF)-based models to predict major PMs, quoted word string locations, and their associated confidences, i.e., the PC and the QC, for each word boundary. Then, the predicted punctuations and their confidences are combined with traditional contextual linguistic features to predict prosodic-acoustic features. Both objective and subjective tests showed that the prosody generation with the proposed linguistic features performed better than the one without the proposed features. So, the proposed PC and QC are promising features for Mandarin prosody generation.

Since the creation of the first parallel electrical power systems around the world, the rotor angle stability of synchronously operating generators has been one of the most crucial and challenging problems. In modern electricity networks, involving Kazakhstani, where the renewable energy technologies are rapidly penetrating, and the issue of stability takes on even greater importance due to the technical shortcomings of inverter-based generation. In this framework, an analysis of rotor angle transient stability was carried out when replacing existing synchronous generators with doubly fed induction generators under a certain pre-emergency mode. A critical proportion of active power generation by DFIG units was identified at which transient stability can still be maintained due to the sufficient stored kinetic energy of the synchronous machines remaining in operation. In addition, 2 simple solutions were investigated to improve transient stability, such as an increased time of the automatic reclosure operation and the use of special load shedding automation. For the analysis, a real power system of Mangystau region in Kazakhstan was considered, and the PowerWorld software was used.

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions. Having all possible edges amid vertices in a set is a key type of approach to have these notions namely neutrosophic failed-independent number and failed independent neutrosophic-number. Two numbers are obtained but now both settings leads to approach is on demand which is finding biggest set which have all vertices which are neighbors. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then failed independent number I(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously; failed independent neutrosophic-number In(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum neutrosophic cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously. As concluding results, there are some statements, remarks, examples and clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-t-partite-neutrosophic graphs. The clarifications are also presented in both sections “Setting of Neutrosophic Failed-Independent Number,” and “Setting of Failed Independent Neutrosophic-Number,” for introduced results and used classes. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhoods of vertices. In path-neutrosophic graphs, two neighbors, form maximal set but with slightly differences, in cycle-neutrosophic graphs, two neighbors forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of all vertices leads us to neutrosophic failed-independent number and failed independent neutrosophic-number. In star-neutrosophic graphs, a set of vertices containing only center and one other vertex, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices including two vertices from different parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of t vertices from different parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set to extend this set to set of all vertices has key role to have these notions in the form of neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of vertices. The cardinality of a set has eligibility to neutrosophic failed-independent number but the neutrosophic cardinality of a set has eligibility to call failed independent neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connections amid each other, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study chromatic number. Different types of chromatic numbers and neutrosophic chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different types of edges from connectedness in same neutrosophic graphs and in modified neutrosophic graphs to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute types of chromatic numbers. This specific relation amid edges is necessary to compute both types of chromatic number concerning the number of representative in the set of representatives and types of neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no intended edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study chromatic number. vital chromatic number and n-vital chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using vital edge from connectedness to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute vital chromatic number. This specific relation amid edges is necessary to compute both vital chromatic number concerning the number of representative in the set of representatives and n-vital chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no vital edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

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

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

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

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

Flammability was evaluated and the results showed the values of critical flux at extinguishment (CFE) as 49.5kW/㎡ on average, total heat release (Qt) as 0.21MJ on average, and peak heat release rate (Qp) as 0.66kW on average, which satisfied all of the thresholds presented by the IMO. Therefore, flame-retardant plywood, of which the flame-retardant performance was evaluated, was determined to be an applicable finishing material that satisfies fire safety standards.

It is well established the complex exponential and logarithm are multivalued functions, both failing to maintain most identities originally valid over the positive integers domain. Moreover the general case of complex logarithm, with a complex base, is hardly mentionned in mathematic litterature. We study the exponentiation and logarithm as binary operations where all operands are complex. In a redefined complex number system using an extension of the C field, hereafter named E, we prove both operations always produce single value results and maintain the validity of identities such as log_u (w v) = log_u (w) + log_u (v) where u, v, w in E. There is a cost as some algebraic properties of the addition and subtraction will be diminished, though remaining valid to a certain extent. In order to handle formulas in a C and E dual number system, we introduce the notion of set precision and set truncation. We show complex numbers as defined in C are insufficiently precise to grasp all subtleties of some complex operations, as a result multivaluation, identity failures and, in specific cases, wrong results are obtained when computing exclusively in C. A geometric representation of the new complex number system is proposed, in which the complex plane appears as an orthogonal projection, and where the complex logarithm and exponentiation can be simply represented. Finally we attempt an algebraic formalization of E.

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

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

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

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

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

The paper deals with exploration of subsequences of polygonal numbers of different sides derived through step-by-step elimination of terms of the original sequences. Eliminations are based on special rules similarly to how the classic sieve of Eratosthenes was developed through the elimination of multiples of primes. These elementary number theory activities, appropriate for technology-enhanced secondary mathematics education courses, are supported by a spreadsheet, Wolfram Alpha, Maple, and the Online Encyclopedia of Integer Sequences. General formulas for subsequences of polygonal numbers referred to in the paper as polygonal number sieves of order k that include base-two exponential functions of k have been developed. Different problem-solving approaches to the derivation of such and other sieves based on the technology-immune/technology-enabled framework have been used. The accuracy of computations and mathematical reasoning is confirmed through the technique of computational triangulation enabled by using more than one digital tool. A few relevant excerpts from the history of mathematics are briefly featured.

New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be zero-like vertex but now reverse approach is on demand which is finding biggest set which doesn’t force. LetNTG : (V,E,σ,μ) be a neutrosophic graph. Then failed zero-forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximal cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number Zn(NTG) for a neutrosophic graphNTG : (V,E,σ,μ) is maximal neutrosophic cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black afterfinitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing number and failed zero-forcing neutrosophic-number are about a set of vertices which are applied into the setting of neutrosophic graphs. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-neutrosophic graphs are investigated in the terms of maximal set which forms both of failed zero-forcing number and failed zero-forcing neutrosophic-number. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form failed zero-forcing number and failed zero-forcing neutrosophic-number. In path-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices excluding two vertices leads us to failed zero-forcing number and failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only two vertices and containing center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of failed zero-forcing number and failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility to form failed zero-forcing number but the neutrosophic cardinality of a set has eligibility to call failed zero-forcing neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have unique connection together, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

In the paper it is demonstrated that a valid path to a contradiction in complex number theory exists. In the path use is made of Euler’s identity and simple trigonometry. Each step can be easily verified.

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

The Harmonic Graphs Conjecture states that there exists an asymptotic relation involving the Harmonic Index and the natural logarithm as the order of the graph increases. This conjecture, grounded in the novel context of Prime Graphs, draws upon the Prime Number Theorem and the sum of divisors function to unveil a compelling asymptotic connection. By carefully expanding the definitions of the harmonic index and the sum of divisors function, and leveraging the prime number theorem's approximations, we establish a formula that captures this intricate relationship. This work is an effort to contribute to the advancement of graph theory, introducing a fresh lens through which graph connectivity can be explored. The synthesis of prime numbers and graph properties not only deepens our understanding of structural complexity but also paves the way for innovative research directions.

Background: Military pilots show high visuo-spatial skills. Previous studies demonstrate that they are better in mental rotating a target, in taking different perspectives, in estimating distances, in travel planning and in topographic memory. Here, we compared navigational cognitive styles between military pilots and people without flight experience. Pilots were expected to be more survey users than non-pilots, showing higher navigational strategies. Method: 106 jet military pilots of Italian Air Force and 92 non-pilots were enrolled in order to investigate group differences in navigational styles. Participants were asked to perform a reduced version of the Spatial Cognitive Style Test – SCST, consisting of six tasks that allow to distinguish individuals in landmark (people orient themselves by using a figurative memory for environmental objects), route (people use an egocentric representation of the space) and survey (people have a map-like representation of the space) users. Results: In line with our hypothesis, military pilots mainly adopt a survey style, whereas non-pilots mainly adopt the route style. In addition, pilots outperformed non pilots in both the 3D-Rotation task and Map Description Task. Conclusion: Military flight expertise influences some aspects of the spatial ability, leading to enhance human navigation. Although, it must be considered that they are a population whose navigational skills were already high at the time of selection at the academy before formal training began.

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

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

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

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

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

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

A symbolic analysis of Archimedes’ periodical number system is developed, from which a natural link emerges with the modern positional number systems with zero. After the publication of Fibonacci’s Liber Abaci, the decimal Indo-Arabic positional system was the basis of the algorithmic and algebraic trend of modern mathematics, but even if zero plays a crucial role in algebra and mathematical analysis, zeroless positional systems show the same capability of producing efficient arithmetical algorithms based on operation tables over digits. The crucial role of digits is assessed, by considering a representation of numbers based on strings in lexicographic order. A new algorithm for the determination of decimal periods is presented,, by remarking the cruciality of this topic in number theory. Periods of ordinal numbers, and enumerations of recursive enumerability are shortly recalled. Concluding remarks are formulated about the deep relationship among numbers and information, which shed new light on a red line passing through the whole history of mathematics

In this paper, we mainly show that generalized hyperharmonic number sums with reciprocal binomial coefficients can be expressed in terms of classical (alternating) Euler sums, zeta values and generalized (alternating) harmonic numbers.

For offshore wind power generation, accessibility is one of the main factors that has great impact on operation and maintenance due to constraints on weather conditions for marine transportation. This paper presents a framework to explore the accessibility of an offshore site. At first, several maintenance types are defined and taken into account. Next, a data visualization procedure is introduced to provide an insight into the distribution of access periods over time. Then, a rigorous mathematical method based on finite state Markov chain is proposed to assess the accessibility of an offshore site from the maintenance perspective. A five-year weather data of a marine site is used to demonstrate the applicability and the outcomes of the proposed method. The main findings show that the proposed framework is effective in investigating the accessibility for different time scales and is able to catch the patterns of the distribution of the access periods. Moreover, based on the developed Markov chain, the average waiting time for a certain access period can be estimated. With more information on the maintenance of an offshore wind farm, the expected production loss due to time delay can be calculated.

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

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

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

Functional copy number alterations (fCNAs) are DNA copy number changes with concordant differential gene expression. These are less likely to be bystander genetic lesions and could serve as robust and reproducible tumor biomarkers. To identify candidate fCNAs in neuroendocrine tumors (NETs), we integrated chromosomal microarray (CMA) and RNA-seq differential gene expression data from 31 pancreatic (pNET) and 33 small bowel neuroendocrine tumors (sbNET). Tumors were resected from 47 early disease progression (24 months) patients. Candidate fCNAs that accurately differentiated these groups in this discovery cohort were then replicated using fluorescence in situ hybridization (FISH) on formalin-fixed, paraffin-embedded (FFPE) tissues in a larger validation cohort of 60 pNETs and 82 sbNETs (52 early and 65 late disease progression samples). Logistic regression analysis determined the predictive ability of these biomarkers as well as the assay performance metrics of sensitivity, specificity, and area under the curve. Our results indicate that copy number changes at chromosomal loci 4p16.3, 7q31.2, 9p21.3, 17q12, 18q21.2, and 19q12 may be used as diagnostic and prognostic NET biomarkers. This involves a rapid, cost-effective approach to determine primary tumor site for patients with metastatic liver NETs and to guide risk stratified therapeutic decisions.

Boutique hotels emerged in the late 1970s since then the product has become more mainstream. The draw of boutique hotels is more personalized services. When marketing and providing services to a niche market it is smart to be able to differentiate potential guests to best meet their needs. The generational cohort theory states that a population may be divided into segments based on their generation. This research focuses on Generation X to find out what they are seeking in a boutique hotel product. Based upon how they chose their travel destination there were significant differences between culinary experience, attractions/activities, and cost/budget.

Recent evidence has highlighted the critical role of memory cells in maintaining lifelong food allergies, thereby identifying these cells as therapeutic targets. IgG⁺ memory B cells replenish pools of IgE-secreting cells upon allergen exposure, which contract thereafter due to the short lifespan of tightly regulated IgE-expressing cells. Advances in the detection and highly dimensional analysis of allergen-specific B and T cells from allergic patients have provided insight on their phenotype and function. The newly identified Th2A and Tfh13 populations represent a leap in our understanding of allergen-specific T cell phenotypes, though how these populations contribute to IgE memory responses remains poorly understood. Within, we discuss the mechanisms by which memory B and T cells are activated, integrating knowledge from human systems and fundamental research. We then focus on memory reactivation; specifically, on the pathways of secondary IgE responses. Throughout, we identify areas of future research which will help identify immunotargets for a transformative therapy for food allergy.

Paraphrase Generation is one of the most important and challenging tasks in the field of Natural Language Generation. The paraphrasing techniques help to identify or to extract/generate phrases/sentences conveying the similar meaning. The paraphrasing task can be bifurcated into two sub-tasks namely, Paraphrase Identification (PI) and Paraphrase Generation (PG). Most of the existing proposed state-of-the-art systems have the potential to solve only one problem at a time. This paper proposes a light-weight unified model that can simultaneously classify whether given pair of sentences are paraphrases of each other and the model can also generate multiple paraphrases given an input sentence. Paraphrase Generation module aims to generate fluent and semantically similar paraphrases and the Paraphrase Identification systemaims to classify whether sentences pair are paraphrases of each other or not. The proposed approach uses an amalgamation of data sampling or data variety with a granular fine-tuned Text-To-Text Transfer Transformer (T5) model. This paper proposes a unified approach which aims to solve the problems of Paraphrase Identification and generation by using carefully selected data-points and a fine-tuned T5 model. The highlight of this study is that the same light-weight model trained by keeping the objective of Paraphrase Generation can also be used for solving the Paraphrase Identification task. Hence, the proposed system is light-weight in terms of the model’s size along with the data used to train the model which facilitates the quick learning of the model without having to compromise with the results. The proposed system is then evaluated against the popular evaluation metrics like BLEU (BiLingual Evaluation Understudy):, ROUGE (Recall-Oriented Understudy for Gisting Evaluation), METEOR, WER (Word Error Rate), and GLEU (Google-BLEU) for Paraphrase Generation and classification metrics like accuracy, precision, recall and F1-score for Paraphrase Identification system. The proposed model achieves state-of-the-art results on both the tasks of Paraphrase Identification and paraphrase Generation.

EIT-MESHER (https://github.com/EIT-team/Mesher) is C++ software, based on the CGAL library, which generates high quality Finite Element Model tetrahedral meshes from binary masks of 3D volume segmentations. Originally developed for biomedical applications in Electrical Impedance Tomography (EIT) to address the need for custom, non-linear refinement in certain areas (e.g. around electrodes), EIT-MESHER can also be used in other fields where custom FEM refinement is required, such as Diffuse Optical Tomography (DOT).

Standard Model is well-performing under the three-generation, but in the wake of more physics, fourth-generation leptons and quarks are introduced. In this paper, We will be reviewing various constraints surrounding quarks and leptons of 4th Generation and tried to show the importance of quarks to understand the baryogenesis. We talked about, reviewed existing parameters and set the updated lower limits of t’ and b’ by analysis. And predicted an updated version of lower mass bounds quarks and leptons. It is also reviewed that fourth generation leptons are primarily not possible because of disintegration of Higgs Boson and an interpretation has been setup. And in final, we talked about the Unified Standard Model.

Plasma being the fourth and most abundant form of matter extensively exists in the universe in the inter-galactic regions. It provides an electrically neutral medium of unbound negative and positive charged particles, which has been produced by subjecting air and various other gaseous mixtures to strengthen the electromagnetic field and by heating compressed air or inert gasses for creating negative and positive charged particles known as ions. Nowadays, many researchers are paying attention to the formation of artificial Plasma and its potential benefits for mankind. The literature is sparsely populated with the applications of Plasma. This paper presents specific methods of generation and applications of Plasma, which benefits humankind in various fields, such as in electrical, mechanical, chemical and medical fields. These applications include hydrogen production from alcohol, copper bonding, semiconductor processing, surface treatment, Plasma polymerization, coating, Plasma display panels, antenna beam forming, nanotechnology, Plasma Torch, Plasma pencils, low-current non-thermal Plasmatron, treatment of prostate cancer, Plasma source ion implantation, cutting by Plasma, Plasma etching, pollution control, neutralization of liquid radioactive waste, etc. Resultantly, worth of Plasma technology in the medical industry is increasing exponentially that is closing the gap between its benefits and cost of equipment used for generating and controlling it.

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

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

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

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

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

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

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

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

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

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

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

The main objective of this investigation was to study the effect of organizational competencies development practices on turnover intentions and whether affective commitment explains this relationship. Another of the study's objectives was to test whether these relationships vary ac-cording to the generation to which the participant belongs. The study sample consisted of 2123 participants working in Portuguese organizations. The results indicate that organizational com-petencies development practices (training, individualized support, and functional rotation) nega-tively and significantly affect turnover intentions and that affective commitment mediates this re-lationship. However, these relationships vary according to the participant's generation. For Gen-eration Y and Generation X, this mediating effect is found in all dimensions of organizational competencies development practices. For the baby boomer generation, there is only a mediating effect of affective commitment in the relationship between individualized support and turnover intentions. These results indicate that human resources should consider the generation to which the participant belongs when implementing competencies development practices.