967 resultados para Extended spectrum
Resumo:
The stretching vibrational spectra of H2S have been calculated by using the algebraic model, and the local mode characteristics have been analyzed. Within the vibrational quanta v=5, the standard deviation is 1.71 cm(-1), which is better than that from the local model HCAO model calculation.
Resumo:
We describe a new method for motion estimation and 3D reconstruction from stereo image sequences obtained by a stereo rig moving through a rigid world. We show that given two stereo pairs one can compute the motion of the stereo rig directly from the image derivatives (spatial and temporal). Correspondences are not required. One can then use the images from both pairs combined to compute a dense depth map. The motion estimates between stereo pairs enable us to combine depth maps from all the pairs in the sequence to form an extended scene reconstruction and we show results from a real image sequence. The motion computation is a linear least squares computation using all the pixels in the image. Areas with little or no contrast are implicitly weighted less so one does not have to explicitly apply a confidence measure.
Resumo:
A theoretical method to calculate multidimensional Franck-Condon factors including Duschinsky effects is described and used to simulate the photoelectron spectrum of the anion SO. Geometry optimizations and harmonic vibrational frequency calculations have been performed on the XA(1) state of SO2 and (XB1)-B-2 state of SO2. Franck-Condon analyses and spectral simulation were carried out on the first photoelectron band of SO2. The theoretical spectra obtained by employing CCSD(T)/6-31 I+G(2d,p) values are in excellent agreement with the experiment. In addition, the equilibrium geometric parameters, r(c)(OS) = 0.1508 +/- 0.0005 nm and theta(e)(O-S-0) = 113.5 +/- 0.5 degrees, of the (XB1)-B-2 state of SO2, are derived by employing an iterative Franck-Condon analysis procedure in the spectral simulation. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
B.M. Brown, M.S.P. Eastham, I. Wood: Conditions for the spectrum associated with a leaky wire to contain the interval [? ?2/4, ?), Arch. Math., 90, 6 (2008), 554-558
Resumo:
Hill, Joe M., Lloyd, Noel G., Pearson, Jane M., 'Centres and limit cycles for an extended Kukles system', Electronic Journal of Differential Equations, Vol. 2007(2007), No. 119, pp. 1-23.
Resumo:
This is an author-created, un-copyedited version of an article accepted for publication in Acta Physica Polonica A. The Version of Record is available online at http://przyrbwn.icm.edu.pl/APP/PDF/118/a118z2p31.pdf
Resumo:
We investigate numerically the ground state phase diagram of the one-dimensional extended Hubbard model, including an on--site interaction U and a nearest--neighbor interaction V. We focus on the ground state phases of the model in the V >> U region, where previous studies have suggested the possibility of dominant superconducting pairing fluctuations before the system phase separates at a critical value V=V_PS. Using quantum Monte Carlo methods on lattices much larger than in previous Lanczos diagonalization studies, we determine the boundary of phase separation, the Luttinger Liquid correlation exponent K_rho, and other correlation functions in this region. We find that phase separation occurs for V significantly smaller than previously reported. In addition, for negative U, we find that a uniform state re-enters from phase separation as the electron density is increased towards half filling. For V < V_PS, our results show that superconducting fluctuations are not dominant. The system behaves asymptotically as a Luttinger Liquid with K_rho < 1, but we also find strong low-energy (but gapped) charge-density fluctuations at a momentum not expected for a standard Luttinger Liquid.
Resumo:
The increased diversity of Internet application requirements has spurred recent interests in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The parameterization of these control rules is done so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. In this paper, we define a new spectrum of window-based congestion control algorithms that are TCP-friendly as well as TCP-compatible under RED. Contrary to previous memory-less controls, our algorithms utilize history information in their control rules. Our proposed algorithms have two salient features: (1) They enable a wider region of TCP-friendliness, and thus more flexibility in trading off among smoothness, aggressiveness, and responsiveness; and (2) they ensure a faster convergence to fairness under a wide range of system conditions. We demonstrate analytically and through extensive ns simulations the steady-state and transient behaviors of several instances of this new spectrum of algorithms. In particular, SIMD is one instance in which the congestion window is increased super-linearly with time since the detection of the last loss. Compared to recently proposed TCP-friendly AIMD and binomial algorithms, we demonstrate the superiority of SIMD in: (1) adapting to sudden increases in available bandwidth, while maintaining competitive smoothness and responsiveness; and (2) rapidly converging to fairness and efficiency.
Resumo:
The increasing diversity of Internet application requirements has spurred recent interest in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The control rules are parameterized so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. This paper presents a comprehensive study of a new spectrum of window-based congestion controls, which are TCP-friendly as well as TCP-compatible under RED. Our controls utilize history information in their control rules. By doing so, they improve the transient behavior, compared to recently proposed slowly-responsive congestion controls such as general AIMD and binomial controls. Our controls can achieve better tradeoffs among smoothness, aggressiveness, and responsiveness, and they can achieve faster convergence. We demonstrate analytically and through extensive ns simulations the steady-state and transient behavior of several instances of this new spectrum.
Resumo:
For pt. I see ibid., vol. 44, p. 927-36 (1997). In a digital communications system, data are transmitted from one location to another by mapping bit sequences to symbols, and symbols to sample functions of analog waveforms. The analog waveform passes through a bandlimited (possibly time-varying) analog channel, where the signal is distorted and noise is added. In a conventional system the analog sample functions sent through the channel are weighted sums of one or more sinusoids; in a chaotic communications system the sample functions are segments of chaotic waveforms. At the receiver, the symbol may be recovered by means of coherent detection, where all possible sample functions are known, or by noncoherent detection, where one or more characteristics of the sample functions are estimated. In a coherent receiver, synchronization is the most commonly used technique for recovering the sample functions from the received waveform. These sample functions are then used as reference signals for a correlator. Synchronization-based coherent receivers have advantages over noncoherent receivers in terms of noise performance, bandwidth efficiency (in narrow-band systems) and/or data rate (in chaotic systems). These advantages are lost if synchronization cannot be maintained, for example, under poor propagation conditions. In these circumstances, communication without synchronization may be preferable. The theory of conventional telecommunications is extended to chaotic communications, chaotic modulation techniques and receiver configurations are surveyed, and chaotic synchronization schemes are described