A NEW ALGORITHM FOR ADAPTIVE LATTICE FILTERAND ITS APPLICATION IN THE SPEECH LINEARPREDICTIVE SYNTHESIS

In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients.     

Computational complexity of queries based on itemsets

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.     

Width-restricted layering of acyclic digraphs with consideration of dummy nodes

This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width.     

Interaction bounds in multivariable control systems

Time-domain limitations due to right half-plane zeros and poles in linear multivariable control systems are studied. Lower bounds on the interaction are derived. They show not only how the location of zeros and poles are critical in multivariable systems, but also how the zero and pole directions influence the performance. The results are illustrated on the quadruple-tank process, which is a new multivariable laboratory process.     

A dynamic linear programming approach to market allocation of renewable resources in the italian energy system: The case of solar thermal and biogas technologies

In Italy solar thermal energy and energy from biogas are two possible means of reducing dependence on energy imports. Using a multiperiod LP model (MARKAL) the authors assessed the likely potential of both technologies under various circumstances. The study covered the period 1980–2005, in five segments of five years. It focused only on the subsystem of the energy end-uses which can be substituted for by solar thermal and biogas technologies. The overall non-renewable sources which can be saved in 20 years by these technologies total 450 PJ (1 PJ = 10^{1 5} J) if the fuel prices rise at 0 per cent average annual, 1450 PJ if the fuel prices rise at 4.2 per cent average annual, 1860 PJ if the fuel prices rise at 7.2 per cent average annual and 3780 PJ if the fuel prices rise at 15 per cent average annual. However the most competitive technologies appear to be solar water heaters used mainly in the private and commercial sectors and biogas systems used mainly in the agricultural sector. The study was carried out by APRE under ENEA (formerly CNEN) contract and was intended to serve as an analytical basis for establishing an overall development and demonstration strategy for end-use renewable technologies in Italy.     

Extensions of LDA by PCA mixture model and class-wise features

Linear discriminant analysis (LDA) is a data discrimination technique that seeks transformation to maximize the ratio of the between-class scatter and the within-class scatter. While it has been successfully applied to several applications, it has two limitations, both concerning the underfitting problem. First, it fails to discriminate data with complex distributions since all data in each class are assumed to be distributed in the Gaussian manner. Second, it can lose class-wise information, since it produces only one transformation over the entire range of classes. We propose three extensions of LDA to overcome the above problems. The first extension overcomes the first problem by modelling the within-class scatter using a PCA mixture model that can represent more complex distribution. The second extension overcomes the second problem by taking different transformation for each class in order to provide class-wise features. The third extension combines these two modifications by representing each class in terms of the PCA mixture model and taking different transformation for each mixture component. It is shown that all our proposed extensions of LDA outperform LDA concerning classification errors for synthetic data classification, hand-written digit recognition, and alphabet recognition.     

Wake and aerodynamics loads in multiple bodies—application to turbomachinery blade rows

Two-dimensional, unsteady flow around bodies of complex geometry (or multiple bodies) at high Reynolds number is simulated using the vortex method. This method is modified to take into account the sub-grid scale phenomena through a second order velocity structure function model adapted to the Lagrangian scheme. The dynamics of the body wake is computed using the convection-diffusion splitting algorithm; the convection process is carried out with a Lagrangian Adams-Bashforth time-marching scheme and the diffusion process is simulated using the random walk method. The pressure distribution is obtained using an integral equation derived from the pressure Poisson equation, which was first developed for a single body. Results for the numerical simulation around a linear cascade of airfoils are presented. As the flow is periodic in the y direction, the discrete vortex shedding need only be considered for a reference airfoil. The flow characteristics around the NACA 65-410 series airfoils are calculated and comparisons are made with results available in the literature.     

PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance

We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the generation of strings of symbols, that have been used in the context of speech and handwriting recognition, and bioinformatics. Recent work on learning PDFAs from random examples has used the KL-divergence as the error measure; here we use the variation distance. We build on recent work by Clark and Thollard, and show that the use of the variation distance allows simplifications to be made to the algorithms, and also a strengthening of the results; in particular that using the variation distance, we obtain polynomial sample size bounds that are independent of the expected length of strings.     

解线性及二次型规划问题增广的神经网络

本文提出了一个解线性及二次型规划问题的神经网络模型，证明了该网络是全局稳定于平衡点，而平衡点就是线性及二次型规划问题的解，该网络的优点是能够实时获得问题的精确解，且可以同时获得带等式不式约束的对偶问题解，该网络易于电路实现。     

圆杆弹性和弹—塑性扭转公式的探讨

对圆杆在线弹性阶段，弹－塑性阶段和全塑性阶段的扭转剪应力的计算公式作了分析，并推导了在材料的应力－应变关系（τ－γ关系）不服从虎克定律时，扭转真实剪应力的计算公式。文中对扭转强度计算公式的来源，物理含义及其都作了详细的说明。这对执行和理解国家ＧＢ１０１２８－８８《金属室温扭转试验方法》是有益的，而且对高校中材料力学的教学具有一定的参考价值。