ppxscal/embedding_network huggingface dataset:
Message-driven speech recognition and topic-word extraction
Authors: K. Ohtsuki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper proposes a new formulation for speech recognition/understanding systems. In which the posteriori probability of a speaker's message that the speaker intends to address given an observed acoustic sequence is maximized. This is an extension of the current criterion that maximizes the probability of a word sequence. Among the various possible representations, we employ a co-occurrence score of words measured by mutual information as the conditional probability of a word sequence occurring in a given message. The word sequence hypotheses obtained by bigram and trigram language models are rescored using the co-occurrence score. Experimental results show that the word accuracy is improved by this method. Topic-words which represent the content of a speech signal are then extracted from speech recognition results based on the significance score of each word. When five topic-words are extracted for each broadcast-news article, 82.8% of them are correct in average. This paper also proposes a verbalization-dependent language model which is useful for Japanese dictation systems.
Time-frequency representation based cepstral processing for speech recognition
Authors: A. B. Fineberg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Both linear predictive coding (LPC) and mel scale frequency cepstral coefficient (MFCC) analysis, the most common techniques for speech recognition signal processing, make the assumption that the speech signal is stationary for some analysis window and produce a representation based upon the "stationary" frequency content within the window. This work uses a technique based upon Cohen's (1989) class of generalized time frequency representations (TFR) to produce selected frequency representations that are not based upon an assumption of stationarity. This representation is used in a speech recognition system to produce improved accuracy. The proposed approach requires a kernel design to specify the attributes of the representations. The considerations used for analyzing speech signals and the resulting attributes are discussed. Comparisons with standard analysis techniques are presented. The significant computational requirements are also discussed.
Machine models and lower bounds for query processing
Authors: Nicole Schweikardt
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where, apart from an "internal memory" of limited size, also a number of (potentially huge) streams may be used as "external memory devices".
Performance analysis of subspace projection techniques for interference excision in DSSS communications
Authors: R. S. Ramineni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper presents the performance analysis of the interference excision techniques in direct sequence spread spectrum (DSSS) communications using orthogonal subspace projections. It is shown that this technique is sensitive to the errors in the instantaneous frequency (IF) estimate of the interference over segments of the bit period. This paper discusses the effect of two different types of errors on the receiver SINR and compares the performance of the block-wise processing to the single block projection approach.
Mechanical qualification of RF-filters for space applications
Authors: X. Lafontan, J. Kuchenbecker, B. Guillon, P. Pons, P. Nerin, F. Pressecq, M. Dardalhon, S. Rigo
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

Micromachined RF-filters for Millimeter wave communications are expected to replace the actual bulky off-chip filters since they offer high performances at low cost. Nevertheless, their large aspect ratio between area (several mm/sup 2/) and their thickness (a few microns) may make them sensitive to mechanical stress such as vibrations or shocks. In this paper, we focus on their mechanical characteristics. The studied filters are built on a thin SiO/sub 2//Si/sub x/N/sub y/ dielectric membrane and the signal lines are in gold. This composition of material makes the analytical approach rapidly complex. So, in counterparts, we ran FEM simulations to study the influence of process parameters such as stress on flexion modes. Then, we measured by vibrometry the natural resonant frequency of several filter sizes (from 1 mm/sup 2/ up to 70 mm/sup 2/) and compared results with previous simulations. Finally, we applied at die level, standard procedures of shock and vibration used for space qualification. All the membranes withstood the tests without structural damage.
Multiple invariance spatio-temporal spectral estimation
Authors: J. W. C. Robinson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Simultaneous frequency and direction-of-arrival (DOA) estimation can be formulated as a 2D processing problem or as a set of coupled 1D problems. In narrow-band cases the 2D approach can be used to remove the need for frequency-DOA pairing procedures but the price can be a considerably higher computational cost. Therefore, the 1D approach a viable alternative in many applications. This paper presents an ESPRIT based technique using the multiple 1D approach. It requires few sensors, guarantees identifiability of the parameters and admits several sources on the same frequency or DOA.
An Information-Theoretic Analysis on the Interactions of Variables in Combinatorial Optimization Problems
Authors: Dong-Il Seo, Byung-Ro Moon
Venue: Evolutionary Computation (2007)

In optimization problems, the contribution of a variable to fitness often depends on the states of other variables. This phenomenon is referred to as epistasis or linkage. In this paper, we show that a new theory of epistasis can be established on the basis of Shannon's information theory. From this, we derive a new epistasis measure called entropic epistasis and some theoretical results. We also provide experimental results verifying the measure and showing how it can be used for designing efficient evolutionary algorithms.
Dynamic Scheduling with Process Migration
Authors: Cong Du, Xian-He Sun, Ming Wu
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Process migration is essential for runtime load balancing. In Grid and shared networked environments, load imbalance is not only caused by the dynamic nature of underlying applications, but also by the fluctuation of resource availability. In a shared environment, tasks need to be rescheduled frequently to adapt the variation of resources availability. Unlike conventional task scheduling, dynamic rescheduling has to consider process migration costs in its formulation. In this study, we first model the migration cost and introduce an effective method to predict the cost. We then introduce a dynamic scheduling mechanism that considers migration cost as well as other conventional influential factors for performance optimization in a shared, heterogeneous environment. Finally we present experimental testing to verify the analytical results. Experimental results show that the proposed dynamic scheduling system is feasible and improves the system performance considerably.
Cheating the I/O bottleneck: network storage with Trapeze/Myrinet
Authors: Darrell C. Anderson, Jeffrey S. Chase, Syam Gadde, Andrew J. Gallatin, Kenneth G. Yocum, Michael J. Feeley
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Recent advances in I/O bus structures (e.g., PCI), high-speed networks, and fast, cheap disks have significantly expanded the I/O capacity of desktop-class systems. This paper describes a messaging system designed to deliver the potential of these advances for network storage systems including cluster file systems and network memory. We describe gms_net, an RPC-like kernel-kernel messaging system based on Trapeze, a new firmware program for Myrinet network interfaces. We show how the communication features of Trapeze and gms_net are used by the Global Memory Service (GMS), a kernel-based network memory system. The paper focuses on support for zero-copy page migration in GMS/Trapeze using two RPC variants important for peer-peer distributed services: (1) delegated RPC in which a request is delegated to a third party, and (2) nonblocking RPC in which replies are processed from the Trapeze receive interrupt handler. We present measurements of sequential file access from network memory in the GMS/Trapeze prototype on a Myrinet/Alpha cluster, showing the bandwidth effects of file system interfaces and communication choices. GMS/Trapeze delivers a peak read bandwidth of 96 MB/s using memory-mapped file I/O.
Statistical phrase-based models for interactive computer-assisted translation
Authors: Jesús Tomás, Francisco Casacuberta
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Obtaining high-quality machine translations is still a long way off. A post-editing phase is required to improve the output of a machine translation system. An alternative is the so called computer-assisted translation. In this framework, a human translator interacts with the system in order to obtain high-quality translations. A statistical phrase-based approach to computer-assisted translation is described in this article. A new decoder algorithm for interactive search is also presented, that combines monotone and non-monotone search. The system has been assessed in the Trans Type-2 project for the translation of several printer manuals, from (to) English to (from) Spanish, German and French.
The signed star domination numbers of the Cartesian product graphs
Authors: Changping Wang
Venue: Discrete Applied Mathematics (2007)

Let G be a graph with vertex set V(G) and edge set E(G). A function f:E(G)->{-1,1} is said to be a signed star dominating function of G if @?"e"@?"E"""G"("v")f(e)>=1 for every v@?V(G), where E"G(v)={uv@?E(G)|u@?V(G)}. The minimum of the values of @?"e"@?"E"("G")f(e), taken over all signed star dominating functions f on G, is called the signed star domination number of G and is denoted by @c"S"S(G). In this paper, a sharp upper bound of @c"S"S(GxH) is presented.
On scheduling garbage collector in dynamic real-time systems with statistical timing assurances
Authors: Hyeonjoong Cho, Chewoo Na, Binoy Ravindran, E. Douglas Jensen
Venue: Real-Time Systems (2007)

We consider garbage collection (GC) in dynamic real-time systems. We consider the time-based GC approach of running the collector as a separate, concurrent thread, and focus on real-time scheduling to obtain assurances on mutator timing behavior, while ensuring that memory is never exhausted. We present a scheduling algorithm called GCUA. The algorithm considers mutator activities that are subject to time/utility function time constraints, variable execution time demands, the unimodal arbitrary arrival model that allows a strong adversary, and resource overloads. We establish several properties of GCUA including probabilistically-satisfied utility lower bounds for each mutator activity, a lower bound on the system-wide total accrued utility, bounded sensitivity for the assurances to variations in mutator execution time demand estimates, and no memory exhaustion at all times. Our simulation experiments validate our analytical results and confirm the algorithm's effectiveness and superiority.
Software distribution to PC clients in an enterprise network
Authors: Cameron D. Luerkens, H. John Cole, Danielle R. Legg
Venue: Proceedings of the 1998 Conference on Large Installation System Administration of Windows NT (1998)

Rockwell CACD and CCA divisions merged into Rockwell Avionics & Communications in March, 1997 (now Rockwell Collins), creating support issues for integrating and maintaining several networks that included Banyan, Novell, Microsoft NT and PC-NFS (Hummingbird's Maestro). The combined total PC clients now number about 10,000, which include major sites in Cedar Rapids, Iowa; Dallas, Texas; and Melbourne, Florida. Other Service Centers and off-sites are also included in the total.
Probabilistic activity recognition from low-level sensors
Authors: Qiang Yang
Venue:  (2006)

Activity recognition is gaining increasing interest in the artificial intelligence (AI) and ubiquitous computing communities due to the dramatically advancing sensor technology. In this dissertation, we address the problem of probabilistic activity recognition from low-level sensor data. The novelty of our work can be seen from two fronts. First, in the pervasive computing literature, an important focus has been to determine a user's context from streams of sensor data. Despite the large amount of previous work done on computing the locations of users, there has been a lack of study on the problem of high-level activity recognition. Second, in the AI area, recognizing complex high-level behavior has traditionally been the focus of plan recognition. However, most of the work has been restricted to high-level inferences in a logical framework, and the challenge of dealing with low-level sensor modeling has so far not been adequately addressed. In this dissertation, we propose several novel probabilistic algorithms for activity recognition from low-level sensors. Firstly, we present a novel clustering algorithm to automatically group user traces into a set of clusters, each corresponding to a typical class of user activity patterns. Secondly, we propose a hierarchical activity recognition model, in which high-level inference about activities is enabled via a location-based sensor model at the low level. Thirdly, to reduce the calibration effort for activity recognition and to increase robustness in recognition quality, we design a segmentation-based activity recognition model, in which activities can be directly recognized from sequences of discovered motion patterns. Finally, we also propose a novel approach to detecting users' abnormal activities from sensor data. We demonstrate the effectiveness of our proposed algorithms using the data collected in real wireless environments.
Interactive traffic analysis and visualization with Wisconsin Netpy
Authors: Cristian Estan, Garret Magin
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

Monitoring traffic on important links allows network administrators to get insights into how their networks are used or misused. Traffic analysis based on NetFlow records or packet header traces can reveal floods, aggressive worms, large (unauthorized) servers, spam relays, and many other phenomena of interest. Existing tools can plot time series of pre-defined traffic aggregates, or perform (hierarchical) "heavy hitter" analysis of the traffic. Wisconsin Netpy is a software package that goes beyond the capabilities of other existing tools through its support for interactive analysis and novel powerful visualization of the traffic data. Adaptive sampling of flow records ensures that the performance is good enough for interactive use, while the results of the analyses stay close to the results based on exact data. Among the salient features of the package are: hierarchical analyses of source addresses, destination addresses, or applications within aggregates identified by user-defined filters; time series plots that separate the traffic into categories specified with ACL-like syntax at run time; interactive drill-down into analyses of components of the traffic mix; "heatmap" visualization of traffic that describes how two "dimensions" of the traffic relate to each other (e.g., which sources send to which destinations, or which sources use which service, etc.).
Tracking of moving objects with multiple models using Gaussian mixtures
Authors: J. S. Marques
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper addresses the problem of tracking of objects with complex shape or motion dynamics. The approach followed relies on multiple models based on Gaussian mixtures and hidden Markov models. A tracking algorithm derived from nonlinear filtering is presented and illustrated in two situations. In the first, two points moving independently along a line are tracked, only one being observed at each time. In the second, two-dimensional objects are tracked, under severe shape deformations. Unlike other multi-model approaches, the proposed method relies on parametric techniques providing an efficient tool to update shape and motion estimates.
Quantifying distances from points to polygons-applications in determining fetch in coastal environments
Authors: Mika Murtojärvi, Tapio Suominen, Harri Tolvanen, Ville Leppänen, Olli S. Nevalainen
Venue: Computers Geosciences (2007)

Distance from a point to adjacent borderlines is a variable that has many applications in environmental research. Geographical information systems (GIS) include tools for measuring such distances, but these tools are inefficient if there are multiple, i.e. millions of distances to be calculated. In this paper we propose an efficient algorithm which calculates the distances in multiple predetermined directions from a large number of points to polygon borders. The problem is significantly simplified by the fact that the distances are calculated in some directions, only. An interval tree is utilized for efficiently retrieving those line segments describing the coastal lines and the borders of the islands that are relevant in determining these distances. The algorithm is also robust so that it gives meaningful results in the presence of rounding errors regardless of the positions of the study points with respect to the polygon borders. In coastal environments the straight-line distance from a point to the nearest shoreline over an open water surface is referred to as fetch length. The fetch lengths in multiple directions indicate general openness around a studied point and it may also be used as a variable in wave power calculations. An implementation of the algorithm was used for calculating fetch data for the archipelago of SW-Finnish coast in the Baltic Sea. The map data contained 3 million vertices and fetch lengths were calculated for 2.5 million points in 48 directions. The algorithm enabled determining fetch lengths in the complex archipelago environment quickly in high spatial accuracy and it may have applications also in other geographical research and image processing.
'Reachability' in converged IMS services: a BT Alcatel-Lucent collaboration
Authors: D. Roxburgh, C. Bazin, S. Beddus, G. Dorbes, C. Hue, S. Ringland
Venue: BT Technology Journal (2007)

BT has commenced the switch-over to its 21st Century Network -- an all-IP based network which will reduce costs and provide a more `innovation-friendly' platform where exciting new services can be rolled out much more quickly and cost effectively.Increasing computing power and openness on the client device coupled with the move to an IP environment fundamentally alters the competitive landscape for service provision, making it much harder to control the customer's service experience. Further complexity is introduced by convergence -- the requirement for services to run across a multitude of networks and devices. The challenge is to create an infrastructure capable of delivering the exciting new own-build and third-party converged services users want while preserving ease of use and security.The IP multimedia subsystem (IMS) element of the 21CN architecture is a key enabler in reaching these goals. Alcatel-Lucent is a vendor with a strong track-record both in supplying IMS products and in ongoing research activities, considering improvements and extensions to the current IMS standards.This paper summarises activities to date in a research collaboration between BT and Alcatel-Lucent which is looking at the area of improved intelligence in the provision of converged services over an IMS architecture. The collaboration utilises capabilities produced by Alcatel-Lucent's research department called the Reachability Server to implement a number of novel converged service scenarios. The paper introduces the Reachability Server, describes the collaboration, summarises the scenario implementation work completed to date and presents a number of conclusions and observations.
Region-based near-lossless image compression
Authors: A. J. Pinho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present a near-lossless technique for the compression of images, which is based on the partitioning of the image into regions of constant intensity. The boundary information associated with the image partition is encoded with the method of the transition points. The compression of the intensities of the regions is based on the usual entropy encoding of the context-modeled prediction residuals. The experimental results show that this approach is able to provide significant compression improvements in images having sparse histograms, for small L/sub /spl infin// errors.
Design experiences in digital signal processing laboratories
Authors: J. A. Dickerson
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The goal of this project is to develop a unique undergraduate laboratory in digital signal processing that emphasizes the design of a complete system. Projects that develop simple communications systems or build modems give the students a chance to combine techniques from many different classes.
Service discovery in pervasive computing environments
Authors: Scott F. Midkiff
Venue:  (2006)

Service discovery is a driving force in realizing pervasive computing. It provides a way for users and services to locate and interact with other services in a pervasive computing environment. Unfortunately, current service discovery solutions do not capture the effects of the human or physical world and do not deal well with diverse device populations; both of which are characteristics of pervasive computing environments. This research concentrates on the examination and fulfillment of the goals of two of the four components of service discovery, service description and dissemination. It begins with a review of and commentary on current service discovery solutions. Following this review, is the formulation of the problem statement, including a full explanation of the problems mentioned above. The problem formulation is followed by an explanation of the process followed to design and build solutions to these problems. These solutions include the Pervasive Service Description Language (PSDL), the Pervasive Service Query Language (PSQL), and the Multi-Assurance Delivery Protocol (MADEP). Prototype implementations of the components are used to validate feasibility and evaluate performance. Experimental results are presented and analyzed. This work concludes with a discussion of overall conclusions, directions for future work, and a list of contributions.