ppxscal/embedding_network huggingface dataset:
Stochastic observability and fault diagnosis of additive changes in state space models
Authors: F. Gustafsson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We derive a Kalman filter based on data from a sliding window. This is used for a new approach to fault detection and diagnosis, where the state estimate from past data is compared to the state estimate of some of the future data. We suggest a method to judge the quality of diagnosis in a simple way. For fault estimation in the diagnosis, the general concept of stochastic observability in linear systems is introduced. Its role in the design step is illustrated on a problem of estimating the true velocity of a car.
Parallel Loop Scheduling Using Knowledge-Based Workload Estimation on Grid Environments
Authors: Wen-Chung Shih, Chao-Tung Yang, Chun-Jen Chen, Shian-Shyong Tseng
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

Parallel loop scheduling on grid environments is a challenging problem, especially for loops with irregular workload distribution. In the past, this problem of load imbalance resulting from irregular workload was not explicitly addressed. This paper proposes a new approach to schedule loop iterations with irregular workload on grid environments. Based on knowledge-based estimation of workload, the proposed method can dispatch an appropriate proportion of workload to each node for execution according to its performance. In addition, the scheduler uses historical statistics of CPU usage and network bandwidth to estimate the dynamically changing performance of each node. Two applications, regular type and irregular one respectively, are implemented and executed on a grid test-bed, which consists of four schools. Experimental results show that the new approach improves the performance on previous schemes.
Identity Information Management in the Network Environment
Authors: Yanan Zhang, Jingsha He
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

the proliferation of user identities in the network has made it more difficult to manage user identity information because such information is distributed in many web servers over the network. Our goal is to propose a solution to this management problem by integrating all identity information that belongs to individual users in the network. The method we propose in this paper for the integration is based on a third party server that we call Identity Management Server (IMS). It is required that each website register with the IMS so that it can bind all the identities that belong to a user in network, record every change to user identity information in each server, and facilitate server communication to unify user identity information. In this paper, we describe the architecture, the primary functions as well as the implementation of the proposed method.
Geometric facility location under continuous motion: bounded-velocity approximations to the mobile euclidean k-centre and k-median problems
Authors: Stephane Durocher
Venue:  (2006)

The traditional problems of facility location are defined statically; a set (or multiset) of n points is given as input, corresponding to the positions of clients, and a solution is returned consisting of set of k points, corresponding to the positions of facilities, that optimizes some objective function of the input set. In the k -centre problem, the objective is to select k points for locating facilities such that the maximum distance from any client to its nearest facility is minimized. In the k-median problem, the objective is to select k points for locating facilities such that the average distance from each client to its nearest facility is minimized. A common setting for these problems is to model clients and facilities as points in Euclidean space and to measure distances between these by the Euclidean distance metric. In this thesis, we examine these problems in the mobile setting. A problem instance consists of a set of mobile clients, each following a continuous trajectory through Euclidean space under bounded velocity. The positions of the mobile Euclidean k-centre and k-median are defined as functions of the instantaneous positions of the clients. Since mobile facilities located at the exact Euclidean k-centre or k-median involve either unbounded velocity or discontinuous motion, we explore approximations to these. The goal is to define a set of functions, corresponding to positions for the set of mobile facilities, that provide a good approximation to the Euclidean k-centre or k-median while maintaining motion that is continuous and whose magnitude of velocity has a low fixed upper bound. Thus, the fitness of a mobile facility is determined not only by the quality of its optimization of the objective function but also by the maximum velocity and continuity of its motion. These additional constraints lead to a trade-off between velocity and approximation factor, requiring new approximation strategies quite different from previous static approximations. We identify existing functions and introduce new functions that provide bounded-velocity approximations of the mobile Euclidean 1-centre, 2-centre, and 1-median. We show that no bounded-velocity approximation of the Euclidean 3-centre or the Euclidean 2-median is possible. Finally, we present kinetic algorithms for maintaining these various functions using both exact and approximate solutions.
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
Authors: Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to coordinate their behavior using a shared entangled quantum state, a perfect parallel repetition theorem holds in the following sense. The prover's optimal success probability for simultaneously playing a collection of XOR proof systems is exactly the product of the individual optimal success probabilities. This property is remarkable in view of the fact that, in the classical case (where the provers can only utilize classical information), it does not hold. The theorem is proved by analyzing parities of XOR proof systems using semidefinite programming techniques, which we then relate to parallel repetitions of XOR games via Fourier analysis.
Fast and exact projected convolution for non-equidistant grids
Authors: W. Hackbusch
Venue: Computing (2007)

Usually, the fast evaluation of a convolution integral $$\int_{{\mathbb{R}}}f(y)g(x-y)\mathrm{d}y$$ requires that the functions f, g are discretised on an equidistant grid in order to apply the fast Fourier transform. Here we discuss the efficient performance of the convolution in locally refined grids. More precisely, the convolution result is projected into some given locally refined grid (Galerkin approximation). Under certain conditions, the overall costs are still $${\mathcal{O}}(N\log N),$$ where N is the sum of the dimensions of the subspaces containing f, g and the resulting function.
A New Wildcard Search Method for Digital Dictionary Based on Mobile Platform
Authors: Xin Zhou, Yunlong Xu, Gongming Chen, Zhigeng Pan
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper implements a digital dictionary system on the mobile platform and proposes a novel algorithm for the wildcard search problem. Our approach, which is based on the advanced trie tree, performs the wildcard search process in a cut-branch operation, which will reduce the search range largely. Thus, the efficiency of the algorithm is increased radically. In addition, compared with normal trie tree, the advanced one, which includes the fuzzy pointer field, makes it possible that the no-head wildcard search can be processed efficiently without linearly scanning all the word entries in the dictionary. At last, the new algorithm is easy to be implemented and experimental results show high robustness and efficiency on the mobile platform.
ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks
Authors: Huaizhi Li, Mukesh Singhal
Venue: Wireless Personal Communications: An International Journal (2007)

Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston: Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator. We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy--efficiency and scalability, and avoids the burden--GPS support.
Adaptation of pitch and spectrum for HMM-based speech synthesis using MLLR
Authors: M. Tamura
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Describes a technique for synthesizing speech with arbitrary speaker characteristics using speaker independent speech units, which we call "average voice" units. The technique is based on an HMM-based text-to-speech (TTS) system and maximum likelihood linear regression (MLLR) adaptation algorithm. In the HMM-based TTS system, speech synthesis units are modeled by multi-space probability distribution (MSD) HMMs which can model spectrum and pitch simultaneously in a unified framework. We derive an extension of the MLLR algorithm to apply it to MSD-HMMs. We demonstrate that a few sentences uttered by a target speaker are sufficient to adapt not only voice characteristics but also prosodic features. Synthetic speech generated from adapted models using only four sentences is very close to that from speaker dependent models trained using 450 sentences.
Late-binding: enabling unordered load-store queues
Authors: Simha Sethumadhavan, Franziska Roesner, Joel S. Emer, Doug Burger, Stephen W. Keckler
Venue: ACM SIGARCH Computer Architecture News (2007)

Conventional load/store queues (LSQs) are an impediment to both power-efficient execution in superscalar processors and scaling tolarge-window designs. In this paper, we propose techniques to improve the area and power efficiency of LSQs by allocating entries when instructions issue ("late binding"), rather than when they are dispatched. This approach enables lower occupancy and thus smaller LSQs. Efficient implementations of late-binding LSQs, however, require the entries in the LSQ to be unordered with respect to age. In this paper, we show how to provide full LSQ functionality in an unordered design with only small additional complexity and negligible performance losses. We show that late-binding, unordered LSQs work well for small-window superscalar processors, but can also be scaled effectively to large, kilo-window processors by breaking the LSQs into address-interleaved banks. To handle the increased overflows, we apply classic network flow control techniques to the processor micronetworks, enabling low-overhead recovery mechanisms from bank overflows. We evaluate three such mechanisms: instruction replay, skid buffers, an dvirtual-channel buffering in the on-chip memory network. We show that for an 80-instruction window, the LSQ can be reduced to 32 entries. For a 1024-instruction window, the unordered, late-binding LSQ works well with four banks of 48 entries each. By applying a Bloom filter as well, this design achieves full hardware memory disambiguation for a 1,024 instruction window while requiring low average power per load and store access of 8 and 12 CAM entries, respectively.
Language-dependent state clustering for multilingual acoustic modelling
Authors: Thomas Niesler
Venue: Speech Communication (2007)

The need to compile annotated speech databases remains an impediment to the development of automatic speech recognition (ASR) systems in under-resourced multilingual environments. We investigate whether it is possible to combine speech data from different languages spoken within the same multilingual population to improve the overall performance of a speech recognition system. For our investigation, we use recently collected Afrikaans, South African English, Xhosa and Zulu speech databases. Each consists of between 6 and 7h of speech that has been annotated at the phonetic and the orthographic level using a common IPA-based phone set. We compare the performance of separate language-specific systems with that of multilingual systems based on straightforward pooling of training data as well as on a data-driven alternative. For the latter, we extend the decision-tree clustering process normally used to construct tied-state hidden Markov models to allow the inclusion of language-specific questions, and compare the performance of systems that allow sharing between languages with those that do not. We find that multilingual acoustic models obtained in this way show a small but consistent improvement over separate-language systems as well as systems based on IPA-based data pooling.
Automated Insect Identification through Concatenated Histograms of Local Appearance Features
Authors: N. Larios, H. Deng, W. Zhang, M. Sarpola, J. Yuen, R. Paasch, A. Moldenke, D. A. Lytle, Ruiz Correa, E. Mortensen, L. G. Shapiro, T. G. Dietterich
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

This paper describes a fully automated stonefly-larvae classification system using a local features approach. It compares the three region detectors employed by the sys- tem: the Hessian-affine detector, the Kadir entropy detector and a new detector we have developed called the princi- pal curvature based region detector (PCBR). It introduces a concatenated feature histogram (CFH) methodology that uses histograms of local region descriptors as feature vec- tors for classification and compares the results using this methodology to that of Opelt [11] on three stonefly identifi- cation tasks. Our results indicate that the PCBR detector outperforms the other two detectors on the most difficult discrimination task and that the use of all three detectors outperforms any other configuration. The CFH methodol- ogy also outperforms the Opelt methodology in these tasks.
Automatic Recognition of Noisy Code-39 Barcode
Authors: Xianyong Fang, Fuli Wu, Bin Luo, Haifeng Zhao, Peng Wang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Barcode has been widely applied in the modern world. This paper presents a fast and robust recognition method of noisy Code 39 barcode. The proposed method can be divided into two steps: search and decoding. In the first step, all asterisks in the image are found with evenly defined scan lines and then those with the same directions are matched together to get a valid barcode region. In the second step, a local denoise method is first applied to eliminate noise in the barcode region and then a middle band filter is used to decode the barcode. Our method is simple in comparison with former methods and experimental results show that it is efficient for fast barcode recognition on noisy images.
A Proposal of a Platform for Alert Notification and Response Support
Authors: Marcus Lucas da Silva, Mitsuji Matsumoto
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The role of warning systems' dissemination and of associated preparation acts have supported the decrease of number of deaths caused by emergencies and disasters. Nowadays, computers are been programmed to automatically respond to alerts, notifying the right people and triggering correlated alert response procedures. In this sense, this paper describes a platform approach, the Pervasive Communities for Alerting Platform (PerCAP), for alert notification and response support which explores the cooperation among heterogeneous computational entities in order to disseminate alert messages and to achieve user-centered and system-centered response tasks even in the presence of software and network failures.
Implementing large NT networks in a heterogeneous computing environment at SLAC
Authors: Andrea Chan, Freddie Chow, Jonathan Wong
Venue: Proceedings of the 1997 Workshop on Large Scale System Administration of Windows NT (1997)

Similar to most research labs, Stanford Linear Accelerator Center (SLAC) has multiple computing platforms. But in the recent two years, there has been a tremendous growth of Windows NT at SLAC. We have encouraged this due to the popularity and availability of Windows-based software, and to the fact that Windows NT has system management tools. In this paper, we describe implementing a new support infrastructure and the use of Microsoft Systems Management Server (SMS)-both needed to migrate the lab quickly from the chaotic characteristics of desktop computing to a more centrally-managed NT network. We also describe the use of NTrigue servers for UNIX and Macintosh users to access Windows-based software in this heterogeneous environment.
Customization and flexibility in the exmh mail user interface
Authors: Brent Welch
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

The exmh mail user interface is designed to be flexible and customizable. The goal in the design is to provide a platform that can be tuned to suit individual preferences, as well as extended to provide custom functionality. There are several mechanisms for customization: install-time settings define runtime support requirements; a Preferences user interface exposes various "knobs" and "dials"; the X resource database controls fonts, colors, and other widget attributes; a personal library of Tcl procedures supports new functionality; the buttons and menus in the interface are defined by X resource specifications to allow customization and access to personal Tcl extensions; hook points in the implementation support callbacks to user extensions at key moments in mail handling; A binding user interface defines editing and accelerator keystrokes. This paper describes these mechanisms, and provides some experiences in the use and development of exmh.
Tracking based on local motion estimation of spatio-temporally weighted salient points
Authors: Vincent Garcia, Eric Debreuve, Michel Barlaud
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

The extraction of a video object contour, called "rotoscoping in cinematographic post-production, is usually performed manually and frame by frame. Semi-automatic algorithms have been proposed to reduce the load of this task. However, they classically use region information and are usually based on a notion of homogeneity of the object. This homogeneity description might be difficult to establish and, consequently, the tracking may be not precise enough. The proposed method relies on the analysis of some temporal trajectories of salient points, or keypoints, called tracks. The main contribution of this paper is the local estimation, both spatially and temporally, of the contour motion from these tracks. The proposed method seems accurate, robust to outliers, and allows local deformation. Moreover, it can deal with partial occlusions.
Conversational Coherence in Instant Messaging and Getting Work Done
Authors: Stephanie L. Woerner, JoAnne Yates, Wanda J. Orlikowski
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper explores the critical role conversational coherence plays in facilitating the ongoing, distributed work of one virtual team as they engage in instant messaging (IM) conversations to communicate, coordinate, and collaborate. In studying the IM conversations of team members over the course of a month, a number of challenges to coherence emerged as they communicated with each other and worked together. These challenges include two previously identified challenges-lack of simultaneous feedback, and disrupted turn adjacency and two additional challenges: multi-tasking, and authority. We describe the team's responses to these challenges and conclude by discussing implications for research.
SINR Enhancement Techniques for an IS-95 Downlink SIC Receiver
Authors: Richard E. Cagley, John J. Shynk, Richard P. Gooch
Venue: Wireless Personal Communications: An International Journal (2007)

Due to near-far effects and multiple-access interference, several types of multiuser detectors have been developed in recent years to reliably demodulate user signals in a code-division multiple-access (CDMA) system. The downlink of Interim Standard 95 (IS-95) is particularly well suited to one such detector known as the successive interference canceler (SIC). In order to keep the receiver complexity low, entire base station signals are typically canceled in the receiver in a sequential manner. However, for the SIC to operate effectively, a base station signal that is being canceled must be reconstructed with enough accuracy such that sufficient interference power is removed for the subsequent base station to be reliably detected. If this is not possible, it may be necessary to employ techniques, specific to the signal format specified in the IS-95 downlink, which enhance the received signal-to-interference-plus-noise ratio (SINR). In this paper, we explore the performance gains achieved with several SINR enhancement techniques, and present computer simulations to demonstrate this improvement for example cochannel signal scenarios.