ppxscal/embedding_network huggingface dataset:
Natural language in computer human-interaction: a CHI 99 special interest group
Authors: Nancy Green, David Novick
Venue: ACM SIGCHI Bulletin (2000)

Fifty-three people from accross the world participated in the CHI 99 special interest group on Natural Language in Computer Human-Interaction. The SIG's main goal was to provide an opportunity for CHI 99 attendees from two research communities, natural language processing (NLP) and human-computer interaction (CHI), to discuss issues of mutual interest. The SIG embraced natural-language interfaces of all kinds, inlcuding text, spoken and multi-modal interaction. This report inlcudes the results of e-mail discussions following up on the SIG itself.
A methodological approach towards the design of a highly innovative wheelchair with enhanced safety, manoeuverability and comfort
Authors: G. Papaioannou, A. Nanipoulos, E. Bekiaris, A. Spaepen
Venue: Technology and Health Care (1999)

This paper presents the methodological framework for the development of an innovative wheelchair able to solve the problem of use within all transportation modes (car, bus, train, ship, aeroplane). This task calls for a multi-step integrated methodology in order to gather and reconciliate conflicting user needs and requirements regarding safety, manoeuvrability and comfort. The paper describes also the methodology adopted for the system architecture of a modular design wheelchair as well as for its evaluation, ranging from crash tests (both simulations and real tests) to vibration and comfort studies. The work stems from the research conducted in the TRANSWHEEL project (DE 3013), partly financed by the European Unions DE/TAP programme.
A Time-Reversible Variable-Stepsize Integrator for Constrained Dynamics
Authors: Eric Barth, Benedict Leimkuhler, Sebastian Reich
Venue: SIAM Journal on Scientific Computing (1999)

This article considers the design and implementation of variable-timestep methods for simulating holonomically constrained mechanical systems. Symplectic variable stepsizes are briefly discussed, and we consider time-reparameterization techniques employing a time-reversible (symmetric) integration method to solve the equations of motion. We give several numerical examples, including a simulation of an elastic (inextensible, unshearable) rod undergoing large deformations and collisions with the sides of a bounding box. Numerical experiments indicate that adaptive stepping can significantly smooth the numerical energy and improve the overall efficiency of the simulation.
FotoFile: a consumer multimedia organization and retrieval system
Authors: Allan Kuchinsky, Celine Pering, Michael L. Creech, Dennis Freeze, Bill Serra, Jacek Gwizdka
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

FotoFile is an experimental system for multimedia organization and retrieval, based upon the design goal of making multimedia content accessible to non-expert users. Search and retrieval are done in terms that are natural to the task. The system blends human and automatic annotation methods. It extends textual search, browsing, and retrieval technologies to support multimedia data types.
Locality of order-invariant first-order formulas
Authors: Martin Grohe, Thomas Schwentick
Venue: ACM Transactions on Computational Logic (TOCL) (2000)

A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.
The most important technical library in the world
Authors: Bruce Greer
Venue: ACM SIGPLAN Fortran Forum (1998)

Intel provides several libraries known as the Performance Library Suite to address several computational areas: signal processing, image processing, speech and character recognition and linear algebra. This latter library is known as the Math Kernel Library, or MKL.In this paper we discuss the methods we use to achieve high performance on the current version. These methods revolve primarily around the management of memory and minimization of branch costs. Memory management involves compensating for the mismatch in main memory performance compared to the processor consumption rate, latency hiding, cache management and TLB management.We also discuss the SMP capabilities and the performance thereof.We discuss the direction the library will be taking including additions that will be made to the offerings: multithreaded LAPACK, cblas interface, and a powerful graphical DLL builder to create custom libraries no larger than the end user requires. Finally we will point out that using libraries such as MKL permits the user to profit from the architectural advances in new processors even if the tools, especially compilers, may not be able to fully exploit the features. There will be versions of MKL which exploit features of the recently announced Katmai processor, and the library will be fully developed for the Merced processor when it is introduced.
Linear QR Architecture for a Single Chip Adaptive Beamformer
Authors: G. Lightbody, R. Walke, R. Woods, J. McCanny
Venue: Journal of VLSI Signal Processing Systems (2000)

This paper presents the design of a novel single chip adaptive beamformer capable of performing 50 Gflops, (Giga-floating-point operations/second). The core processor is a QR array implemented on a fully efficient linear systolic architecture, derived using a mapping that allows individual processors for boundary and internal cell operations. In addition, the paper highlights a number of rapid design techniques that have been used to realise this system. These include an architecture synthesis tool for quickly developing the circuit architecture and the utilisation of a library of parameterisable silicon intellectual property (IP) cores, to rapidly develop detailed silicon designs.
ASAP&mdash;a simple assertion pre-processor
Authors: Igor D.D. Curcio
Venue: ACM SIGPLAN Notices (1998)

Assertions are widely known as a powerful tool to detect software faults during the debugging of software systems. Despite the maturity of software engineering tools, assertions are seldom used in practice. ASAP is a pre-processor for C programs which implements several concepts defmed in the theory of formal specification, such as preconditions, postconditions, assertions related to intermediate states, loop invariants and variants, existential and universal quantifiers. In this paper, the notion of software contract is introduced, and shown how it is applicable with assertions. Finally, a collection of useful examples is given, and ASAP design and implementation is described.
A Behavior Model for Next Generation Test Systems
Authors: Lee A. Shombert, John W. Sheppard
Venue: Journal of Electronic Testing: Theory and Applications (1998)

Defining information required by automatic test systems frequently involves a description of system behavior. To facilitate capturing the required behavior information in the context of testing, a formal model of behavior was developed for use by test systems. The approach taken in defining the behavior model was based on information modeling and was derived from recent work in formal methods by the hardware and software design communities. Specifically, an information model was developed in EXPRESS capturing the relationships between essential entities characterizing behavior. In this paper, we provide a high level description of the behavior information model and several examples applying the model in a test environment.
Shadow volume reconstruction from depth maps
Authors: Michael D. McCool
Venue: ACM Transactions on Graphics (TOG) (2000)

Current graphics hardware can be used to generate shadows using either the shadow volume or shadow map techniques. However, the shadow volume technique requires access to a representation of the scence as a polygonal model, and handling the near plane clip correctly and efficiently is difficult; conversely, accurate shadow maps require high-precision texture map data representations, but these are not widely supported. We present a hybird of the shadow map and shadow volume approaches which does not have these difficulties and leverages high-performance polygon rendering. The scene is rendered from the point of view of the light source and a sampled depth map is recovered. Edge detection and a template-based reconstruction technique are used to generate a global shadow volume boundary surface, after which the pixels in shadow can be marked using only a one-bit stencil buffer and a single-pass rendering of the shadow volume boundary polygons. The simple form of our template-based reconstruction scheme simplifies capping the shadow volume after the near plane clip.
DOMINO: databases fOr MovINg Objects tracking
Authors: Ouri Wolfson, Prasad Sistla, Bo Xu, Jutai Zhou, Sam Chamberlain
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

Consider a database that represents information about moving objects and their location. For example, for a database representing the location of taxi-cabs a typical query may be: retrieve the free cabs that are currently within 1 mile of 33 N. Michigan Ave., Chicago (to pick-up a customer); or for a trucking company database a typical query may be: retrieve the trucks that are currently within 1 mile of truck ABT312 (which needs assistance); or for a database representing the current location of objects in a battlefield a typical query may be: retrieve the friendly helicopters that are in a given region, or, retrieve the friendly helicopters that are expected to enter the region within the next 10 minutes. The queries may originate from the moving objects, or from stationary users. We will refer to applications with the above characteristics as moving-objects-database (MOD) applications, and to queries as the ones mentioned above as MOD queries. In the military MOD applications arise in the context of the digital battlefield (see [1]), and in the civilian industry they arise in transportation systems. For example, Omnitracs developed by Qualcomm (see[2]) is a commercial system used by the transportation industry, which enables MOD functionality. It provides location management by connecting vehicles (e.g. trucks), via satellites, to company databases. The vehicles are equipped with a Global Positioning System (GPS), and they automatically and periodically report their location.
Visualizing digital library search results with categorical and hierarchical axes
Authors: Ben Shneiderman, David Feldman, Anne Rose, Xavier Ferré Grau
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

Digital library search results are usually shown as a textual list, with 10-20 items per page. Viewing several thousand search results at once on a two-dimensional display with continuous variables is a promising alternative. Since these displays can overwhelm some users, we created a simplified two-dimensional display that uses categorical and hierarchical axes, called hieraxes. Users appreciate the meaningful and limited number of terms on each hieraxis. At each grid point of the display we show a cluster of color-coded dots or a bar chart. Users see the entire result set and can then click on labels to move down a level in the hierarchy. Handling broad hierarchies and arranging for imposed hierarchies led to additional design innovations. We applied hieraxes to a digital video library of science topics used by middle school teachers, a legal information system, and a technical library using the ACM Computing Classification System. Feedback from usability testing with 32 subjects revealed strengths and weaknesses.
A Micropower Adaptive Linear Transform Vector Quantiser
Authors: Richard J. Coggins, Raymond J. W. Wang, Marwan A. Jabri
Venue: Analog Integrated Circuits and Signal Processing (1999)

Micropower signal classification and compression are becoming important requirements for implantable cardioverter defibrillators although they are currently limited by power and computational constraints. This paper describes an integrated circuit that facilitates Intracardiac Electrogram (ICEG) classification and compression of 30 dimensional analogue vectors while consuming a maximum of 2.5 &mu; W power for a heart rate of 60 beats per minute (1 vector per second) from a 3.3 V supply. This represents a significant advance on previous work which achieved ultra low power supervised morphology classification [6] since the templated matching scheme used in this chip enables unsupervised blind classification of abnormal rhythms and the computational support for low bit rate data compression. The adaptive template matching scheme used is tolerant to amplitude variations, and inter- and intra-sample time shifts. Micropower performance is achieved using CMOS analogue circuits biased in weak inversion in order to minimise energy per computation. Results from the fabricated chip demonstrate the impact of the amplitude and shift tolerance on ICEG data and performance for blind classification of an abnormal rhythm in five heart patients. For four out of the five patients, no false negative classifications and a worst case of 11\% false positive classifications were made.
Gaze communication using semantically consistent spaces
Authors: Michael J. Taylor, Simon M. Rowe
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

This paper presents a design for a user interface that supports improved gaze communication in multi-point video conferencing. We set out to use traditional computer displays to mediate the gaze of remote participants in a realistic manner. Previous approaches typically assume immersive displays, and use live video to animate avatars in a shared 3D virtual world. This shared world is then rendered from the viewpoint of the appropriate avatar to yield the required views of the virtual meeting. We show why such views of a shared space do not convey gaze information realistically when using traditional computer displays. We describe a new approach that uses a different arrangement of the avatars for each participant in order to preserve the semantic significance of gaze. We present a design process for arranging these avatars. Finally, we demonstrate the effectiveness of the new interface with experimental results.
Copy detection for intellectual property protection of VLSI designs
Authors: Andrew B. Kahng, Darko Kirovski, Stefanus Mantik, Miodrag Potkonjak, Jennifer L. Wong
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

We give the first study of copy detection techniques for VLSI CAD applications; these techniques are complementary to previous watermarking-based IP protection methods in finding and proving improper use of design IP. After reviewing related literature (notably in the text processing domain), we propose a generic methodology for copy detection based on determining basic elements within structural representations of solutions (IPs), calculating (context-independent) signatures for such elements, and performing fast comparisons to identify potential violators of IP rights. We give example implementations of this methodology in the domains of scheduling, graph coloring and gate-level layout; experimental results show the effectiveness of our copy detection schemes as well as the low overhead of implementation. We remark on open research areas, notably the potentially deep and complementary interaction between watermarking and copy detection.
Exploratory mining via constrained frequent set queries
Authors: Raymond Ng, Laks V. S. Lakshmanan, Jiawei Han, Teresa Mah
Venue: ACM SIGMOD Record (1999)

Although there have been many studies on data mining, to date there have been few research prototypes or commercial systems supporting comprehensive query-driven mining, which encourages interactive exploration of the data. Our thesis is that constraint constructs and the optimization they induce play a pivotal role in mining queries, thus substantially enhancing the usefulness and performance of the mining system. This is based on the analogy of declarative query languages like SQL and query optimization which have made relational databases so successful. To this end, our proposed demo is not yet another data mining system, but of a new paradigm in data mining - mining with constraints, as the important first step towards supporting ad-hoc mining in DBMS. In this demo, we will show a prototype exploratory mining system that implements constraint-based mining query optimization methods proposed in [5]. We will demonstrate how a user can interact with the system for exploratory data mining and how efficiently the system may execute optimized data mining queries. The prototype system will include all the constraint pushing techniques for mining association rules outlined in [5], and will include additional capabilities for mining other kinds of rules for which the computation of constrained frequent sets forms the core first step.
A New Algorithm for State-Constrained Separated Continuous Linear Programs
Authors: Xiaodong Luo, Dimitris Bertsimas
Venue: SIAM Journal on Control and Optimization (1999)

During the last few decades, significant progress has been made in solving large-scale finite-dimensional and semi-infinite linear programming problems. In contrast, little progress has been made in solving linear programs in infinite-dimensional spaces despite their importance as models in manufacturing and communication systems. Inspired by the research on separated continuous linear programs, we propose a new class of continuous linear programming problems that has a variety of important applications in communications, manufacturing, and urban traffic control. This class of continuous linear programs contains the separated continuous linear programs as a subclass. Using ideas from quadratic programming, we propose an efficient algorithm for solving large-scale problems in this new class under mild assumptions on the form of the problem data. We prove algorithmically the absence of a duality gap for this class of problems without any boundedness assumptions on the solution set. We show this class of problems admits piecewise constant optimal control when the optimal solution exists. We give conditions for the existence of an optimal solution. We also report computational results which illustrate that the new algorithm is effective in solving large-scale realistic problems (with several hundred continuous variables) arising in manufacturing systems.
Exploiting Discontinuities in Optical Flow
Authors: William B. Thompson
Venue: International Journal of Computer Vision (1998)

Most optical flow estimation techniques have substantial difficulties dealing with flow discontinuities. Methods which simultaneously detect flow boundaries and use the detected boundaries to aid in flow estimation can produce significantly improved results. Current approaches to implementing these methods still have important limitations, however. We demonstrate three such problems: errors due to the mixture of image properties across boundaries, an intrinsic ambiguity in boundary location when only short sequences are considered, and difficulties insuring that the motion of a boundary aids in flow estimation for the surface to which it is attached without corrupting the flow estimates for the occluded surface on the other side. The first problem can be fixed by basing flow estimation only on image changes at edges. The second requires an analysis of longer time intervals. The third can be aided by using a boundary detection mechanism which classifies the sides of boundaries as occluding and occluded at the same time as the boundaries are detected.
Efficient Genetic Algorithms Using Simple Genes Exchange LocalSearch Policy for the Quadratic Assignment Problem
Authors: M. H. Lim, Y. Yuan, S. Omatu
Venue: Computational Optimization and Applications (2000)

In this paper, we describe an approach for solving the quadratic assignment problem (QAP) that is based on genetic algorithms (GA). It will be shown that a standard canonical GA (SGA), which involves genetic operators of selection, reproduction, crossover, and mutation, tends to fall short of the desired performance expected of a search algorithm. The performance deteriorates significantly as the size of the problem increases. To address this syndrome, it is common for GA-based techniques to be embedded with deterministic local search procedures. It is proposed that the local search should involve simple procedure of genome reordering that should not be too complex. More importantly, from a computational point of view, the local search should not carry with it the full cost of evaluating a chromosome after each move in the localized landscape. Results of simulation on several difficult QAP benchmarks showed the effectiveness of our approaches.
Implementing incremental code migration with XML
Authors: Wolfgang Emmerich, Cecilia Mascolo, Anthony Finkelstein
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

We demonstrate how XML and related technologies can be used for code mobility at any granularity, thus overcoming the restrictions of existing approaches. By not fixing a particular granularity for mobile code, we enable complete programs as well as individual lines of code to be sent across the network. We define the concept of incremental code mobility as the ability to migrate and add, remove, or replace code fragments (i.e., increments) in a remote program. The combination of fine-grained and incremental migration achieves a previously unavailable degree of flexibility. We examine the application of incremental and fine-grained code migration to a variety of domains, including user interface management, application management on mobile thin clients, for example PDAs, and management of distributed documents.
A 640 by 480 Pixels Readout Circuit for IR Imaging
Authors: Henk Martijn, Urban Halldin, Per Helander, Jan Y. Andersson
Venue: Analog Integrated Circuits and Signal Processing (2000)

A readout circuit for a 640 \times 480 pixels FPA (focal plane array) has been successfully designed, fabricated and tested. The circuit solution is based on a per pixel source-follower direct injection (SFDI) pre-amplifier. Signal multiplexing is performed in both X and Y direction. The pixel size is 25\,\mu {\rm {m}}\times25\,\mu {\rm {m}}. The chip is optimized for a QWIP (quantum well infrared photodetector) operating at a temperature of 70 K. The circuit has been realized in a standard 0.8 &mu;m CMOS process.
Evaluation of eye gaze interaction
Authors: Linda E. Sibert, Robert J. K. Jacob
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Eye gaze interaction can provide a convenient and natural addition to user-computer dialogues. We have previously reported on our interaction techniques using eye gaze [10]. While our techniques seemed useful in demonstration, we now investigate their strengths and weaknesses in a controlled setting. In this paper, we present two experiments that compare an interaction technique we developed for object selection based on a where a person is looking with the most commonly used selection method using a mouse. We find that our eye gaze interaction technique is faster than selection with a mouse. The results show that our algorithm, which makes use of knowledge about how the eyes behave, preserves the natural quickness of the eye. Eye gaze interaction is a reasonable addition to computer interaction and is convenient in situations where it is important to use the hands for other tasks. It is particularly beneficial for the larger screen workspaces and virtual environments of the future, and it will become increasingly practical as eye tracker technology matures.