Results 1  10
of
348,192
NEW VIEWPOINTS IN MASS FILTER DESIGN
, 1982
"... The quadrupole mass filter (QMF) is ubiquitous in military and civilian mass spectrometry laboratories. This instrument is used by chemists to determine the mass distribution associated with a sample. As illustrated in figure 1, a QMF has four pole pieces and each of these is ..."
Abstract
 Add to MetaCart
The quadrupole mass filter (QMF) is ubiquitous in military and civilian mass spectrometry laboratories. This instrument is used by chemists to determine the mass distribution associated with a sample. As illustrated in figure 1, a QMF has four pole pieces and each of these is
Axiomatic quantum field theory in curved spacetime
, 2008
"... The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary globa ..."
Abstract

Cited by 682 (18 self)
 Add to MetaCart
of the spinstatistics theorem and the PCT theorem. Some potentially significant further implications of our new viewpoint on quantum field theory are discussed.
A New Viewpoint to Fourier Analysis in Fractal Space
, 2012
"... Fractional analysis is an important method for mathematics and engineering [121], and fractional differentiation inequalities are great mathematical topic for research [2224]. In the present paper we point out a new viewpoint to Fourier analysis in fractal space based on the local fractional calcu ..."
Abstract
 Add to MetaCart
Fractional analysis is an important method for mathematics and engineering [121], and fractional differentiation inequalities are great mathematical topic for research [2224]. In the present paper we point out a new viewpoint to Fourier analysis in fractal space based on the local fractional
Smooth minimization of nonsmooth functions
 Math. Programming
, 2005
"... In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex optimization. It is based on a special smoothing technique, which can be applied to the functions with explicit maxstructure. Our approach can be considered as an alternative to blackbox minimization. F ..."
Abstract

Cited by 504 (1 self)
 Add to MetaCart
In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex optimization. It is based on a special smoothing technique, which can be applied to the functions with explicit maxstructure. Our approach can be considered as an alternative to blackbox minimization
A Theory of the Learnable
, 1984
"... Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from ..."
Abstract

Cited by 1965 (15 self)
 Add to MetaCart
Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from
Robust wide baseline stereo from maximally stable extremal regions
 In Proc. BMVC
, 2002
"... The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly desir ..."
Abstract

Cited by 998 (34 self)
 Add to MetaCart
The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly de
New Viewpoint to CPviolation and Quarkmixing
, 1997
"... The relation between CPviolation phase angle and the other three mixing angles in CabibboKobayashiMaskawa matrix is postulated. This relation has a very definite geometry meaning. The numerical result coincides surprisingly with that extracting from the experiments. It can be further put to the m ..."
Abstract
 Add to MetaCart
to the more precise tests in the future. PACS number(s): 11.30.Er, 12.10.Ck, 13.25.+mNew Viewpoint to CPviolation and Quarkmixing Although more than thirty years have passed after the discovery of CP violation [1], our understanding about CP violation [26] is still very poor. In the Standard Model (SM), CP
New Viewpoint to the Source of Weak CP Phase
, 1997
"... The relation between CPviolation phase angle and the other three mixing angles in CabibboKobayashiMaskawa matrix is postulated. This relation has a very definite geometry meaning. The numerical result coincides surprisingly with that extracting from the experiments. It can be further put to the m ..."
Abstract
 Add to MetaCart
to the more precise tests in the future. PACS number(s): 11.30.Er, 12.10.Ck, 13.25.+mNew Viewpoint to the Source of Weak CP Phase Although more than thirty years have elapsed since the discovery of CP violation [1], our understanding about the source of CP violation is still very poor. In the Minimal Standard
The Dantzig selector: statistical estimation when p is much larger than n
, 2005
"... In many important statistical applications, the number of variables or parameters p is much larger than the number of observations n. Suppose then that we have observations y = Ax + z, where x ∈ R p is a parameter vector of interest, A is a data matrix with possibly far fewer rows than columns, n ≪ ..."
Abstract

Cited by 854 (14 self)
 Add to MetaCart
≪ p, and the zi’s are i.i.d. N(0, σ 2). Is it possible to estimate x reliably based on the noisy data y? To estimate x, we introduce a new estimator—we call the Dantzig selector—which is solution to the ℓ1regularization problem min ˜x∈R p ‖˜x‖ℓ1 subject to ‖A T r‖ℓ ∞ ≤ (1 + t −1) √ 2 log p · σ
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 572 (5 self)
 Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97
Results 1  10
of
348,192