D We investigate the complexity of derivations from logic programs, and find it closely related to the complexity of computations of alternating Turing machines. In particular, we define three complexity measures over logic programs-goal-size, length, and depth-and show that goal-size is linearly related to alternating space, the product of length and goal-size is linearly related to alternatin...

Objective. Low gene expression in rare cell subpopulations can make it difficult to identify transcripts using real time quantitative RT-PCR (qRT-PCR). Transcript number can be increased using linear amplification, but this technique amplifies the 3’ end of mRNA, imposing severe limitations on qRT-PCR primer design. Artifacts such as primer-dimers, introduced by these limitations, may interfere...

We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in ...

Linearly-implicit two-step peer methods are successfully applied in the numerical solution of ordinary differential and differential-algebraic equations. One of their strengths is that even highorder methods do not show order reduction in computations for stiff problems. With this property, peer methods commend themselves as time-stepping schemes in finite element calculations for timedependent...

Based on Lyapunov stability theory and matrix measure, this paper presents a new generic criterion of global chaotic synchronization for bidirectional coupled chaotic system with time-delay. A new chaotic system with four-scroll attractor is chosen as an example to verify the effectiveness of the criterion. Numerical simulation are shown for demonstration. 2006 Published by Elsevier Ltd.

Temporal databases, databases of events in an ordered domain, have attracted attention since the early 90’s, and the complexity of evaluating various queries on such databases has been analyzed [1, 10]. One important issue is an efficient algorithm for a query on an indefinite data over a linearly ordered domain, i.e., efficiently answering a query as to whether all possible models of incomplet...

To support high data rate wireless communications, in this paper, based on the linearly constrained constant modulus (LCCM) criterion, the reverse link performance of the multi-carrier code division multiple access (MC-CDMA) receiver, with frequency combiner, and having smart antenna arrays beamformer in base station, has been investigated over the Rayleigh fading channel. By using the Kronecke...

A time-resolved photoacoustic technique has been applied to the study of dissolved and dispersed absorbers in aqueous systems. The temporal pressure profiles generated from colloidal graphite and glucose solutions were measured, and it was found that the amplitude of the photoacoustic signal of both the glucose and the colloidal graphite solutions increase linearly with concentration and that a...

Supervised Fisher Linear Discriminant Analysis (LDA) is a classical dimensionality reduction approach. LDA assumes each class has a Gaussian density and may suffer from the singularity problem when handling high-dimensional data. We in this work consider more general class densities and show that optimizing LDA criterion cannot always achieve maximum class discrimination with the geometrical ba...

In this article, the convergence of the often used iterative softthresholding algorithm for the solution of linear operator equations in infinite dimensional Hilbert spaces is analyzed in detail. As main result we show that the algorithm converges with linear rate as soon as the underlying operator satisfies the so-called finite basis injectivity property. This result quantifies the experience ...