A frequency measure robust to linear filtering

It is noted that the determination of an oscillation frequency by used of the power spectrum of measured time series is susceptible to filtering of the signal. Similarly, frequency measurements made by period counting can yield different, results depending on how the signal is filtered for noise reduction. In an attempt to eliminate these ambiguities, a new measure of frequency, based on an approximate reconstruction of the phase-space trajectory of the oscillator from the signal, is introduced. This measure is shown to be invariant under linear filtering. For this reason, it is also inaccessible by spectral methods. The effect of filtering on frequency for weakly nonlinear, noisy oscillators, to which this definition applies only imperfectly, is quantified. This work provides the theoretical basis for frequency measurements employing MIRVA filtering.

Data-driven optimal filtering for phase and frequency of noisy oscillations: Application to vortex flow metering

A method for measuring the phase of oscillations from noisy time series is proposed. To obtain the phase, the signal is filtered in such a way that the filter output has minimal relative variation in the amplitude over all filters with complex-valued impulse response. The argument of the filter output yields the phase. Implementation of the algorithm and interpretation of the result are discussed. We argue that the phase obtained by the proposed method has a low susceptibility to measurement noise and a low rate of artificial phase slips. The method is applied for the detection and classification of mode locking in vortex flow meters. A measure for the strength of mode locking is proposed.

Improved Nonlinear PCA for Process Monitoring Using Support Vector Data Description

Nonlinear principal component analysis (PCA) based on neural networks has drawn significant attention as a monitoring tool for complex nonlinear processes, but there remains a difficulty with determining the optimal network topology. This paper exploits the advantages of the Fast Recursive Algorithm, where the number of nodes, the location of centres, and the weights between the hidden layer and the output layer can be identified simultaneously for the radial basis function (RBF) networks. The topology problem for the nonlinear PCA based on neural networks can thus be solved. Another problem with nonlinear PCA is that the derived nonlinear scores may not be statistically independent or follow a simple parametric distribution. This hinders its applications in process monitoring since the simplicity of applying predetermined probability distribution functions is lost. This paper proposes the use of a support vector data description and shows that transforming the nonlinear principal components into a feature space allows a simple statistical inference. Results from both simulated and industrial data confirm the efficacy of the proposed method for solving nonlinear principal component problems, compared with linear PCA and kernel PCA.

High contrast plasma mirror: spatial filtering and second harmonic generation at 10(19)Wcm(-2)

Recently, the use of plasma optics to improve temporal pulse contrast has had a remarkable impact on the field of high- power laser-solid density interaction physics. Opening an avenue to previously unachievable plasma density gradients in the high intensity focus, this advance has enabled researchers to investigate new regimes of harmonic generation and ion acceleration. Until now, however, plasma optics for fundamental laser reflection have been used in the sub-relativistic intensity regime (10(15) - 10(16)Wcm(-2)) showing high reflectivity (similar to 70%) and good focusability. Therefore, the question remains as to whether plasma optics can be used for such applications in the relativistic intensity regime (> 10(18)Wcm(-2)). Previous studies of plasma mirrors (PMs) indicate that, for 40 fs laser pulses, the reflectivity fluctuates by an order of magnitude and that focusability of the beam is lost as the intensity is increased above 5 x 10(16)Wcm(-2). However, these experiments were performed using laser pulses with a contrast ratio of similar to 10(7) to generate the reflecting surface. Here, we present results for PM operation using high contrast laser pulses resulting in a new regime of operation - the high contrast plasma mirror (HCPM). In this regime, pulses with contrast ratio > 10(10) are used to form the PM surface at > 10(19)Wcm(-2), displaying excellent spatial filtering, reflected near- field beam profile of the fundamental beam and reflectivities of 60 +/- 5%. Efficient second harmonic generation is also observed with exceptional beam quality suggesting that this may be a route to achieving the highest focusable harmonic intensities. Plasma optics therefore offer the opportunity to manipulate ultra-intense laser beams both spatially and temporally. They also allow for ultrafast frequency up-shifting without detrimental effects due to group velocity dispersion (GVD) or reduced focusability which frequently occur when nonlinear crystals are used for frequency conversion.

Improved conjugate gradient implementation for least squares support vector machines

As a promising method for pattern recognition and function estimation, least squares support vector machines (LS-SVM) express the training in terms of solving a linear system instead of a quadratic programming problem as for conventional support vector machines (SVM). In this paper, by using the information provided by the equality constraint, we transform the minimization problem with a single equality constraint in LS-SVM into an unconstrained minimization problem, then propose reduced formulations for LS-SVM. By introducing this transformation, the times of using conjugate gradient (CG) method, which is a greatly time-consuming step in obtaining the numerical solution, are reduced to one instead of two as proposed by Suykens et al. (1999). The comparison on computational speed of our method with the CG method proposed by Suykens et al. and the first order and second order SMO methods on several benchmark data sets shows a reduction of training time by up to 44%. (C) 2011 Elsevier B.V. All rights reserved.

An expression vector containing a rhamnose-inducible promoter provides tightly regulated gene expression in Burkholderia cenocepacia

Infection of the respiratory tract caused by Burkholderia cepacia complex poses a serious risk for cystic fibrosis (CF) patients due to the high morbidity and mortality associated with the chronic infection and the lack of efficacious antimicrobial treatments. A detailed understanding of the pathogenicity of B. cepacia complex infections is hampered in part by the limited availability of genetic tools and the inherent resistance of these isolates to the most common antibiotics used for genetic selection. In this study, we report the construction of an expression vector which uses the rhamnose-regulated P(rhaB) promoter of Escherichia coli. The functionality of the vector was assessed by expressing the enhanced green fluorescent protein (eGFP) gene (e-gfp) and determining the levels of fluorescence emission. These experiments demonstrated that P(rhaB) is responsive to low concentrations of rhamnose and it can be effectively repressed with 0.2% glucose. We also demonstrate that the tight regulation of gene expression by P(rhaB) promoter allows us to extend the capabilities of this vector to the identification of essential genes.

A Kernel Interleaved Scheduling Method for Streaming Applications on Soft-core Vector Processors

Massively parallel networks of highly efficient, high performance Single Instruction Multiple Data (SIMD) processors have been shown to enable FPGA-based implementation of real-time signal processing applications with performance and
cost comparable to dedicated hardware architectures. This is achieved by exploiting simple datapath units with deep processing pipelines. However, these architectures are highly susceptible to pipeline bubbles resulting from data and control hazards; the only way to mitigate against these is manual interleaving of
application tasks on each datapath, since no suitable automated interleaving approach exists. In this paper we describe a new automated integrated mapping/scheduling approach to map algorithm tasks to processors and a new low-complexity list scheduling technique to generate the interleaved schedules. When applied to a spatial Fixed-Complexity Sphere Decoding (FSD) detector
for next-generation Multiple-Input Multiple-Output (MIMO) systems, the resulting schedules achieve real-time performance for IEEE 802.11n systems on a network of 16-way SIMD processors on FPGA, enable better performance/complexity balance than current approaches and produce results comparable to handcrafted implementations.