861 resultados para Ultrashort timescale
Resumo:
The vibrational wavepacket revival of a basic quantum system is demonstrated experimentally. Using few-cycle laser pulse technology, pump and probe imaging of the vibrational motion of D+2 molecules is conducted, and together with a quantum-mechanical simulation of the excited wavepacket motion, the vibrational revival phenomenon has been characterised. The simulation shows good correlation with the temporal motion and structural features obtained from the data, relaying fundamental information on this diatomic system.
Resumo:
We investigate the carrier-wave Rabi flopping effects in an asymmetric semiparabolic semiconductor quantum well (QW) with few-cycle pulse. It is found that higher spectral components of few-cycle ultrashort pulses in the semiparabolic QW depend crucially on the carrier-envelope phase (CEP) of the few-cycle ultrashort pulses: continuum and distinct peaks can be achieved by controlling the CEP. Our results demonstrate that by adjusting the CEP of few-cycle ultrashort pulses, the intersubband dynamics in the asymmetric semiparabolic QW can be controlled in an ultrashort timescale with moderate laser intensity. (c) 2008 Optical Society of America.
Resumo:
Nuclei and electrons in condensed matter and/or molecules are usually entangled, due to the prevailing (mainly electromagnetic) interactions. However, the "environment" of a microscopic scattering system (e.g. a proton) causes ultrafast decoherence, thus making atomic and/or nuclear entanglement e®ects not directly accessible to experiments. However, our neutron Compton scattering experiments from protons (H-atoms) in condensed systems and molecules have a characteristic collisional time about 100|1000 attoseconds. The quantum dynamics of an atom in this ultrashort, but ¯nite, time window is governed by non-unitary time evolution due to the aforementioned decoherence. Unexpectedly, recent theoretical investigations have shown that decoherence can also have the following energetic consequences. Disentangling two subsystems A and B of a quantum system AB is tantamount to erasure of quantum phase relations between A and B. This erasure is widely believed to be an innocuous process, which e.g. does not a®ect the energies of A and B. However, two independent groups proved recently that disentangling two systems, within a su±ciently short time interval, causes increase of their energies. This is also derivable by the simplest Lindblad-type master equation of one particle being subject to pure decoherence. Our neutron-proton scattering experiments with H2 molecules provide for the first time experimental evidence of this e®ect. Our results reveal that the neutron-proton collision, leading to the cleavage of the H-H bond in the attosecond timescale, is accompanied by larger energy transfer (by about 2|3%) than conventional theory predicts. Preliminary results from current investigations show qualitatively the same e®ect in the neutron-deuteron Compton scattering from D2 molecules. We interpret the experimental findings by treating the neutron-proton (or neutron-deuteron) collisional system as an entangled open quantum system being subject to fast decoherence caused by its "environment" (i.e., two electrons plus second nucleus of H2 or D2). The presented results seem to be of generic nature, and may have considerable consequences for various processes in condensed matter and molecules, e.g. in elementary chemical reactions.
Resumo:
The ultrafast vibrational phase relaxation of O–H stretch in bulk water is investigated in molecular dynamics simulations. The dephasing time (T2) of the O–H stretch in bulk water calculated from the frequency fluctuation time correlation function (Cω(t)) is in the range of 70–80 femtosecond (fs), which is comparable to the characteristic timescale obtained from the vibrational echo peak shift measurements using infrared photon echo [W.P. de Boeij, M.S. Pshenichnikov, D.A. Wiersma, Ann. Rev. Phys. Chem. 49 (1998) 99]. The ultrafast decay of Cω(t) is found to be responsible for the ultrashort T2 in bulk water. Careful analysis reveals the following two interesting reasons for the ultrafast decay of Cω(t). (A) The large amplitude angular jumps of water molecules (within 30–40 fs time duration) provide a large scale contribution to the mean square vibrational frequency fluctuation and gives rise to the rapid spectral diffusion on 100 fs time scale. (B) The projected force, due to all the atoms of the solvent molecules on the oxygen (FO(t)) and hydrogen (FH(t)) atom of the O–H bond exhibit a large negative cross-correlation (NCC). We further find that this NCC is partly responsible for a weak, non-Arrhenius temperature dependence of the dephasing rate.
Resumo:
Muscoidea is a significant dipteran clade that includes house flies (Family Muscidae), latrine flies (F. Fannidae), dung flies (F. Scathophagidae) and root maggot flies (F. Anthomyiidae). It is comprised of approximately 7000 described species. The monophyly of the Muscoidea and the precise relationships of muscoids to the closest superfamily the Oestroidea (blow flies, flesh flies etc) are both unresolved. Until now mitochondrial (mt) genomes were available for only two of the four muscoid families precluding a thorough test of phylogenetic relationships using this data source. Here we present the first two mt genomes for the families Fanniidae (Euryomma sp.) (family Fanniidae) and Anthomyiidae (Delia platura (Meigen, 1826)). We also conducted phylogenetic analyses containing of these newly sequenced mt genomes plus 15 other species representative of dipteran diversity to address the internal relationship of Muscoidea and its systematic position. Both maximum-likelihood and Bayesian analyses suggested that Muscoidea was not a monophyletic group with the relationship: (Fanniidae + Muscidae) + ((Anthomyiidae + Scathophagidae) + (Calliphoridae + Sarcophagidae)), supported by the majority of analysed datasets. This also infers that Oestroidea was paraphyletic in the majority of analyses. Divergence time estimation suggested that the earliest split within the Calyptratae, separating (Tachinidae + Oestridae) from the remaining families, occurred in the Early Eocene. The main divergence within the paraphyletic muscoidea grade was between Fanniidae + Muscidae and the lineage ((Anthomyiidae + Scathophagidae) + (Calliphoridae + Sarcophagidae)) which occurred in the Late Eocene
Resumo:
We develop extensions of the Simulated Annealing with Multiplicative Weights (SAMW) algorithm that proposed a method of solution of Finite-Horizon Markov Decision Processes (FH-MDPs). The extensions developed are in three directions: a) Use of the dynamic programming principle in the policy update step of SAMW b) A two-timescale actor-critic algorithm that uses simulated transitions alone, and c) Extending the algorithm to the infinite-horizon discounted-reward scenario. In particular, a) reduces the storage required from exponential to linear in the number of actions per stage-state pair. On the faster timescale, a 'critic' recursion performs policy evaluation while on the slower timescale an 'actor' recursion performs policy improvement using SAMW. We give a proof outlining convergence w.p. 1 and show experimental results on two settings: semiconductor fabrication and flow control in communication networks.
Resumo:
An analytical treatment of performance analysis of guidance laws is possible only in simplistic scenarios. As the complexity of the guidance system increases, a search for analytical solutions becomes quite impractical. In this paper, a new performance measure, based upon the notion of a timescale gap that can be computed through numerical simulations, is developed for performance analysis of guidance laws. Finite time Lyapunov exponents are used to define the timescale gap. It is shown that the timescale gap can be used for quantification of the rate of convergence of trajectories to the collision course. Comparisonbetween several guidance laws, based on the timescale gap, is presented. Realistic simulations to study the effect of aerodynamicsand atmospheric variations on the timescale gap of these guidance laws are also presented.
Resumo:
The overall performance of random early detection (RED) routers in the Internet is determined by the settings of their associated parameters. The non-availability of a functional relationship between the RED performance and its parameters makes it difficult to implement optimization techniques directly in order to optimize the RED parameters. In this paper, we formulate a generic optimization framework using a stochastically bounded delay metric to dynamically adapt the RED parameters. The constrained optimization problem thus formulated is solved using traditional nonlinear programming techniques. Here, we implement the barrier and penalty function approaches, respectively. We adopt a second-order nonlinear optimization framework and propose a novel four-timescale stochastic approximation algorithm to estimate the gradient and Hessian of the barrier and penalty objectives and update the RED parameters. A convergence analysis of the proposed algorithm is briefly sketched. We perform simulations to evaluate the performance of our algorithm with both barrier and penalty objectives and compare these with RED and a variant of it in the literature. We observe an improvement in performance using our proposed algorithm over RED, and the above variant of it.
Resumo:
A two timescale stochastic approximation scheme which uses coupled iterations is used for simulation-based parametric optimization as an alternative to traditional "infinitesimal perturbation analysis" schemes, It avoids the aggregation of data present in many other schemes. Its convergence is analyzed, and a queueing example is presented.
Resumo:
Alopex is a correlation-based gradient-free optimization technique useful in many learning problems. However, there are no analytical results on the asymptotic behavior of this algorithm. This article presents a new version of Alopex that can be analyzed using techniques of two timescale stochastic approximation method. It is shown that the algorithm asymptotically behaves like a gradient-descent method, though it does not need (or estimate) any gradient information. It is also shown, through simulations, that the algorithm is quite effective.
Resumo:
We propose two variants of the Q-learning algorithm that (both) use two timescales. One of these updates Q-values of all feasible state-action pairs at each instant while the other updates Q-values of states with actions chosen according to the ‘current ’ randomized policy updates. A sketch of convergence of the algorithms is shown. Finally, numerical experiments using the proposed algorithms for routing on different network topologies are presented and performance comparisons with the regular Q-learning algorithm are shown.
Resumo:
A terrestrial biosphere model with dynamic vegetation capability, Integrated Biosphere Simulator (IBIS2), coupled to the NCAR Community Atmosphere Model (CAM2) is used to investigate the multiple climate-forest equilibrium states of the climate system. A 1000-year control simulation and another 1000-year land cover change simulation that consisted of global deforestation for 100 years followed by re-growth of forests for the subsequent 900 years were performed. After several centuries of interactive climate-vegetation dynamics, the land cover change simulation converged to essentially the same climate state as the control simulation. However, the climate system takes about a millennium to reach the control forest state. In the absence of deep ocean feedbacks in our model, the millennial time scale for converging to the original climate state is dictated by long time scales of the vegetation dynamics in the northern high latitudes. Our idealized modeling study suggests that the equilibrium state reached after complete global deforestation followed by re-growth of forests is unlikely to be distinguishable from the control climate. The real world, however, could have multiple climate-forest states since our modeling study is unlikely to have represented all the essential ecological processes (e. g. altered fire regimes, seed sources and seedling establishment dynamics) for the reestablishment of major biomes.
Resumo:
In this paper, we consider an intrusion detection application for Wireless Sensor Networks. We study the problem of scheduling the sleep times of the individual sensors, where the objective is to maximize the network lifetime while keeping the tracking error to a minimum. We formulate this problem as a partially-observable Markov decision process (POMDP) with continuous stateaction spaces, in a manner similar to Fuemmeler and Veeravalli (IEEE Trans Signal Process 56(5), 2091-2101, 2008). However, unlike their formulation, we consider infinite horizon discounted and average cost objectives as performance criteria. For each criterion, we propose a convergent on-policy Q-learning algorithm that operates on two timescales, while employing function approximation. Feature-based representations and function approximation is necessary to handle the curse of dimensionality associated with the underlying POMDP. Our proposed algorithm incorporates a policy gradient update using a one-simulation simultaneous perturbation stochastic approximation estimate on the faster timescale, while the Q-value parameter (arising from a linear function approximation architecture for the Q-values) is updated in an on-policy temporal difference algorithm-like fashion on the slower timescale. The feature selection scheme employed in each of our algorithms manages the energy and tracking components in a manner that assists the search for the optimal sleep-scheduling policy. For the sake of comparison, in both discounted and average settings, we also develop a function approximation analogue of the Q-learning algorithm. This algorithm, unlike the two-timescale variant, does not possess theoretical convergence guarantees. Finally, we also adapt our algorithms to include a stochastic iterative estimation scheme for the intruder's mobility model and this is useful in settings where the latter is not known. Our simulation results on a synthetic 2-dimensional network setting suggest that our algorithms result in better tracking accuracy at the cost of only a few additional sensors, in comparison to a recent prior work.