Nucleation is a fundamental and general process at the initial stage of first order phase transition. Although various models based on the classical nucleation theory (CNT) have been proposed to explain the energetics and kinetics of nucleation, detailed understanding on nanoscales are still required. Here we focus on homogeneous bubble nucleation, in which evaluation of the size dependence of bubble free energy is the key issue. We propose application of a formula in stochastic thermodynamics, the Jarzynski’s equality, for data analysis of molecular dynamics (MD) simulation to evaluate the free energy of bubble nucleation. As a test case, we performed a series of MD simulations with Lennard-Jones (LJ) fluid system. By applying an external spherical force field to equilibrated LJ liquid, we evaluated the free energy change during bubble growth as the Jarzynski’s ensemble average of required works. A fairly smooth free energy curve was obtained as a function of bubble radius in metastable liquid of mildly negative pressure conditions.

The temporo-spatial theory of consciousness postulates that the brain implements its own inner time and space for conscious processing of outside world. In line with this hypothesis, I present a mechanistic model of mutually connected processes that encode the inner space and time. The model is used to elaborate the binding mechanism between two sets of processes representing the inner space and time, respectively. Further, a stochastic version of the model is developed to investigate the interplay between the binding strength and noise. The spectral entropy is used to characterize the noise effects on the systems of processes when the binding strength is varied. The stochastic modeling results reveal that the spectral entropy values for strongly bound systems have similar entropy values for weakly bound or even decoupled systems. Thus, the analysis performed in this study allows to conclude that the binding mechanism is noise-resilient.

We present a novel method for interpolating univariate time series data. The proposed method combines multi-point fractional Brownian bridges, a genetic algorithm, and Takens’ theorem for reconstructing a phase space from univariate time series data. The basic idea is to first generate a population of different stochastically interpolated time series data, and secondly, to use a genetic algorithm to find the pieces in the population which generate the smoothest reconstructed phase space trajectory. A smooth trajectory curve is hereby found to have a low variance of second derivatives along the curve. For simplicity, we refer to the developed method as PhaSpaSto-interpolation, which is an abbreviation for phase-space-trajectory-smoothing stochastic interpolation. The proposed approach is tested and validated with a univariate time series of the Lorenz system, five non-model data sets and tested against a cubic spline interpolation and a linear linear interpolation. We find that the criterion for smoothness guarantees low errors on known model and non-model data. Finally, we interpolate the discussed non-model data sets, and show the corresponding improved phase space portraits. The proposed method is useful for interpolating low-sampled time series data sets for, e.g., machine learning, regression analysis, or time series prediction approaches.

Breast cancer is the most common cause of death for women worldwide. Thus, the ability of artificial intelligence systems to predict and classify breast cancer is very important. In this paper, a hybrid ensemble method classification mechanism is proposed based on a majority voting mechanism. First, the performance of different state-of-the-art machine learning classification algorithms for the Wisconsin Breast Cancer Dataset (WBCD) were evaluated. The three best classifiers were then selected based on their F3 score. F3 score is used to emphasize the importance of false negatives (recall) in breast cancer classification. Then, these three classifiers, simple logistic Regression learning, stochastic gradient descent learning and multilayer perceptron network, are used for ensemble classification using a voting mechanism. We also evaluated the performance of hard and soft voting mechanism. For hard voting, majority-based voting mechanism was used and for soft voting we used average of probabilities, product of probabilities, maximum of probabilities and minimum of probabilities-based voting methods. The hard voting (majority-based voting) mechanism shows better performance with 99.42% as compared to the state-of-the-art algorithm for WBCD.

This feature study attempts on setting a granules involving mesoscopic matter-aggregation context as a problem of passing locally by the matter-aggregating system from classical stochastic (mesoscopic limit) to a quantum description (nanoscale quantum-size effect limit). A d-dimensional entropy-production aggregation of the granules-involving matter is considered in terms of a (sub)diffusive realization. It turns out that when taking a full d-dimensional pathway of the aggregation toward the nanoscale, one is capable of disclosing a Heisenberg type (diffusional) relation, setting up an upper uncertainty bound for the (sub)diffusive very slow granules-including environment that matches the quantum limit of h/2pm (m– average mass of a granule; h – the Planck’s constant) for the diffusion coefficient of the aggregation, likely first proposed by Fürth in 1933, and qualitatively foreseen by Schrödinger some years before, both in the context of a diffusing particle cluster. The classical-quantum passage uncovered here, also termed insightfully the quantum-size effect (as borrowed from the quantum dots’ parlance), works properly for the three-dimensional (d=3) case, making use of a substantial physical fact that the (nano)granules interact readily via their surfaces with the also granular surroundings in which they are immersed. This natural observation is embodied in the basic averaging construction of the diffusion coefficient of the aggregation of interest. Certain, possibly biomedical, applications of the model can also be viewed by prospective inspection of tiny inhomogeneities in nanofibrillar and/or lamellar matter for which certain numerical realizations are plausible to prepare based on thorough nanoscale experiments.

A controlled ammonia (NH₃) release experiment was performed at a grassland site to quantify the effect of dry deposition, at the field scale between the source and the receptors (NH₃ measurement locations), on the estimates of emission rates by means of inverse dispersion modelling. NH₃ was released for 3 hours at a constant rate of Q = 6.29 mg s⁻¹ from a grid of 36 orifices spread over an area of 250 m². The increase in line-integrated NH₃ concentration was measured with open-path optical miniDOAS devices at different locations downwind of the artificial source. Using a backward Lagrangian stochastic (bLS) dispersion model (bLSmodelR), the fraction of the modelled release rate to the emitted NH₃ (Q_bLS/Q) was calculated from the measurements of the individual instruments. Q_bLS/Q was found to be systematically lower than 1, on average between 0.69 and 0.91, depending on the location of the receptor. We hypothesized that NH₃ dry deposition to grass and soil surfaces was the main factor responsible for the observed depletion of NH₃ between source and receptor. A dry deposition algorithm based on a deposition velocity approach was included in the bLS modelling. Model deposition velocities were evaluated from a ‘big‑leaf’ canopy resistance analogy. Canopy resistances (generally termed Rc) that provided Q_bLS/Q = 1 ranged from 75 to 290 s m⁻¹, showing that surface removal of NH₃ by dry deposition can plausibly explain the original underestimation of Q_bLS/Q. The inclusion of a dry deposition process in dispersion modelling is crucial for emission estimates, which are based on concentration measurements of depositing tracers downwind of homogeneous area sources or heterogeneously distributed hot spots, such as e.g. urine patches on pastures in the case of NH₃.

Historical maps constitute unique sources of retrospective geographic information. Recently, several map archives containing map series covering large spatial and temporal extents have been systematically scanned and made available to the public. The geographic information contained in such data archives allows extending geospatial analysis retrospectively beyond the era of digital cartography. However, given the large data volumes of such archives and the low graphical quality of older map sheets, the processes to extract geographic information need to be automated to the highest degree possible. In order to understand the salient characteristics, data quality variation, and potential challenges in large-scale information extraction tasks, preparatory analytical steps are required to efficiently assess spatio-temporal coverage, approximate map content, and spatial accuracy of such georeferenced map archives across different cartographic scales. Such preparatory steps are often neglected or ignored in the map processing literature but represent highly critical phases that lay the foundation for any subsequent computational analysis and recognition. In this contribution we demonstrate how such preparatory analyses can be conducted using classical analytical and cartographic techniques as well as visual-analytical data mining tools originating from machine learning and data science, exemplified for the United States Geological Survey topographic map and Sanborn fire insurance map archives.

Deterministic-stochastic empirical mode decomposition (EMD) is used to obtain low-frequency (non-diffusive, i.e., background velocity) and high-frequency (diffusive, i.e., eddies) components from a Lagrangian drifter‘s trajectory. Eddy characteristics are determined from the time series of eddy trajectories from individual Lagrangian drifter such as the eddy radial scale, eddy velocity scale, eddy Rossby number, and eddy-background kinetic energy ratio. A long-term dataset of the SOund Fixing And Ranging float time series obtained near the California coast by the Naval Postgraduate School from 1992 to 2004 at depth between 150 and 600 m (http://www.oc.nps.edu/npsRAFOS/) is used as an example to demonstrate the capability of the deterministic-stochastic EMD.

Long-range interactions are relevant for a large variety of quantum systems in quantum optics and condensed matter physics. In particular, the control of quantum-optical platforms promises to gain deep insights in quantum-critical properties induced by the long-range nature of interactions. From a theoretical perspective, long-range interactions are notoriously complicated to treat. Here, we give an overview of recent advancements to investigate quantum magnets with long-range interactions focusing on two techniques based on Monte Carlo integration. First, the method of perturbative continuous unitary transformations where classical Monte Carlo integration is applied within the embedding scheme of white graphs. This linked-cluster expansion allows to extract high-order series expansions of energies and observables in the thermodynamic limit. Second, stochastic series expansion quantum Monte Carlo which enables calculations on large finite systems. Finite-size scaling can then be used to determine physical properties of the infinite system. In recent years, both techniques have been applied successfully to one- and two-dimensional quantum magnets involving long-range Ising, XY, and Heisenberg interactions on various bipartite and non-bipartite lattices. Here, we summarise the obtained quantum-critical properties including critical exponents for all these systems in a coherent way. Further, we review how long-range interactions are used to study quantum phase transitions above the upper critical dimension and the scaling techniques to extract these quantum critical properties from the numerical calculations.

We investigate some information properties of consecutive k-out-of-n:G systems in light of fractional generalized cumulative residual entropy. We firstly derive a formula to compute fractional generalized cumulative residual entropy related to the system's lifetime and explore its preservation properties in terms of established stochastic orders. Additionally, we obtain useful bounds. To aid practical applications, we propose two non parametric estimators for the fractional generalized cumulative residual entropy in these systems. The efficiency and performance of these estimators are illustrated using simulated and real datasets.

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

For evaluating probabilities of arbitrary random events with respect to a given multivariate probability distribution, specific techniques are of great interest. An important two-dimensional high risk limit law is the Gauss-exponential distribution whose probabilities can be dealt with based upon the Gauss-Laplace law. The latter will be considered here as an element of the newly introduced family of (p,q)-spherical distributions. Based upon a suitably defined non-Euclidean arc-length measure on (p,q)-circles we prove geometric and stochastic representations of these distributions and correspondingly distributed random vectors, respectively. These representations allow dealing with the new probability measures similarly like with elliptically contoured distributions and more general homogeneous star-shaped ones. This is demonstrated at hand of a generalization of the Box-Muller simulation method. En passant, we prove an extension of the sector and circle number functions.

A single Information security is of pivotal concern for consistently streaming information over the widespread internetwork. The bottleneck flow of incoming and outgoing data traffic introduces the issue of malicious activities taken place by intruders, hackers and attackers in the form of authenticity desecration, gridlocking data traffic, vandalizing data and crashing the established network. The issue of emerging suspicious activities is managed by the domain of Intrusion Detection Systems (IDS). The IDS consistently monitors the network for identifica-tion of suspicious activities and generates alarm and indication in presence of malicious threats and worms. The performance of IDS is improved by using different signature based machine learning algorithms. In this paper, the performance of IDS model is determined using hybridization of nestrov-accelerated adaptive moment estimation –stochastic gradient descent (HNADAM-SDG) algorithm. The performance of the algorithm is compared with other classi-fication algorithms as logistic regression, ridge classifier and ensemble algorithm by adapting feature selection and optimization techniques