ppxscal/embedding_network huggingface dataset:
The cubic mouse: a new device for three-dimensional input
Authors: Bernd Fröhlich, John Plate
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

We have developed a new input device that allows users to intuitively specify three-dimensional coordinates in graphics applications. The device consists of a cube-shaped box with three perpendicular rods passing through the center and buttons on the top for additional control. The rods represent the X, Y, and Z axes of a given coordinate system. Pushing and pulling the rods specifies constrained motion along the corresponding axes. Embedded within the device is a six degree of freedom tracking sensor, which allows the rods to be continually aligned with a coordinate system located in a virtual world. We have integrated the device into two visualization prototypes for crash engineers and geologists from oil and gas companies. In these systems the Cubic Mouse controls the position and orientation of a virtual model and the rods move three orthogonal cutting or slicing planes through the model. We have evaluated the device with experts from these domains, who were enthusiastic about its ease of use.
A Brokerage Framework for Internet Commerce
Authors: Martin Bichler, Arie Segev
Venue: Distributed and Parallel Databases (1999)

Electronic brokerage is regarded as a core functionality in overcoming many current limitations of Internet commerce. In this paper, we describe current approaches to brokerage services, both, on the Internet and for distributed object systems and analyze how brokerage influences business models for electronic commerce. We then describe OFFER, a project that focuses on advanced models for brokerage on the Internet. We investigate a variety of brokerage services and provide a high-level specification for core components of a generic brokerage service on the Internet. The work should provide a framework to classify existing approaches and a roadmap for further research in this emerging field.
Cycle-accurate energy consumption measurement and analysis: case study of ARM7TDMI
Authors: Naehyuck Chang, Kwanho Kim, Hyung Gyu Lee
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

We introduce an energy consumption analysis of complex digital systems through a case study of ARM7TDMI RISC processor by using a new energy measurement technique. We developed a cycle-accurate energy consumption measurement system based on charge transfer which is robust to spiky noise and is capable of collecting a range of power consumption profiles in real time. The relative energy variation of the RISC core is measured by changing the opcode, the instruction fetch address, the register number, in each pipeline stage, respectively. We demonstrated energy characterization of a pipelined RISC processor for high-level power reduction.
Making the connection: programming with animated small world
Authors: Wanda Dann, Stephen Cooper, Randy Pausch
Venue: Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education (2000)

In learning to program, students must gain an understanding of how their program works. They need to make a connection between what they have written and what the program actually does. Otherwise, students have trouble figuring out what went wrong when things do not work. One factor that contributes to making this connection is an ability to visualize a program's state and how it changes when the program is executed. In this paper, we present Alice, a 3-D interactive animation environment. Alice provides a graphic visualization of a program's state in an animated small world and thereby supports the beginning programmer in learning to construct and debug programs.
Toward a psychophysically-based light reflection model for image synthesis
Authors: Fabio Pellacini, James A. Ferwerda, Donald P. Greenberg
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

In this paper we introduce a new light reflection model for image synthesis based on experimental studies of surface gloss perception. To develop the model, we've conducted two experiments that explore the relationships between the physical parameters used to describe the reflectance properties of glossy surfaces and the perceptual dimensions of glossy appearance. In the first experiment we use multidimensional scaling techniques to reveal the dimensionality of gloss perception for simulated painted surfaces. In the second experiment we use magnitude estimation methods to place metrics on these dimensions that relate changes in apparent gloss to variations in surface reflectance properties. We use the results of these experiments to rewrite the parameters of a physically-based light reflection model in perceptual terms. The result is a new psychophysically-based light reflection model where the dimensions of the model are perceptually meaningful, and variations along the dimensions are perceptually uniform. We demonstrate that the model can facilitate describing surface gloss in graphics rendering applications. This work represents a new methodology for developing light reflection models for image synthesis.
Design and evaluation of a replicated database for mobile systems
Authors: S. Palazzo, A. Puliafito, M. Scarpa
Venue: Wireless Networks (2000)

The new generation mobile systems are anticipated to provide mobile users with new broadband services such as wireless multimedia, including real&dash;time video and high&dash;speed data. In these systems, the requirement on service transparency placed by the handling of mobility, both personal and terminal, implies a remarkable increase in the complexity of data management. Therefore, appropriate distributed databases &lpar;DDB&rpar; must be designed to guarantee speed in the processing and updating of user information, and a high level of reliability and performance. In this paper we analyze a minimally replicated DDB in which different strategies for the redundancy of user data are discussed. First, we develop a Petri net based model in order to analyze the consequences on dependability deriving from faults in nodes at different levels in the DDB structure. Then, we investigate the performance offered by the system through a queueing network model. The measures of interest include reliability, availability, mean time to failure, and mean response time to service access.
Rewriting Histories: Recovering from Malicious Transactions
Authors: Peng Liu, Paul Ammann, Sushil Jajodia
Venue: Distributed and Parallel Databases (2000)

We consider recovery from malicious but committed transactions. Traditional recovery mechanisms do not address this problem, except for complete rollbacks, which undo the work of good transactions as well as malicious ones, and compensating transactions, whose utility depends on application semantics. We develop an algorithm that rewrites execution histories for the purpose of backing out malicious transactions. Good transactions that are affected, directly or indirectly, by malicious transactions complicate the process of backing out undesirable transactions. We show that the prefix of a rewritten history produced by the algorithm serializes exactly the set of unaffected good transactions. The suffix of the rewritten history includes special state information to describe affected good transactions as well as malicious transactions. We describe techniques that can extract additional good transactions from this latter part of a rewritten history. The latter processing saves more good transactions than is possible with a dependency-graph based approach to recovery.
Whisper: a wristwatch style wearable handset
Authors: Masaaki Fukumoto, Yoshinobu Tonomura
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Whisper is a new wrist-worn handset, which is used by inserting the fingertip into the ear canal. A received signal is conveyed from a wrist-mounted actuator to the ear canal via the hand and a finger by bone conduction. The users voice is captured by a microphone mounted on the inside of the wrist. All components of Whisper can be mounted on the wrist, and usability does not de- crease if the size of components is miniaturized. So, both wearability and usability can be achieved together. The way Whisper is operated is similar to that of an ordinary telephone handset. Thus, onlookers may not look upon Whispers operation as talking to oneself, even if the associated PDA is controlled by voice commands. Whis- per is especially effective in a noisy environment. Signals received via bone conduction can be heard clearly in the presence of noise without raising the volume (-12 dB at noise = 90 dB(A) in comparison to cellular phone hand- set). Whisper is also effective in avoiding the annoying problem of the users voice being raised in a noisy situa- tion. Feedback of the users utterance is boosted by bone conduction when covering the ear canal with a fingertip, then the users voice does not need to raised in the pres- ence of noise (-6 dB at noise = 90 dB(A) in comparison to cellular phone handset). Whisper is useful as a voice interface for a wrist-worn PDA and cellular phone.
Design and Implementation of a Low Complexity VLSITurbo-Code Decoder Architecture for LowEnergy Mobile Wireless Communications
Authors: Sangjin Hong, Wayne E. Stark
Venue: Journal of VLSI Signal Processing Systems (2000)

Channel coding is commonly incorporated to obtain sufficient reception quality in wireless mobile communications transceiver to counter channel degradation due to intersymbol interference, multipath dispersion, and thermal noise induced by electronic circuit devices. For low energy mobile wireless communications, it is highly desirable to incorporate a decoder which has a very low power consumption while achieving a high coding gain. In this paper, a sub-optimal low-complexity multi-stage pipeline decoder architecture for a powerful channel coding technique known as &ldquo;turbo-code&rdquo; is presented. The presented architecture avoids complex operations such as exponent and logarithmic computations. The turbo-code decoding algorithm is reformulated for an efficient VLSI implementation. Furthermore, the communication channel statistic estimation process has been completely eliminated. The architecture has been designed and implemented with the 0.6 &mu;m CMOS standard cell technology using Epoch computer aided design tool. The performance and the circuit complexity of the turbo-code decoder are evaluated and compared with the other types of well-known decoders. The power consumption of the low-complexity turbo-code decoder is comparable to that of the conventional convolutional-code decoder. However, the low-complexity turbo-code decoder has a significant coding gain over the conventional convolutional-code decoders and it is well suited for very low power applications.
Knowledge production from different worlds: what can happen when technical writers speak for engineers
Authors: Bernadette Longo
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1998)

At the turn of the 20th century, technical writers in the United States were mostly engineers who both developed technology and wrote about it. During World War II, however, some engineers seeking to increase the efficiency of technology development separated their engineering from their communication tasks. This trend opened up a new occupation for non-engineering technical writers who communicated knowledge made by engineers. While this specialization may have allowed engineers to develop technology more efficiently, it also allowed non-scientists to give voice to scientific knowledge and by the 1970s created tensions between practitioners in scientific fields and liberal arts-trained technical writers. How could non-scientists give scientific knowledge its material form through communication? And did this arrangement between engineers and writers too often render engineers mute within their own professions? This paper traces a cultural history of technical writing practice in the United States and explores current trends in the academy which aim to prepare engineers more adequately for communicating about their work. Finally, this paper suggests that technical editors, as distinguished from traditional technical writers, can accommodate both an engineer's need to give voice to technology developments and a writer's contributions to shaping that voice into effective communication.
Java for network management applications
Authors: N. J. Muller
Venue: International Journal of Network Management (1998)

Java preserves much of C&plus;&plus;, and offers compelling benefits: it is object-oriented, portable and relatively easy to master and maintain. These, and other benefits, can greatly speed the development cycle for Web-based network management applications. This article discusses these issues, and gives an overview of Java&rsquo;s relevance for network managers. &copy; 1998 John Wiley & Sons, Ltd.
Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
Authors: Michael Ulbrich, Stefan Ulbrich, Matthias Heinkenschloss
Venue: SIAM Journal on Control and Optimization (1999)

A class of interior-point trust-region algorithms for infinite-dimensional nonlinear optimization subject to pointwise bounds in L p-Banach spaces, $2\le p\le\infty$, is formulated and analyzed. The problem formulation is motivated by optimal control problems with L p-controls and pointwise control constraints. The interior-point trust-region algorithms are generalizations of those recently introduced by Coleman and Li [SIAM J. Optim., 6 (1996), pp. 418--445] for finite-dimensional problems. Many of the generalizations derived in this paper are also important in the finite-dimensional context. All first- and second-order global convergence results known for trust-region methods in the finite-dimensional setting are extended to the infinite-dimensional framework of this paper.
An Optimal Value-Based Admission Policy and its ReflectiveUse in Real-Time Systems
Authors: Andrea Bondavalli, Felicita Di Giandomenico, Ivan Mura
Venue: Real-Time Systems (1999)

This paper deals with planning system activities to support applications that have different contrasting requirements including timing constraints on tasks execution and correctness requirements. Our approach is based on a simple yet effective formulation of a value structure associated to the application tasks. Values are associated to each relevant outcome thus accounting for successful executions as well as for those which violate the application requirements. Moreover we assume degradable real time systems equipped with several execution techniques characterised by different execution costs and different levels of fulfilment of requirements (and associated reward). We propose an admission algorithm to select the part of the offered load to be executed, should overload occur. For all the admitted tasks the algorithm selects also the most suitable execution technique (among those available) to optimise the expected cumulated reward. We show that the algorithm provides the best solution to the optimisation problem resorting to the linear programming theory. Then we discuss the applicability of this result to systems operating in dynamic environments. A planner component is defined, responsible to collect information on the current status of the system and of its environment. The planner decides when a new &rsquo;plan&lsquo; is required, and dynamically executes the admission algorithm to properly tune the usage of system resources.
Computer personnel research: what have we learned in this decade?
Authors: Fred Niederman, Jo Ellen Moore
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

This paper presents the results of quantitative and qualitative analysis of the prior 9 years of SIGCPR proceedings. The purpose is to accumulate results of prior investigations and identify areas requiring further study.
The Broadcast Comparison Model for On-Line Fault Diagnosis in Multicomputer Systems: Theory and Implementation
Authors: Douglas M. Blough, Hongying W. Brown
Venue: IEEE Transactions on Computers (1999)

This paper describes a new comparison-based model for distributed fault diagnosis in multicomputer systems with a weak reliable broadcast capability. The classical problems of diagnosability and diagnosis are both considered under this broadcast comparison model. A characterization of diagnosable systems is given, which leads to a polynomial-time diagnosability algorithm. A polynomial-time diagnosis algorithm for $t$-diagnosable systems is also given. A variation of this algorithm, which allows dynamic fault occurrence and incomplete diagnostic information, has been implemented in the COmmon Spaceborne Multicomputer Operating System (COSMOS). Results produced using a simulator for the JPL MAX multicomputer system running COSMOS show that the algorithm diagnoses all fault situations with low latency and very little overhead. These simulations demonstrate the practicality of the proposed diagnosis model and algorithm for multicomputer systems having weak reliable broadcast. This includes systems with fault-tolerant hardware for broadcast, as well as those where reliable broadcast is implemented in software.
Interprocessor communication with memory constraints
Authors: Ali Pinar, Bruce Hendrickson
Venue: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (2000)

Many parallel applications require periodic redistribution of workloads and associated data. In a distributed memory computer, this redistribution can be difficult if limited memory is available for receiving messages. We propose a model for optimizing the exchange of messages under such circumstances which we call the minimum phase remapping problem. We first show that the problem is NP-Complete, and then analyze several methodologies for addressing it. First, we show how the problem can be phrased as an instance of multi-commodity flow. Next, we study a continuous approximation to the problem. We show that this continuous approximation has a solution which requires at most two more phases than the optimal discrete solution, but the question of how to consistently obtain a good discrete solution from the continuous problem remains open. Finally, we devise a simple and practical approximation algorithm for the problem with a bound of 1.5 times the optimal number of phases.
A compression algorithm for DNA sequences and its applications in genome comparison
Authors: Xin Chen, Sam Kwong, Ming Li
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

We present a lossless compression algorithm, Gen-Compress, for DNA sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for benchmark DNA sequences, comparing to other DNA compression programs [3, 7]. Significantly better compression results show that the approximate repeats are one of the main hidden regularities in DNA sequences. We then describe a theory of measuring the relatedness between two DNA sequences. We propose to use d(x, y) = 1 &mdash; K(x) - K(x|y)/K(xy to measure the distance of any two sequences, where K stands for Kolmogorov complexity [5]. Here, K(x) - K(x|y) is the mutual information shared by x and y. But mutual information is not a distance, there is no triangle inequality. The distance d(x, y) is symmetric. It also satisfies the triangle inequality, and furthermore, it is universal [4]. It has not escaped our notice that the distance measure we have postulated can be immediately used to construct evolutionary trees from DNA sequences, especially those that cannot be aligned, such as complete genomes. With more and more genomes sequenced, constructing trees from genomes becomes possible [1, 2, 6, 8]. Kolmogorov complexity is not computable. We use GenCompress to approximate it. We present strong experimental support for this theory, and demonstrate its applicability by correctly constructing a 16S (18S) rRNA tree, and a whole genome tree for several species of bacteria. Larger scale experiments are underway at the University of Waterloo, with very promising results.
Second Logarithmic Derivative of a Complex Matrix in the Chebyshev Norm
Authors: L. Kohaupt
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

The second logarithmic derivative $\mu^{(2)}_{\infty}[A]$ of a complex n x n matrix A in the Chebyshev norm is defined as the second right derivative of $\| \Phi(t) \|_{\infty} \,=\, \| e^{A t} \|_{\infty}$ at $t=0$, where $\| \cdot \|_{\infty}$ denotes the operator norm corresponding to the norm $\| \cdot \|_{\infty}$ in $\CC^n$. The obtained formula is illustrated by a numerical example. The result may be of interest in applications such as stability theory.
Enhanced code compression for embedded RISC processors
Authors: Keith D. Cooper, Nathaniel McIntosh
Venue: ACM SIGPLAN Notices (1999)

This paper explores compiler techniques for reducing the memory needed to load and run program executables. In embedded systems, where economic incentives to reduce both RAM and ROM are strong, the size of compiled code is increasingly important. Similarly, in mobile and network computing, the need to transmit an executable before running it places a premium on code size. Our work focuses on reducing the size of a program's code segment, using pattern-matching techniques to identify and coalesce together repeated instruction sequences. In contrast to other methods, our framework preserves the ability to run program executables directly, without an intervening decompression stage. Our compression framework is integrated into an industrial-strength optimizing compiler, which allows us to explore the interaction between code compression and classical code optimization techniques, and requires that we contend with the difficulties of compressing previously optimized code. The specific contributions in this paper include a comprehensive experimental evaluation of code compression for a RISC-like architecture, a more powerful pattern-matching scheme for improved identification of repeated code fragments, and a new form of profile-driven code compression that reduces the speed penalty arising from compression.
Unmixed and prime decomposition of radicals of polynomial ideals
Authors: Dongming Wang
Venue: ACM SIGSAM Bulletin (1998)

A method is presented for decomposing the radical of any finitely generated polynomial ideal into unmixed radical ideals or prime ideals. It proceeds by first computing simple systems of irreducible triangular systems using algorithms based on subresultant regular subchains and then computing the generating sets for the unmixed or prime ideals from the corresponding triangular sets using ideal saturation. The method method has been implemented in Maple V.
Network planning with a performance-prediction tool
Authors: Stephen D. Post
Venue: International Journal of Network Management (1999)

A new type of tool facilitates network engineering by combining the speed and practicality of mathematical analysis with a graphic user interface that is customized for network modeling. Copyright &copy; 1999 John Wiley Sons, Ltd.
Integrated services architecture: the next-generation internet
Authors: William Haj Stallings
Venue: International Journal of Network Management (1999)

The integrated services architecture is a response to the growing variety and volume of traffic experienced in the Internet and intranets. It provides a framework for the development of protocols such as RSVP and RTP, to handle multimedia&sol;multicast traffic and provides guidance to router vendors on the development of efficient techniques for handling a varied load. ISA is already influencing router and Internet design, and will have a greater impact over the next few years. Copyright &copy; 1999 John Wiley Sons, Ltd.