Domain wall propagation due to the synchronization with circularly polarized microwaves

Finding a new control parameter for magnetic domain wall (DW) motion in magnetic nanostructures is important in general and in particular for the spintronics applications. Here, we show that a circularly polarized magnetic field (CPMF) at GHz frequency (microwave) can efficiently drive a DW to propagate along a magnetic nanowire. Two motion modes are identified: rigid-DW propagation at low frequency and oscillatory propagation at high frequency. Moreover, DW motion under a CPMF is equivalent to the DW motion under a uniform spin current in the current perpendicular to the plane magnetic configuration proposed recently by Khvalkovskiy et al. [Phys. Rev. Lett. 102, 067206 (2009)], and the CPMF frequency plays the role of the current

Search for ηc′\eta_{c}^{'} and hc(1P1)h_{c} (^{1}P_{1}) states in the e+e−e^+ e^- annihilations

Productions and decays of spin-singlet $S,P-$wave charmonium states, $\eta_{c}^{'}$ and $h_{c} (^{1}P_{1})$, in the $e^+ e^-$ annihilations are considered in the QCD multipole expansion with neglecting nonlocality in time coming from the color-octet intermediate states. Our approximation is opposite to the Kuang-Yan's model. The results are $B (\psi^{'} \rightarrow h_{c} + \pi^{0}) \approx 0.3 \%$, $B ( \psi^{'} \rightarrow \eta^{'} + \gamma ) \approx 0.34 \%$, $\Gamma (\eta_{c}^{'} \rightarrow J/\psi + \gamma) \approx 0.26$ keV and $\Gamma (h_{c} \rightarrow J/\psi + \pi^{0}) \approx 2.5$ keV.Comment: LaTeX file, to appear in Phys. Rev.

On weighted time optimal control for linear hybrid automata using quantifier elimination

This paper considers the optimal control problem for linear hybrid automata. In particular, it is shown that the problem can be transformed into a constrained optimization problem whose constraints are a set of inequalities with quantifiers. Quantifier Elimination (QE) techniques are employed in order to derive quantifier free inequalities that are linear. The optimal cost is obtained using linear programming. The optimal switching times and optimal continuous control inputs are computed and used in order to derive the optimal hybrid controller. Our results areapplied to an air traffic management example

Shattering Thresholds for Random Systems of Sets, Words, and Permutations

This paper considers a problem that relates to the theories of covering arrays, permutation patterns, Vapnik-Chervonenkis (VC) classes, and probability thresholds. Specifically, we want to find the number of subsets of [n]:={1,2,....,n} we need to randomly select, in a certain probability space, so as to respectively "shatter" all t-subsets of [n]. Moving from subsets to words, we ask for the number of n-letter words on a q-letter alphabet that are needed to shatter all t-subwords of the q^n words of length n. Finally, we explore the number of random permutations of [n] needed to shatter (specializing to t=3), all length 3 permutation patterns in specified positions. We uncover a very sharp zero-one probability threshold for the emergence of such shattering; Talagrand's isoperimetric inequality in product spaces is used as a key tool.Comment: 25 page