222 resultados para Random processes
Resumo:
We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.
Resumo:
We propose robust and scalable processes for the fabrication of floating gate devices using ordered arrays of 7 nm size gold nanoparticles as charge storage nodes. The proposed strategy can be readily adapted for fabricating next generation (sub-20 nm node) non-volatile memory devices.
Resumo:
An attempt has been made to describe the glass forming ability (GFA) of liquid alloys, using the concepts of the short range order (SRO) and middle range order (MRO) characterizing the liquid structure.A new approach to obtain good GFA of liquid alloys is based on the following four main factors: (1) formation of new SRO and competitive correlation with two or more kinds of SROs for crystallization, (2) stabilization of dense random packing by interaction between different types of SRO, (3) formation of stable cluster (SC) or middle range order (MRO) by harmonious coupling of SROs, and (4) difference between SRO characterizing the liquid structure and the near-neighbor environment in the corresponding equilibrium crystalline phases. The atomic volume mismatch estimated from the cube of the atomic radius was found to be a close relation with the minimum solute concentration for glass formation. This empirical guideline enables us to provide the optimum solute concentration for good GFA in some ternary alloys. Model structures, denoted by Bernal type and the Chemical Order type, were again tested in the novel description for the glass structure as a function of solute concentration. We illustrated the related energetics of the completion between crystal embryo and different types of SRO. Recent systematic measurements also provide that thermal diffusivity of alloys in the liquid state may be a good indicator of their GFA.
Resumo:
A simplified energy‐level scheme is proposed for the photochemical cycle of the bacteriorhodopsin molecule. Rate equations are solved for the detailed light‐induced processes based on this model and the intensity‐induced population densities in various states of the molecule at steady state are computed which are used to obtain an analytic expression for the absorption coefficient of the modulation beam. Modulation of the probe laser‐beam transmission by the modulation‐laser‐beam intensity‐induced population changes is analyzed. It is predicted that for a probe beam at 412 nm up to 82% modulation can be achieved using a laser beam intensity of 3.2 W/cm2 at 570 nm. For temperatures ∼77 K, the transmission at 610 nm can be switched from zero to 81% for modulating laser intensity of 11 W/cm2. Construction of a spatial light modulator based on bacteriorhodopsin molecules is proposed and some of its features are discussed.
Resumo:
A system of transport equations have been obtained for plasma of electrons and having a background of positive ions in the presence of an electric and magnetic field. The starting kinetic equation is the well-known Landau kinetic equation. The distribution function of the kinetic equation has been expanded in powers of generalized Hermite polynomials and following Grad, a consistent set of transport equations have been obtained. The expressions for viscosity and heat conductivity have been deduced from the transport equation.
Resumo:
The paper outlines a technique for sensitive measurement of conduction phenomena in liquid dielectrics. The special features of this technique are the simplicity of the electrical system, the inexpensive instrumentation and the high accuracy. Detection, separation and analysis of a random function of current that is superimposed on the prebreakdown direct current forms the basis of this investigation. In this case, prebreakdown direct current is the output data of a test cell with large electrodes immersed in a liquid medium subjected to high direct voltages. Measurement of the probability-distribution function of a random fluctuating component of current provides a method that gives insight into the mechanism of conduction in a liquid medium subjected to high voltages and the processes that are responsible for the existence of the fluctuating component of the current.
Resumo:
A reliable method for service life estimation of the structural element is a prerequisite for service life design. A new methodology for durability-based service life estimation of reinforced concrete flexural elements with respect to chloride-induced corrosion of reinforcement is proposed. The methodology takes into consideration the fuzzy and random uncertainties associated with the variables involved in service life estimation by using a hybrid method combining the vertex method of fuzzy set theory with Monte Carlo simulation technique. It is also shown how to determine the bounds for characteristic value of failure probability from the resulting fuzzy set for failure probability with minimal computational effort. Using the methodology, the bounds for the characteristic value of failure probability for a reinforced concrete T-beam bridge girder has been determined. The service life of the structural element is determined by comparing the upper bound of characteristic value of failure probability with the target failure probability. The methodology will be useful for durability-based service life design and also for making decisions regarding in-service inspections.
Resumo:
We study the distribution of first passage time for Levy type anomalous diffusion. A fractional Fokker-Planck equation framework is introduced.For the zero drift case, using fractional calculus an explicit analytic solution for the first passage time density function in terms of Fox or H-functions is given. The asymptotic behaviour of the density function is discussed. For the nonzero drift case, we obtain an expression for the Laplace transform of the first passage time density function, from which the mean first passage time and variance are derived.
Resumo:
The simulation characteristics of the Asian-Australian monsoon are documented for the Community Climate System Model, version 4 (CCSM4). This is the first part of a two part series examining monsoon regimes in the global tropics in the CCSM4. Comparisons are made to an Atmospheric Model Intercomparison Project (AMIP) simulation of the atmospheric component in CCSM4 Community Atmosphere Model, version 4, (CAM4)] to deduce differences in the monsoon simulations run with observed sea surface temperatures (SSTs) and with ocean-atmosphere coupling. These simulations are also compared to a previous version of the model (CCSM3) to evaluate progress. In general, monsoon rainfall is too heavy in the uncoupled AMIP run with CAM4, and monsoon rainfall amounts are generally better simulated with ocean coupling in CCSM4. Most aspects of the Asian-Australian monsoon simulations are improved in CCSM4 compared to CCSM3. There is a reduction of the systematic error of rainfall over the tropical Indian Ocean for the South Asian monsoon, and well-simulated connections between SSTs in the Bay of Bengal and regional South Asian monsoon precipitation. The pattern of rainfall in the Australian monsoon is closer to observations in part because of contributions from the improvements of the Indonesian Throughflow and diapycnal diffusion in CCSM4. Intraseasonal variability of the Asian-Australian monsoon is much improved in CCSM4 compared to CCSM3 both in terms of eastward and northward propagation characteristics, though it is still somewhat weaker than observed. An improved simulation of El Nino in CCSM4 contributes to more realistic connections between the Asian-Australian monsoon and El Nino-Southern Oscillation (ENSO), though there is considerable decadal and century time scale variability of the strength of the monsoon-ENSO connection.
Resumo:
We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network-oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network-aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network-oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network-oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network-aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.
Resumo:
We develop an online actor-critic reinforcement learning algorithm with function approximation for a problem of control under inequality constraints. We consider the long-run average cost Markov decision process (MDP) framework in which both the objective and the constraint functions are suitable policy-dependent long-run averages of certain sample path functions. The Lagrange multiplier method is used to handle the inequality constraints. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal solution. We also provide the results of numerical experiments on a problem of routing in a multi-stage queueing network with constraints on long-run average queue lengths. We observe that our algorithm exhibits good performance on this setting and converges to a feasible point.
Resumo:
The repeated or closely spaced eigenvalues and corresponding eigenvectors of a matrix are usually very sensitive to a perturbation of the matrix, which makes capturing the behavior of these eigenpairs very difficult. Similar difficulty is encountered in solving the random eigenvalue problem when a matrix with random elements has a set of clustered eigenvalues in its mean. In addition, the methods to solve the random eigenvalue problem often differ in characterizing the problem, which leads to different interpretations of the solution. Thus, the solutions obtained from different methods become mathematically incomparable. These two issues, the difficulty of solving and the non-unique characterization, are addressed here. A different approach is used where instead of tracking a few individual eigenpairs, the corresponding invariant subspace is tracked. The spectral stochastic finite element method is used for analysis, where the polynomial chaos expansion is used to represent the random eigenvalues and eigenvectors. However, the main concept of tracking the invariant subspace remains mostly independent of any such representation. The approach is successfully implemented in response prediction of a system with repeated natural frequencies. It is found that tracking only an invariant subspace could be sufficient to build a modal-based reduced-order model of the system. Copyright (C) 2012 John Wiley & Sons, Ltd.
Resumo:
The spatial search problem on regular lattice structures in integer number of dimensions d >= 2 has been studied extensively, using both coined and coinless quantum walks. The relativistic Dirac operator has been a crucial ingredient in these studies. Here, we investigate the spatial search problem on fractals of noninteger dimensions. Although the Dirac operator cannot be defined on a fractal, we construct the quantum walk on a fractal using the flip-flop operator that incorporates a Klein-Gordon mode. We find that the scaling behavior of the spatial search is determined by the spectral (and not the fractal) dimension. Our numerical results have been obtained on the well-known Sierpinski gaskets in two and three dimensions.