ppxscal/embedding_network huggingface dataset:
Speech recognition technology in the ubiquitous/wearable computing environment
Authors: S. Furui
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Due principally to the technology of making computers smaller, more powerful and cheaper, the ubiquitous and wearable computing era is expected to come into being in the beginning of 21st century. In such an environment, speech recognition will be widely used as one of the principal methods of human-computer interaction, and in most of cases it will be performed using a microphone and a networked computer worn and tailored to each person. Accordingly, speech recognition systems will comprise very different structures than do present systems. Promptly retrieving environmental information, such as noise, which is regularly monitored by computers, and task-dependent information transmitted according to each application to the personalized recognizers will significantly improve system adaptability to the new tasks and robustness. Nonetheless, a number of salient issues remain to be resolved to generate the ubiquitous/wearable computing environment.
JANE-The Java Ad Hoc Network Development Environment
Authors: Daniel Gorgen, Hannes Frey, Christian Hiedels
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

This work describes a Java based development platform which is intended to support ad hoc network researchers in application and protocol design. Software development within this environment is expected to follow a bottom up approach. Basic functionality is implemented in elementary components which can be combined to more complex ones by using well defined interfaces. With dynamically changing network links being rather the common case than a failure situation, asynchronous communication has been selected as the main communication paradigm within this platform. Reusability of components in different execution contexts by providing an appropriate machine abstraction is a further important design decision which drove the platform development. Code written once can be executed in a pure simulation mode, in a hybrid setting with real devices being attached to a running simulation and, finally, in a setting using real devices only. Software development following this three-tier development process paired with the platform's rich visualization features emerged to significantly ease the burden of debugging and parameterizing in such highly dynamic and inherently distributed environments. In conjunction with a core middleware platform a rich set of generic services has been implemented with the most important ones being described in this work. Several application programs have already been implemented on top of these services. These applications which are described in this work as well serve as a proof of concept for both the platform itself and the utilized set of generic services.
Arbitrarily-shaped wavelet packets for zerotree coding
Authors: O. Egger
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

In order to satisfy the needs of new multimedia applications, the problem of content-based video coding has to be addressed. A new approach of object interior coding is proposed. It is based on an arbitrarily-shaped subband transform followed by a generalized embedded zerotree wavelet algorithm. It is shown that the proposed technique achieves good compression results and has additional properties such as being computationally efficient, keeping the same dimensionality in the transformed domain, being perfect reconstruction, and allowing a perfect rate control. In addition a lossless mode can be defined by using an appropriate filter bank.
State Space Multiple Leaves Representations of Complex Systems: The basic properties of system theory.
Authors: Stanislaw Tarasiewicz
Venue: Proceedings of the Second International Conference on Systems (2007)

The purpose of this paper is to provide a reasonable comprehensive transition from the linear timeinvariant systems to the linear time-varying systems at a level comparable on the state space multiple leaves representation. In this regard, the preliminary works are dedicated to the on-line identification procedures of a class of complex system. This class of systems is represented by a mechatronic point of view, i.e. communication, calculation, monitoring, linking and state-plan trajectories mapping. For the case in which both calculation and monitoring processes are used, these identification procedures show which type of state-plan is more attractive on KC , or KR parameters. To complete the on-line identification procedures with a controller tuning of the model parameters, it was necessary to extend the sliding mode's theorem to the case of multiple leaves state-plan, allowing limitation of short-time instability analysis.
A Linear Programming Approach to Max-Sum Problem: A Review
Authors: Tomas Werner
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.
IGMPS, a New Tool for Estimating End-to-End Available Bandwidth in IP Network Paths
Authors: Ahmed Ait Ali, Francis Lepage
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper presents a new end-to-end available band- width estimation tool called IGMPS (Improved Gap Model using Packet Size parameter). IGMPS is a lightweight tool based on a new deterministic model of packet delays de- rived from the Probe Gap Model which uses packet pair technique for actively assessing bottleneck link characteris- tics. In a previous work that presented a detailed analysis of the capabilities and limitations of packet dispersion tech- niques, it is showed that probing packet size parameter has a considerable effect on the measurement accuracy. Based on this insight, the model implemented in IGMPS takes into account this parameter and introduce it in available band- width estimation formula. Through measurements on sev- eral network testbed configurations, we evaluated IGMPS in terms of accuracy, convergence time and intrusiveness and found that IGMPS provides available bandwidth esti- mates with high accuracy. We investigated the effect of sev- eral deciding factors on IGMPS measurement accuracy and found that when the probing packet size is equal or close enough to the cross traffic packet size, IGMPS estimates available bandwidth with a very high accuracy.
OASIS: anycast for any service
Authors: Michael J. Freedman, Karthik Lakshminarayanan, David Mazières
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

Global anycast, an important building block for many distributed services, faces several challenging requirements. First, anycast response must be fast and accurate. Second, the anycast system must minimize probing to reduce the risk of abuse complaints. Third, the system must scale to many services and provide high availability. Finally, and most importantly, such a system must integrate seamlessly with unmodified client applications. In short, when a new client makes an anycast query for a service, the anycast system must ideally return an accurate reply without performing any probing at all. This paper presents OASIS, a distributed anycast system that addresses these challenges. Since OASIS is shared across many application services, it amortizes deployment and network measurement costs; yet to facilitate sharing, OASIS has to maintain network locality information in an application-independent way. OASIS achieves these goals by mapping different portions of the Internet in advance (based on IP prefixes) to the geographic coordinates of the nearest known landmark. Measurements from a preliminary deployment show that OASIS, surprisingly, provides a significant improvement in the performance that clients experience over state-of-the-art on-demand probing and coordinate systems, while incurring much less network overhead.
Blind equalization for CDMA systems with aperiodic spreading sequences
Authors: Hui Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Multipath induced interchip-interference (ICI) alters waveforms of transmitted signals and presents a major obstacle to direct-sequence (DS) code-division-multiple-access (CDMA) communications. Since practical systems often employ aperiodic pseudorandom (PN) spreading sequences, source separation/equalization based on users signature waveforms may be prohibitive. We consider antenna array CDMA systems with aperiodic PN sequences and present a blind method to estimate the filter coefficients in a standard 2D RAKE receiver. A simple cost function is formulated based on which we derive a least-squares equalizer to effectively suppress both ICI and multiuser interference (MUI) by exploiting the channel diversities.
A model for implementing "Supplemental Instruction" in engineering
Authors: R. M. Marra
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Supplemental Instruction (SI) is a learning enhancement program. SI targets high risk courses instead of high risk students and offers assistance on an outreach basis in regularly scheduled, out of class sessions. The primary goal of SI is to facilitate students' mastery of the course concepts, however a secondary goal is to encourage students to develop better learning skills and strategies. A student who has received a high grade in a targeted SI course is trained to become an SI leader. As an SI leader, the student re-attends the course to model effective student behaviors, and conducts weekly SI sessions. During the SI sessions, SI leaders facilitate students' understanding of course material via interactive learning strategies which encourage involvement, comprehension and higher order reasoning skills. SI leaders do not re-teach or simply work problems on the board; rather they offer alternative perspectives and exercises designed to mirror the course content. Penn State's SI program was piloted as a part of our larger Undergraduate Teaching Intern Program. The Teaching Intern (TI) Program allows undergraduate students to partner with a professor on a particular course in order to learn about the responsibilities of being a faculty member. This paper provides an overview of both the SI and TI programs, specific details on how to run a course to train for these programs, and preliminary results of the SI program in terms of experiences of the three student SI leaders and achievement results of those students who attended SI sessions versus those who did not.
Clue tables: a distributed, dynamic-binding naming mechanism
Authors: Cheng-Zen Yang, Chih-Chung Chen, Yen-Jen Oyang
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

This paper presents a distributed, dynamic naming mechanism called clue tables for building highly scalable, highly available distributed file systems. The clue tables naming mechanism is distinctive in three aspects. First, it is designed to cope well with the hierarchical structure of the modern large-scale computer networks. Second, it implicitlycarries out load balancing among servers to improve systemscalability. Third, it supports file replication and dynamically designates a primary copy to resolve possible data inconsistency. This paper also reports a performance evaluation of the clue tables mechanism when compared with NFS, a popular distributed file system.
Convergence of Nanoelectronics and Living Cells: A New Frontier for Diagnostics and Therapy?
Authors: Roberto Guerrieri
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Nanoelectronics offers the potential to develop structures which can interact with living cells, displacing them under software control and sensing their position and status. This information can be used to create new diagnostic protocols that will have a broad impact in the treatment of several important ailments. This talk provides an overview of the field and gives examples taken from a specific platform based on silicon technology.
Design of Embedded m-out-of-n Code Checkers Using Complete Parallel Counters
Authors: Steffen Tarnick
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Self-testing m-out-of-n code checkers are often designed using parallel counters. Each code word is partitioned into two parts. The ones of both parts are counted by two parallel counters or similar circuits and the obtained numbers, after a correction if necessary, are evaluated using another checker. In this paper this checker design method is extended such that the obtained checkers achieve the self-testing property under very weak conditions. It is only required that no checker input gets a constant signal and that the code words occur in a random order so that the checkers can be used as embedded checkers. The basic building blocks of the checkers are two identical parallel counters that only consist of full adders of which some have a special architecture. The obtained checkers have in most cases a much smaller hardware size than previously known embedded m-out-of-n code checkers. The proposed design method that works for allm-out-of-n codes is further extended to make the checkers programmable, i.e. the same m-out-of-n code checker can be used for different values of m.
Using Online Competitor's Inventory Information for Pricing
Authors: Rajiv Dewan, Marshall Freimer, Yabing Jiang
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Information displayed on an e-commerce site can be used not just by the intended customers but also by competitors. In the paper, we examine the effect of such proactive information use in the setting of e-commerce retailing where duopoly e-tailers set their prices of a commodity that is in short supply. While e-tailers enhance their service quality by making stockout information available online, that inventory information could also be used by competitors to determine their prices. Each e-tailer can launch software agents to detect its competitor's inventory position and make its price decision contingent on that position. We show that when customer reservation value is relatively high, and e-tailers do not resemble each other in terms of fill rate, both e-tailers choose to adopt the software agent technology and price dynamically at equilibrium. The high availability e-tailer can charge higher prices and enjoy a higher profit level than the low availability e-tailer. More customers prefer to visit the high fill rate e-tailer first under the dynamic pricing scheme than under the static pricing scheme. Because total search costs are reduced, social welfare is improved under the new dynamic pricing scheme.
Maximizing uniform translational motion: Motion estimation with the Haar transform and dynamic programming
Authors: O. G. Guleryuz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper proposes a new motion estimation framework based on localized linear transforms, multiresolutional probability models and dynamic programming. We incorporate localized linear transforms (specifically wavelets) into motion estimation by parameterizing the motion fields to be estimated in terms of their localized linear transform coefficients. In terms of these coefficients, we propose a simple multiresolutional probability model that captures the possible local smoothness in the field to be estimated while allowing for discontinuities and uncovered regions. Within this framework we formulate the motion estimation problem as a MAP optimization problem that can be tackled with dynamic programming to yield the globally optimal dense motion field. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance analysis of multiclass services in the uplink of wideband CDMA
Authors: T. C. Wong, J. W. Mark, K. C. Chua
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

An analytical formulation of the outage probability in term of bit error rate specification for multiclass services in the uplink of a wideband CDMA-based cellular system is presented. The analytical framework is formulated for the general case in which different traffic classes have different spreading gains. The analytical work leads to the determination of the capacity region of a WCDMA system. Numerical results of the capacity region corresponding to typical parameter values are also presented.
An Ice-Free Arctic? Opportunities for Computational Science
Authors: L. Bruno Tremblay, Marika M. Holland, Irina V. Gorodetskaya, Gavin A. Schmidt
Venue: Computing in Science and Engineering (2007)

The authors discuss modeling's role in understanding the ice-ocean system, as well as its importance in predicting the future state of Arctic sea-ice. In doing so, this article presents results from a hierarchy of models of different complexity, their strengths and weaknesses, and how they could help forecast the future state of the ice-ocean system.
The design of a web-based computer proficiency examination
Authors: N. Kinnersley
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

In 1996, the Kansas Board of Regents passed a requirement that, beginning in 2001, a student applying for admission to a Kansas university must have earned one high school unit of computer technology. One option a student has for satisfying this requirement is to pass a computer proficiency examination. This paper reports on the development of a web-based proficiency test designed and developed at the University of Kansas. It discusses initial design decisions that were made as well as unanticipated problems which arose that had to be resolved in order to bring this project to fruition. Two types of security issues had to be addressed-maintaining the integrity of the question source and ensuring that the testing environment at the remote site was strictly monitored. Having to deal with different versions of browsers as well as different computing platforms presented additional challenges.
Privacy-Aware Context Discovery for Next Generation Mobile Services
Authors: Cristian Hesselman, Henk Eertink, Martin Wibbels
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

We present a system that enables applications to discover and obtain information that describes the context of a particular entity (e.g., a user or a device). Our system revolves around the notion of a context agent, which is a service that represents an entity and provides access to context information about that entity. Context agents facilitate the enforcement of an entity's policies regarding the release of context information (e.g., to applications or visiting users), even while these entities roam across different administrative domains. Context agents form an overlay on top of traditional local area service discovery infrastructures (e.g., based on SLP or WS-Discovery) and are enablers for more intelligent pervasive computing environments. In this extended abstract, we outline the architecture of our system based on a simple scenario.
A block quasi-Newton algorithm implemented in the frequency domain
Authors: K. Berberidis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

A new block adaptive filtering algorithm is derived. The algorithm belongs to the quasi-Newton class of algorithms which are known to have superior convergence properties as compared to gradient algorithms. An important feature of the algorithm is that it lends itself to efficient implementation in the frequency domain. The computational complexity of the frequency domain version of the algorithm is comparable to that of the self-orthogonalizing frequency domain block LMS algorithm while it converges at a faster rate. Depending on the input signal this improvement in performance may be significant in some practical cases.
Block Data Processing Using Commercial Processors
Authors: Kenneth N. Ellis, Winser E. Alexander
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper presents an approach to using commercial digital signal processors to develop a high performance multiprocessing system for block data processing. We use a restricted dataflow multiprocessor architecture and block data processing to achieve high performance. We call this architecture the Block Data Flow Architecture (BDFA). Block data processing algorithms for many applications have been developed by other researchers. Although many of these algorithms were developed for single processor systems, the algorithms can be mapped onto the BDFA because of its inherent support for block data processing. This paper highlights a few of these algorithms and presents the BDFA as a high performance architecture to implement these algorithms. In addition, we evaluate the potential of using Texas Instruments' TMS320C40 (C40) as a node processor in the BDFA.
Economic-Inspired Truthful Reputation Feedback Mechanism in P2P Networks
Authors: Yufeng Wang, Yoshiaki Hori, Kouichi Sakurai
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

Recently, cross-disciplinary efforts involving economics and computer security have proliferated. And Peer-to-Peer (P2P) reputation systems are essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest and malicious behaviors of peers. But reputation feedback is special kind of information, and it is not free. Based on those above consideration, in this paper, VCG (Vickrey-Clarke-Groves)-like reputation remuneration scheme inspired by economic model is proposed to stimulate rational peers not only to provide reputation feedback, but truthfully offer feedback.
An Innovative Master's Program in Distributed Computing
Authors: Rajkumar Buyya, Kotagiri Ramamohanarao
Venue: IEEE Distributed Systems Online (2007)

Current academic programs don't yet teach the skill set required to meet the demand for new Internet-based distributed computingtechnologies. The University of Melbourne's Master of Engineering in Distributed Computing program fills the gap between undergraduateprograms and industrial requirements to help students excel in both research and industry careers.