ppxscal/embedding_network huggingface dataset:
Gait phase effects in mobile interaction
Authors: Andrew Crossan, Roderick Murray-Smith, Stephen Brewster, James Kelly, Bojan Musizza
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

One problem evaluating mobile and wearable devices is that they are used in mobile settings, making it hard to collect usability data. We present a study of tap-based selection of on-screen targets whilst walking and sitting, using a PocketPC instrumented with an accelerometer to collect information about user activity at the time of each tap. From these data the user's gait can be derived, and this is then used to investigate preferred tapping behaviour relative to gait phase, and associated tap accuracy. Results showed that users were more accurate sitting than walking. When walking there were phase regions with significantly increased tap likelihood, and these regions had significantly lower error rates, and lower error variability. This work represents an example of accelerometer-instrumented mobile usability analysis, and the results give a quantitative understanding of the detailed interactions taking place when on the move, allowing us to develop better mobile interfaces.
Essential covers of the cube by hyperplanes
Authors: Nathan Linial, Jaikumar Radhakrishnan
Venue: Journal of Combinatorial Theory Series A (2005)

A set L of linear polynomials in variables X1, X2,...,Xn with real coefficients is said to be an essential cover of the cube {0, 1}x if (E1) for each v ∈ {0, 1}n, there is a p ∈ L such that p(v) = 0; (E2) no proper subset of L satisfies (E1), that is, for every p ∈ L, there is a v ∈ {0, 1}n such that p alone takes the value 0 on v; (E3) every variable appears (in some monomial with non-zero coefficient) in some polynomial of L. Let e(n) be the size of the smallest essential cover of {0, 1}n. In the present note we show that ½(√4n+1 + 1) ≤ e(n) ≤ ⌈n/2⌉ + 1.
User interfaces for interactive control of physics-based 3D characters
Authors: Peng Zhao, Michiel van de Panne
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

We present two user interfaces for the interactive control of dynamically-simulated characters. The first interface uses an 'action palette' and targets sports prototyping applications. When used online, the user selects from a palette of actions (e.g., stand, pike, extend) during an ongoing simulation. Actions are defined in terms of a set of target joint angles for PD controllers or as feedback-based balance controllers. When used offline, the timing of the key motion events can be adjusted manually or optimized automatically to produce desired outcomes. We demonstrate the action palette interface with simulations of platform diving, freestyle aerial ski jumps, and half-pipe snowboarding. The second interface explores the feasibility of using a game-pad to control a 13-link rigid body simulation of snowboarding for game applications. Unlike traditional video game play, the stunts accessible through our interface need not be preconceived by the game author and can emerge as the product of the physics, the terrain, and the player skill. We describe the control mapping and provide a mechanism to simplify balance control. We demonstrate the system using numerous snowboarding stunts.
Object-oriented programming in peer-to-peer systems: Research Articles
Authors: Patrick Th. Eugster, Sebastien Baehni
Venue: Concurrency and Computation: Practice Experience (2005)

Leveraged by the success of applications aiming at the &lsquo;free&rsquo; sharing of data in the Internet, the paradigm of peer-to-peer (P2P) computing has had substantial consideration devoted to it recently. This paper presents a high-level abstraction for remote object interaction in a P2P environment, called borrow&sol;lend (BL). We present the principles underlying our BL abstraction, and illustrate how this abstraction can be used to program P2P applications in Java. We contrast our abstraction with established abstractions for distributed programming such as the remote method invocation or the tuple space, illustrating how the BL abstraction, obviously influenced by such previous abstractions, unifies flavors of these, but also how it captures the constraints specific to P2P environments. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The Data Compression Theorem for Ergodic Quantum Information Sources
Authors: Igor Bjelaković, Arleta Szkola
Venue: Quantum Information Processing (2005)

We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically optimal compression scheme which is based on the concept of high probability subspaces. The rate of this compression scheme is equal to the von Neumann entropy rate.
Smart debugging software architectural design in SDL
Authors: W. Eric Wong, Tatiana Sugeta, Yu Qi, Jose C. Maldonado
Venue: Journal of Systems and Software (2005)

Statistical data show that it is much cheaper to fix software bugs at the early design stage than the late stage of the development process where the final system has already been implemented and integrated together. The use of slicing and execution histories as an aid in software debugging is well established for programming languages like C and C++; however, it is rarely applied in the field of software specification for designs. We propose a solution by applying the technology at source code level to debugging software designs represented in a high-level specification and description language such as SDL. More specifically, we extend execution slice-based heuristics from source code-based debugging to the software design specification level. Suspicious locations in an SDL specification are prioritized based on their likelihood of containing faults. Locations with a higher priority should be examined first rather than those with a lower priority as the former are more suspicious than the latter, i.e., more likely to contain the faults. A debugging tool, SmartDSDL, with user-friendly interfaces was developed to support our method. An experiment is reported to demonstrate the feasibility of using our method to effectively debug an architectural design.
An embedded domain-specific language for type-safe server-side web scripting
Authors: Peter Thiemann
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

WASH/CGI is an embedded domain-specific language for server-side Web scripting. Due to its reliance on the strongly typed, purely functional programming language Haskell as a host language, it is highly flexible and---at the same time---it provides extensive guarantees due to its pervasive use of type information.WASH/CGI can be structured into a number of sublanguages addressing different aspects of the application. The document sublanguage provides tools for the generation of parameterized XHTML documents and forms. Its typing guarantees that almost all generated documents are valid XHTML documents. The session sublanguage provides a session abstraction with a transparent notion of session state and allows the composition of documents and Web forms to entire interactive scripts. Both are integrated with the widget sublanguage which describes the communication (parameter passing) between client and server. It imposes a simple type discipline on the parameters that guarantees that forms posted by the client are always understood by the server. That is, the server never asks for data not submitted by the client and the data submitted by the client has the type requested by the server. In addition, parameters are received in their typed internal representation, not as strings. Finally, the persistence sublanguage deals with managing shared state on the server side as well as individual state on the client side. It presents shared state as an abstract data type, where the script can control whether it wants to observe mutations due to concurrently executing scripts. It guarantees that states from different interaction threads cannot be confused.
Generalized net model of a program system for composing verses
Authors: Dilyana Budakova, Lyudmil Dakovski
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The article reviews a generalized net model of a program system for constructing verbal expressions and especially for composing verses. The process is decomposed in four subsequent stages of transforming an emotionally evaluated input set of key notions into corresponding, by sense and evaluations, grammatically proper couplets of a poem. For modeling the knowledge of internal tokens are defined. An example tracing the operation of model is described.
Phylogenetics in the bioinformatics culture of understanding: Reviews
Authors: Robin G. Allaby, Mathew Woodwark
Venue: Comparative and Functional Genomics (2004)

Bioinformatics, as a relatively young discipline, has grown up in a world of high-throughput large volume data that requires automatic analysis to enable us to stay on top of it all. As a response, the bioinformatics discipline has developed strategies to find patterns in a &lsquo;low signal : noise ratio&rsquo; environment. While the need to process large amounts of information and extract hypotheses is both laudable and inescapable, the pressures that such requirements have introduced can lead to short cuts and misapprehensions. This is particularly the case with reference to assumptions about the underlying evolutionary theories that are implicitly invoked by the algorithms utilised in the analysis pipelines. The classic example is the misuse of the term &lsquo;homologous&rsquo; to mean &lsquo;similar&rsquo; or even &lsquo;functionally similar&rsquo;, rather than the correct definition of &lsquo;having the same evolutionary origin&rsquo;, which may or may not imply similarity of function. In this review, we outline some of the common phylogenetic questions from a bioinformatics perspective that can be better addressed with a deeper understanding of evolutionary principles and show, with examples from the amidohydrolase and Toll families, that quite different conclusions can be drawn if such approaches are taken. This review focuses on the importance of the underlying evolutionary biology, rather than assessing the merits of different phylogenetic techniques. The relative merits of a priori and a posteriori inclusion of biological information are discussed. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A Family of Discontinuous Galerkin Finite Elements for the Reissner--Mindlin Plate
Authors: Douglas N. Arnold, Franco Brezzi, L. Donatella Marini
Venue: Journal of Scientific Computing (2005)

We develop a family of locking-free elements for the Reissner--Mindlin plate using Discontinuous Galerkin (DG) techniques, one for each odd degree, and prove optimal error estimates. A second family uses conforming elements for the rotations and nonconforming elements for the transverse displacement, generalizing the element of Arnold and Falk to higher degree.
Interview with Bill Kinder: January 13, 2005
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2005)

Bill Kinder is the Director of Editorial and Postproduction at the Pixar Animation Studios. He is also the DVD Producer for Pixar movies, including the Academy award-winning films "The Incredibles (2004)" and "Finding Nemo (2003)," which earned the honor of being the fastest selling DVD and video of all time. Prior to joining Pixar in 1996, Bill was the Director of Facilities at American Zoetrope in San Francisco. There he coordinated sound and picture post production on numerous feature films (including "Jack," "Mi Familia," and "Theremin: An Electronic Odyssey"), introduced innovations in Francis Coppola's Electronic Storyboard Department, and oversaw the film-to-tape transfers of dailies. He has also directed an Emmy-nominated documentary, produced television news, and edited commercials. Bill studied film, sound, and photography at Brown University, Rhode Island School of Design, and the University of East Anglia.
Anomaly subspace detection based on a multi-scale Markov random field model
Authors: Arnon Goldman, Israel Cohen
Venue: Signal Processing (2005)

In this paper we introduce a multi-scale Gaussian Markov random field (GMRF) model and a corresponding anomaly subspace detection algorithm. Natural clutter images, often appear to have several periodical patterns of various period lengths. In such cases, the GMRF model may not sufficiently describe the clutter image. The proposed model is based on a multi-scale wavelet representation of the image, independent component analysis, and modeling each independent component as a GMRF. Anomaly detection is subsequently carried out by applying a matched subspace detector to the innovations process generated by the presumed model. The robustness of the proposed approach is demonstrated with application to automatic target detection in synthetic and real imagery. A quantitative performance analysis and experimental results demonstrate the advantage of the proposed method in comparison to competing methods.
Effective parametric control laws for market economy mechanisms
Authors: A. A. Ashimov, As. A. Ashimov, Yu. V. Borovskii, O. P. Volobyeva
Venue: Automation and Remote Control (2005)

Parametric control for market economy mechanisms is studied under the assumption that effective algorithms are chosen from separate extremal problems.
Heuristic-Based Architecture Generation for Complex Computer System Optimisation
Authors: Cameron Maxwell, Artem Parakhine, John Leaney, Tim O'Neill, Mark Denford
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Having come of age in the last decade, the use of architecture to describe complex systems, especially in software, is now maturing. With our current ability to describe, represent, analyse and evaluate architectures comes the next logical step in our application of architecture to system design and optimisation. Driven by the increasing scale and complexity of modern systems, the designers have been forced to find new ways of managing the difficult and complex task of balancing the quality trade-offs inherent in all architectures. Architecture-based optimisation has the potential to not only provide designers with a practical method for approaching this task, but also to provide a generic mechanism for increasing the overall quality of system design. In this paper we explore the issues that surround the development of architectural optimisation and present an example of heuristic-based optimisation of a system with respect to concrete goals.
Dynamic process programming for a robotic manipulator based on hopfield NN monotonous optimization searching
Authors: Zhongwei Yu, Huitang Chen, Peng-Yung Woo
Venue: Journal of Robotic Systems (2004)

A new approach to programming the optimal dynamic process for an n-joint rigid robotic manipulator with the use of the monotonous optimization searching ability of a Hopfield NN is presented. By combining robotic dynamics, this paper designs a programmed controller, which satisfies the aforementioned dynamic process. The convergence of the programmed controller is investigated. Simulations and experiments demonstrate the effectiveness of the scheme described. &copy; 2004 Wiley Periodicals, Inc.
Synchronizable Compact CMOS Oscillator
Authors: G. Villar, E. Alarcón, E. Vidal, J. Cosp, J. Madrenas
Venue: Analog Integrated Circuits and Signal Processing (2005)

This letter describes the design and implementation of a synchronizable compact CMOS oscillator. By using a fully differential topology, a reduction in area occupancy together with an improved robustness in front of on-chip interferences is achieved. Post-layout simulation results and experimental results for a standard CMOS 0.35 ¿ m technology are presented to validate the functionality of the tunable oscillator.
Validation of Torso Force Feedback Slope Simulation through an Energy Cost Comparison
Authors: Craig R. Parker, David R. Carrier, John M. Hollerbach
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper compares the energy cost of locomotion on a real slope and on a simulated slope using a tether force on the Sarcos Treadport. Walking and running both up and down slopes are investigated. Horizontal tether forces were based on f = Kmgsin(¿) to simulate the slope ¿. For uphill walking and running, average values of K were determined to be 0.84 and 0.78. For downhill walking and running, average values of K were determined to be 0.72 and 0.66. These values of K reinforce previous findings from psychological and biomechanical studies that found K equal to an average of 0.65.
Reversible logic for supercomputing
Authors: Erik P. DeBenedictis
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

This paper is about making reversible logic a reality for supercomputing. Reversible logic offers a way to exceed certain basic limits on the performance of computers, yet a powerful case will have to be made to justify its substantial development expense. This paper explores the limits of current, irreversible logic for supercomputers, thus forming a threshold above which reversible logic is the only solution. Problems above this threshold are discussed, with the science and mitigation of global warming being discussed in detail. To further develop the idea of using reversible logic in supercomputing, a design for a 1 Zettaflops supercomputer as required for addressing global climate warming is presented. However, to create such a design requires deviations from the mainstream of both the software for climate simulation and research directions of reversible logic. These deviations provide direction on how to make reversible logic practical
MITRE-Bedford: description of the ALEMBIC system as used for MUC-4
Authors: John Aberdeen, John Burger, Dennis Connolly, Susan Roberts, Marc Vilain
Venue: Proceedings of the 4th conference on Message understanding (1992)

The ALEMBIC text understanding system fielded at MUC-4 by MITRE-Bedford is primarily based on natural language techniques. ALEMBIC is a research prototype that is intended to explore several major areas of investigation:&bull; Error recovery, involving primarily issues of semi-parsing and recovery of plausible attachments.&bull; Robustness, involving primarily issues of uncertain reasoning and tractable inference.&bull; Self-extensibility, focusing primarily on machine learning of natural language and user-configurable semantics.&bull; System integration, through SGML (the Standard Generalized Markup Language), both at the level of meaning analysis and at the overall application level.
Scalable, Reliable Marshalling and Organization of Distributed Large Scale Data Onto Enterprise Storage Environments
Authors: Joesph JaJa, Mike Smorul, Fritz McCall, Yang Wang
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Emerging technologies in high speed NAS, hierarchical storage management systems, and networked systems that virtualize interconnected storage over IP and fiber-channel networks, promise to consolidate distributed data stores onto large-scale professionally managed enterprise storage environments. We describe the software architecture of the PAWN (Producer - Archive Workflow Network) environment that enables scalable, reliablemarshalling and organization of distributed data into such enterprise storage environments. PAWN was initially developed to capture the core elements required for long term preservation of digital objects as identified by researchers in the digital library and archiving communities. In this paper, we show how PAWN can be extended to enable multiple clients at a number of distributed sites to prepare, organize, and bulk transfer large scale data onto clusters ofservers that securely verify the integrity of the data, register the metadata, and store the data into an enterprise storage environment. PAWN allows detailed description, auditing, and organization of the data, and hence will allow for efficient management, access, and disaster recovery. The basic software components are based on open standards and web technologies, and hence are platform independent.
High Fidelity Multi Finger Haptic Display
Authors: Rainer Leuschke, Elizabeth K. T. Kurihara, Jesse Dosher, Blake Hannaford
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The Fingertip Haptic Display (FHD) is a five bar mechanism developed at the University of Washington for haptic interaction with the fingertip of the operator. Thetwo-degree-of-freedom mechanism was computer optimized to accommodate the workspace of the human finger in flexion/extension with a high degree of kinematic isotropy. Direct drive with frictionless flat-coil actuators ensures low torque ripple, inertia, and static friction in the actuation system for highfidelity haptic rendering. This paper describes a redesign of the position sensing arrangement, I/O hardware and software as well as thermal modelling to improve performance and stack four devices for use with index, middle, ring and little finger in a multifinger haptic display. Some results of the initial performance evaluation are given. Promising applications are expected to include palpation training for medical personnel, museum displays enabling the visitor to "touch" art, as well as psychophysics research: exploring the limits of human touch perception.
Computer aided plant layout design
Authors: F. Ciaffi
Venue: ACM SIGDA Newsletter (1975)

Plant layout is of fundamental importance for the arrangement and allocation of internal plant-areas an essential and frequent operation for large industrial installations.
Validation methods for calibrating software effort models
Authors: Tim Menzies, Dan Port, Zhihao Chen, Jairus Hihn, Sherry Stukes
Venue: Proceedings of the 27th international conference on Software engineering (2005)

COCONUT calibrates effort estimation models using an ex-haustive search over the space of calibration parameters in a COCOMO I model. This technique is much simpler than other effort estimation method yet yields PRED levels com-parable to those other methods. Also, it does so with less project data and fewer attributes (no scale factors). How-ever, a comparison between COCONUT and other methods is complicated by differences in the experimental methods used for effort estimation. A review of those experimental methods concludes that software effort estimation models should be calibrated to local data using incremental hold-out (not jack knife) studies, combined with randomization and hypothesis testing, repeated a statistically significant number of times.
Tutoring tool for logical schemes design
Authors: Vladimir Mateev, Plamen Manoilov, Mihail Iliev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Tutoring tool for logical schemes design with a Graphical User Interface having been a part of an intelligent environment for analysis and synthesis of Boolean functions is presented in this paper. The tool affords an opportunity of drawing logical schemes in a defined basis. It determines and if the user desires brings out the truth table of the synthesised structured scheme. It offers a list of Boolean functions for structured synthesis, formed like a number of tasks which the user can choose. The tool has a possibility to estimate the rightness of the drawing scheme and can save it as a file. It is designed to help the students giving them a way to practice and improve their skills in the area of logical schemes design. It can be used for testing or self-learning. Java programming language has been used. That allows to create it as an applet and to incorporate it in a Web document or as a stand-alone application. Thus this tool can find a large area of its application in the virtual universities, distance education and e learning.