ppxscal/embedding_network huggingface dataset:
Privacy-aware location sensor networks
Authors: Marco Gruteser, Graham Schelle, Ashish Jain, Rick Han, Dirk Grunwald
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Advances in sensor networking and location tracking technology enable location-based applications but they also create significant privacy risks. Privacy is typically addressed through privacy policies, which inform the user about a service provider's data handling practices and serve as the basis for the user's decision to release data. However, privacy policies require user interaction and offer little protection from malicious service providers. This paper addresses privacy through a distributed anonymity algorithm that is applied in a sensor network, before service providers gain access to the data. These mechanisms can provide a high degree of privacy, save service users from dealing with service providers' privacy policies, and reduce the service providers' requirements for safeguarding private information.
Search-space reduction for fast, optimal HMM decoding in speaker verification
Authors: Qi Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Currently, the most popular algorithm for hidden Markov model (HMM) decoding is the Viterbi algorithm with beam search to reduce search space. However, it is a difficult problem in determining a beam width beforehand. To address this problem, we propose a novel approach on search space reduction. Following the definition of HMM, we first detect the possible change points between HMM states sequentially, then use the change points to locate a subspace for searching. Using a combined forward and backward scheme, we can detect two boundaries consisting of change points to enclose the subspace. The Viterbi algorithm or any other search algorithms can then be applied in the subspace. The experiments on a speaker verification task show that the proposed algorithm is about 4 times faster than a full search algorithm while the accuracy is almost the same. On the same decoding speed, the proposed algorithm provides a better accuracy than a beam-search approach. For an HMM with S states, the upper bound of speedup comparing to the full search approach is approximately S/3.
Learn Programming by Using Mobile Edutainment Game Approach
Authors: Siti Hafizah Ab Hamid, Leong Yu Fung
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

The concept of edutainment or "education and entertainment" is not new in a learning environment and its purpose is to make the learning process more enjoyable. This project integrated mobile game technology into a Mobile Learning system to make the learning process more fun and effective for its student end-users. The current generation prefers to spend time in front of the computer playing games instead of studying, so the project merged the technology so they can still play games but study at the same time. Even though mobile technology has many weaknesses (e.g., limited screen size), the project used this technology because it can be played anywhere, anytime, by any mobile device. The main end-users of the project are students or anyone who is learning the subject. For the time being, the project focuses on C++ programming as its domain. Basically, once a student executes the application, he or she can play the game by using C++ programming knowledge. The game starts by displaying a question. The player is represented by a small car that can shoot by using bullets. Within a time limit, the player must shoot the correct answer to a practical programming question. If the player shoots the wrong answer, the wrong answer will try to shoot the player back. The game was developed using J2ME as its development tool and Adobe Photoshop as its graphic design tool.
Improvement of tracking methods in information providing system using LED traffic lights
Authors: Y. Sugawara, M. Akanegawa, Y. Tanaka, M. Nakagawa
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

We propose a new tracking method for an information providing system using LED traffic lights. The proposed tracking method is accomplished by comparing the correlation values of the packet header in each area of 4 division photodiode (PD). In this paper, to begin with, we show that the proposed tracking method can track the LED traffic lights better than the tracking method proposed previously for this system, and then, can also expand the service area. Next, we compare the performance among the proposed tracking schemes when the power of the ambient light is changed.
Distributed multi-join query processing in data grids
Authors: Donghua Yang, Jianzhong Li
Venue: Information Sciences: an International Journal (2007)

Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.
Virtualization aware file systems: getting beyond the limitations of virtual disks
Authors: Ben Pfaff, Tal Garfinkel, Mendel Rosenblum
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

Virtual disks are the main form of storage in today's virtual machine environments. They offer many attractive features, including whole system versioning, isolation, and mobility, that are absent from current file systems. Unfortunately, the low-level interface of virtual disks is very coarse-grained, forcing all-or-nothing whole system rollback, and opaque, offering no practical means of sharing. These problems impose serious limitations on virtual disks' usability, security, and ease of management. To overcome these limitations, we offer Ventana, a virtualization aware file system. Ventana combines the file-based storage and sharing benefits of a conventional distributed file system with the versioning, mobility, and access control features that make virtual disks so compelling.
Structure management for scalable overlay service construction
Authors: Kai Shen
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

This paper explores the model of providing a common overlay structure management layer to assist the construction of large-scale wide-area Internet services. To this end, we propose Saxons, a distributed software layer that dynamically maintains a selected set of overlay links for a group of nodes. Saxons maintains high-quality overlay structures with three performance objectives: low path latency, low hop-count distance, and high path bandwidth. Additionally, it provides partition repair support for the overlay structure. Saxons targets large self-organizing services with high scalability and stability requirements. Services can directly utilize the Saxons structure for overlay communication. Saxons can also benefit unicast or multicast overlay path selection services by pro viding them a small link selection base without hurting their performance potential. Our simulations and experiments on 55 PlanetLab sites demonstrate Saxons's structure quality and the performance of Saxons-based service construction. In particular, a simple overlay multicast service built on Saxons provides near-loss-free data delivery to 4 times more multicast receivers compared with the same multicast service running on random overlay structures. This performance is close to that of direct Internet unicast without simultaneous traffic.
Modeling and Analysis of Noise Margin in SET Logic
Authors: Chaitanya Sathe, Santanu Mahapatra
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this paper the Static Noise Margin for SET (Single Electron Transistor) logic is defined and compact models for the noise margin are developed by making use of the MIB (Mahapatra-Ionescu-Banerjee) model. The variation of the noise margin with temperature and background charge is also studied. A chain of SET inverters is simulated to validate the definition of various logic levels (like VIH, VOH etc) and Noise Margin. Finally the noise immunity of SET logic is compared with current CMOS logic.
How do individual portable computers effect students' learning?
Authors: A. Berglund
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Investing in portable computers for students is a controversial issue. The paper focuses on pedagogical aspects of such an endeavour. It reports on a case study of portable computer use by students in the Master's degree program in Information Technology at Uppsala University, Uppsala, Sweden. The results are promising, indicating that in general students learn more and that they use the computers for collaboration.
Off-line signature verification using DTW
Authors: A. Piyush Shanker, A. N. Rajagopalan
Venue: Pattern Recognition Letters (2007)

In this paper, we propose a signature verification system based on Dynamic Time Warping (DTW). The method works by extracting the vertical projection feature from signature images and by comparing reference and probe feature templates using elastic matching. Modifications are made to the basic DTW algorithm to account for the stability of the various components of a signature. The basic DTW and the modified DTW methods are tested on a signature database of 100 people. The modified DTW algorithm, which incorporates stability, has an equal-error-rate of only 2% in comparison to 29% for the basic DTW method.
Constrain yourselves: exploring end user development in support for musical creativity
Authors: Tim Coughlan, Peter Johnson
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This research explores links between constraint development in creative processes and end user development in environments for creative tasks. A process model describing the development of constraints in creative tasks is presented. To ground the research, support for the user development of musical instruments in a collaborative composition environment is developed, and the use of the system analysed. We find evidence that the development of tangible constraints in the interface has value to users, particularly in focusing collaborative ideation.
Direction finding with a circularly rotated antenna
Authors: A. Tuncay Koc
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A new algorithm for multiple emitter direction finding by using a single antenna moving along a circular trajectory is proposed. The problem is formulated by taking the Doppler frequency shift, caused by the movement of the antenna, into account, and by assuming that the information, hidden in the incoming signals, does not change in the observation duration. The proposed direction finding algorithm is, therefore, based on single snapshot processing and also on the linear prediction method developed by Tuncay Koc (see Ph.D. Dissertation, Middle East Technical University, Ankara, Turkey, 1996) and by Tuncay Koc and Tanik (see Signal Processing, vol.56, no.1, p.17-31, 1997). It has no restriction on the correlation of the incoming signals since it performs a single snapshot processing. The algorithm performance is investigated through computer simulations and it is observed that the root-mean-square errors of the direction of arrival estimates are less than one degree in most cases. Therefore, it seems reasonable to use the proposed direction finding algorithm in some particular applications, for instance, in identifying the environment for calibration purposes.
Optimal Leader Election Scheme for Peer-to-Peer Applications
Authors: Seung Chul Han, Ye Xia
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Leader election is one of the most frequently encountered problems in peer-to-peer applications. However, choosing the best node is not a trivial problem and the obtained performance can dramatically vary depending on it. Another issue is what to measure in the evaluation and comparison of different leader election schemes. It is not clear yet what metrics best capture the performance objective. In this paper, we introduce two performance metrics, the worst link stress (WLS) and the degree of interference (DOI), for the leader election problem, and present a fully distributed, optimal scheme that elects a leader according to the DOI-minimizing criterion in a peer-to-peer network. Our scheme does not require network collaboration, and the communication/ computation overhead is low. The only assumption is that the participating nodes can obtain a list of IDs of the nodes in the session through the underlying P2P substrates. After examining the correctness of the algorithm, we present simulation results demonstrating the benefits of the optimal leader election scheme. Through the simulation results, we conclude that the algorithm is simple yet effective in achieving the design goals, particularly in reducing (1) the worst link stress and balancing load in the network, and (2) the network bandwidth usage.
The theta-Laguerre calculus formulation of the Li/Keiper constants
Authors: Mark W. Coffey
Venue: Journal of Approximation Theory (2007)

The Riemann hypothesis is equivalent to the nonnegativity of a sequence of real constants {@l"k}"k"="1^~, that are certain logarithmic derivatives of the Riemann xi function evaluated at unity. We re-express these constants using the theta-Laguerre calculus. By using integral representations, we reformulate the coefficients {@l"k}"k"="1^~ together with a closely related sequence {a"j}"j"="0^~. We present a decomposition of the quantities a"j into superdominant and subdominant components and give an upper bound on the former and an asymptotic lower bound for the latter. Sufficient estimation of these quantities would lead to confirmation of the Riemann hypothesis.
Non-Functional Modeling and Validation in Model-Driven Architecture
Authors: Vittorio Cortellessa, Antinisca Di Marco, Paola Inverardi
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Software models are, in most cases, considered as functional abstractions of systems. They represent the backbone of transformational processes aimed at code generation. On the other end, modeling is a traditional activity in the field of non-functional validation of software/hardware systems, although non-functional models found on different notations (such as Petri Nets) and embed additional information (such as the operational profile) with respect to software models. In this paper we widen the scope of Model- Driven Architecture by introducing a Non-Functional-MDA framework that, beside the typical model transformations for code generation, embeds new types of model transformations that allow to generate non-functional models. For an uniform integration of these practices, we define Platform Independent/Specific Models in the non-functional domain.
Blurring the Layers of Abstractions: Time to Take a Step Back?
Authors: Krisztian Flautner
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Silicon technology evolution over the last four decades has yielded an exponential increase in integration densities with steady improvements of performance and power consumption at each technology generation. This steady progress has created a sense of entitlement for the riches that future process generations would bring. Today, however, classical process scaling seems to be dead and living up to technology expectations requires continuous innovation at many levels, which comes at steadily progressing implementation and design costs. Solutions to problems need to cut across layers of abstractions and require coordination between software, architecture and circuit features. This talk will describe some of the recent work at ARM on designing architectures which dynamically optimize operating parameters for temporal conditions.
The 1998 HTK system for transcription of conversational telephone speech
Authors: T. Hain
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes the 1998 HTK large vocabulary speech recognition system for conversational telephone speech as used in the NIST 1998 Hub5E evaluation. Front-end and language modelling experiments conducted using various training and test sets from both the Switchboard and Callhome English corpora are presented. Our complete system includes reduced bandwidth analysis, side-based cepstral feature normalisation, vocal tract length normalisation (VTLN), triphone and quinphone hidden Markov models (HMMs) built using speaker adaptive training (SAT), maximum likelihood linear regression (MLLR) speaker adaptation and a confidence score based system combination. A detailed description of the complete system together with experimental results for each stage of our multi-pass decoding scheme is presented. The word error rate obtained is almost 20% better than our 1997 system on the development set.
Location-based activity recognition
Authors: Dieter Fox, Henry Kautz
Venue:  (2006)

Automatic recognition of human activities can support many applications, from context aware computing to just-in-time information systems to assistive technology for the disabled. Knowledge of a person's location provides important context information for inferring a person's high-level activities. This dissertation describes the application of machine learning and probabilistic reasoning techniques to recognizing daily activities from location data collected by GPS sensors. In the first part of the dissertation, we present a new framework of activity recognition that builds upon and extends existing research on conditional random fields and relational Markov networks. This framework is able to take into account complex relations between locations, activities, and significant places, as well as high level knowledges such as number of homes and workplaces. By extracting and labeling activities and significant places simultaneously, our approach achieves high accuracy on both extraction and labeling. We present efficient inference algorithms for aggregate features using Fast Fourier Transform or local Markov Chain Monte Carlo within the belief propagation framework, and a novel approach for feature selection and parameter estimation using boosting with virtual evidences. In the second part, we build a hierarchical dynamic Bayesian network model for transportation routines. It can predict a user's destination in real time, infer the user's mode of transportation, and determine when a user has deviated from his ordinary routines. The model encodes general knowledge such as street maps, bus routes, and bus stops, in order to discriminate different transportation modes. Moreover, our system could automatically learn navigation patterns at all levels from raw GPS data, without any manual labeling! We develop an online inference algorithm for the hierarchical transportation model based on the framework of Rao-Blackwellised particle filters, which performs analytical inference both at the low level and at the higher levels of the hierarchy while sampling other variables.
Convergence properties of self-organizing maps applied for communication channel equalization
Authors: H. Abdulkader
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper studies the convergence properties of a self-organizing map (SOM) equalizer. The transmitted signal is assumed to be a 4-QAM signal corrupted by an additive white Gaussian noise (AWGN). Several theoretical results such as map ordering and stability conditions are given. These results show a good fit with computer simulations.
Flexible video compression systems using an analog vector quantization chip
Authors: S. Rovetta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Vector quantization systems are usually based on digital implementation of the core operations. In this paper, video compression systems exploiting an analog implementation of vector quantization are presented. The main advantages of analog design are exploited, obtaining notable performances when compared to other solutions found in the literature. The circuit features a very modular, completely parallel internal architecture. Many circuits can be easily connected to obtain a larger codebook size and a larger vector dimension. Synthesis of codebooks is also described.
Revisiting Hot Passive Replication
Authors: Ruben de Juan-Marin, Hendrik Decker, Francesc D. Munoz-Esco
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Passive replication has been extensively studied in the literature. However, there is no comprehensive study yet with regard to its degree of communication synchrony. Therefore, we propose a new, detailed classification of hot passive replication protocols, including a survey of the fault tolerance and performance of each class.
Measuring the performance of implemented multirate systems
Authors: F. A. Heinle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Multirate systems play an important role in modern telecommunication. Examples of their application are filter banks for image or speech coding, transmultiplexers, sampling rate converters, and block processing systems. Usually they are designed under idealizing assumptions, neglecting wordlength effects as well as the required coding between analysis and synthesis part of the multirate system. Thus a rather different performance of an implemented system in comparison with the idealized one has to be expected. In general, not all of the resulting distortions can be calculated analytically. Nevertheless, they must be considered carefully during the design and implementation phase. We describe a method for measuring the performance of implemented multirate systems. The method is illustrated by measurement results.
FIR H/spl infin/ equalization
Authors: A. T. Erdogan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper addresses the problem of blind channel equalization in the context of digital communications. Recent results have shown that certain operations applied to the source signal at the transmitter help in the blind identification and equalization of the channel at the receiver. For example, cyclostationarity is induced by multiplying the baseband data signal with a periodic sequence. Here, the baseband data signal is multiplied with a chirp sequence. Exploiting certain structural properties arising from this operation, a simple and fast converging algorithm is obtained for estimating the equalizer coefficients. The algorithm is deterministic, i.e. it provides optimal equalizer settings using finite data in the noiseless case.