3230690
A new verification-based fast-match for large vocabulary continuous speech recognition
Acoustic fast-match is a popular way to accelerate the search in large-vocabulary continuous-speech recognition, where an efficient method is used to identify poorly scoring phonemes and discard them from detailed evaluation. In this paper we view acoustic fast-match as a verification problem, and hence develop an efficient likelihood ratio test, similar to other verification scenarios, to perform the fast match. Various aspects of the test like the design of alternate hypothesis models and the setting of phoneme look-ahead durations and decision thresholds are studied, resulting in an efficient implementation. The proposed fast-match is tested in a large vocabulary speech recognition task and it is demonstrated that depending on the decision threshold, it leads to 20-30% improvement in speed without any loss in recognition accuracy. In addition, it significantly outperforms a similar test based on using likelihoods only, which fails, in our setting, to bring any improvement in speed-accuracy trade-off. In a larger set of experiments with varying acoustic and task conditions, similar improvements are observed for the fast-match with the same model and setting. This indicates the robustness of the proposed technique. The gains due to the proposed method are obtained within a highly efficient 2-pass search strategy and similar or even higher gains are expected in other alternative search architectures.
1165057
An Extensible Three-tier XML Dialogue System Architecture for Multimodal Interaction and Automated Agent Services
16996391
WIP: Web Service Initiation Protocol for Multimedia and Voice Communication over IP
In this paper, we present WIP - Web service initiation protocol for multimedia and voice communication over IP. WIP is an entirely Web service based communication protocol, consisting of a set of Web service operations for initiating and establishing converged (e.g. multimedia, IM, voice, etc.) communication services over IP. It inherits the principle of separation signaling and media transmission of SIP (session initiation protocol); but it relies on a single Web service stack to provide a full featured communication signaling protocol. WIP opens a new paradigm of Web service based VoIP communication, which is extensible and can be easily integrated in end-to-end SOA solutions. The generic Web service approach used in WIP overcomes many limitations which would be otherwise difficult to achieve in non-Web service based communication methods used today. WIP is based on two-way, full duplex Web service interaction. The communication signaling establishment in WIP is through Web service interactions, and the media negotiation in WIP is modeled as a special Web service "event" subscription, which is fully extensible for various media needs. The signaling messages of WIP are encoded in the standard based SOAP message envelops which can be carried by multiple transport protocols, including HTTP. WIP supports both P2P (peer-to-peer) and B2B (back-to-back) broker mode communication services. A prototype research system has been implemented, and the results indicate that WIP, as a full Web service based communication protocol, is both feasible and advantageous
14601627
Semantic Modeling and Design Patterns for Asynchronous Events in Web Service Interaction
This paper proposes a conceptual model for modeling static and dynamic event sources by reusing the information in WSDL. A set-theoretic semantics for event subscription is introduced, based on which two metrics, recall and precision, are proposed to measure the accuracy of event subscriptions. We discuss the accuracy of several event subscription strategies under the framework of Web service event subscription standard proposals (WS-Eventing and WS-Notification). Four major types of event broker design patterns are discussed based on two visibility/reachability factors: if sink knows the source and if source can deliver events directly to the sink. The implication on the broker state and message routing is studied in this analysis. A prototype implementation indicated that these design patterns are feasible
1325770
Factors Affecting Software Projects' Budget - A Case Study
A hand tool in the form of a magnetic screwdriver, having a handle provided with a cavity for storing a plurality of tool bits, and a removable cap, and the cap has a recess with means for securely holding and driving a tool bit placed in said recess so as to form an extra, small-independent, stubby like adjustment screwdriver as a separate specialized second screwdriver.
18563923
Forward and Inverse Solutions of Electrocardiography Problem Using an Adaptive BEM Method
The construction of geometry models of heart-torso is critical for solving the forward and inverse problems of magneto- and electrocardiography (MCG/ECG). Boundary element method (BEM) is a commonly used numerical approach for the solution of these problems and it requires the modeling of interfaces between various tissue regions. In this study, a new BEM (h-adaptive type) has been applied to the ECG forward/inverse problems. Compared with those traditional BEMs, the adaptive BEM can self-adjust the number and size of the boundary element (BE) meshes according to an error indicator, and thus can save a lot of computational time and also improve the accuracy of the forward and inverse solutions. In this paper, the procedure of the adaptive triangular mesh generation is detailed and the algorithm is tested using a concentric sphere model and a realistic heart-torso model. For the realistic torso model, to improve the numerical accuracy, a number of new nodes are added on the basis of initial torso BE meshes, and the corresponding node coordinates are determined using an approach called Parametric Fourier Representation (PFR) of closed polygons. The simulation results show that the adaptive BEM is more accurate and efficient than traditional BEMs and therefore it is a very promising numerical scheme for ECG forward/inverse problems.
34743400
An optimal weather condition dependent approach for emission planning in urban areas
Abstract The urban air quality strongly depends on the weather conditions. When unfavorable weather conditions are forecasted, it is desirable to reduce a certain amount of pollutant emissions to maintain a given level of air quality. In this paper, we propose and demonstrate a new approach to find the optimal reduction, and we contribute to the methodology of decision support of short-term emission control. This approach is based on weather forecasts and state-of-the-art 3-dimensional numerical air-quality prediction models by solving an optimal control problem with the emission cuts as the control variables. The objective of the optimal problem is to minimize the total cost due to the emission cuts, subject to feasibility constraints, system-governing model constraints, and target constraints. When a high-resolution numerical model is used as the state constraint, the problem can become a very high dimensional one. A practical approach to solving this problem with high dimension is proposed, based on the adjoint technique. The proposed approach is demonstrated with two computational test cases in Jinan, China for the control of sulfur dioxide. The results show the capability and computational efficiency of the method and suggest a promising potential for emission planning applications based on weather forecasts.
11689877
A Projection and Search Algorithm for the Bicluster Problem
The advent of microarray technologies has made the experimental study of gene expression faster and more efficient. It is an important task to analyze the gene expression data acquired from the microarray experiments. Biclustering is a popular method to search a subset of genes which exhibit similar expression patterns along a subset of conditions in the gene expression matrix. In this paper, we propose a projection and search algorithm (PSA) for finding biclusters in the gene expression matrix. The algorithm adopts projection method to find a raw submatrix, then refines and extends the raw submatrix into a bicluster using greedy algorithms. We test the algorithm on simulation data and real data. The test results show that the algorithm has good performance on both simulation data and real data. Additionally, compared with other methods, PSA isnpsilat sensitive to noise level.
26250215
Wideband Signal DOA Estimation Based on Modified Quantum Genetic Algorithm
A new wideband signal DOA estimation algorithm based on modified quantum genetic algorithm (MQGA) is proposed in the presence of the errors and the mutual coupling between array elements. In the algorithm, the narrowband signal subspace fitting method is generalized to wideband signal DOA finding according to the character of space spectrum of wideband signal, and so the rule function is constructed. Then, the solutions is encoded onto chromosomes as a string of binary sequence, the variable quantum rotation angle is defined according to the distribution of optimization solutions. Finally, we use the MQGA algorithm to solve the nonlinear global azimuths optimization problem, and get optimization azimuths by fitness values. The computer simulation results illustrated that the new algorithm have good estimation performance.