ppxscal/embedding_network huggingface dataset:
Designing a DHT for low latency and high throughput
Authors: Frank Dabek, Jinyang Li, Emil Sit, James Robertson, M. Frans Kaashoek, Robert Morris
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solutions, including iterative routing, recursive routing, proximity routing and neighbor selection, erasure coding, replication, and server selection. This paper explores the design of these techniques and their interaction in a complete system, drawing on the measured performance of a new DHT implementation and results from a simulator with an accurate Internet latency model. New techniques that resulted from this exploration include use of latency predictions based on synthetic co-ordinates, efficient integration of lookup routing and data fetching, and a congestion control mechanism suitable for fetching data striped over large numbers of servers. Measurements with 425 server instances running on 150 PlanetLab and RON hosts show that the latency optimizations reduce the time required to locate and fetch data by a factor of two. The throughput optimizations result in a sustainable bulk read throughput related to the number of DHT hosts times the capacity of the slowest access link; with 150 selected PlanetLab hosts, the peak aggregate throughput over multiple clients is 12.8 megabytes per second.
Optimization of continuous queries with shared expensive filters
Authors: Kamesh Munagala, Utkarsh Srivastava, Jennifer Widom
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When filters are expensive, significant performance gains are achieved by sharing filter evaluations across queries. A shared execution strategy in our scenario can either be fixed, in which filters are evaluated in the same predetermined order for all input, or adaptive, in which the next filter to be evaluated is chosen at runtime based on the results of the filters evaluated so far. We show that as filter costs increase, the best adaptive strategy is superior to any fixed strategy, despite the overhead of adaptivity. We show that itis NP-hard to find the optimal adaptive strategy, even if we are willing to approximate within any factor smaller than m where m is the number of queries. We then present a greedy adaptive execution strategy and show that it approximates the best adaptive strategy to within a factor O(log2m log n) where n is the number of distinct filters. We also give a precomputation technique that can reduce the execution overhead of adaptive strategies.
Design and Testing of an Integrated Circuit for Multi-Electrode Neural Recording
Authors: Reid R. Harrison, Paul T. Watkins, Ryan J. Kier, Daniel J. Black, Robert O. Lovejoy, Richard A. Normann, Florian Solzbacher
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We have developed a single-chip neural recording system with wireless power delivery and telemetry. The 0.5-Êm CMOS IC is designed to be bonded to the back of a 100-channel Utah Electrode Array. A pad near each amplifier allows connection of the chip to the MEMS electrode array. The complete Integrated Neural Interface will receive power wirelessly through a 2.64-MHz inductive link. A clock, regulated supply, and commands are derived from the power signal .The neural amplifiers each have a gain of 60 dB. A 10-bit charge-redistribution ADC is used to digitize the signal from one amplifier selected with an analog MUX. Digitizing all channels simultaneously would generate prohibitively high data rates; therefore, we perform data reduction by incorporating one-bit gspike detectors h into each amplifier. Neural data is transmitted off chip using an -integrated 433-MHz FSK transmitter. The chip measures 4.7 5.9 mm2 and consumes 13.5 mW of power.
Reusable binary-paired partitioned neural networks for text-independent speaker identification
Authors: S. A. Zahorian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A neural network algorithm for speaker identification with large groups of speakers is described. This technique is derived from a technique in which an N-way speaker identification task is partitioned into N*(N-1)/2 two-way classification tasks. Each two-way classification task is performed using a small neural network which is a two-way, or pair-wise, network. The decisions of these two-way networks are then combined to make the N-way speaker identification decision (Rudasi and Zahorian, 1991 and 1992). Although very accurate, this method has the drawback of requiring a very large number of pair-wise networks. In the new approach, two-way neural network classifiers, each of which is trained only to separate two speakers, are also used to separate other pairs of speakers. This method is able to greatly reduce the number of pair-wise classifiers required for making an N-way classification decision, especially when the number of speakers is very large. For 100 speakers extracted from the TIMIT database, the number of pair-wise classifiers can be reduced by approximately a factor of 5, with only minor degradation in performance when 3 seconds or more of speech is used for identification. Using all 630 speakers from the TIMIT database, this method can be used to obtain over 99.7% accuracy. With the telephone version of the same database, an accuracy of 40.2% can be obtained.
A comparison of online communication in distance education and in conventional education
Authors: T. Eriksson
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The online communication between students and teachers leads to both new problems and new opportunities. To investigate this, the authors made a comparison and evaluation of two versions of the same short course. The course "Planning and design of Web sites" is given at Chalmers University of Technology, Chalmers Lindholmen University College, both as a conventional course (ordinary lectures and workshops at location with online support) and a distance course (fully online). All students use the same Web site, which have functionality such as coursework, exercises, newsgroup, chat, etc. The evaluation shows that the time asynchrony was considered the most important advantage of computer mediated communications. The authors have also found that the distance course students were more satisfied with what they had learned and the Web site functionality. They thus concluded that the students in the fully online education adapted better to learning in the digital environment.
A Software Cybernetics Approach to Deploying and Scheduling
Authors: Stephen S. Yau, Dazhi Huang, Luping Zhu, Kai-Yuan Cai
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

Service-based Systems (SBS) are being adopted by many distributed systems. Applications in SBS can often be viewed as the composition of various computing services following specific workflows. These workflows often need to satisfy various timing and resource constraints. In this paper, a software cybernetics approach to deploying and scheduling workflows with timing and resource constraints in SBS is presented. In our approach, a logic-based technique for modeling and solving timing and resource constraints for workflows in SBS is developed to generate the initial resource assignments, schedules and deployment plans of agents for workflows. The principles and concepts in software cybernetics are applied to guide the synthesis of software controllers for monitoring and adapting system behavior.
An efficient polynomial multiplier in GF(2m) and its application to ECC designs
Authors: Steffen Peter, Peter Langendörfer
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In this paper we discuss approaches that allow to construct efficient polynomial multiplication units. Such multipliers are the most important components of ECC hardware accelerators. The proposed hRAIK multiplication improves energy consumption, the longest path, and required silicon area compared to state of the art approaches. We use such a core multiplier to construct an efficient sequential polynomial multiplier based on the known iterative Karatsuba method. Finally, we exploit the beneficial properties of the design to build an ECC accelerator. The design for GF(2233) requires about 1.4 mm2 cell area in a .25 &mu;m technology and needs 80 &mu;sec for an EC point multiplication.
Orthogonal source adaptive modulation for image transmission over noisy channels
Authors: J. E. Kleider
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper presents a low-complexity method of transmitting digitally compressed imagery through AWGN and fading channels. The proposed method combines a wavelet-based image coder that employs phase scrambling and trellis-coded quantization (TCQ), and orthogonal source adaptive modulation (OSAM), which is implemented using time diversity and orthogonal modulation. We compare the performance of the OSAM-TCQ system to that of a system that utilizes unequal error protection (UEP). We show that for the AWGN channel, the OSAM-TCQ system performs nearly 4 dB better than UEP-TCQ at high bit error rates (BERs), and the same as the UEP-TCQ system at low bit error rates, with much lower complexity than the UEP-based system.
Interactive presentation: An enhanced technique for the automatic generation of effective diagnosis-oriented test programs for processor
Authors: E. Sánchez, M. Schillaci, G. Squillero, M. Sonza Reorda
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The ever increasing usage of microprocessor devices is sustained by a high volume production that in turn requires a high production yield, backed by a controlled process. Fault diagnosis is an integral part of the industrial effort towards these goals. This paper presents a new methodology that significantly improves over a previous work. The goal is construction of cost-effective programs sets for software-based diagnosis of microprocessors. The methodology exploits existing post-production test sets, designed for software-based self-test, and may use an already developed infrastructure IP to perform the diagnosis. Experimental results are reported in the paper comparing the new results with existing ones, and showing the effectiveness of the new approach for an Intel 18051 processor core.
The complexity of reasoning about pattern-based XML schemas
Authors: Gjergji Kasneci, Thomas Schwentick
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form (r,s), wherer, s are regular expressions. Sets of such rules can be interpreted in an existential or a universal fashion. An XML tree is existentially valid with respect to a rule set, if for each node there is a rule such that the root path of the node matches r and the children sequence of the node matchess. It is universally valid if each node matching r also matchess. This paper investigates the complexity of reasoning about such rule sets, in particular the satisfiability and the implication problem. Whereas, in general these reasoning problems are complete for EXPTIME, two important fragments are identified with PSPACE and PTIME complexity, respectively.
Autonomic Behaviour in QoS Management
Authors: Rachid Anane
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

In QoS provisioning adaptation defines an area of overlap between QoS management and autonomic computing. This convergence is highlighted by the adherence of QoS systems to fundamental principles such as transparency, and the ability of QoS mechanisms to adapt seamlessly to prevailing environmental conditions. This characteristic is also underpinned by a combination of monitoring and management mechanisms, features that are inherent to autonomic behaviour. This paper is concerned with an investigation into the autonomic behaviour of QoS management systems. Relevant QoS mechanisms are identified and their functionality mapped onto autonomic behaviour. In a wider context, the components of a specific QoS architecture, ITSUMO, are considered from the perspective of autonomic control. Furthermore, as part of an ongoing research project, an evaluation mechanism is presented as a fundamental component in the architectural support for autonomic behaviour.
Numerical Approximation of a Macroscopic Model of Pedestrian Flows
Authors: Christophe Chalons
Venue: SIAM Journal on Scientific Computing (2007)

This paper is concerned with the numerical approximation of the solutions of a macroscopic model for the description of the flow of pedestrians. Solutions of the associated Riemann problem are known to be possibly nonclassical in the sense that the underlying discontinuities may well violate the Lax inequalities, which makes their numerical approximation very sensitive. This study proposes to extend the transport-equilibrium strategy proposed in [C. Chalons, C. R. Acad. Sci. Paris Ser. I, 342 (2006), pp. 623-626] and [C. Chalons, Transport-equilibrium schemes for computing nonclassical shocks. I. Scalar conservation laws, submitted] for computing the nonclassical solutions of scalar conservation laws with either a concave-convex or a convex-concave flux function and supplemented with an invertible kinetic function. These strong properties are not fulfilled in the present setting, since the flow function admits several inflection points and the kinetic function is not invertible. We nevertheless succeed in obtaining an efficient numerical scheme. Numerical evidence is provided.
A Queuing Model for Finite-Buffered Multistage Interconnection Networks
Authors: Prasant Mohapatra, Chita R. Das
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In this paper, we present a queueing model for per formance analysis of finite-buffered multistage inter connection networks. The model captures network be havior in an asynchronous communication mode and is based on realistic assumptions. Throughput and de lay are computed using the proposed model and the results are validated via simulation. Various design decisions using this mode! are drawn with respect to delay, throughput, and system power.
Rapid reverse DNS lookups for web servers
Authors: William LeFebvre, Ken Craig
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

When a web server wants to learn the domain name of one of its clients, it must perform a lookup in the Domain Name System's "reverse domain", inaddr.arpa. These lookups can take time and may have an adverse impact on the web server's response to its clients. Rapid DNS is an intermediate client/server system that operates between a web server and a DNS server. It provides caching of the results and, more importantly, limits web server lookups to the data contained in the cache. This provides a significant improvement in response time for situations in which knowledge of the hostname is not critical to the web server's operation. The Rapid DNS system was implemented for use in the web farm that serves the collection of Cable News Network (CNN) sites. Its design is presented, along with measurements of its performance in the CNN environment.
A data-driven scheme for the approximated computing of alias-free generalized discrete time-frequency distributions
Authors: Thuyen Le
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The time-frequency distribution (TFD) based on Cohen's (see Time-Frequency Analysis. Signal Processing Series. Prentice Hall PTR, New Jersey, 1995) class has significant potential for the analysis of a number of non-stationary signals. One of the discrete formulations is the recently introduced alias-free generalized discrete-time TFD (AF-GDTFD). The spectral decomposition of the kernel allows the computation of AF-GDTFD as a weighted sum of spectrograms. The partial sum has been shown to offer a vehicle to trade-off between exactness and computational load. This paper proposes a scheme which exploits local approximations by adapting dynamically the accuracy of spectrograms to the eigenvalue magnitudes. The approach employs the wavelet packet transform followed by a block-recursive Fourier transform and a compensation network. Adaptive selection of subbands for further processing reduces substantially the computational cost while still preserving an acceptable quality. The approach is attractive in terms of VLSI aspects due to the modular structure, local connections and stream processing.
A second-order differential approach for underdetermined convolutive source separation
Authors: Y. Deville
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper concerns the underdetermined case of the convolutive source separation problem, i.e. the situation when the number of observed convolutively mixed signals is lower than the number of sources. We propose a criterion and associated algorithm which, unlike classical approaches, make it possible to perform the separation of a subset of these sources by exploiting their assumed non-stationarity properties. This approach uses the second-order statistics of the signals and adapts the filters of a direct separating system so as to cancel the "differential cross-correlation" of signals derived by this system. This new method is related to the general differential source separation concept that we proposed. Its effectiveness is shown by means of numerical tests.
Privacy Policy Representation in Web-based Healthcare
Authors: Julia B. Earp, Matthew Vail, Annie I. Anton
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Health Insurance Portability and Accountability Act of 1996 (HIPAA) has resulted in the presence of very descriptive privacy policies on healthcare websites. These policies are intended to notify users about the organization's privacy practices. However, these policies are typically not easy to read, and as a result, few people actually read them. Given the fact that these policies are not optional, but required by HIPAA, they should be presented in a more usable manner that encourages consumers to read them. This, in turn, could encourage users to feel more comfortable when interacting with online healthcare organizations. In this paper, we present the preliminary results of our study that compares various ways to present privacy management information to online healthcare consumers. The study involved a survey of 993 Internet users. We also provide recommendations to managers and website designers who focus on usability.
An Efficient Classification System Based on Binary Search Trees for Data Streams Mining
Authors: Tao Wang, Zhoujun Li, Yuejin Yan, Huowang Chen, Jinshan Yu
Venue: Proceedings of the Second International Conference on Systems (2007)

Decision tree construction is a well-studied problem in data mining. Recently, there has been much interest in mining data streams. Domingos and Hulten have presented a one-pass algorithm for decision tree constructions. Their system using Hoeffding inequality to achieve a probabilistic bound on the accuracy of the tree constructed. In this paper, we revisit this problem and propose a decision tree classifier system that uses binary search trees to handle numerical attributes. The proposed system is based on the most successful VFDT, and it achieves excellent performance. The most relevant property of our system is an average large reduction in processing time, while keeps the same tree size and accuracy.
Towards Intuitive Work Modeling with a Tangible Collaboration Interface Approach
Authors: Stefan Oppl
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Models of human work are well recognized means for representing multiple elements of an organization in a mutually tuned form. However, humans and systems tend to use different forms of representation when expressing their knowledge. Most of the widespread modelling approaches focus on a system designer's or software view rather than on intuitive and comprehensive (re)presentations of mental models of users. Tangible interfaces that support the modelling process in an intuitive way could help to reduce the cognitive load when leveraging individual mental models of work processes. In a collaborative setting the immediate and concurrent manipulation of model elements fosters the reflection and discussion of both modelling a work domain and corresponding processes. In this way, it facilitates the development of common views on work tasks and knowledge sharing.
Algorithm for construction of parametric vectors for solution of classification problems by a feed-forward neural network
Authors: A. V. Anisimov, E. V. Porkhun, V. Yu. Taranukha
Venue: Cybernetics and Systems Analysis (2007)

A universal heuristic algorithm is considered that constructs the vector of properties of an object that are distributed among heterogeneous groups. This algorithm is based on a feed-forward neural network. An automatic system for objects classification is described. The use of the automatic classification system for a literary authorship attribution problem is considered.
Degenerate Sharing
Authors: Randall L. Hyde, Brett D. Fleisch
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

False sharing reduces system performance in shared memory systems. A major impediment to solving the problem of false sharing has been that no satisfactory definition for this problem exists. In this paper we provide precise and intuitive definitions for several types of degenerate sharing, including false sharing.
Developing Quality through Measuring Usability - The UTUM Test Package
Authors: Jeff Winter, Kari Ronkko, Marten Ahlberg, Mark Hinely, Mats Hellman
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

This paper presents a tool for building quality of use into the software and software process, in the form of a test package for mass market devices. It is developed for measuring user experience, which is seen as a more encompassing term than usability. The test package, which is under constant development, is the result of a long term cooperation between industry and academia, and is in use in industrial development projects. It shows usability through the use of metrics, for efficiency, effectiveness and satisfaction, supported by qualitative judgements made by a test leader/usability expert. It gives a clear demonstration of quality, from the customer and end-user point of view. The case presented here, where the test has been performed concurrently in two countries, has been a quality assurance of the test package, which has been found to work efficiently and flexibly in a complex industrial environment, with complicated relationships between customers, partners and end-users.