Local normalized linear summation kernel for fast and robust recognition

Kernel-based methods are effective for object detection and recognition. However, the computational cost when using kernel functions is high, except when using linear kernels. To realize fast and robust recognition, we apply normalized linear kernels to local regions of a recognition target, and the kernel outputs are integrated by summation. This kernel is referred to as a local normalized linear summation kernel. Here, we show that kernel-based methods that employ local normalized linear summation kernels can be computed by a linear kernel of local normalized features. Thus, the computational cost of the kernel is nearly the same as that of a linear kernel and much lower than that of radial basis function (RBF) and polynomial kernels. The effectiveness of the proposed method is evaluated in face detection and recognition problems, and we confirm that our kernel provides higher accuracy with lower computational cost than RBF and polynomial kernels. In addition, our kernel is also robust to partial occlusion and shadows on faces since it is based on the summation of local kernels.     

A control method with pheromone information for a transport system

Since the control methods of a transport system between processing machines are specialized for each layout of the system, it is difficult to design prompt schedules and control logic for new complicated systems, especially in cases of machine faults or restructuring the system to modify the layout. In this article, we describe a multiagent transport control system which utilizes pheromone information. Each element of the system acts as an agent and estimates the appropriate path and time to drive out the products using information obtained by communication with other elements as well as pheromone information deposited on the tracks of the products.     

Peroxiredoxin 2 as a chemotherapy responsiveness biomarker candidate in osteosarcoma revealed by proteomics

Purpose : We aimed to identify novel chemotherapy responsiveness biomarkers for osteosarcoma (OS) by investigating the global protein expression profile of 12 biopsy samples from OS patients. Experimental design : Six patients were classified as good responders and six as poor responders, according to the Huvos grading system. The protein expression profiles obtained by 2‐D DIGE consisted of 2250 protein spots. Results : Among them, we identified 55 protein spots whose intensity was significantly different (Bonferroni adjusted p‐value<0.01) between the two patient groups. Mass spectrometric protein identification demonstrated that the 55 spots corresponded to 38 distinct gene products including peroxiredoxin 2 (PRDX 2). Use of a specific antibody against PRDX 2 confirmed the differential expression of PRDX 2 between good and poor responders, while PRDX 2 levels as measured by Western blotting correlated highly with their corresponding 2‐D DIGE values. The predictive value of PRDX 2 expression was further confirmed by examining an additional four OS cases using Western blotting. Conclusions and clinical relevance : These results establish PRDX 2 as a candidate for chemotherapy responsiveness marker in OS. Measuring PRDX 2 in biopsy samples before treatment may contribute to more effective management of OS.     

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.     

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.