ppxscal/embedding_network huggingface dataset:
Middleware for realtime multicomputer tool development
Authors: B. Isenstein
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Developing software applications for scalable, heterogeneous platforms is a highly specialized, time consuming task. This paper discusses a new development in "middleware" that provides an interface for developers and is an intermediary for innovative application development tools. A component software approach insulates both the application developer and tool developer from platform issues while facilitating high-performance execution of applications. Central to the development is a new open application framework that uses an application configuration language based on the well-known Tool Command Language (Tcl), written by John Ousterhout. Adoption of the framework by advanced tools potentially offers a dramatic programming productivity gain over existing practices.
Sampling theorems for linear time-varying systems with bandlimited inputs
Authors: Soonman Kwon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We propose and prove an extended sampling theorem for linear time-varying systems. As a result, we establish a discrete-time equivalent model of the input-output relation of the system for the case of bandlimited inputs and bandlimited system variation. The sampling of the output signal and an equivalent discrete-time model of the system are discussed.
Harvesting Terrorists Information from Web
Authors: Nasrullah Memon, David L. Hicks, Henrik Legind Larsen
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Data collection is difficult to do in any network analysis because it is hard to create a complete network. It is not easy to gain information on terrorist networks. It is a fact that terrorist organizations do not provide information on their members and the government rarely allows researchers to use their intelligence data [1]. Very few researchers [2] [3] [4] collected data from open sources, and to the best of our knowledge, no knowledge base is available in academia for the analysis of the terrorist events. To counter the information scarcity, we at Software Intelligence Security Research Center, Aalborg University Esbjerg Denmark, designed and developed a terrorism knowledge base by harvesting information from authenticated websites. In this paper we discuss data collection and analysis results of our ongoing research of Investigative Data Mining (IDM). In addition, we present a system architecture of our analyzing, visualizing and destabilizing terrorist networks prototype, i.e., iMiner, and also describe how we collected terrorist information using an Information Harvesting System.
A power and reliability model for error prone technologies: improving speech-based support for spatial navigation
Authors: Andrew Sears
Venue:  (2005)

Navigation is one of the major activities that people engage in when interacting with computers. When using traditional navigation solutions, such as the mouse, inherent limitations of human capabilities are the primary source of errors. However, the development of assistive technologies and ubiquitous computing have highlighted the importance of system- and context-based errors both of which differ in important ways from user-based errors. Traditional theories such as the speed and accuracy tradeoff and Fitts' Law may effectively explain user-based errors, but are insufficient when errors are caused by limitations of the underlying technologies or the context in which the interactions are occurring. To address this issue, a power and reliability model (PRM) was proposed, which expands on traditional theories to more effectively address all three types of errors. This model consists of two components: power and reliability. Power addresses the efficiency of a technique or application while reliability addresses the errors that occur during a task. The tradeoff between power and reliability, which is inherent when employing error-prone technologies such as speech recognition, has significant implications for system and interface design. To operationalize the concept of reliability, a metric is proposed that incorporates both the likelihood of command failures and the severity of the outcomes caused by those failures. This metric builds on the concept of entropy in information theory to provide a systematic solution that allows the reliability of various techniques and applications to be quantified, evaluated, and compared. Several studies were conducted to begin the validation of the PRM. One study involving ninety participants focused on the validation of the reliability metric. The results indicate that, compared to failure rates, reliability scores are more effective for describing both objective task completion times and subjective user satisfaction ratings. A case study involving 29 participants illustrated the tradeoff between power and reliability and demonstrated how the proposed model could be used to guide the design of more effective solutions. Interaction solutions developed based on design guidelines derived from the PRM resulted in lower command failure rates, less severe failure consequences, the development of more effective strategies, and more efficient interactions.
Profile-driven energy reduction in network-on-chips
Authors: Feihui Li, Guangyu Chen, Mahmut Kandemir, Ibrahim Kolcu
Venue: ACM SIGPLAN Notices (2007)

Reducing energy consumption of a Network-on-Chip (NoC) is a critical design goal, especially for power-constrained embedded systems.In response, prior research has proposed several circuit/architectural level mechanisms to reduce NoC power consumption. This paper considers the problem from a different perspective and demonstrates that compiler analysis can be very helpful for enhancing the effectiveness of a hardware-based link power management mechanism by increasing the duration of communication links' idle periods. The proposed profile-based approach achieves its goal by maximizing the communication link reuse through compiler-directed, static message re-routing. That is, it clusters the required data communications into a small set of communication links at any given time, which increases the idle periods for the remaining communication links in the network. This helps hardware shut down more communication links and their corresponding buffers to reduce leakage power. The current experimental evaluation, with twelve data-intensive embedded applications, shows that the proposed profile-driven compiler approach reduces leakage energy by more than 35% (on average) as compared to a pure hardware-based link power management scheme.
Unsupervised relation disambiguation using spectral clustering
Authors: Jinxiu Chen, Donghong Ji, Chew Lim Tan, Zhengyu Niu
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. It works by calculating eigen-vectors of an adjacency graph's Laplacian to recover a submanifold of data from a high dimensionality space and then performing cluster number estimation on the eigenvectors. Experiment results on ACE corpora show that this spectral clustering based approach outperforms the other clustering methods.
An efficient top-down parsing algorithm for understanding speech by using stochastic syntactic and semantic models
Authors: H. Stahl, J. Muller, M. Lang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The paper is concerning an approach for understanding speech using a new form of probabilistic models to represent syntactic and semantic knowledge of a restricted domain. One important feature of our grammar is that the parse tree directly represents the semantic content of the utterance. Since we determine that semantic content by an integrated search, we avoid consistency problems at the interface between the recognizer and the language understanding part of the speech understanding system. We succeeded in designing such an incremental algorithm, which integrates semantic, syntactic, and acoustic-phonetic knowledge in a seamless, consistent way. High efficiency is achieved by using a chart-parsing technique with structure-sharing and a strict top-down strategy for opening new word hypotheses in the pronunciation layer.
LIL: an architecture-neutral language for virtual-machine stubs
Authors: Neal Glew, Spyridon Triantafyllis, Michał Clerniak, Marsha Eng, Brian Lewis, James Stichnoth
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

High-performance MREs (managed runtime environments) that run either Java or CLI applications require machine code sequences, called stubs, to implement such runtime support operations as object allocation, synchronization, and native method invocation. Due to the frequency of these operations, implementing stubs efficiently is critical for performance. Also, the number of different stubs that have to be created and maintained makes stub creation a sizable part of an MRE's implementation. Stubs typically require access to low-level resources such as registers and the call stack, and often must be specialized at runtime for particular classes or methods. Although stubs can be implemented by generating hand-crafted machine code at runtime, this approach is tedious and error-prone, and leads to stubs that are non-portable and difficult to maintain. To address these problems, we designed a domain-specific language, called LIL, for implementing stubs. LIL is low-level but architecture-neutral, allowing the creation of stubs that are both portable and efficient. LIL also abstracts away many implementation details, making stubs easier to read. It is lightweight enough to be used for dynamic stub generation. LIL's validity checker helps us to catch many errors early. Our preliminary experience using LIL indicates that it greatly eases development and maintenance of stubs without sacrificing performance.
Context-aware handoff middleware for transparent service continuity in wireless networks
Authors: Paolo Bellavista, Antonio Corradi, Luca Foschini
Venue: Pervasive and Mobile Computing (2007)

Advances in wireless networking and content delivery are enabling new challenging provisioning scenarios where a growing number of users access continuous services, e.g., audio/video streaming, while moving among different points of attachment to the Internet, possibly with different connectivity technologies, e.g., Wi-Fi, Bluetooth, and cellular 3G. That calls for novel middlewares capable of dynamically personalizing service provisioning to the characteristics of client environments, in particular to discontinuities in wireless resource availability due to handoffs. The paper proposes a novel middleware solution, called Mobile agent-based Ubiquitous multimedia Middleware (MUM), that performs effective and context-aware handoff management to transparently avoid service interruptions during both horizontal and vertical handoffs. MUM exploits the full visibility of wireless connections available and their handoff implementations (handoff awareness), of service quality requirements and handoff-related quality degradations (QoS awareness), and of network topology and local resource availability (location awareness); that visibility enables MUM to provide original solutions for handoff prediction, multimedia continuity via adaptive data buffering/pre-fetching, and proactive re-addressing/rebinding.
Experimental Evaluation of Attachment Methods for a Multifinger Haptic Device
Authors: Gina Donlin, Rainer Leuschke, Blake Hannaford
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Due to the nature of touch sensation, the interface between a user and a haptic device must be carefully designed and selected such that the user feels they are directly manipulating a virtual object. This is particularly critical for attachment of fingertips to a multi fingered device. We experimentally tested eight methods of attachment for a Multifinger Haptic Device (MFHD) previously developed in our lab. From the test we gathered objective and subjective data on force and user preference. Based on this data we were able to evaluate the quality of the attachment methods.
A robust speech detection algorithm in a microphone array teleconferencing system
Authors: Qiyue Zou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper describes a robust speech detection algorithm that can operate reliably in a microphone array teleconferencing system. High performance in a nonstationary noisy environment is achieved by combining the following techniques: (1) noise suppression by spectral subtraction, (2) silence detection by adaptive noise threshold and (3) non-stationary noise detection based on the availability of pitch signal. This algorithm can prevent the microphone-array-based speaker tracking system from being misguided by noises commonly present in a conference room. Real world experiments show that this algorithm performs very well and has the potential for practical applications.
Operator theoretic image coding
Authors: H. Puh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A general formalism for iterative image coding is introduced. In this framework, each feature of the image to be coded is associated with a nonexpansive operator which leaves invariant all images possessing the feature in question. The decoding scheme consists of finding a common fixed point of these operators, which can be achieved via efficient parallel algorithms. The proposed formalism provides a flexible treatment of the image coding problem and contains as special cases transform coding, fractal coding, set theoretic coding, and vector quantization.
More efficient network class loading through bundling
Authors: David Hovemeyer, William Pugh
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

In this paper, we describe bundling, a technique for the transfer of files over a network. The goal of bundling is to group together files that tend to be needed in the same program execution and that are loaded close together. We describe an algorithm for dividing a collection of files into bundles based on profiles of file-loading behavior. Our motivation for bundling is to improve the performance of network class loading in Java. We examine other network class loading mechanisms and discuss their performance tradeoffs. Bundling is able to combine the strengths of both on-demand strategies and archive-based strategies. We present experimental results that show how bundling can perform well in a variety of network conditions.
Untangling the web from DNS
Authors: Michael Walfish, Hari Balakrishnan, Scott Shenker
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

The Web relies on the Domain Name System (DNS) to resolve the hostname portion of URLs into IP addresses. This marriage-of-convenience enabled the Web's meteoric rise, but the resulting entanglement is now hindering both infrastructures--the Web is overly constrained by the limitations of DNS, and DNS is unduly burdened by the demands of the Web. There has been much commentary on this sad state-of-affairs, but dissolving the ill-fated union between DNS and the Web requires a new way to resolve Web references. To this end, this paper describes the design and implementation of Semantic Free Referencing (SFR), a reference resolution infrastructure based on distributed hash tables (DHTs).
Fully Bayesian analysis of conditionally linear Gaussian state space models
Authors: A. Doucet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we use the Gibbs sampler to carry out Bayesian inference on conditionally linear Gaussian state space models. In a Bayesian framework, the Gibbs sampler is a powerful iterative procedure which can be seen as a stochastic analogue of the EM algorithm. To use it, it is necessary to sample from complex multivariate densities. An efficient algorithm is derived. An application to Bernoulli-Gauss processes deconvolution is given for which very satisfactory results are obtained. For this example, the geometric convergence of the algorithm is established.
Zero-copy TCP in Solaris
Authors: Hsiao-keng Jerry Chu
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

This paper describes a new feature in Solaris that uses virtual memory remapping combined with checksumming support from the networking hardware, to eliminate data-touching overhead from the TCP/IP protocol stack. By implementing page remapping operations at the right level of the operating system, and caching MMU mappings to take advantage of locality of reference, significant performance gain is attained on certain hardware platforms. Nevertheless, the performance improvement over CPU copying varies, depending on the host memory cache architecture, MMU design, and application behavior. We begin by comparing different zero-copy schemes, and explain our preference for page remapping and copy-on-write (COW) techniques. We then describe our implementation, and present its performance characteristics under a number of different parameters. We conclude with ideas for future improvements.
Topic independent language model for key-phrase detection and verification
Authors: T. Kawahara
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A topic independent lexical and language modeling for robust key-phrase detection and verification is presented. Instead of assuming a domain specific lexicon and language model, our model is designed to characterize filler phrases depending on the speaking-style, thus can be trained with large corpora of different topics but the same style. Mutual information criterion is used to select topic independent filler words and their N-gram model is used for verification of key-phrase hypotheses. A dialogue-style dependent filler model improves the key-phrase detection in different dialogue applications. A lecture-style dependent model is trained with transcriptions of various oral presentations by filtering out topic specific words. It performs much better verification of key-phrases uttered during lectures of different topics compared with the conventional syllable-based model and large vocabulary model.
Open versus closed: a cautionary tale
Authors: Bianca Schroeder, Adam Wierman, Mor Harchol-Balter
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

Workload generators may be classified as based on a closed system model, where new job arrivals are only triggered by job completions (followed by think time), or an open system model, where new jobs arrive independently of job completions. In general, system designers pay little attention to whether a workload generator is closed or open. Using a combination of implementation and simulation experiments, we illustrate that there is a vast difference in behavior between open and closed models in real-world settings. We synthesize these differences into eight simple guiding principles, which serve three purposes. First, the principles specify how scheduling policies are impacted by closed and open models, and explain the differences in user level performance. Second, the principles motivate the use of partly open system models, whose behavior we show to lie between that of closed and open models. Finally, the principles provide guidelines to system designers for determining which system model is most appropriate for a given workload.
A Distributed Algorithm for Underlay Aware and Available Overlay Formation in Event Broker Networks for Publish/Subscribe Systems
Authors: Madhu Kumar SD, Umesh Bellur
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Event broker networks are basically overlay networks formed over the underlying physical network. In modern distributed applications, ensuring high availability in the face of the runtime failures is a major issue. This paper presents an asynchronous distributed algorithm for constructing and maintaining an underlay aware overlay which ensures high availability in the presence of node and link failures in the underlying physical network. We prove theoretically that our algorithm is correct. The time complexity of the algorithm is estimated to be O(diameter*degree)2 of the network and the message complexity is O(diameter*degree). A model for availability of an underlay aware overlay network and a classification of available overlays are the other important contributions of this paper.
Rapidly Selecting Good Compiler Optimizations using Performance Counters
Authors: John Cavazos, Grigori Fursin, Felix Agakov, Edwin Bonilla, Michael F. P. O'Boyle, Olivier Temam
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Applying the right compiler optimizations to a particular program can have a significant impact on program performance. Due to the non-linear interaction of compiler optimizations, however, determining the best setting is nontrivial. There have been several proposed techniques that search the space of compiler options to find good solutions; however such approaches can be expensive. This paper proposes a different approach using performance counters as a means of determining good compiler optimization settings. This is achieved by learning a model off-line which can then be used to determine good settings for any new program. We show that such an approach outperforms the state-ofthe- art and is two orders of magnitude faster on average. Furthermore, we show that our performance counter-based approach outperforms techniques based on static code features. Using our technique we achieve a 17% improvement over the highest optimization setting of the commercial PathScale EKOPath 2.3.1 optimizing compiler on the SPEC benchmark suite on a recent AMD Athlon 64 3700+ platform.
Optimal combinatoric auctions with single-minded bidders
Authors: John O. Ledyard
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Combinatoric auctions sell K objects to N people who have preferences defined on subsets of the items. The optimal auction satisfies incentive compatibility (it is a dominant strategy to report true values), voluntary participation (bidders are not worse off through participation) and maximizes the expected revenue of the auctioneer among such auctions. In this paper, the optmal auction is characterized for the special case of single-minded bidders. It is shown that the optimal auction is not a Vickrey-Clarke-Groves mechanism. The optimal auction uses pivot prices, as in VCG, but it also uses bidder preferences. An example is provided showing improvement over the VCG mechanism can be large. The example also illustrates that auctions that are efficient or in the core are not optimal.