Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem

This paper presents an algebraic approach to polynomial spectral factorization, an important mathematical tool in signal processing and control. The approach exploits an intriguing relationship between the theory of Gröbner bases and polynomial spectral factorization which can be observed through the sum of roots, and allows us to perform polynomial spectral factorization in the presence of real parameters. It is discussed that parametric polynomial spectral factorization enables us to express quantities such as the optimal cost in terms of parameters and the sum of roots. Furthermore an optimization method over parameters is suggested that makes use of the results from parametric polynomial spectral factorization and also employs two quantifier elimination techniques. This proposed approach is demonstrated in a numerical example of a particular control problem.     

Pose-Invariant Facial Expression Recognition Using Variable-Intensity Templates

In this paper, we propose a method for pose-invariant facial expression recognition from monocular video sequences. The advantage of our method is that, unlike existing methods, our method uses a simple model, called the variable-intensity template, for describing different facial expressions. This makes it possible to prepare a model for each person with very little time and effort. Variable-intensity templates describe how the intensities of multiple points, defined in the vicinity of facial parts, vary with different facial expressions. By using this model in the framework of a particle filter, our method is capable of estimating facial poses and expressions simultaneously. Experiments demonstrate the effectiveness of our method. A recognition rate of over 90% is achieved for all facial orientations, horizontal, vertical, and in-plane, in the range of ±40 degrees, ±20 degrees, and ±40 degrees from the frontal view, respectively. Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.     

Performance of SOR methods on modern vector and scalar processors

The building-cube method (BCM) is a new generation algorithm for CFD simulations. The basic idea of BCM is to simplify the algorithm in all stages of flow computation to achieve large-scale simulations. Calculation of a pressure field using the Successive Over Relaxation (SOR) method consumes most of the total execution time required for BCM. In this paper, effective implementations on modern vector and scalar processors are investigated. NEC SX-9 and Intel Nehalem-EX are the latest vector and scalar processors. Those processors have much higher peak performances than their previous-generation processors. However, their memory bandwidth improvement cannot catch up with the performance improvement of processors. This is the so-called memory wall problem. In our paper, we discuss optimization techniques for implementation of the SOR method based on architectural characteristics of these modern processors, and evaluate their effects on the sustained performances of these processors for BCM.     

Theory of ion mobility in liquid3He

An ion interacting with quasiparticles in liquid³He is treated theoretically by summing most divergent terms in perturbation series of the self-energy of the ion and the vertex part. The ion Green's function is renormalized by a factorZ(T), and the vertex part byZ(T) ^?1, where \({\text{Z(T)}} = {\text{(T/T}}_F {\text{)}}^{{\text{2V}}_{{\text{0}}^{\rho ^{\text{2}} } }^{\text{2}} } \) , forT ₀?T?T _F. Here,T ₀=(m/M)T _F, withm the³He mass andM the ion mass, and \({\text{V}}_{0^\rho } \) is the strength of the interaction. The factor explains the weak temperature dependence of the mobility around the minimum atT ₀; we also discuss its effect on the behavior of the mobility in³He-B nearT _c.     

Long-term availability prediction for groups of volunteer resources

Volunteer computing uses the free resources in Internet and Intranet environments for large-scale computation and storage. Currently, 70 applications use over 12 PetaFLOPS of computing power from such platforms. However, these platforms are currently limited to embarrassingly parallel applications. In an effort to broaden the set of applications that can leverage volunteer computing, we focus on the problem of predicting if a group of resources will be continuously available for a relatively long time period. Ensuring the collective availability of volunteer resources is challenging due to their inherent volatility and autonomy. Collective availability is important for enabling parallel applications and workflows on volunteer computing platforms. We evaluate our predictive methods using real availability traces gathered from hundreds of thousands of hosts from the SETI@home volunteer computing project. We show our prediction methods can guarantee reliably the availability of collections of volunteer resources. We show that this is particularly useful for service deployments over volunteer computing environments.     

Efficient blind dereverberation and echo cancellation based on independent component analysis for actual acoustic signals

This letter presents a new algorithm for blind dereverberation and echo cancellation based on independent component analysis (ICA) for actual acoustic signals. We focus on frequency domain ICA (FD-ICA) because its computational cost and speed of learning convergence are sufficiently reasonable for practical applications such as hands-free speech recognition. In applying conventional FD-ICA as a preprocessing of automatic speech recognition in noisy environments, one of the most critical problems is how to cope with reverberations. To extract a clean signal from the reverberant observation, we model the separation process in the short-time Fourier transform domain and apply the multiple input/output inverse-filtering theorem (MINT) to the FD-ICA separation model. A naive implementation of this method is computationally expensive, because its time complexity is the second order of reverberation time. Therefore, the main issue in dereverberation is to reduce the high computational cost of ICA. In this letter, we reduce the computational complexity to the linear order of the reverberation time by using two techniques: (1) a separation model based on the independence of delayed observed signals with MINT and (2) spatial sphering for preprocessing. Experiments show that the computational cost grows in proportion to the linear order of the reverberation time and that our method improves the word correctness of automatic speech recognition by 10 to 20 points in a RT??= 670 ms reverberant environment.     

Magnetic Correlation in BETS2(Cl2TCNQ)

We carried out⁷⁷Se NMR measurements on BETS₂(Cl₂TCNQ) under pressure in order to investigate the magnetic properties of the insulating state which appears above 0.6 GPa. The relaxation rate 1/T₁ at 0.7 GPa shows small peak-like anomaly at 20 K, indicating a spin density wave transition as observed in BETS₂(Br₂TCNQ).     

Plan for first phase of safety demonstration tests of the High Temperature Engineering Test Reactor (HTTR)

Safety demonstration tests using the High Temperature Engineering Test Reactor (HTTR) will be conducted for the purpose of demonstrating inherent safety features of High Temperature Gas-cooled Reactors (HTGRs) as well as providing the core and plant transient data for validation of HTGR safety analysis codes. The first phase safety demonstration test items include the reactivity insertion test and the coolant flow reduction test. In the reactivity insertion test, which is the control rod withdrawal test, one pair out of 16 pairs of control rods is withdrawn, simulating a reactivity insertion event. The coolant flow reduction test consists of the partial loss of coolant flow test and the gas circulators trip test. In the partial loss of coolant flow test, primary coolant flow rate is slightly reduced by control system. In the gas circulators trip test one and two out of three gas circulators are run down, simulating coolant flow reduction events. The gas circulators trip tests, in which position of control rods are kept unchanged, are simulation tests of anticipated transients without scram (ATWS).     

A fast and compact elimination method of empty elements from a double‐array structure

A double‐array is a well‐known data structure to implement the trie. However, the space efficiency of the double‐array degrades with the number of key deletions because the double‐array keeps empty elements produced by the key deletion. This paper presents a fast and compact elimination method of empty elements using properties of the trie nodes that have no siblings. The present elimination method is implemented by C language. From simulation results for large sets of keys, the present elimination method is about 30–330 times faster than the conventional elimination method and maintains high space efficiency. Copyright © 2003 John Wiley & Sons, Ltd.     

Frequency range extension of actively mode-locked lasers integratedwith electroabsorption modulators using chirped gratings

We have fabricated actively mode-locked lasers integrated with electroabsorption modulators and chirped gratings. A chirped grating with a large chirp rate of 1.45 Å/μm can be realized by using multiphase-shifted patterns. Short pulses of 4-6 ps were generated over a wide frequency range from 18.9-19.8 GHz. We observed jumps in the wavelength during detuning. These jumps arise from multiple lobes in the reflectivity spectrum. It is found that the wavelength jumps cause increases in the intensity noise. We showed that by reducing the grating length from 150 to 100 μm the sidelobes were suppressed and the detuning frequency range of over 1% could be realized. A smaller pulsewidth was obtained for the negatively-chirped gratings when compared to the positively chirped gratings