An approach to nonstandard quantum mechanics

We use nonstandard analysis to formulate quantum mechanics in hyperfinite-dimensional spaces. Self-adjoint operators on hyperfinite-dimensional spaces have complete eigensets, and bound states and continuum states of a Hamiltonian can thus be treated on an equal footing. We show that the formalism extends the standard formulation of quantum mechanics. To this end we develop the Loeb-function calculus in nonstandard hulls. The idea is to perform calculations in a hyperfinite-dimensional space, but to interpret expectation values in the corresponding nonstandard hull. We further apply the framework to non-relativistic quantum scattering theory. For time-dependent scattering theory, we identify the starting time and the finishing time of a scattering experiment, and we obtain a natural separation of time scales on which the preparation process, the interaction process, and the detection process take place. For time-independent scattering theory, we derive rigorously explicit formulas for the M{\o}ller wave operators and the S-Matrix

Pions: Experimental Tests of Chiral Symmetry Breaking

Based on the spontaneous breaking of chiral symmetry, chiral perturbation theory (ChPT) is believed to approximate confinement scale QCD. Dedicated and increasingly accurate experiments and improving lattice calculations are confirming this belief, and we are entering a new era in which we can test confinement scale QCD in some well chosen reactions. This is demonstrated with an overview of low energy experimental tests of ChPT predictions of $\pi\pi$ scattering, pion properties, $\pi$N scattering and electromagnetic pion production. These predictions have been shown to be consistent with QCD in the meson sector by increasingly accurate lattice calculations. At present there is good agreement between experiment and ChPT calculations, including the $\pi\pi$ and $\pi$N s wave scattering lengths and the $\pi^{0}$ lifetime. Recent, accurate pionic atom data are in agreement with chiral calculations once isospin breaking effects due to the mass difference of the up and down quarks are taken into account, as was required to extract the $\pi\pi$ scattering lengths. In addition to tests of the theory, comparisons between $\pi\pi$ and $\pi$N interactions based on general chiral principles are discussed. Lattice calculations are now providing results for the fundamental, long and inconclusively studied, $\pi$N $\sigma$ term and the contribution of the strange quark to the mass of the proton. Increasingly accurate experiments in electromagnetic pion production experiments from the proton which test ChPT calculations (and their energy region of validity) are presented. These experiments are also beginning to measure the final state $\pi$N interaction. This paper is based on the concluding remarks made at the Chiral Dynamics Workshop CD12 held at Jefferson Lab in Aug. 2012.Comment: 13 pages, 8 fig

Automatic communication signal monitoring system

A system is presented for automatic monitoring of a communication signal in the RF or IF spectrum utilizing a superheterodyne receiver technique with a VCO to select and sweep the frequency band of interest. A first memory is used to store one band sweep as a reference for continual comparison with subsequent band sweeps. Any deviation of a subsequent band sweep by more than a predetermined tolerance level produces an alarm signal which causes the band sweep data temporarily stored in one of two buffer memories to be transferred to long-term store while the other buffer memory is switched to its store mode to assume the task of temporarily storing subsequent band sweeps

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

We study dynamic $(1+\epsilon)$-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected $n$-node $m$-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of $\tilde O(mn/\epsilon)$ and constant query time by Roditty and Zwick [FOCS 2004]. The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach [JACM 1981]; it has a total update time of $O(mn^2)$ and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of $\tilde O(n^{5/2}/\epsilon)$ and constant query time that has an additive error of $2$ in addition to the $1+\epsilon$ multiplicative error. This beats the previous $\tilde O(mn/\epsilon)$ time when $m=\Omega(n^{3/2})$. Note that the additive error is unavoidable since, even in the static case, an $O(n^{3-\delta})$-time (a so-called truly subcubic) combinatorial algorithm with $1+\epsilon$ multiplicative error cannot have an additive error less than $2-\epsilon$, unless we make a major breakthrough for Boolean matrix multiplication [Dor et al. FOCS 1996] and many other long-standing problems [Vassilevska Williams and Williams FOCS 2010]. The algorithm can also be turned into a $(2+\epsilon)$-approximation algorithm (without an additive error) with the same time guarantees, improving the recent $(3+\epsilon)$-approximation algorithm with $\tilde O(n^{5/2+O(\sqrt{\log{(1/\epsilon)}/\log n})})$ running time of Bernstein and Roditty [SODA 2011] in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of $\tilde O(mn/\epsilon)$ and a query time of $O(\log\log n)$. The algorithm has a multiplicative error of $1+\epsilon$ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein [STOC 2013].Comment: A preliminary version was presented at the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS 2013

The Limit Behavior Of The Trajectories of Dissipative Quadratic Stochastic Operators on Finite Dimensional Simplex

The limit behavior of trajectories of dissipative quadratic stochastic operators on a finite-dimensional simplex is fully studied. It is shown that any dissipative quadratic stochastic operator has either unique or infinitely many fixed points. If dissipative quadratic stochastic operator has a unique point, it is proven that the operator is regular at this fixed point. If it has infinitely many fixed points, then it is shown that $\omega-$ limit set of the trajectory is contained in the set of fixed points.Comment: 14 pages, accepted in Difference Eq. App