ppxscal/embedding_network huggingface dataset:
The People Sensor: A Mobility Aid for the Visually Impaired
Authors: Sunita Ram, Jennie Sharf
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

Electronic Travel Aids, which transform visual environmental cues into another sensory modality, have been proven to help visually impaired people travel with a greater degree of psychological comfort and independence. The People Sensor is an Electronic Travel Aid designed to address two issues of importance to visually impaired people: inadvertent cane contact with other pedestrians and objects, and speaking to a person who is no longer within hearing range. The device uses pyroelectric and ultrasound sensors to locate and differentiate between animate (human) and inanimate (non-human) obstructions in the detection path. The distance between the user and the obstruction, along with the nature of the obstruction (human or non-human) is transmitted via modulated vibrotactile feedback. Armed with advance knowledge of the presence and location of objects and people in the environment, users of The People Sensor can travel with increased independence, safety and confidence.
Avid Xpress DV 3.5 for Windows and Macintosh: Visual QuickPro Guide
Authors: James Monohan
Venue:  (2003)

:Long known for its professional-level video-editing workstations, Avid has finally brought its system to both Windows and Macintosh desktops. Beginning digital filmmakers who are looking to acquire a high degree of editing proficiency quickly and experienced editors who are making the switch from other editing software will find everything they need in this guide. Best of all, readers can apply the skills they acquire here to other Avid products, which share similar interfaces and a common file format. Focused, task-based instruction covers the entire video-editing process from the basics of getting a DV project rolling all the way to advanced editing techniques and methods of distributing the final product. Along the way, readers will find the meaty tips and enhanced graphics (with labels, arrows, and other annotations) that have become the hallmark of this popular series. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Design and Analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster
Authors: David A. Bader, Arthur B. MacCabe, Jason R. Mastaler, John K. McIver,  III, Patricia A. Kovatch
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

This paper will discuss high performance clustering from a series of critical topics: architectural design, system software infrastructure, and programming environment. This will be accomplished through an overview of a large scale, high performance SuperCluster (named Roadrunner) in production at The University of New Mexico (UNM) Albuquerque High Performance Computing Center (AHPCC). This SuperCluster, sponsored by the U.S. National Science Foundation (NSF) and the National Computational Science Alliance (NCSA), is based almost entirely on freely-available, vendor-independent software. For example, its operating system (Linux), job scheduler (PBS), compilers (GNU/EGCS), and parallel programming libraries (MPI). The Globus toolkit, also available for this platform, allows high performance distributed computing applications to use geographically distributed resources such as this SuperCluster. In addition to describing the design and analysis of the Roadrunner SuperCluster, we provide experimental analyses from grand challenge applications and future directions for SuperClusters.
A Stochastic Model of Human Errors in Software Development: Impact of Repair Times
Authors: Carol Smidts
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Most existing software reliability models estimate the failure intensity function during dynamic testing. While these models are useful engineering tools, they can not be applied to earlier life-cycle phases where pay-off is maximum in terms of avoiding later failures. Few models have been developed to capture phenomena occurring early in the life cycle and their impact on reliability and much research effort is still needed in this area. Our previous research efforts have led to the development of a stochastic model which relates human errors committed during software development and debugging activities to the software failure intensity function. The software development schedule and other influencing factors (e.g., experience, schedule pressure, etc) were used to predict human error rates. The model is based on several assumptions. In particular, it is assumed that repair is instantaneous. The present paper attempts to remove this assumption and assesses the impact of repair times on previous findings.
Heuristics for Parallel Graph-Partitioning
Authors: John E. Savage, Markus G. Wloka
Venue:  (1989)

Graph partitioning is an important NP-complete problem with many applications. The problem is to partition vertices of a graph into two (nearly) equal-sized sets so that the number of edges joining the sets is minimal. It has applications in VLSI CAD, processor allocation, and many other areas. In this paper we show that the Kernighan-Lin and simulated annealing heuristics are logspace complete for the classes P and BPP, respectively, which means that they are hard to parallelize. We also describe a new parallel heuristic that on the 32K-processor CM-2 Connection Machine handles graphs with more than two million edges and gives in nine minutes partitions that are within 2 best ever found.
Preliminary Study of a Possible Attack on Automatic Speaker Verification Systems Using Computer Assisted Voice Mimicking
Authors: Shlomo Geva
Venue:  (1995)

Voice is the primary mode of communication between people. Recent developments in telecommunications and computerised signal processing technology have advanced the possibility of wide spread use of voice mail, or the use of EFTPOS transactions over the phone. Speaker verification for over the phone EFTPOS transactions is a subject of extensive research at present. There are numerous situations in which voice mimicking may be regarded as a serious security threat. Telephone conversations and electronic mail systems are typically without speaker verification protection, however, this may change once robust speaker verification techniques become available. In this report we study and propose the possibility of mounting a successful attack on existing speaker verification methods. Speaker verification research is carried out in Queensland at QUT, in the Signal Processing research centre, and at the University of Queensland in the speaker verification group of the school of Computer and Electrical Engineering. The topic is also of great interest to the telecommunications industry. It is highly desirable for speaker verification groups to subject their systems to the proposed attack to verify their robustness. In the following we introduce some of the current methods used in speaker verification, speech recognition, and speech synthesis, and then proceed to propose a method to attack Automatic Speaker Verification systems using existing knowledge and techniques.
Revealing local variability properties of human heartbeat intervals with the local effective Holder exponent
Authors: Zbigniew R. Struzik
Venue:  (2000)

The local effective H\"older exponent has been applied to evaluate the variability of heart rate locally at an arbitrary position (time) and resolution (scale). The local effective H\"older exponent [8, 9] used is effectively insensitive to local polynomial trends in heartbeat rate due to the use of the Wavelet Transform Modulus Maxima technique. Also the variability so obtained is compatible in the sense of distribution to the Multifractal Spectra of the analysed heart rate time series. This provides the possibility of standardising the variability estimation for comparison between different patients and between different recordings for one patient. The previously reported global correlation behaviour [1] is captured in the effective H\"older exponent based, local variability estimate. This includes discriminating healthy and sick (congestive heart failure patients) on the basis of both the central (Hurst) exponent and the width of the multifractal spectra. In addition to this, we observed intriguing patterns of individual response in variability records to daily activities. A moving average filtering of H\"older exponent based variability estimates was used to enhance these fluctuations. We find that this way of local presentation of scaling properties may be of clinical importance.
Testing Delay-Insensitive Circuits
Authors: Alain J. Martin, Pieter J. Hazewindus
Venue:  (1990)

We show that a single stuck-at fault in a non-redundant delay-insensitive circuit results in a transition either not taking place or firing prematurely, or both, during an execution of the circuit. A transition not taking place can be tested easily, as this always prevents a transition on a primary output from taking place. A premature firing can also be tested but the addition of testing points may be required to enforce the premature firing and to propagate the transition to a primary output. Hence all single stuck-at faults are testable. All test sequences can be generated from the high-level specification of the circuit. The circuits are hazard-free in normal operation and during the tests.
Active Device under Bond Pad to Save I/O Layout for High-pin-count SOC
Authors: Ming-Dou Ker, Jeng-Jie Peng, Hsin-Chin Jiang
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

To save layout area for electrostatic discharge (ESD)protection design in the SOC era, test chip with large sizeNMOS devices placed under bond pads has beenfabricated in 0.35-µm one-poly-four-metal (1P4M) 3.3VCMOS process for verification. The bond pads had beendrawn with different layout patterns on the inter-layermetals to investigate the effect of bonding stress on theactive devices under the pads. Threshold voltage, off-statedrain current, and gate leakage current of these devicesunder bond pads have been measured. After assembled inwire bond package, the measurement results show thatthere are only little variations between devices underbond pads and devices beside bond pads. This result canbe applied on saving layout area for on-chip ESDprotection devices or I/O devices of IC products,especially for the high-pin-count system-on-a-chip (SOC).
Information technology, GIS and democraticvalues: Ethical implications for ITprofessionals in public service
Authors: Akhlaque Haque
Venue: Ethics and Information Technology (2003)

Information technologies (IT) play a critical role in transforming public administration and redefining the role of bureaucracy in a democratic society. New applications of IT bring great promises for government, but at the same time raise concerns about administrative power and its abuse. Using Geographic Information Systems (GIS) as the central example, this paper provides the philosophical underpinnings of the role of technology and discusses the importance of an ethical discourse in IT for public service professionals. Such ethical discourse must be based on upholding the democratic values and preserving the institutional integrity of IT professionals in public office.
Uniform Proofs as a Foundation for Logic Programming
Authors: Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov
Venue:  (1989)

A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instruments. The operational semantics is formalized by the identification of a class of cut-free sequent proofs called {\em uniform proofs.} A uniform proof is one that can be found by a goal-directed search that respects the interpretation of the logical connectives as search instructions. The concept of a uniform proof is used to define the notion of an {\em abstract logic programming language,} and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language. Horn clauses are then generalized to {\em hereditary Harrop formulas} and it is shown that first-order and higher-order versions of this new class of formulas are also abstract logic programming languages if the inference rules are those of either intuitionistic or minimal logic. The programming language significance of the various generalizations to first-order Horn clauses is briefly discussed.
Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete
Authors: Kjartan Stefansson
Venue:  (1993)

A system of set constraints is a system of expressions $E\subseteq F$ where $E$ and $F$ describe sets of ground terms over a ranked alphabet. Aiken et al. [AKVW93] classified the complexity of such systems. In [AKW93] it was shown that if negative constraints $E\not\subseteq F$ were allowed, then the problem is decidable. This was done by reduction to a Diophantine problem, the Nonlinear Reachability Problem, which was shown to be decidable. We show that nonlinear reachability is NP-complete. By bounding the reduction of [AKW93] we conclude that systems of set constraints, allowing negative constraints, is NEXPTIME-complete.
Kea - A Dynamically Extensible and Configurable Operating System Kernel
Authors: Alistair C. Veitch, Norman C. Hutchinson
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Kea is a new operating system kernel which has been designed for maximum flexibility and performance in the areas of kernel and application extensibility and dynamic reconfiguration. Kea provides a means through which kernel services can be reconfigured, either on an application specific or system wide scale. We describe the design and implementation of these features, and report on some of our current research which relies on these abilities.
ISIS and META Projects: Progress Report
Authors: Kenneth P. Birman, Robert Cooper, Keith Marzullo
Venue:  (1990)

No abstract is available.
A Vector Space Model for Automatic Indexing
Authors: Gerard Salton, A. Wong, C. S. Yang
Venue:  (1974)

In a document retieval, or other pattern matching environment where stored entities (documents) are compared with each other, or with incoming patterns (search requests), it appears that the best indexing (property) space is one where each entity lies as far away from the others as possible; that is, retrieval performance correlates inversely with space density. This result is used to choose an optimum indexing vocabulary for a collection of documents. Typical evaluation results are shown demonstrating the usefulness of the model.
An Embedded IDDQ Testing Architecture and Technique
Authors: Y. Tsiatouhas, Th. Haniotakis, A. Arapoyanni
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

In this paper an embedded IDDQ testing architecture ispresented that targets to overcome the excessive hardwareoverhead requirements in built-in current sensing basedtesting applications. Moreover, a technique that utilises theIEEE 1149.1 boundary scan standard to control theproposed architecture is provided. The proposed solutionis characterised by low silicon area requirements andpermits the application of IDDQ testing also in case that thechip is mounted on a printed circuit board.
Comparison of Two Middleware Data Dissemination Services in a Wide-Area Distributed System
Authors: G. Robert Malan, Farnam Jahanian, Peter A. Knoop
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

This paper provides an experimental comparison of two middleware data dissemination services: a distributed object-based service, and a message-based service. This paper compares these two services in the context of a common application: a wide-area network collaboratory, namely the Upper Atmospheric Research Collaboratory (UARC). UARC is an example of an application that reliably-streams data from a set of suppliers to a set of receivers. This comparison highlights the tradeoffs between ease of implementation and performance for a data streaming middleware service. By relying on a rigid language primitive, namely remote method invocation, the object-based dissemination service gave up the control over its transport policies. In contrast, the lower-level socket-based service was specifically constructed to provide a flexible interface to its applications. This flexibility allowed the middleware to better support data delivery to a heterogeneous set of receivers. This is important in a wide-area distributed system where hosts are connected together over a broad spectrum of network links. This paper provides a concrete example of the effects of high-level design choices in the implementation of a wide-area distributed system's communication middleware.
Multimedia Conferencing: Designed with H32X Capabilities
Authors: M. Z. Zhao, Y. C. Loh
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Multimedia conferencing technology is becoming increasingly important, as it enables people who are located in different cities (or countries) to share as well as interact with their data, comments, images, and video pictures. This paper introduces the multimedia conferencing standards, such as ITU-T T.120, T.130, H.320, H.323, and H.324, which comprise the core technologies for multimedia conferencing. The paper discusses interoperability and compatibility issues arise from the deployment of different vendor applications. The paper also presents a proposed multimedia conferencing system with H.32X standard capabilities, which is designed to facilitate interoperability and compatibility between different platforms. Key words: Multimedia Conferencing, Computer Networks, ITU-T Standards.
Simulations and the Future of Learning: An Innovative (and Perhaps Revolutionary) Approach to e-Learning
Authors: Clark Aldrich
Venue:  (2003)

:Simulators, an innovative and engaging method of learning that allows users to transform e-learning into effective learning, are at the very heart of any sustainable educational solution, be it corporate, government, or K-12 and higher education. This book, written by the leading expert of simulations, is designed for training managers, human resource professionals, chief learning officers, and anyone else who makes their living creating and disseminating training or educational content. Readers will learn how to build simulators, how to evaluate them, and how to use them. The book provides a clear understanding of simulators' multi-billion dollar potential--explaining how to repurpose content, leverage computer game world technology, and integrate both into broader learning options.
Quality Requirements Analysis in Customer-Centered Software Development
Authors: Johan Vanwelkenhuysen
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

An approach to nonfunctional requirements analysis for software systems is discussed. The approach is designed to refine and analyze quality requirements, to manage change and to stress customer acceptance. Our work is driven by the aim to develop a technology to enable and support customer-centered (cooperative) approaches to software development. We view quality requirements analysis essentially as an outcome of argumentation-based software design. Adopting this view, we support three claims: (1) The analysis of quality requirements is inherently intertwined in the conceptual software design process; (2) Relationships among quality requirements hold in the context of a design decision for a local problem only; (3) Priorities among competing requirements are sensitive to characteristics of the workplace.
Transient-fault recovery for chip multiprocessors
Authors: Mohamed Gomaa, Chad Scarbrough, T. N. Vijaykumar, Irith Pomeranz
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

To address the increasing susceptibility of commodity chip multiprocessors (CMPs) to transient faults, we propose Chiplevel Redundantly Threaded multiprocessor with Recovery (CRTR). CRTR extends the previously-proposed CRT for transient-fault detection in CMPs, and the previously-proposed SRTR for transient-fault recovery in SMT. All these schemes achieve fault tolerance by executing and comparing two copies, called leading and trailing threads, of a given application. Previous recovery schemes for SMT do not perform well on CMPs. In a CMP, the leading and trailing threads execute on different processors to achieve load balancing and reduce the probability of a fault corrupting both threads; whereas in an SMT, both threads execute on the same processor. The inter-processor communication required to compare the threads introduces latency and bandwidth problems not present in an SMT.To hide inter-processor latency, CRTR executes the leading thread ahead of the trailing thread by maintaining a long slack, enabled by asymmetric commit. CRTR commits the leading thread before checking and the trailing thread after checking, so that the trailing thread state may be used for recovery. Previous recovery schemes commit both threads after checking, making a long slack suboptimal. To tackle inter-processor bandwidth, CRTR not only increases the bandwidth supply by pipelining the communication paths, but also reduces the bandwidth demand. By reasoning that faults propagate through dependences, previously-proposed Dependence-Based Checking Elision (DBCE) exploits (true) register dependence chains so that only the value of the last instruction in a chain is checked. However, instructions that mask operand bits may mask faults and limit the use of dependence chains. We propose Death- and Dependence-Based Checking Elision (DDBCE), which chains a masking instruction only if the source operand of the instruction dies after the instruction. Register deaths ensure that masked faults do not corrupt later computation. Using SPEC2000, we show that CRTR incurs negligible performance loss compared to CRT for inter-processor (one-way) latency as high as 30 cycles, and that the bandwidth requirements of CRT and CRTR with DDBCE are 5.2 and 7.1 bytes/cycle, respectively.
Distribution transparent MIB based on MSA (Management System Agent) model
Authors: S. Nishiyama, C. Ono, S. Obana, K. Suzuki
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

OSI Management model defines only peer to peer communication process between a managing application (AP) and a managed AP. Thus, when more than one managed AP stores portions of Management Information Base (MIB) distributively, the managing AP needs a sophisticated distributed processing function. This paper proposes an agent, called Management System Agent (MSA) which provides location transparency and schema transparency of MIB for managing APs, to ease the realization of managing APs. Location transparency hides the distribution of MIB from managing APs. Schema transparency also enables managing APs to invoke management operation on unified schema. This paper demonstrates the effectiveness of the MSA model through applying it to implementation of Customer Network Management (CNM) system focusing X.25 public data networks.
Fast Compact Prime Number Sieves (Among Others)
Authors: Paul Pritchard
Venue:  (1981)

NO SUPPLIED