A nanospray MS3 method deployed on a quadrupole linear ion trap hybrid can detect targeted peptides with high dynamic range and high sensitivity from complex mixtures without separations. The method uses a recognition...
详细信息
A nanospray MS3 method deployed on a quadrupole linear ion trap hybrid can detect targeted peptides with high dynamic range and high sensitivity from complex mixtures without separations. The method uses a recognition algorithm that is a modification of the relative (Kullback-Leibler, KO entropy characterization of probabilistic distance to detect if reference MS3 fragmentation patterns are components of acquired MS3 spectra. The recognition reflects the probabilistic structure of physical MS measurements unlike the euclidean or inner product metrics widely used for comparing spectra. It capably handles spectra with a significant chemical ion background in contrast to the euclidean metric or the direct relative entropy. The full nanospray MS3 method allows both the detection and quantitation of targets without the need to obtain isotopically labeled standards. By avoiding chromatographic separations and its associated surface losses, the detection can be applied to complex samples on a very limited material scale. The methodology is illustrated by applications to the medically important problem of detecting targeted major histocompatibility complex (MHC) I associated peptides extracted from limited cell numbers.
We establish global existence for the energy-critical nonlinear Schrodinger equation on S-3. This follows similar lines to the work on T-3 but requires new extinction results for linear solutions and bounds on the int...
详细信息
We establish global existence for the energy-critical nonlinear Schrodinger equation on S-3. This follows similar lines to the work on T-3 but requires new extinction results for linear solutions and bounds on the interaction of a euclidean profile and a linear wave of much higher frequency that are adapted to the new geometry. (C) 2013 Elsevier Masson SAS. All rights reserved.
An improved delay-dependent H-infinity filtering design is proposed for linear, continuous, time-invariant systems with time delay. The resulting filter is of the Luenberger observer type, and it guarantees that the H...
详细信息
An improved delay-dependent H-infinity filtering design is proposed for linear, continuous, time-invariant systems with time delay. The resulting filter is of the Luenberger observer type, and it guarantees that the H-infinity-norm of the system, relating the exogenous signals to the estimation error, is less than a prescribed level. The filter is based on the application of the descriptor model transformation and Park's inequality for the bounding of cross terms. The advantage of the new filtering scheme is clearly demonstrated via simple examples.
Hyperbolic symmetric mappings defined on hyperbolic tilings are investigated. Ljapunov exponents of the dynamic systems are computed with the euclidean distance. The parameter combinations with great impact on the cha...
详细信息
Hyperbolic symmetric mappings defined on hyperbolic tilings are investigated. Ljapunov exponents of the dynamic systems are computed with the euclidean distance. The parameter combinations with great impact on the characteristics of the dynamic systems were chosen as the window coordinates for construction of generalized Mandelbrot sets. The accelerated direct search algorithm is used to search for the set of the critical points in the fundamental region. The parameter space is separated into chaotic, periodic and mixed regions by the Ljapunov exponents of the critical points. The generalized Mandelbrot sets (M-set), which are the cross-sections of the parameter space, were constructed. Three different types of hyperbolic symmetry patients, which are chaotic attractors. filled-in Julia sets and mixed images composed of an attractor and a filled-in Julia set from the same set of parameters, were created by using, parameters from this kind of M-sets. (C) 2007 Elsevier Ltd. All rights reserved.
This paper studies the geometric and topological properties of complete open Riemannian manifolds which support a weighted Sobolev or log-Sobolev inequality. We show that the constant in the weighted Sobolev inequalit...
详细信息
This paper studies the geometric and topological properties of complete open Riemannian manifolds which support a weighted Sobolev or log-Sobolev inequality. We show that the constant in the weighted Sobolev inequality on a complete open Riemannian manifold should be bigger than or equal to the optimal one on the euclidean space of the same dimension and that a complete open manifold of asymptotically non-negative Ricci curvature supporting a weighted Sobolev inequality must have large volume growth. We also show that a complete manifold of non-negative Ricci curvature on which the log-Sobolev inequality holds is not very far from the euclidean space. (C) 2011 Elsevier Ltd. All rights reserved.
An enhanced degree computationless modified Euclid's (E-DCME) algorithm for Reed-Solomon (RS) decoders is proposed. The algorithm does not require the degree computation and comparison circuits. In addition, the E...
详细信息
An enhanced degree computationless modified Euclid's (E-DCME) algorithm for Reed-Solomon (RS) decoders is proposed. The algorithm does not require the degree computation and comparison circuits. In addition, the E-DCME algorithm can reduce the number of basic cells and the latency to solve the key equation since it uses new initial conditions. The E-DCME architecture using the Samsung 0.18 mu m cell library consists of only 18 000 gates.
In the present paper, we consider the problem of computing the norm of the transfer matrix of a neutral type linear system. We obtain a explicit expression for the required norm, which generalizes the well-known expre...
详细信息
In the present paper, we consider the problem of computing the norm of the transfer matrix of a neutral type linear system. We obtain a explicit expression for the required norm, which generalizes the well-known expression for the norm of the transfer matrix of a delay-free linear time-invariant system. An example illustrating the computation procedure is considered.
This paper deals with two different asymptotically fast algorithms for the computation of ideal sums in quadratic orders. If the class number of the quadratic number field is equal to 1, these algorithms can be used t...
详细信息
This paper deals with two different asymptotically fast algorithms for the computation of ideal sums in quadratic orders. If the class number of the quadratic number field is equal to 1, these algorithms can be used to calculate the GCD in the quadratic order. We show that the calculation of an ideal sum in a fixed quadratic order can be done as fast as in Z up to a constant factor, i.e., in O(mu(n) log n), where n bounds the size of the operands and mu(n) denotes an upper bound for the multiplication time of n-bit integers. Using Schonhage-Strassen's asymptotically fast multiplication for n-bit integers, we achieve mu(n) = O(n log n log log n).
Let X-1,...,X-N is an element of R-n be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability one has sup x is an elem...
详细信息
Let X-1,...,X-N is an element of R-n be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability one has sup x is an element of Sn-1 vertical bar 1/N Sigma(N)(i=1)(vertical bar < X-i, x >vertical bar(2) - E vertical bar < X-i, x >vertical bar(2))vertical bar <= C root n/N, where C is an absolute positive constant. This result is valid in a more general framework when the linear forms (< X-i, x >)(i <= N), x is an element of Sn-1 and the euclidean norms (vertical bar X-i vertical bar/root n)(i <= N) exhibit uniformly a sub-exponential decay. As a consequence, if A denotes the random matrix with columns (X-i), then with overwhelming probability, the extremal singular values lambda(min) and lambda(max) of AA(T) satisfy the inequalities 1 - C root n/N <= lambda(min)/N <= lambda(max)/N <= 1 + C root n/N which is a quantitative version of Bai-Yin theorem (Z.D. Bai, Y.Q. Yin, 1993 [4]) known for random matrices with i.i.d. entries. (C) 2010 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved.
暂无评论