Joint decoding of multiple speech patterns for robust speech recognition

We are addressing a new problem of improving automatic speech recognition performance, given multiple utterances of patterns from the same class. We have formulated the problem of jointly decoding K multiple patterns given a single Hidden Markov Model. It is shown that such a solution is possible by aligning the K patterns using the proposed Multi Pattern Dynamic Time Warping algorithm followed by the Constrained Multi Pattern Viterbi Algorithm The new formulation is tested in the context of speaker independent isolated word recognition for both clean and noisy patterns. When 10 percent of speech is affected by a burst noise at -5 dB Signal to Noise Ratio (local), it is shown that joint decoding using only two noisy patterns reduces the noisy speech recognition error rate to about 51 percent, when compared to the single pattern decoding using the Viterbi Algorithm. In contrast a simple maximization of individual pattern likelihoods, provides only about 7 percent reduction in error rate.

On the duality between rate and power optimizations

Sequence design problems are considered in this paper. The problem of sum power minimization in a spread spectrum system can be reduced to the problem of sum capacity maximization, and vice versa. A solution to one of the problems yields a solution to the other. Subsequently, conceptually simple sequence design algorithms known to hold for the white-noise case are extended to the colored noise case. The algorithms yield an upper bound of 2N - L on the number of sequences where N is the processing gain and L the number of non-interfering subsets of users. If some users (at most N - 1) are allowed to signal along a limited number of multiple dimensions, then N orthogonal sequences suffice.

The EU and Institutional Twinning in Morocco - An inquiry into the motives of cooperation through discourse ethics

This study examines Institutional Twinning in Morocco as a case of EU cooperation through the pragmatic, ethical and moral logics of reason in Jürgen Habermas’s discourse ethics. As a former accession tool, Twinning was introduced in 2004 for legal approximation in the context of the European Neighborhood Policy. Twinning is a unique instrument in development cooperation from a legal perspective. With its long historical and cultural ties to Europe, Morocco presents an interesting case study of this new form of cooperation. We will analyse motives behind the Twinning projects on illegal immigration, environment legislation and customs reform. As Twinning is a new policy instrument within the ENP context, there is relatively little preceding research, which, in itself, constitutes a reason to inquire into the subject. While introducing useful categories, the approaches discussing “normative power Europe” do not offer methodological tools precise enough to analyse the motives of the Twinning cooperation from a broad ethical standpoint. Helene Sjursen as well as Esther Barbé and Elisabeth Johansson-Nogués have elaborated on Jürgen Habermas’ discourse ethics in determining the extent of altruism in the ENP in general. Situating the analysis in the process-oriented framework of Critical Theory, discourse ethics provides the methodological framework for our research. The case studies reveal that the context in which they operate affects the pragmatic, ethical and moral aspirations of the actors. The utilitarian notion of profit maximization is quite pronounced both in terms of the number of Twinning projects in the economic sphere and the pragmatic logics of reason instrumental to security and trade-related issues. The historical background as well internal processes, however, contribute to defining areas of mutual interest to the actors as well as the motives Morocco and the EU sometimes described as the external projection of internal values. Through its different aspects, Twinning cooperation portrays the functioning of the pragmatic, ethical and moral logics of reason in international relations.

A generalized mathematical theory and experimental verification of proportional notches

A theory and generalized synthesis procedure is advocated for the design of weir notches and orifice-notches having a base in any given shape, to a depth a, such that the discharge through it is proportional to any singular monotonically-increasing function of the depth of flow measured above a certain datum. The problem is reduced to finding an exact solution of a Volterra integral equation in Abel form. The maximization of the depth of the datum below the crest of the notch is investigated. Proof is given that for a weir notch made out of one continuous curve, and for a flow proportional to the mth power of the head, it is impossible to bring the datum lower than (2m − 1)a below the crest of the notch. A new concept of an orifice-notch, having discontinuity in the curve and a division of flow into two distinct portions, is presented. The division of flow is shown to have a beneficial effect in reducing the datum below (2m − 1)a from the crest of the weir and still maintaining the proportionality of the flow. Experimental proof with one such orifice-notch is found to have a constant coefficient of discharge of 0.625. The importance of this analysis in the design of grit chambers is emphasized.

A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.

The EU and Institutional Twinning in Morocco - An inquiry into the motives of cooperation through discourse ethics

This study examines Institutional Twinning in Morocco as a case of EU cooperation through the pragmatic, ethical and moral logics of reason in Jürgen Habermas’s discourse ethics. As a former accession tool, Twinning was introduced in 2004 for legal approximation in the context of the European Neighborhood Policy. Twinning is a unique instrument in development cooperation from a legal perspective. With its long historical and cultural ties to Europe, Morocco presents an interesting case study of this new form of cooperation. We will analyse motives behind the Twinning projects on illegal immigration, environment legislation and customs reform. As Twinning is a new policy instrument within the ENP context, there is relatively little preceding research, which, in itself, constitutes a reason to inquire into the subject. While introducing useful categories, the approaches discussing “normative power Europe” do not offer methodological tools precise enough to analyse the motives of the Twinning cooperation from a broad ethical standpoint. Helene Sjursen as well as Esther Barbé and Elisabeth Johansson-Nogués have elaborated on Jürgen Habermas’ discourse ethics in determining the extent of altruism in the ENP in general. Situating the analysis in the process-oriented framework of Critical Theory, discourse ethics provides the methodological framework for our research. The case studies reveal that the context in which they operate affects the pragmatic, ethical and moral aspirations of the actors. The utilitarian notion of profit maximization is quite pronounced both in terms of the number of Twinning projects in the economic sphere and the pragmatic logics of reason instrumental to security and trade-related issues. The historical background as well internal processes, however, contribute to defining areas of mutual interest to the actors as well as the motives Morocco and the EU sometimes described as the external projection of internal values. Through its different aspects, Twinning cooperation portrays the functioning of the pragmatic, ethical and moral logics of reason in international relations.

Application of nonlinear filtering to credit risk

Merton's model views equity as a call option on the asset of the firm. Thus the asset is partially observed through the equity. Then using nonlinear filtering an explicit expression for likelihood ratio for underlying parameters in terms of the nonlinear filter is obtained. As the evolution of the filter itself depends on the parameters in question, this does not permit direct maximum likelihood estimation, but does pave the way for the `Expectation-Maximization' method for estimating parameters. (C) 2010 Elsevier B.V. All rights reserved.

Uncoupling Protein 2 and 3 Gene Polymorphisms and Their Association with Type 2 Diabetes in Asian Indians

Background: This study examined the association of -866G/A, Ala55Val, 45bpI/D, and -55C/T polymorphisms at the uncoupling protein (UCP) 3-2 loci with type 2 diabetes in Asian Indians. Methods: A case-control study was performed among 1,406 unrelated subjects (487 with type 2 diabetes and 919 normal glucose-tolerant NGT]), chosen from the Chennai Urban Rural Epidemiology Study, an ongoing population-based study in Southern India. The polymorphisms were genotyped using polymerase chain reaction-restriction fragment length polymorphism and direct sequencing. Haplotype frequencies were estimated using an expectation-maximization algorithm. Linkage disequilibrium was estimated from the estimates of haplotypic frequencies. Results: The genotype (P = 0.00006) and the allele (P = 0.00007) frequencies of Ala55Val of the UCP2 gene showed a significant protective effect against the development of type 2 diabetes. The odds ratios (adjusted for age, sex, and body mass index) for diabetes for individuals carrying Ala/Val was 0.72, and that for individuals carrying Val/Val was 0.37. Homeostasis insulin resistance model assessment and 2-h plasma glucose were significantly lower among Val-allele carriers compared to the Ala/Ala genotype within the NGT group. The genotype (P = 0.02) and the allele (P = 0.002) frequencies of -55C/T of the UCP3 gene showed a significant protective effect against the development of diabetes. The odds ratio for diabetes for individuals carrying CT was 0.79, and that for individuals carrying TT was 0.61. The haplotype analyses further confirmed the association of Ala55Val with diabetes, where the haplotypes carrying the Ala allele were significantly higher in the cases compared to controls. Conclusions: Ala55Val and -55C/T polymorphisms at the UCP3-2 loci are associated with a significantly reduced risk of developing type 2 diabetes in Asian Indians.

Bayesian Learning for Joint Sparse OFDM Channel Estimation and Data Detection

The impulse response of a typical wireless multipath channel can be modeled as a tapped delay line filter whose non-zero components are sparse relative to the channel delay spread. In this paper, a novel method of estimating such sparse multipath fading channels for OFDM systems is explored. In particular, Sparse Bayesian Learning (SBL) techniques are applied to jointly estimate the sparse channel and its second order statistics, and a new Bayesian Cramer-Rao bound is derived for the SBL algorithm. Further, in the context of OFDM channel estimation, an enhancement to the SBL algorithm is proposed, which uses an Expectation Maximization (EM) framework to jointly estimate the sparse channel, unknown data symbols and the second order statistics of the channel. The EM-SBL algorithm is able to recover the support as well as the channel taps more efficiently, and/or using fewer pilot symbols, than the SBL algorithm. To further improve the performance of the EM-SBL, a threshold-based pruning of the estimated second order statistics that are input to the algorithm is proposed, and its mean square error and symbol error rate performance is illustrated through Monte-Carlo simulations. Thus, the algorithms proposed in this paper are capable of obtaining efficient sparse channel estimates even in the presence of a small number of pilots.

Learning automata in feedforward connectionist systems

This paper analyses the behaviour of a general class of learning automata algorithms for feedforward connectionist systems in an associative reinforcement learning environment. The type of connectionist system considered is also fairly general. The associative reinforcement learning task is first posed as a constrained maximization problem. The algorithm is approximated hy an ordinary differential equation using weak convergence techniques. The equilibrium points of the ordinary differential equation are then compared with the solutions to the constrained maximization problem to show that the algorithm does behave as desired.

Tatonnement Mechanisms for Combinatorial Exchanges

Combinatorial exchanges are double sided marketplaces with multiple sellers and multiple buyers trading with the help of combinatorial bids. The allocation and other associated problems in such exchanges are known to be among the hardest to solve among all economic mechanisms. It has been shown that the problems of surplus maximization or volume maximization in combinatorial exchanges are inapproximable even with free disposal. In this paper, the surplus maximization problem is formulated as an integer linear programming problem and we propose a Lagrangian relaxation based heuristic to find a near optimal solution. We develop computationally efficient tâtonnement mechanisms for clearing combinatorial exchanges where the Lagrangian multipliers can be interpreted as the prices of the items set by the exchange in each iteration. Our mechanisms satisfy Individual-rationality and Budget-nonnegativity properties. The computational experiments performed on representative data sets show that the proposed heuristic produces a feasible solution with negligible optimality gap.

Optimal feature extraction for bilingual OCR

Feature extraction in bilingual OCR is handicapped by the increase in the number of classes or characters to be handled. This is evident in the case of Indian languages whose alphabet set is large. It is expected that the complexity of the feature extraction process increases with the number of classes. Though the determination of the best set of features that could be used cannot be ascertained through any quantitative measures, the characteristics of the scripts can help decide on the feature extraction procedure. This paper describes a hierarchical feature extraction scheme for recognition of printed bilingual (Tamil and Roman) text. The scheme divides the combined alphabet set of both the scripts into subsets by the extraction of certain spatial and structural features. Three features viz geometric moments, DCT based features and Wavelet transform based features are extracted from the grouped symbols and a linear transformation is performed on them for the purpose of efficient representation in the feature space. The transformation is obtained by the maximization of certain criterion functions. Three techniques : Principal component analysis, maximization of Fisher's ratio and maximization of divergence measure have been employed to estimate the transformation matrix. It has been observed that the proposed hierarchical scheme allows for easier handling of the alphabets and there is an appreciable rise in the recognition accuracy as a result of the transformations.

Impact of Energy Expenditure Rate Constraints on the performance of Multihop Wireless Mesh Networks

In this article we study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh network, where the nodes in the network are subjected to maximum energy expenditure rates. We model link contention in the wireless network using the contention graph and we model energy expenditure rate constraint of nodes using the energy expenditure rate matrix. We formulate the problem as an aggregate utility maximization problem and apply duality theory in order to decompose the problem into two sub-problems namely, network layer routing and congestion control problem and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. We study the e�ects of energy expenditure rate constraints of the nodes on the optimal throughput of the network.

Connectivity-aware Routing in Sensor Networks

Sensor network applications such as environmental monitoring demand that the data collection process be carried out for the longest possible time. Our paper addresses this problem by presenting a routing scheme that ensures that the monitoring network remains connected and hence the live sensor nodes deliver data for a longer duration. We analyze the role of relay nodes (neighbours of the base-station) in maintaining network connectivity and present a routing strategy that, for a particular class of networks, approaches the optimal as the set of relay nodes becomes larger. We then use these findings to develop an appropriate distributed routing protocol using potential-based routing. The basic idea of potential-based routing is to define a (scalar) potential value at each node in the network and forward data to the neighbor with the highest potential. We propose a potential function and evaluate its performance through simulations. The results show that our approach performs better than the well known lifetime maximization policy proposed by Chang and Tassiulas (2004), as well as AODV [Adhoc on demand distance vector routing] proposed by Perkins (1997).

Probabilistic Shared Cache Management (PriSM)

Effective sharing of the last level cache has a significant influence on the overall performance of a multicore system. We observe that existing solutions control cache occupancy at a coarser granularity, do not scale well to large core counts and in some cases lack the flexibility to support a variety of performance goals. In this paper, we propose Probabilistic Shared Cache Management (PriSM), a framework to manage the cache occupancy of different cores at cache block granularity by controlling their eviction probabilities. The proposed framework requires only simple hardware changes to implement, can scale to larger core count and is flexible enough to support a variety of performance goals. We demonstrate the flexibility of PriSM, by computing the eviction probabilities needed to achieve goals like hit-maximization, fairness and QOS. PriSM-HitMax improves performance by 18.7% over LRU and 11.8% over previously proposed schemes in a sixteen core machine. PriSM-Fairness improves fairness over existing solutions by 23.3% along with a performance improvement of 19.0%. PriSM-QOS successfully achieves the desired QOS targets.