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.

A challenge in building large-scale superconducting quantum processors is the precise control and manipulation of the qubit state. However, the crosstalk between the microwave control lines impedes the parallel execution of high-fidelity digital and analog quantum operations. Here, we propose and demonstrate a universal compensation protocol for calibrating the microwave signal crosstalk. We also introduce amplified error sequences to optimize the accuracy. Furthermore, we show a definitive improvement in parallel gate operations with crosstalk cancellation, demonstrating the technique's effectiveness. This work paves the way for superconducting hardware that features automated calibration of microwave crosstalk, leading to enhanced fidelities in multiqubit circuits.

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.

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.

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

The rapid advancements and the merging of hybrid quantum-classical computing, artificial intelligence (AI), machine learning (ML), and deep learning (DL) pose a potentially unseen and significant threat to encryption that may impact Post-Quantum Cryptography (PQC) transition timelines. There is a direct hybrid quantum-classical computing threat on cryptography, and there is also a direct threat AI/ML on cryptography. However, the synergistic combination of these technologies presents known and unknown threats that need attention, focus action, and research. This paper reviews Grover's Adaptive Search (GAS), which combines Grover's Algorithm with adaptive techniques to optimize search further, potentially making it even more efficient for attacking encryption. This work also examines the quantum-accelerated Harrow-Hassidim-Lloyd (HHL) Algorithm, designed to solve systems of linear equations exponentially faster than classical algorithms in certain conditions. The HHL algorithm can solve some lattice-based problems, which have implications for lattice-based encryption. This technological confluence and its potential impact on cryptography and encryption necessitate a proactive and coordinated approach to developing and implementing quantum-resistant AI/ML cryptographic solutions. This paper reviews the technological confluence and its potential implications for classical cryptography and PQC transition timelines and calls for further research.

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.

We study Einstein's gravity coupled to nonlinear electrodynamics with two parameters in Anti-de Sitter spacetime. Magnetically charged black holes in an extended phase space is investigated. We obtain the mass and metric functions, their asymptotic and corrections to the Reissner--Nordstr\"{o}m metric function when the cosmological constant vanishes. The first law of black hole thermodynamics in extended phase space is formulated and the magnetic potential and the thermodynamic conjugate to the coupling are obtained. We proved the generalized Smarr relation. The heat capacity and the Gibbs free energy are computed and phase transitions are studied. It was shown that the electric field of charged objects at the origin and electrostatic self-energy are finite within the nonlinear electrodynamics proposed.

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.

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

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.

Quantum computing (QC) has opened the door to advancements in machine learning (ML) tasks that are currently implemented in the classical domain. Convolutional neural networks (CNNs) are classical ML architectures that exploit data locality and possess a simpler structure than fully-connected multi-layer perceptrons (MLPs) without compromising the accuracy of classification. However, the concept of preserving data locality is usually overlooked in the existing quantum counterparts of CNNs, particularly for extracting multi-features in multidimensional data. In this paper, we present a multidimensional quantum convolutional classifier (MQCC) that performs multidimensional and multi-feature quantum convolution with average and Euclidean pooling and thus adapting the CNN structure to a variational quantum algorithm (VQA). Average pooling is based on the quantum Haar transform (QHT) and Euclidean pooling is based on partial quantum measurement. The experimental work was conducted using multidimensional data to validate the correctness and demonstrate the scalability of the proposed method utilizing both noisy and noise-free quantum simulations. We evaluated the MQCC model with reference to reported work on state-of-the-art quantum simulators from IBM Quantum and Xanadu using a variety of standard ML datasets. The experimental results showed favorable characteristics of our proposed techniques compared to existing work with respect to a number of quantitative metrics such as the number of training parameters, cross-entropy loss, classification accuracy, circuit depth, and quantum gate count.

In this study, based on a new quantum integral identity, the authors establish some quantum estimates of Hermite-Hadamard type inequalities for convex functions. These results generalize and improve some known results given in literatures.

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.

Quantum correlations, especially time correlations, are crucial in ghost imaging in order to significantly reduce the background noise on the one hand while increasing the imaging resolution. Moreover, the time correlations serve as a critical reference, distinguishing between signal and noise, which in turn enable clear visualization of biological samples. Quantum imaging also addresses the challenge involved in imaging delicate biological structures with minimal photon exposure and sample damage. Here we explore the recent progress in quantum correlation-based imaging, notably its impact on secure imaging and remote sensing protocols as well as on biological imaging. We also exploit the quantum characteristics of heralded single-photon sources (HSPS) combined with decoy-state methods for secure imaging. This method uses Quantum Key Distribution (QKD) principles to reduce measurement uncertainties and protect data integrity. It is highly effective in low-photon-number regimes for producing high-quality, noise-reduced images. The versatility of decoy-state methods with WCSs (WCS) is also discussed, highlighting their suitability for scenarios requiring higher photon numbers. We emphasize the dual advantages of these techniques: improving image quality through noise reduction and enhancing data security with quantum encryption, suggesting significant potential for quantum imaging in various applications, from delicate biological imaging to secure quantum communication.

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 concept of out-of-time-ordered correlation (OTOC) function is treated as a very strong theoretical probe of quantum randomness, using which one can study both chaotic and non-chaotic phenomena in the context of quantum statistical mechanics. In this paper, we define a general class of OTOC, which can perfectly capture quantum randomness phenomena in a better way. Further we demonstrate an equivalent formalism of computation using a general time independent Hamiltonian having well defined eigenstate representation for integrable supersymmetric quantum systems. We found that one needs to consider two new correlators apart from the usual one to have a complete quantum description. To visualize the impact of the given formalism we consider the two well known models viz. Harmonic Oscillator and one dimensional potential well within the framework of supersymmetry. For the Harmonic Oscillator case we obtain similar periodic time dependence but dissimilar parameter dependences compared to the results obtained from both microcanonical and canonical ensembles in quantum mechanics without supersymmetry. On the other hand, for one dimensional potential well problem we found significantly different time scale and the other parameter dependence compared to the results obtained from non-supersymmetric quantum mechanics. Finally, to establish the consistency of the prescribed formalism in the classical limit, we demonstrate the phase space averaged version of the classical version of OTOCs from a model independent Hamiltonian along with the previously mentioned these well cited models.

We introduce optically clear and resilient free-form micro-optical of pure (non-photosensitized) organic-inorganic SZ2080 material made by femtosecond 3D laser lithography (3DLL). This is advantageous for rapid printing of 3D micro-/nanooptics, including their integration directly onto optical fibers. A systematic study on the fabrication peculiarities and quality of resultant structures is performed. Comparison of microlenses’ resiliency to CW and femtosecond pulsed exposure is determined. Experimental results prove that pure SZ2080 is ∼3 fold more resistant to high irradiance as compared with a standard photo-sensitized material and can sustain up to 1.91 GW/cm² intensity. 3DLL is a promising manufacturing approach for high-intensity micro-optics for emerging fields in astro-photonics and atto-second pulse generation. Additionally, pyrolysis is employed to shrink structures up to 40% by removing organic SZ2080 constituents. This opens a promising route towards downscaling photonic lattices and creation of mechanically robust glass-ceramic structures.

In recent years, advancements in brain science and neuroscience have significantly influenced the field of computer science, particularly in the domain of reinforcement learning (RL). Drawing insights from neurobiology and neuropsychology, researchers have leveraged these findings to develop novel mechanisms for understanding intelligent decision-making processes in the brain. Concurrently, the emergence of quantum computing has opened new frontiers in artificial intelligence, leading to the development of quantum machine learning (QML). This study introduces a novel model that integrates Quantum Spiking Neural Networks (QSNN) and Quantum Long Short-Term Memory (QLSTM) architectures, inspired by the complex workings of the human brain. Specifically designed for reinforcement learning tasks in energy-efficient environments, our approach progresses through two distinct stages mirroring sensory and memory systems. In the initial stage, analogous to the brain’s hypothalamus, low-level information is extracted to emulate sensory data processing patterns. Subsequently, resembling the hippocampus, this information is processed at a higher level, capturing and memorizing correlated patterns. We conduct a comparative analysis of our model against existing quantum models such as Quantum Neural Networks and their classical counterparts, elucidating its unique contributions. Through empirical results, we aim to underscore the effectiveness of our approach in optimizing energy consumption in practical scenarios.

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.

RNA transcripts play a crucial role as witnesses of gene expression health. Identifying disruptive short sequences in RNA transcription and regulation is essential for potentially treating diseases. Let’s delve into the mathematical intricacies of these sequences. We’ve previously devised a mathematical approach for defining a “healthy” sequence (10.14218/GE.2023.00079). This sequence is characterized by having at most four distinct nucleotides (denoted as nt≤4). It serves as the generator of a group denoted as fp. The desired properties of this sequence are as follows: fp should be close to a free group of rank nt−1, it must be aperiodic, fp should not have isolated singularities within its SL2(C) character variety (specifically within the corresponding Groebner basis). Now, let’s explore the concept of singularities. There are cubic surfaces associated with the character variety of a four-punctured sphere denoted as S24. When we encounter these singularities, we find ourselves dealing with some algebraic solutions of a dynamical second-order differential (and transcendental) equation known as the Painlevé VI equation (10.3390/dynamics4010001). In certain cases, S24 degenerates, in the sense that two punctures collapse, resulting in a “wild” dynamics governed by the Painlevé equations of an index lower than VI. In our paper, we provide examples of these fascinating mathematical structures within the context of miRNAs. Specifically, we find a clear relationship between decorated character varieties of Painlevé equations and the character variety calculated from the seed of oncomirs. These findings should find applications in cancer research.

This paper draws upon the theory of turbulence in physics to explore the similarities and differences between volatility in financial markets and turbulent phenomena at a statistical physics level. By analogizing the dynamics of financial markets with fluid turbulence, we have developed an innovative analytical framework aimed at deepening the understanding of the complexity inherent in financial markets. Our research methodology includes a comparative analysis of simulated time series data for the Standard & Poor's 500 Index and fully developed turbulent velocity time series. We focus on the similarities in key statistical physical properties, including probability distributions, correlation structures, and power spectral densities. Furthermore, we have established a model of capital flow in financial markets and proposed corresponding solutions. Through computational simulations and data analysis, we find that while financial market volatility shares some statistical characteristics with turbulent phenomena, significant differences exist in the shapes of probability distributions and the temporal scales of correlations. This suggests that although financial markets exhibit patterns akin to turbulence, the behavior of this complex, multi-variable driven system does not completely correspond to natural turbulence, highlighting the limitations of directly applying turbulence theory to financial market analysis. Our study offers a new perspective for the theories of financial markets and the field of econophysics, providing fresh insights into the complexity of financial markets and contributing to the prevention and management of financial risk.

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.

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

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.

Here we will electrically-quantum model the neutron and proton as a three-phase alternating current electric generator, for this, we will use the theory of three-phase electric generators and vector or phasor diagrams. We will use this model to hypothesize how the quarks that form neutrons and protons with a combined mass of 10 MeV/c², can generate, through quarks-antiquarks-gluon interactions, a mass of 939.56 MeV/c² for the neutron and a mass of 938.27 MeV/c² for the proton. Using quantum mechanics and the theory of the generalization of the Boltzmann constant in curved space-time we will calculate the number of quarks-antiquarks-gluons and gravitons inside a neutron. We will also analyse βˉ decay using vector diagrams, we will calculate the tension of the string T₀ and the length of the string ℓs between quarks-antiquark and finally, we will model a black hole using a neutron equivalent model. In version 2 of this article, we will update the vector diagrams of the βˉ decay and theoretically calculate the energy of the W⁻ boson, the Z⁰ boson, and the Θ angle, Θ = arc cos (W⁻/Z⁰). We will demonstrate, through vector diagrams, that quarks-antiquarks-gluon interactions are the cause of the origin of the W⁻ boson and the Z⁰ boson. We will also demonstrate how the fine structure constant α originates. It is important to make clear, in future updates, we will describe the relationship that exists between the theory described in this paper and the Isospin theory, flavour and colour theory

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.

1) We shall discuss what modern interpretations say about the Heisenberg's uncertainties. These interpretations explain that a quantity begins to 'lose' meaning when a conjugate property begins to 'acquire' definite meaning. We know that a quantity losing meaning means that it has no fixed value and has an uncertainty . In this paper we look deeper into this interpretation and the outcome reveals more evidence of the quantity losing meaning. Newer insights appear. 2) We consider two extreme cases of hypothetical processes nature undergoes, without interference by a measurement: One, a system collapses to an energy eigenstate under the influence of a Hamiltonian instantaneously at a time $t$. This is thus what would happen if we would measure the system's energy. Next, when a particle becomes localised to a point at a time $t_0$ under the influence of a Hamiltonian. This is thus what would happen if we would measure the system's position. We shall prove that both these situations cannot arise under ordinary circumstances and thus measurement processes cannot be modelled by physical Hamiltonians.

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.

Huperzine A is an herbal reversible inhibitor of Acetylcholinesterase (AChE). A molecular docking analysis on Huperzine A molecule has been carried out to understand its structure, conformational flexibility, intermolecular interaction and the binding affinity in the active site of AChE enzyme. Further, the charge density distribution of huperzine A molecule (lifted from the active site of AChE) was determined from the high level quantum chemical calculations coupled with charge density analysis. The binding affinity of Huperzine A towards AChE was calculated from the molecular docking; the lowest docked energy is -8.46 kcal/mol. In the active site, huperzine A molecule interacts with acyl binding pocket-Phe330 of AChE, that is, the bicyclo ring group of huperzine A forms an intermolecular interaction with the oxygen atom of main chain of the amino acid residue Phe330 at the distances 3.02 and 3.25 Å respectively. On the other hand, a gas phase study on huperzine A molecule also performed using HF and DFT (B3LYP) methods with the basis set 6-311G**. The molecular structure, conformation, and the charge density distribution of huperzine A molecule in the gas phase have determined using quantum chemical calculations and the charge density analysis. The comparative studies between the gas phase and the active site forms of huperzine A molecule, explicitly reveals the degree of conformational modification and the charge density redistribution of huperzine A when present in the active site. The dipole moment of the molecule in the active site is 6.85 D, which is slightly higher than its gas phase value (5.91 D). The electrostatic potential (ESP) surface of active site molecule clearly shows the strong electronegative and positive ESP regions of the molecule, which are the expected strong reactive locations of the molecule.

Every finite simple group P can be generated by two of its elements. Pairs of generators forP are available in the Atlas of finite group representations as (not necessarily minimal) permutation representations P . It is unusual but significant to recognize that a P is a Grothendieck’s dessin d’enfant D and that a wealth of standard graphs and finite geometries G - such as near polygons and their generalizations - are stabilized by a D. In our paper, tripods P − D − G of rank larger than two,corresponding to simple groups, are organized into classes, e.g. symplectic, unitary, sporadic, etc (as in the Atlas). An exhaustive search and characterization of non-trivial point-line configurationsdefined from small index representations of simple groups is performed, with the goal to recognize their quantum physical significance. All the defined geometries G's have a contextuality parameterclose to its maximal value 1.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

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.

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

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.

We discuss the fate of the correspondence principle beyond quantum mechanics, specifically in quantum field theory and quantum gravity, in connection with the intrinsic limitations of the human ability to observe the external world. We conclude that the best correspondence principle is made of unitarity, locality, proper renormalizability (a refinement of strict renormalizability), combined with fundamental local symmetries and the requirement of having a finite number of fields. Quantum gravity is identified in an essentially unique way. The gauge interactions are uniquely identified in form. Instead, the matter sector remains basically unrestricted. The major prediction is the violation of causality at small distances.

In this paper we will show that standard physics to a large degree consists of derivatives of a deeper reality. This means standard physics is both overly complex and also incomplete. Modern physics has typically started from working with first understanding the surface of the world, that is typically the macroscopic world, and then forming theories about the atomic and subatomic world. And we did not have much of a choice, as the subatomic world is very hard to observe directly, if not impossible to observe directly at the deepest level. Despite the enormous success of modern physics, it is therefore no big surprise that we at some point have possibly taken a step in the wrong direction. We will claim that one such step came when one thought that the de Broglie wavelength represented a real matter wavelength. We will claim that the Compton wavelength is the real matter wavelength. Based on such a view we will see that many equations in modern physics are only derivatives of much simpler relations. Second, we will claim that in today’s physics one uses two different mass definitions, one mass definition that is complete or at least more complete, embedded in gravity equations without being aware of it, as it is concealed in GM, and the standard, but incomplete, kg mass definition in non-gravitational physics. First, when this is understood, and one uses the more complete mass definition that is embedded in gravity physics, not only in gravity physics, but in all of physics, then one has a chance to unify gravity and quantum mechanics. Our new theory shows that most physical phenomena when observed over a very short timescale are probabilistic for masses smaller than a Planck mass and dominated by determinism at or above Planck mass size. Our findings have many implications. For example, we show that the Heisenberg uncertainty principle is rooted in a foundation not valid for rest-mass particles, so the Heisenberg uncertainty principle can say nothing about rest-masses. When re-formulated based on a foundation compatible with a new momentum that is also compatible with rest-masses, we obtain a re-defined Heisenberg principle that seems to become a certainty principle in the special case of a Planck mass particle. Furthermore, we show that the Planck mass particle is linked to gravity and that we can easily detect the Planck scale from gravity observations. The Planck mass particle is unique as it only lasts the Planck time, and in that very short time period it can only be observed directly from itself, and it therefore closely linked to absolute rest.

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.

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.

We investigate a possible reduction mechanism from (bosonic) Quantum Field Theory (QFT) to Quantum Mechanics (QM), in a way that could explain the apparent loss of degrees of freedom of the original theory in terms of quantum information in the reduced one. This reduction mechanism consists mainly in performing an ansatz on the boson field operator, which takes into account quantum foam and non-commutative geometry. Through the reduction mechanism, QFT reveals its hidden internal structure, which is a quantum network of maximally entangled multipartite states. In the end, a new approach to the quantum simulation of QFT is proposed through the use of QFT's internal quantum network

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.

This paper gives both a general canonical quantum gravity theory and the general canonical quantum gravity theories of the Universe and general black hole, and discovers the relations reflecting symmetric properties of the standard nonlinear gravitational Lagrangian, which are not relevant to any concrete metric models. This paper concretely shows the general commutation relations of the general gravitational field operators and their zeroth, first, second and third style, respectively, of high order canonical momentum operators for the general nonlinear system of the standard gravitational Lagrangian, and then has finished all the four styles of the canonical quantization of the standard gravity.

“For me then this is the real problem with quantum theory: the apparently essential conflict between any sharp formulation and fundamental relativity. That is to say, we have an apparent incompatibility, at the deepest level, between the two fundamental pillars of contemporary theory...” J. S. Bell (2004, p. 171) The inability to delineate a unified physical ontology that accounts simultaneously for the laws of special relativity and the results of quantum experiments has been a defining problem in physics for more than 100 years. Although various primitive ontologies (including Bohmian pilot wave, spontaneous collapse, and objective collapse theories) along with wave function realism ontologies, many-worlds interpretations, and multi-field theories address the tension between special relativity and quantum mechanics, none has successfully resolved it. This analysis addresses the problem by positing an ontic, mixed ontology composed of a “discrete” 4D spacetime and a physical, ultra-high dimensional (3 x N) “Planck Space.” Together, Planck Space and the three spatial dimensions of 4D spacetime form a tightly integrated ((3 x N) + 3) hyperspace (the “Dual Ontology”). 4D spacetime’s three spatial dimensions and the N dimensions of Planck Space are composed of two substructures: discrete, three-dimensional, quantized units of space ("Planck Spheres") and an ontic State of Absolute Nothingness (the "SOAN") whose sole physical characteristic is onticness. Critically, the Dual Ontology’s structure replaces 1) the continuous, differentiable manifold of 4D spacetime with a discrete 4D spacetime and 2) mathematical 3N configuration spaces with a physical (3 x N) Planck Space. Moreover, structurally and dynamically, the Dual Ontology is predicated on the one-to-one mapping and identity between the Planck Spheres that simultaneously form 4D spacetime and Planck Space. The one-to-one mapping and identity physically and theoretically support an integrated quantum dynamics based upon the dynamic evolution of single and N-body quantum states in 4D spacetime in full compliance with the laws of special relativity and the instantaneous collapse of all quantum states in an ontic Planck Space, where special and general relativity and more generally, 4D spacetime’s laws of physics, do not apply.

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.

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

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

In this paper, the connections between quantum non-locality and permutation symmetries are explored. This includes two types of symmetries: permutation across a superposition and permutation of qubits in a quantum system. An algorithm is proposed for nding the separability class of a quantum state using a method based on factorizing an arbitrary multipartite state into possible partitions, cyclically permuting qubits of the vectors in a superposition to check which separability class it falls into and thereafter using a reduced density-matrix analysis of the system is proposed. For the case of mixed quantum states, conditions for separability are found in terms of the partial transposition of the density matrices of the quantum system. One of these conditions turns out to be the Partial Positive Transpose (PPT) condition. A graphical method for analyzing separability is also proposed. The concept of permutation of qubits is shown to be useful in de ning a new entanglement measure in the `engle'.

We present a model of space that considers it to be a quantized dynamical entity which is a component of the universe along with matter and radiation. The theory is used together with thermodynamic data to provide a new view of cosmic evolution and an insight into the nature of dark energy and dark matter. Space is made up of energy quanta. The universe started from an atomic size volume at very high temperature and pressure near the Planck epoch. Upon expansion and cooling, phase transitions occurred resulting in the formation of radiation, fundamental particles, and matter. These nucleate and grow into stars, galaxies, and clusters. From a phase diagram of cosmic composition, we obtained a correlation between dark energy and the energy of space. Using the Friedmann equations, data from WMAP studies of the composition of the universe at 3.0 x 10⁵ (a=5.25 x 10^-2) years and at present (a=1), are well fitted by our model with an equation of state parameter, w= -0.7. The accelerated expansion of the universe, starting at about 7 billion years, determined by BOSS measurements, also correlates well with the dominance of dark energy at 7.25 x 10⁹ years ( a= 0.65). The expansion can be attributed to Quintessence with a space force arising from a quantum space field. From our phase diagram, we also find a correlation suggesting that dark matter is a plasma form of matter similar to that which existed during the photon epoch immediately prior to recombination. Our Quantum Space Model leads to a universe which is homogeneous and isotropic without the need for inflation. The thermodynamics of expansion is consistent with BOSS data that show the process to be adiabatic and the rate of expansion decelerating during the first 6 billion years after the Big Bang. However, it became non-adiabatic and accelerating thereafter. This implies an influx of energy from a source outside the universe; it warrants consideration as a possible factor in the accelerated expansion of the universe.

The paper considers the symmetries of a bit of information corresponding to one, two or three qubits of quantum information and identifiable as the three basic symmetries of the Standard model, U(1), SU(2), and SU(3) accordingly. They refer to “empty qubits” (or the free variable of quantum information), i.e. those in which no point is chosen (recorded). The choice of a certain point violates those symmetries. It can be represented furthermore as the choice of a privileged reference frame (e.g. that of the Big Bang), which can be described exhaustively by means of 16 numbers (4 for position, 4 for velocity, and 8 for acceleration) independently of time, but in space-time continuum, and still one, 17th number is necessary for the mass of rest of the observer in it. The same 17 numbers describing exhaustively a privileged reference frame thus granted to be “zero”, respectively a certain violation of all the three symmetries of the Standard model or the “record” in a qubit in general, can be represented as 17 elementary wave functions (or classes of wave functions) after the bijection of natural and transfinite natural (ordinal) numbers in Hilbert arithmetic and further identified as those corresponding to the 17 elementary of particles of the Standard model. Two generalizations of the relevant concepts of general relativity are introduced: (1) “discrete reference frame” to the class of all arbitrarily accelerated reference frame constituting a smooth manifold; (2) a still more general principle of relativity to the general principle of relativity, and meaning the conservation of quantum information as to all discrete reference frames as to the smooth manifold of all reference frames of general relativity. Then, the bijective transition from an accelerated reference frame to the 17 elementary wave functions of the Standard model can be interpreted by the still more general principle of relativity as the equivalent redescription of a privileged reference frame: smooth into a discrete one. The conservation of quantum information related to the generalization of the concept of reference frame can be interpreted as restoring the concept of the ether, an absolutely immovable medium and reference frame in Newtonian mechanics, to which the relative motion can be interpreted as an absolute one, or logically: the relations, as properties. The new ether is to consist of qubits (or quantum information). One can track the conceptual pathway of the “ether” from Newtonian mechanics via special relativity, via general relativity, via quantum mechanics to the theory of quantum information (or “quantum mechanics and information”). The identification of entanglement and gravity can be considered also as a ‘byproduct” implied by the transition from the smooth “ether of special and general relativity’ to the “flat” ether of quantum mechanics and information. The qubit ether is out of the “temporal screen” in general and is depicted on it as both matter and energy, both dark and visible.

A new framework in quantum chemistry has been proposed recently ("An approach to first principles electronic structure calculation by symbolic-numeric computation'' by A. Kikuchi). It is based on the modern technique of computational algebraic geometry, viz. the symbolic computation of polynomial systems. Although this framework belongs to molecular orbital theory, it fully adopts the symbolic method. The analytic integrals in the secular equations are approximated by the polynomials. The indeterminate variables of polynomials represent the wave-functions and other parameters for the optimization, such as atomic positions and contraction coefficients of atomic orbitals. Then the symbolic computation digests and decomposes the polynomials into a tame form of the set of equations, to which numerical computations are easily applied. The key technique is Grröbner basis theory, by which one can investigate the electronic structure by unraveling the entangled relations of the involved variables. In this article, at first, we demonstrate the featured result of this new theory. Next, we expound the mathematical basics concerning computational algebraic geometry, which are necessitated in our study. We will see how highly abstract ideas of polynomial algebra would be applied to the solution of the definite problems in quantum mechanics. We solve simple problems in "quantum chemistry in algebraic variety'' by means of algebraic approach. Finally, we review several topics related to polynomial computation, whereby we shall have an outlook for the future direction of the research.

Quantum chaos is presented as a paradigm of information processing by dynamical systems at the bottom of the range of phase-space scales. Starting with a brief review of classical chaos as entropy flow from micro- to macro-scales, I argue that quantum chaos came as an indispensable rectification, removing inconsistencies related to entropy in classical chaos: Bottom-up information currents require an inexhaustible entropy production and a diverging information density in phase space, reminiscent of Gibbs' paradox in Statistical Mechanics. It is shown how a mere discretization of the state space of classical models already entails phenomena similar to hallmarks of quantum chaos, and how the unitary time evolution in a closed system directly implies the “quantum death” of classical chaos. As complementary evidence, I discuss quantum chaos under continuous measurement. Here, the two-way exchange of information with a macroscopic apparatus opens an inexhaustible source of entropy and lifts the limitations implied by unitary quantum dynamics in closed systems. The infiltration of fresh entropy restores permanent chaotic dynamics in observed quantum systems. Could other instances of stochasticity in quantum mechanics be interpreted in a similar guise? Where observed quantum systems generate randomness, that is, produce entropy without discernible source, could it have infiltrated from the macroscopic meter? This speculation is worked out for the case of spin measurement.

In this work, we present some results related with the issue of the Loop Quantum Black Holes (LQBH) thermodynamics by the use of the tunneling radiation formalism. The information loss paradox is also discussed in this context, where we have considered the influence of back reaction effects.

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.

This research focuses on exploring generalized electron emissions in one-dimensional conducting materials, specifically examining field emission and thermionic emission. Additionally, the study investigates one-dimensional thermal radiation. The current density is derived for both one-dimensional thermionic emission and one-dimensional field emission. A generalized current density in one dimension is devised, taking into account arbitrary accelerating fields and temperature conditions. The formula for the one-dimensional current density is depicted with accelerating field and temperature across various work function materials. The current is also represented as a function of both temperature and electric field for various temperatures.

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.

In this study, we address the formidable challenge of solving large-scale Max-Cut problems (MCP). We introduce a rapid computational procedure utilizing a hybrid 1-flip/r-flip local search heuristic. This innovative strategy significantly reduces the computational time required for MCP problems while consistently generating solutions of exceptional quality. The paper presents substantial computational insights, showcasing the effectiveness of our approach on very-large-scale Max-Cut instances with varying densities. Our proposed heuristic is rigorously evaluated by comparing its performance against a quantum annealing solver, leveraging a multi-start Tabu Search framework. The results underscore the potency of this unique combination as an efficient and effective solution for large-scale QUBO problems. Notably, our hybrid heuristic consistently delivers high-quality solutions within the stringent CPU time limits of 600 seconds, demonstrating its efficacy across Max-Cut instances ranging from 10,000 to 40,000 variables. This research contributes to advancing the state-of-the-art in large-scale QUBO problem-solving, offering a powerful and time-efficient approach with broad applicability.

We derive a quantum speed limit for unitary evolution for the case of mixed quantum states using the stronger uncertainty relation for mixed quantum states. This bound can be optimized over different choices of Hermitian operators for a better bound. We illustrate this with some examples and show its better performance with respect to three existing bounds for mixed quantum states.

There is a formal analogy between the evolution of the universe, when this is seen as a trajectory in the minisuperspace, and the worldline followed by a test particle in a curved spacetime. The analogy can be extended to the quantum realm, where the trajectories are transformed into wave packets that give us the probability of finding the universe or the particle in a given point of their respective spaces: the spacetime in the case of the particle and the minisuperspace in the case of the universe. The wave function of the spacetime and the matter fields, all together, can then be seen as a super-field that propagates in the minisuperspace and the so-called third quantisation procedure can be applied in a parallel way as the second quantisation procedure is performed with a matter field that propagates in the spacetime. The super-field can thus be interpreted as made up of universes propagating, i.e. evolving, in the minisuperspace. The analogy can also be used in the opposite direction. The way in which the semiclassical state of the universe is obtained in quantum cosmology allows us to obtain, from the quantum state of a field that propagates in the spacetime, the geodesics of the underlying spacetime as well as their quantum uncertainties or dispersions. This might settle a new starting point for a different quantisation of the spacetime.

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.

Quantum computing is tipped to lead the future of global technological progress. However, the obstacles related to quantum software development are an actual challenge to overcome. In this scenario, this work presents an implementation of the quantum search algorithm in Atos Quantum Assembly Language (AQASM) using the quantum software stack my Quantum Learning Machine (myQLM). We present the creation of a virtual quantum processor whose configurable architecture allows the analysis of induced quantum noise effects on the quantum algorithms. The codes are available throughout the manuscript so that readers can replicate them and apply the methods discussed in this article to solve their own quantum computing projects. The presented results are consistent with theoretical predictions and demonstrate that AQASM and myQLM are powerful tools for building, implementing, and simulating quantum hardware.

We study the performance of a classical and quantum magnetic Otto cycle with a quantum dot as a working substance using the Fock-Darwin model with the inclusion of the Zeeman interaction. Modulating an external/perpendicular magnetic field, we found in the classical approach an oscillating behavior in the total work that is not perceptible under the quantum formulation. Also, we compare the work and efficiency of this system for different regions of the Entropy, $S(T,B)$, diagram where we found that the quantum version of this engine always shows a reduced performance in comparison to his classical counterpart.

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.