Effect of curve crossing on absorption and resonance Raman spectra: analytical treatment for delta-function coupling in parabolic potentials

We propose an exactly solvable model for the two-state curve-crossing problem. Our model assumes the coupling to be a delta function. It is used to calculate the effect of curve crossing on the electronic absorption spectrum and the resonance Raman excitation profile.

Multi-channel curve crossing problems: analytically solvable model

We have proposed a general method for finding the exact analytical solution for the multi-channel curve crossing problem in the presence of delta function couplings. We have analysed the case where aa potential energy curve couples to a continuum (in energy) of the potential energy curves.

Barrier crossing in one and three dimensions by a long chain

We consider the Kramers problem for a long chain polymer trapped in a biased double-well potential. Initially the polymer is in the less stable well and it can escape from this well to the other well by the motion of its N beads across the barrier to attain the configuration having lower free energy. In one dimension we simulate the crossing and show that the results are in agreement with the kink mechanism suggested earlier. In three dimensions, it has not been possible to get an analytical `kink solution' for an arbitrary potential; however, one can assume the form of the solution of the nonlinear equation as a kink solution and then find a double-well potential in three dimensions. To verify the kink mechanism, simulations of the dynamics of a discrete Rouse polymer model in a double well in three dimensions are carried out. We find that the time of crossing is proportional to the chain length, which is in agreement with the results for the kink mechanism. The shape of the kink solution is also in agreement with the analytical solution in both one and three dimensions.

Evolving Philosophies on Autonomous Obstacle/Collision Avoidance of Unmanned Aerial Vehicles

Much of the benefits of deploying unmanned aerial vehicles can be derived from autonomous missions. For such missions, however, sense-and-avoid capability (i.e., the ability to detect potential collisions and avoid them) is a critical requirement. Collision avoidance can be broadly classified into global and local path-planning algorithms, both of which need to be addressed in a successful mission. Whereas global path planning (which is mainly done offline) broadly lays out a path that reaches the goal point, local collision-avoidance algorithms, which are usually fast, reactive, and carried out online, ensure safety of the vehicle from unexpected and unforeseen obstacles/collisions. Even though many techniques for both global and local collision avoidance have been proposed in the recent literature, there is a great interest around the globe to solve this important problem comprehensively and efficiently and such techniques are still evolving. This paper presents a brief overview of a few promising and evolving ideas on collision avoidance for unmanned aerial vehicles, with a preferential bias toward local collision avoidance.

A Sub-Nyquist Sampling Method For Computing The Level-crossing-times Of An Analog Signal: Theory And Applications

We address the problem of computing the level-crossings of an analog signal from samples measured on a uniform grid. Such a problem is important, for example, in multilevel analog-to-digital (A/D) converters. The first operation in such sampling modalities is a comparator, which gives rise to a bilevel waveform. Since bilevel signals are not bandlimited, measuring the level-crossing times exactly becomes impractical within the conventional framework of Shannon sampling. In this paper, we propose a novel sub-Nyquist sampling technique for making measurements on a uniform grid and thereby for exactly computing the level-crossing times from those samples. The computational complexity of the technique is low and comprises simple arithmetic operations. We also present a finite-rate-of-innovation sampling perspective of the proposed approach and also show how exponential splines fit in naturally into the proposed sampling framework. We also discuss some concrete practical applications of the sampling technique.

Precise measurement of hyperfine intervals using avoided crossing of dressed states

We demonstrate a technique for precisely measuring hyperfine intervals in alkali atoms. The atoms form a three-level system in the presence of a strong control laser and a weak probe laser. The dressed states created by the control laser show significant linewidth reduction. We have developed a technique for Doppler-free spectroscopy that enables the separation between the dressed states to be measured with high accuracy even in room temperature atoms. The states go through an avoided crossing as the detuning of the control laser is changed from positive to negative. By studying the separation as a function of detuning, the center of the level-crossing diagram is determined with high precision, which yields the hyperfine interval. Using room temperature Rb vapor, we obtain a precision of 44 kHz. This is a significant improvement over the current precision of similar to1 MHz.

Adaptive window zero-crossing-based instantaneous frequency estimation

We address the problem of estimating instantaneous frequency (IF) of a real-valued constant amplitude time-varying sinusoid. Estimation of polynomial IF is formulated using the zero-crossings of the signal. We propose an algorithm to estimate nonpolynomial IF by local approximation using a low-order polynomial, over a short segment of the signal. This involves the choice of window length to minimize the mean square error (MSE). The optimal window length found by directly minimizing the MSE is a function of the higher-order derivatives of the IF which are not available a priori. However, an optimum solution is formulated using an adaptive window technique based on the concept of intersection of confidence intervals. The adaptive algorithm enables minimum MSE-IF (MMSE-IF) estimation without requiring a priori information about the IF. Simulation results show that the adaptive window zero-crossing-based IF estimation method is superior to fixed window methods and is also better than adaptive spectrogram and adaptive Wigner-Ville distribution (WVD)-based IF estimators for different signal-to-noise ratio (SNR).

Barrier crossing by a flexible long chain molecule - The kink mechanism

The problem and related earlier work All the above problems involve the passage of a long chain molecule, through a region in space, where the free energy per segment is higher, thus effectively presenting a barrier for the motion of the molecule. This is what we refer to as the Kramers proble...

Zero-crossing approach to high-resolution reconstruction in frequency-domain optical-coherence tomography

We address the problem of high-resolution reconstruction in frequency-domain optical-coherence tomography (FDOCT). The traditional method employed uses the inverse discrete Fourier transform, which is limited in resolution due to the Heisenberg uncertainty principle. We propose a reconstruction technique based on zero-crossing (ZC) interval analysis. The motivation for our approach lies in the observation that, for a multilayered specimen, the backscattered signal may be expressed as a sum of sinusoids, and each sinusoid manifests as a peak in the FDOCT reconstruction. The successive ZC intervals of a sinusoid exhibit high consistency, with the intervals being inversely related to the frequency of the sinusoid. The statistics of the ZC intervals are used for detecting the frequencies present in the input signal. The noise robustness of the proposed technique is improved by using a cosine-modulated filter bank for separating the input into different frequency bands, and the ZC analysis is carried out on each band separately. The design of the filter bank requires the design of a prototype, which we accomplish using a Kaiser window approach. We show that the proposed method gives good results on synthesized and experimental data. The resolution is enhanced, and noise robustness is higher compared with the standard Fourier reconstruction. (c) 2012 Optical Society of America

Cubicity, degeneracy, and crossing number

A $k$-box $B=(R_1,...,R_k)$, where each $R_i$ is a closed interval on the real line, is defined to be the Cartesian product $R_1\times R_2\times ...\times R_k$. If each $R_i$ is a unit length interval, we call $B$ a $k$-cube. Boxicity of a graph $G$, denoted as $\boxi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-boxes. Similarly, the cubicity of $G$, denoted as $\cubi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-cubes. It was shown in [L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes. MCDES-2008, IISc Centenary Conference, available at CoRR, abs/cs/ 0607092, 2006.] that, for a graph $G$ with maximum degree $\Delta$, $\cubi(G)\leq \lceil 4(\Delta +1)\log n\rceil$. In this paper, we show that, for a $k$-degenerate graph $G$, $\cubi(G) \leq (k+2) \lceil 2e \log n \rceil$. Since $k$ is at most $\Delta$ and can be much lower, this clearly is a stronger result. This bound is tight. We also give an efficient deterministic algorithm that runs in $O(n^2k)$ time to output a $8k(\lceil 2.42 \log n\rceil + 1)$ dimensional cube representation for $G$. An important consequence of the above result is that if the crossing number of a graph $G$ is $t$, then $\boxi(G)$ is $O(t^{1/4}{\lceil\log t\rceil}^{3/4})$ . This bound is tight up to a factor of $O((\log t)^{1/4})$. We also show that, if $G$ has $n$ vertices, then $\cubi(G)$ is $O(\log n + t^{1/4}\log t)$. Using our bound for the cubicity of $k$-degenerate graphs we show that cubicity of almost all graphs in $\mathcal{G}(n,m)$ model is $O(d_{av}\log n)$, where $d_{av}$ denotes the average degree of the graph under consideration. model is O(davlogn).

A POSTERIORI ERROR CONTROL OF DISCONTINUOUS GALERKIN METHODS FOR ELLIPTIC OBSTACLE PROBLEMS

In this article, we derive an a posteriori error estimator for various discontinuous Galerkin (DG) methods that are proposed in (Wang, Han and Cheng, SIAM J. Numer. Anal., 48: 708-733, 2010) for an elliptic obstacle problem. Using a key property of DG methods, we perform the analysis in a general framework. The error estimator we have obtained for DG methods is comparable with the estimator for the conforming Galerkin (CG) finite element method. In the analysis, we construct a non-linear smoothing function mapping DG finite element space to CG finite element space and use it as a key tool. The error estimator consists of a discrete Lagrange multiplier associated with the obstacle constraint. It is shown for non-over-penalized DG methods that the discrete Lagrange multiplier is uniformly stable on non-uniform meshes. Finally, numerical results demonstrating the performance of the error estimator are presented.

A Reliable Residual Based A Posteriori Error Estimator for a Quadratic Finite Element Method for the Elliptic Obstacle Problem

A residual based a posteriori error estimator is derived for a quadratic finite element method (FEM) for the elliptic obstacle problem. The error estimator involves various residuals consisting of the data of the problem, discrete solution and a Lagrange multiplier related to the obstacle constraint. The choice of the discrete Lagrange multiplier yields an error estimator that is comparable with the error estimator in the case of linear FEM. Further, an a priori error estimate is derived to show that the discrete Lagrange multiplier converges at the same rate as that of the discrete solution of the obstacle problem. The numerical experiments of adaptive FEM show optimal order convergence. This demonstrates that the quadratic FEM for obstacle problem exhibits optimal performance.

A Remark on the A Posteriori Error Analysis of Discontinuous Galerkin Methods for the Obstacle Problem

We revisit the a posteriori error analysis of discontinuous Galerkin methods for the obstacle problem derived in 25]. Under a mild assumption on the trace of obstacle, we derive a reliable a posteriori error estimator which does not involve min/max functions. A key in this approach is an auxiliary problem with discrete obstacle. Applications to various discontinuous Galerkin finite element methods are presented. Numerical experiments show that the new estimator obtained in this article performs better.

A Zero-Crossing Rate Property of Power Complementary Analysis Filterbank Outputs

We establish zero-crossing rate (ZCR) relations between the input and the subbands of a maximally decimated M-channel power complementary analysis filterbank when the input is a stationary Gaussian process. The ZCR at lag is defined as the number of sign changes between the samples of a sequence and its 1-sample shifted version, normalized by the sequence length. We derive the relationship between the ZCR of the Gaussian process at lags that are integer multiples of Al and the subband ZCRs. Based on this result, we propose a robust iterative autocorrelation estimator for a signal consisting of a sum of sinusoids of fixed amplitudes and uniformly distributed random phases. Simulation results show that the performance of the proposed estimator is better than the sample autocorrelation over the SNR range of -6 to 15 dB. Validation on a segment of a trumpet signal showed similar performance gains.

Short-lived triplets of aliphatic thioketenes

The photophysical behavior of the triplets of three aliphatic thioketenes, namely di-tert-butylthioketene (1), 2,6-di-tert-butylcyclohexylthioketene (2) and 2,2,6,6-tetramethylcyclohexylthioketene, has been studied in fluid solutions at room temperature by nanosecond laser flash photolysis. Upon 532 nm laser excitation into the S1 state, the thioketenes in concentrated benzene solutions produce very short-lived transient absorptions (τ < 5 ns; λmax ≈ 450 nm) attributable to their triplets. The photogeneration of the latter under S1 excitation has also been established by energy transfer to all-trans-1,6-diphenyl-1,3,5-hexatriene. The factors which render the triplet lifetimes short are shown to be intrinsic in origin (rather than self-quenching). Unlike thiocarbonyl compounds in general, the thioketenes posses low intersystem crossing yields (less than 0.1 in benzene). From the kinetics of the quenching of a series of sensitizer triplets by 1 and 2, the thioketene triplet energies are estimated to be 43 – 44 kcal mol−1.