ppxscal/embedding_network huggingface dataset:
The many faces of systems research: and how to evaluate them
Authors: Aaron B. Brown, Anupam Chanda, Rik Farrow, Alexandra Fedorova, Petros Maniatis, Michael L. Scott
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

Improper evaluation of systems papers may result in the loss or delay in publication of possibly important research. This paper posits that systems research papers may be evaluated in one or more of the three dimensions of science, engineering and art. Examples of these dimensions are provided, and methods for evaluating papers based on these dimensions are suggested. In the dimension of science, papers can be judged by how well they actually follow the scientific method, and by the inclusion of proofs or statistical measures of the significance of results. In engineering, the applicability and utility of the research in solving real world problems is the main metric. Finally, we argue that art be considered as a paper category evaluated based on elegance, simplicity, and beauty.
Neural Network Control of Coordinated Multiple Manipulator Systems
Authors: Naveen Kumar, Vikas Panwar, N. Sukavanam
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper proposes a neural network (NN) based control scheme for coordinated multiple robot manipulators carrying a common object. Firstly, an integrated dynamic model of the manipulators and the object is derived in terms of object position and orientation as states of the derived model. Based on this model a controller is proposed that achieves the stability in the sense of Lyapunov for the trajectory tracking of the object as well as tracking of the desired internal forces arising in the system. A feedforward neural network is employed to learn the unknown dynamics of robot manipulators and the object. Finally, numerical simulation studies are carried for two three-link planar manipulators moving a circular disc on specified trajectory.
Problems in the provision of courseware for mature employees: an initial exploration
Authors: J. Heywood
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Many businesses in the UK, requiring employees to upgrade their skills, are turning to the use of information communication technology (ICT). The UK government have established a University for Industry (UfI) to take advantage and make use of recent developments in ICT. This paper outlines the principles on which this university will operate. On the basis of prior research and an on-going investigation into the effectiveness of learning through ICT, this paper discusses some of the problems likely to be faced.
Designing and Evaluating Collaborative Processes for Requirements Elicitation and Validation
Authors: Ann Fruhling, Lucas Steinhauser, Gregory Hoff, Christopher Dunbar
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Defining and validating system requirements are one of the most important activities in the development of an information system. It often requires collaboration of multiple stakeholders who have different needs and perspectives. In many cases it is especially challenging to facilitate the gathering of the requirements in an efficient and effective manner in a hierarchical environment and yet encourage system stakeholders to freely share their ideas and opinions. The goal of our research was to implement and evaluate a collaboration engineering process that would facilitate system requirements validation and elicit new requirements from key stakeholders who had disparate needs. We applied several collaboration "thinkLets" in our process and then evaluated their effectiveness. The study focused on a User Alerts/Events Notification system for the US Military at USSTRATCOM. Two sessions were conducted that generated a number of insights on the implementation and transferability of thinkLets as well as lessons learned by novice facilitators.
Spatial frequency response surfaces: an alternative visualization tool for head-related transfer functions (HRTFs)
Authors: C. I. Cheng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents an alternative visualization tool for head-related transfer functions (HRTFs) which represents HRTF data sets as magnitude spatial frequency response surfaces. Qualitative analysis of HRTF data is easier in the spatial domain than in the magnitude frequency domain and allows quick comparisons between different subjects' HRTF sets. In addition, these surfaces exhibit many well-known HRTF-related psychophysical phenomena due to head, torso, and pinna filtering. Finally, these surfaces suggest an interpolation algorithm by which directional transfer functions (DTFs) corresponding to arbitrary spatial locations can be computed from existing DTF measurements at known locations.
Multichannel dynamic range compression for music signals
Authors: J. C. Schmidt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Dynamic range compression reduces the level differences between the high and low intensity portions of an audio signal. Applications include hearing aids and professional audio. Many applications strive for transparent compression, where the output signal is to be as perceptually similar to the original signal as possible. Most compression algorithms are very similar, with variations existing primarily in the implementation details of a common set of parameters. This research effort introduces several fundamentally new approaches to dynamic range compression including a critical band multichannel structure, attack and release rates, a level estimate mode control, and a normalization of the level estimates across the frequency bands. This research effort also applies multidimensional scaling techniques to the analysis of subject testing performed using musical stimuli. This analysis allows us to evaluate the interactions of multiple compression parameters and to formulate a much needed metric pertaining to the degree of compression achieved.
Using dramaturgical methods to gain more dynamic user understanding in user-centered design
Authors: Vesa Kantola, Sauli Tiitta, Katri Mehto, Tomi Kankainen
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

In this paper we introduce the method of dramaturgical reading, which was originally a method of producing different crystallized and associative theatrical and graphical presentations of a role character in a drama context. We transfer dramaturgical reading into the field of user-centered design in order to understand, analyze and represent user-centered material. We compare a persona created with dramaturgical reading to a user profile and persona. We state that adapting a role character as an embodied and concrete user description in user-centered design improves the designers' ability to empathize and understand the users, thus improving the results of the design process. We believe personas must be enabled to "come to life" and allowed to develop in the minds of the designers using them. The dramaturgical method is one way of accomplishing this.
AI Bridges and Dreams
Authors: Alan Bundy
Venue: AI Society (2007)

This paper is a modified version of my acceptance lecture for the 1986 SPL-Insight Award. It turned into something of a personal credo -describing my view of the nature of AI the potential social benefit of applied AI the importance of basic AI research the role of logic and the methodology of rational construction the interplay of applied and basic AI research, and the importance of funding basic AI. These points are knitted together by an analogy between AI and structural engineering: in particular, between building expert systems and building bridges.
Using a transcription graph for large vocabulary continuous speech recognition
Authors: Z. Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A new algorithm is developed for constructing a transcription graph in large vocabulary continuous speech recognition. The transcription graph satisfies lexical constraints and encodes all high scoring phonetic transcriptions. By building a transcription graph in parallel with the word graph, we use high-level knowledge sources to constrain the paths of phonetic transcriptions such that they are created only if needed for building the word graph. This not only speeds up the search of the lexicon, but also limits the memory requirement in our system.
An unrestrictedly parallel scheme for ultra-high-rate reprogrammable Huffman coding
Authors: R. A. Freking
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper proposes a comprehensive method for overcoming the inherently serial nature of variable-length near-entropy coding to obtain unrestrictedly parallel realizations of Huffman compression. A codestream rearrangement technique together with a symbol-stream order-recovery procedure form a concurrent approach capable of exceeding all previously attainable code rate figures. Furthermore, the method is noteworthy for achieving 100% hardware utilization with no code rate overhead while maintaining data output in a traditional streamed format. To further this endeavor, bit-serial encoder and decoder designs that possess compelling speed and area advantages are developed for service as parallel processing elements. However, both are suitable in more general contexts as well. The decoder, in particular, is optimally fast. The encoder and decoder designs are programmable, thus suggesting the appropriateness of the composite approach for a general-purpose ultra-high-speed codec. The benefits for low-power and variable-rate applications are briefly discussed.
Discrete control for safe execution of IT automation workflows
Authors: Yin Wang, Terence Kelly, Stéphane Lafortune
Venue: ACM SIGOPS Operating Systems Review (2007)

As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is notoriously difficult. Although static analysis tools are available, fixing defects remains manual and error-prone. This paper applies discrete control theory to IT automation workflows. Discrete control detects flaws in workflows just as static analysis does, and more importantly it also allows safe execution of flawed workflows by dynamically avoiding run-time failures. Our approach can guarantee compliance with certain requirements and can partially decouple requirements from software, reducing the need to modify the latter if the former change. We have implemented a discrete control module for a real IT automation system. Experiments with workflows from a real production system and with randomly generated workflows show that our approach scales to workflows of practical size.
GBDE: GEOM based disk encryption
Authors: Poul-Henning Kamp
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

The ever increasing mobility of computers has made protection of data on digital storage media an important requirement in a number of applications and situations. GBDE is a strong cryptographic facility for denying unauthorised access to data stored on a "cold" disk for decades and longer. GBDE operates on the disk(-partition) level allowing any type of file system or database to be protected. A significant focus has been put on the practical aspects in order to make it possible to deploy GBDE in the real world.
Integrating COTS Search Engines into Eclipse: Google Desktop Case Study
Authors: Denys Poshyvanyk, Maksym Petrenko, Andrian Marcus
Venue: Proceedings of the Second International Workshop on Incorporating COTS Software into Software Systems: Tools and Techniques (2007)

The paper presents an integration of the Google Desktop Search (GDS) engine into the Eclipse development environment. The resulting tool, namely Google Eclipse Search (GES), provides enhanced searching in Eclipse software projects. The paper advocates for a COTS component-based approach to develop useful and reliable research prototypes, which support various software maintenance tasks. The development effort for such the tools is reduced, while customization and flexibility, to fully support the needs of developers, is maintained. The proposed solution takes advantages of the power of GDS for quick and accurate searching and of Eclipse for great extensibility. The paper outlines our experiences of integrating GDS engine into Eclipse as well as possible extensions and applications of the proposed tool.
On the Problem of Over-clustering in Tuple-based Coordination Systems
Authors: Matteo Casadei, Ronaldo Menezes, Robert Tolksdorf, Mirko Viroli
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

When it comes to communication performance, open distributed tuple-space systems depend heavily on the proximity of tuples to processes. Researchers have proposed many approaches for storing tuples in a way that processes benefit from the organization of tuples. Although some progress has been made, most of the proposed solutions fail to address the reverse problem: if most tuples are kept close to processes, the system's robustness is affected the over-clustering of tuples in particular nodes creates a dependence on that particular node. Hence, we have a dichotomy where it is important to organize tuples in clusters close to processes, but it is equally important to avoid overclustering. This paper presents a self-organized solution to the tuple distribution problem, in which the possibility of over-clustering is considered.
A video compression scheme with optimal bit allocation between displacement vector field and displaced frame difference
Authors: G. M. Schuster
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We address the fundamental problem of optimally splitting a video sequence into two sources of information, the displaced frame difference (DFD) and the displacement vector field (DVF). We first consider the case of a lossless motion compensated video coder (MCVC) and derive a general dynamic programming (DP) formulation which results in an optimal tradeoff between the DVF and the DFD. We then consider the more important case of a lossy MCVC and present an algorithm which solves optimally the bit allocation between the rate and the distortion. This algorithm is based on Lagrangian relaxation and the DP approach introduced for the lossless MCVC. We then present an H.263-based MCVC which uses the proposed optimal bit allocation scheme and compare its results to H.263. As expected, the proposed coder is superior in the rate-distortion sense.
Parallel strategies of occlusion culling on cluster of GPUs: Research Articles
Authors: Hua Xiong, Haoyu Peng, Aihong Qin, Jiaoying Shi
Venue: Computer Animation and Virtual Worlds (2007)

Parallel rendering, visibility culling and level-of-detail are key techniques to improve the rendering performance for large geometric data sets. Although each of these techniques has been researched extensively and some systems have been developed to combine them together. However, parallel occlusion culling, that is distributing the computation of occlusion culling to multiple computing nodes such as a CPUs cluster or a GPUs cluster, has rarely been touched. This is because most existing occlusion culling algorithms are difficult to parallelize or do not scale well when parallelized. We first introduce a novel occlusion culling algorithm that uses the occlusion query functionality provided by current GPU. We employ a visibility prediction technique based on temporal coherence to reduce the times of occlusion query. Furthermore, different strategies of parallelizing the occlusion culling algorithm on a GPUs cluster are proposed including data parallelism strategies and functionality parallelism strategies. Data parallelism strategies decompose the data sets for occlusion query into disjoint parts and map these queries on different cluster nodes for parallel execution while functionality parallelism strategies assemble an occlusion culling pipeline with multiple cluster nodes which outputs image stream steadily. We propose a number of solutions to some special issues on parallelizing this occlusion culling algorithm, such as the transferring of data dependency and the load-balancing of occlusion culling pipeline. Experimental results demonstrate the efficiency of the proposed parallelism strategies of the occlusion culling algorithm based on the visibility predictor. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Task Based Reliability for Large Systems: A Hierarchical Modeling Approach
Authors: Teresa A. Dahlberg, Dharma P. Agrawal
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

An efficient algorithm to compute Task Based Reliability of large multiprocessor systems or Distributed Computer Systems, using hierarchical modeling approach, is introduced. Heterogenous clusters with irregular topologies are handled.
Implementing STV securely in Pret a Voter
Authors: James Heather
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Work on electronic voting systems to date has largely focused around first-past-the-post voting. However, the governments of many countries, and many non-governmental organisations, use a single transferable vote system, in which the voter needs to indicate not just a single preferred candidate but a preference ranking of (some or all of) the candidates on offer. This paper investigates the possibility of modifying Pret a Voter to cope with a single transferable vote system. With its newer form involving re-encryption mixes [8], this seems at first sight to be impossible; with the older version based on RSA onions [2], the obvious approach works, but security is less than ideal; using multiple re-encryption mix onions for each vote, combined with a lazy decryption semantics, however, proves to be an elegant and efficient solution to the problem.
Security Solution For Data Integrity InWireless BioSensor Networks
Authors: Vidya Bharrgavi Balasubramanyn, Geethapriya Thamilarasu, Ramalingam Sridhar
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In body biosensor networks, which may be classified as a specialized type of ad hoc networks, it is necessary to ensure the authenticity and freshness of the vital medical information. In this work, we propose security solutions to identify attacks on data freshness and preserve message integrity in these networks. We use the measurement of permissible round trip time threshold and computationally feasible authentication solution to address the security threats in the network. We have implemented a prototype framework in GloMoSim to assess and evaluate the robustness of our detection mechanism.
Efficient common channel transmission employing multi-beam antenns in W-CDMA forward link
Authors: T. Ihara, K. Higuchi, T. Asai, M. Sawahashi
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper proposes an efficient transmission method for common channels such as the common control physical channel (CCPCH) that utilizes multi-beam antennas instead of the conventional sectored antenna to achieve a harmonized adaptive antenna array beam forming system in the W-CDMA forward link. In the proposed method, by transmitting common channels using multi-beam antennas associated with fixed transmitter antenna weights, the transmission powers of the common channels are dispersed over all the array antennas with which dedicated physical channels (DPCHs) are transmitted by adaptive antenna array beam forming, thereby avoiding unnecessary additional sectored antenna along with power amplifier with large transmission power. The simulation results elucidate that the multi-beam transmission with a conformal array antenna arrangement suppresses the variance in the transmission power of the common channels among the array antennas more than does a linear array antenna arrangement. The results also show that when the conformal array antenna arrangement employing eight antennas is used, the maximum transmission power per antenna is reduced by more than 8.0 dB compared to that using sectored-antenna transmission, and the variance in the transmission powers among array antennas is less than 2.5 dB. We also show that from the viewpoint of the achievable received signal-to-interference power ratio (SIR) and bit error rate (BER) performance of the CCPCH, the proposed common channel transmission using multi-beam antennas is slightly superior to the conventional sectored-antenna transmission.
ProofChecker: an accessible environment for automata theory correctness proofs
Authors: Matthias F. Stallmann, Suzanne P. Balik, Robert D. Rodman, Sina Bahram, Michael C. Grace, Susan D. High
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

ProofChecker is a graphical program based on the notion of formal correctness proofs that allows students, both sighted and visually impaired, to draw a deterministic finite automaton (DFA) and determine whether or not it correctly recognizes a given language. Sighted students use the mouse and graphical controls to draw and manipulate the DFA. Keyboard shortcuts, together with the use of a screen reader to voice the accessible descriptions provided by the program, allow visually impaired students to do the same. Because the states of a DFA partition thelanguage over its alphabet into equivalence classes, each state has a language associated with it. Conditions that describe the language of each state are entered by the student in the form of conditional expressions with function calls and/or regular expressions. A brute-force approach is then used to check that each state's condition correctly describes all of the strings in its language and that none of the strings in a state's language meet the condition for another state. Feedback is provided that either confirms that the DFA correctly meets thegiven conditions or alerts the student to a mismatch between the conditions and the DFA. A student's DFA can be saved in an XML file and submitted for grading. An automated checking tool, known as ProofGrader, can be used to compare a student's DFA with the correct DFA for a given language, thus greatly speeding up the grading of student assignments.
Conversational Knowledge Circulation
Authors: Toyoaki Nishida
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

This paper presents a technology for supporting circulating knowledge in a conversational fashion. The key idea is conversation quantization that allows for representing meaningful conversational segments. Conversation quantization constitutes a basis for capturing, accumulating, and reusing conversational contents. This paper describes the conceptual framework of conversation quantization, and shows techniques for capturing, accumulating, and reusing conversation quanta.