ppxscal/embedding_network huggingface dataset:
Musical composition and creativity in an ICT-enriched learning environment: a case study
Authors: Nicholas Reynolds
Venue: Proceedings of the 3.1 and 3.3 working groups conference on International federation for information processing: ICT and the teacher of the future - Volume 23 (2003)

This paper describes recent research into professional level music software as an effective learning tool for primary school creativity and composition. It looks at the software, the environment-both physical and teaching-and at composition and creativity. It fits into the theme of Teaching Environments.
How Parallel Programming Tools are Used
Authors: Jorge F. Torne
Venue:  (1994)

Parallel programming is a hot topic among scientists and engineers. The number of parallel machines available to them is constantly increasing. These powerful machines provide a new research platform for engineers and scientists. In order to exploit all their power, new programming techniques are needed. Fortunately, several parallel programming tools have appeared to make this complex programming endeavor much easier. We analyze paths to parallel programming from traditional scientific programming through parallelization of a molecular simulation application. We hope this paper encourages scientists and engineers at Cornell''s Theory Center to take the step towards parallelization. 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
Optimal Prefetching via Data Compression
Authors: Jeffrey S Vitter, P. Krishnan
Venue:  (1991)

Caching and prefetching are important mechanisms for speeding up access time to data on secondary storage. Recent work in competitive online algorithms has uncovered several promising new algorithms for caching. In this paper, we apply a form of the competitive philosophy for the first time to the problem of prefetching to develop an optimal universal prefetcher in terms of fault ratio, with particular applications to large-scale databases and hypertext systems. Our algorithms for prefetching are novel in that they are based on data compression techniques that are both theoretically optimal and good in practice. Intuitively, in order to compress data effectively, you have to be able to predict future data well, and thus good data compressors should be able to predict well for purposes of prefetching. We show for powerful models such as Markov sources and $m$th-order Markov sources that the page fault rates incurred by our prefetching algorithms are optimal in the limit for almost all sequences of page accesses.
Recursive Estimation of Motion and Planar Structure
Authors: Jonathan Alon, Stan Sclaroff
Venue:  (1999)

Abstract A specialized formulation of Azarbayejani and Pentland''s framework for recursive recovery of motion, structure and focal length from feature correspondences tracked through an image sequence is presented. The specialized formulation addresses the case where all tracked points lie on a plane. This planarity constraint reduces the dimension of the original state vector, and consequently the number of feature points needed to estimate the state. Experiments with synthetic data and real imagery illustrate the system performance. The experiments confirm that the specialized formulation provides improved accuracy, stability to observation noise, and rate of convergence in estimation for the case where the tracked points lie on a plane.
Preconditioned Eigensolvers - an Oxymoron?
Authors: Andrew V. Knyazev
Venue:  (1998)

A short survey of some results on preconditioned iterative methods for symmetric eigenvalue problems is presented. The survey is in no way complete and reflects author''s personal interests and biases, with emphasis on author''s own contributions. The author tries to mention the majority of important theoretical results and ideas from the Soviet literature on the subject, adding references from the other side of the Iron Curtain usually just to preserve the integrity of the topic. An attempt is made to introduce a systematic classification of preconditioned eigensolvers, separating the choice of a preconditioner from the choice of an iterative method. A formal definition of a preconditioned eigensolver is given. Recent developments in the area are mainly ignored, in particular, on Davidson''s method. Domain decomposition methods for eigenproblems are included in the framework of preconditioned eigensolvers. The paper has more the style of a popular presentation, and can serve as an introduction into the area.
Implementing the NAG CG Benchmark on the SP1/SP2
Authors: Anne E. Trefethen, Tong Zhang
Venue:  (1995)

The NAS Benchmarks are a suite of pencil and paper benchmarks designed for benchmarking high performance machines. There are eight benchmarks in the suite, each designed to stress some feature of the architecture. They were developed at NASA Ames and appear to be becoming a standard in the high performance computing area. We are interested in the implementation of the Conjugate Gradient benchmark and in this note we describe our experiences in implementing it on the IBM SP1 and SP2 When we first considered implementing the CG benchmark it had a slightly different form from its present one. In this note we give a historical perspective on the CG benchmark with discussion of the various phases of developement that it has been through and how these have affected the choice of implementation algorithm. We discuss several algorithms for the implementation and through models of each are able to focus on significant aspects of the machine architecture. We also discuss some intersting aspects of the implementation with regard to the stability of the CG method.
A computer vision based human-robot interface
Authors: José M. Buenaposada, Luis Baumela
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter focuses on the real-time location and tracking of human faces in video sequences. The tracking is based on the cooperation of two low-level trackers based on colour and template information. The colour-based tracker is fast and robust, but it can only compute the 2D location of the face on the image. The template-based tracker, although it is more sensitive to environmental variations and more time consuming, it can compute the position and orientation of a human face in 3D space. As a result of the co-ordination of these two trackers, it emerges a robust real-time tracker that accurately computes face position and orientation in varying environmental conditions.
A Parallel Processor Architecture for Prefetching
Authors: S. Kim, S. Manoharan
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Prefetching brings data into the cache before it is expected by the processor, thereby eliminating a potential cache miss. There are two major prefetching schemes. In a software scheme, the compiler predicts the memory access pattern and places prefetch instructions into the code. In a hardware scheme the hardware predicts the memory access pattern and brings data into the cache before required by the processor.This paper proposes a hardware prefetching scheme, where a second processor is used for prefetching data for the primary processor. The scheme does not predict memory access patterns, but rather uses the second processor to run ahead of the primary processor so as to detect future memory accesses and prefetch these references.
Determining Acceptance Possibility for a Quantum Computation is Hard for PH
Authors: Stephen Fenner, Frederic Green, Steven Homer, Randall Pruim
Venue:  (1998)

Abstract It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation.
The Violation of Parity and Reversality in Molecular Ensembles: Part 1, Field induced Circular and Axial Birefringence
Authors: M. W. Evans
Venue:  (1990)

The violation of parity and reversality are fundamental phenomena which are investigated using magnetic, electric and electromagnetic field induced circular and axial birefringence in chiral and achiral molecular ensembles. Symmetry considerations determine whether parity (P) or reversality (T) must be violated in order to observe the circular or axial birefringence spectroscopically. Several types of field induced birefringence are considered, using static and time varying magnetic and electric fields, and intense electromagnetic fields. In each case, the symmetry of the complete experiment is considered, and if P and T are conserved, expressions are derived for the circular and axial refractive and absorption indices in terms of appropriate molecular property tensors. The order of magnitude of each new birefringence effect is estimated, and spectroscopic configurations suggested for their experimental observation.
IP multicast fault recovery in PIM over OSPF
Authors: Xin Wang, C. Yu, H. Schulzrinne, P. Stirpe, Wei Wu
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Little attention has been given to understanding the fault recovery characteristics and performance tuning of native IP multicast networks. This paper focuses on the interactions of the component protocols to understand their behavior in network failure and recovery scenarios. We consider a multicast environment based on the Protocol Independent Multicast (PIM) routing protocol, the Internet Group Management Protocol (IGMP) and the Open Shortest Path First (OSPF) protocol. Analytical models are presented to describe the interplay of all of these protocols in various multicast channel recovery scenarios. Quantitative results for the recovery time of IP multicast channels are given as references for network configurations, and protocol development. Simulation models are developed using the OPNET simulation tool to measure the fault recovery time and the associated protocol control overhead, and study the influence of important protocol parameters. A testbed with five Cisco routers is configured with PIM, OSPF, and IGMP to measure the multicast channel failure and recovery times for a variety of different link and router failures. In general, the failure recovery is found to be lightweight in term of control overhead and recovery time. Failure recovery time in a WAN is found to be dominated by the unicast protocol recovery process. Failure recovery in a LAN is more complex, and strongly influenced by protocol interaction and implementation specifics. Suggestion for improvement of the failure recovery time via protocol enhancements, parameter tuning, and network configuration are provided.
Deadlock Avoidance for Switches Based on Wormhole Networks
Authors: Olav Lysne
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

We consider the use of wormhole routed networks as internal interconnects of switches. The interconnection of two wormhole networks that are free from deadlocks does not necessarily produce a deadlock free network. This is problematic when wormhole networks are used as switch-internal fabrics, because it severely restricts the possibilities for coupling the switches together. This paper presents a theory that can be effectively used to control this phenomenon caused by aggregated dependencies. We show that all aggregated dependencies can be removed from wormhole networks by careful inclusion of a limited number of virtual channels.
Image Digestion and Relevance Feedback in the ImageRover WWW Search Engine
Authors: Leonid Taycher, Marco La Cascia, Stan Sclaroff
Venue:  (1997)

Abstract ImageRover is a search by image content navigation tool for the world wide web. The staggering size of the WWW dictates certain strategies and algorithms for image collection, digestion, indexing, and user interface. This paper describes two key components of the ImageRover strategy: image digestion and relevance feedback. Image digestion occurs during image collection; robots digest the images they find, computing image decompositions and indices, and storing this extracted information in vector form for searches based on image content. Relevance feedback occurs during index search; users can iteratively guide the search through the selection of relevant examples. ImageRover employs a novel relevance feedback algorithm to determine the weighted combination of image similarity metrics appropriate for a particular query. ImageRover is available and running on the web site.
Inference and Labeling of Metric-Induced Network Topologies
Authors: Azer Bestavros, John Byers, Khaled Harfoush
Venue:  (2001)

Abstract The deployment of distributed network-aware applications over the Internet requires an accurate representation of the conditions of underlying network resources. To be effective, this representation must be possible at multiple resolutions relative to a metric of interest. In this paper, we propose an approach for the construction of such representations using end-to-end measurements. We instantiate our approach by considering packet loss rates as an example metric. To that end, we present an analytical framework for the inference of Internet loss topologies. From the perspective of a server the loss topology is a logical tree rooted at the server with clients at its leaves, in which edges represent lossy paths---paths exhibiting observable loss rates higher than a specified resolution---between a pair of internal network nodes. We show how end-to-end unicast packet probing techniques could be used to (1) infer a loss topology, and (2) identify the loss rates of links in an existing loss topology. We report on simulation, implementation, and Internet deployment results that show the effectiveness of our approach and its robustness in terms of its accuracy and convergence.
Computing Quantitative Characteristics of Finite-State Real-Time Systems
Authors: Sergio Campos, Edmund Clarke, Wilfredo Marrero, Marius Minea, Hiromi Hiraishi
Venue:  (1994)

Current methods for verifying real-time systems are essentially decision procedures that establish whether the system model satisfies a given specification. We present a general method for computing quantitative information about finite-state real-time systems. We have developed algorithms that compute exact bounds on the delay between two specified events and on the number of occurrences of an event in a given interval. This technique allows us to determine performance measures such as schedulability, response time, and system load. Our algorithms produce more detailed information than traditional methods. This information leads to a better understanding of system behavior, in addition to determining its correctness. We also show that our technique can be extended to a more general representation of real-time systems, namely, timed transition graphs. The algorithms presented in this paper have been incorporated into the SMV model checker and used to verify a model of an aircraft control system. The results obtained demonstrate that our method can be successfully applied in the verification of real-time system designs.
Clustering Knowledge in Tabular Knowledge Bases
Authors: Jan Vanthienen, Elke Dries, Jeroen Keppens
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Recently, there has been a growing interest in maintenance and efficiency of large knowledge based systems. Decomposition of knowledge based systems is recognized as an important research issue in this respect. In this paper, we look at the decomposition of knowledge bases that consist of decision tables. Several algorithms to decompose large decision tables into smaller components are proposed.
An extensible language for the generation of parallel data manipulation and control packages
Authors: H. R. Walters, Jasper F.T Kamperman, T. B. Dinesh
Venue:  (1995)

The design and implementation of the language fSDL (full Structure Definition Language) is discussed. In fSDL, complex user-defined data types such as lists, tables, trees, and graphs can be constructed from a tiny set of primitives. Beyond mere structure definitions (also offered by previously existing tools) high-level functionality on these data types can be specified. In the COMPARE (ESPRIT) project, the C code generated from an fSDL specification will be used by compiler-components running in parallel on a common data pool. fSDL is first translated into a sublanguage, flat fSDL, from which the actual C code is produced. Flat fSDL is a convenient interface for cooperation with other compiler generation tools. There is a formal relation between the input fSDL and the resulting flat form.
A Balanced Approach to High-Level Verification: Performance Trade-Offs in Verifying Large-Scale Multiprocessors
Authors: Dennis Abts, Mike Roberts, David J. Lilja
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

A single node of a modern scalable multiprocessor consists of several ASICs comprising tens of millions of gates. This level of integration and complexity imposes an enormous onus on the verification process. A variety of tools, ranging from discrete-event logic simulation to formal model checking, can be used to attack this problem. Unfortunately, conventional simulation techniques, with their primitive interface to the hardware (i.e. test vectors), are inadequate tools for reasoning about the correctness of complex architectural features, such as cache coherence protocols and memory consistency models. Similarly, model checkers offer very limited utility on such large designs. We have previously proposed [1] a novel verification framework, called Raven that addresses many of these challenges. In this paper, we examine the performance implications of verifying systems at higher levels of abstraction. A detailed performance analysis is conducted to compare this higher-level approach against an equivalent Verilog test bench. We establish lower and upper bounds on the performance of the Raven environment executing on a single-processor, on a set of distributed processors, and on a shared-memory multiprocessor.
The Art of Maya, 2 edition
Venue:  (2003)

:An Introduction to 3D Computer Graphics Maya is a 3D modeling, rendering, animation, and paint software package that delivers all the tools and features 3D artists need to produce animation and visual effects on the computer. From feature films to interactive video games, Maya lets you play the role of director, actor, set designer and cinematographer as you build, render and animate digital characters and scenes. In The Art of Maya, every page is full of diagrams and illustrations that show you how to build and manipulate geometry, skeleton joints, deformers, particles, shading groups, lights and cameras. The diagrams describe these computer graphic concepts in a way that will help you understand how you can use Maya in your own work. This book is an excellent resource for all Maya users and includes an introduction to computer graphics that will help people new to the world of 3D animation. The book finishes with articles that outline how Maya was used in actual productions for film, television, and interactive games. 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
Self-assembling dynamical hierarchies
Authors: Alan Dorin, Jon McCormack
Venue: Proceedings of the eighth international conference on Artificial life (2002)

This paper addresses the open problem of assembling multi-levelled hierarchical structure. It presents a model of an infinitely-levelled, self-assembling dynamical hierarchy that arises from the interaction of geometric primary elements with a fixed complexity. A formal description of the presented hierarchy is derived. This quantifies the relative compression achieved by describing the system in terms of components of different organization. The relationship between properties of representations and those of physical objects is then discussed to support the view that at each level in the hierarchy presented, the components exhibit emergent properties not possessed by those at the levels below. It is concluded that these new properties are trivial and that such infinitely-levelled structures may be constructed easily. However, since the definition of the problem in the literature admits such trivial possibilities, more specific definitions are required.
New Delay Analysis in High Speed Networks
Authors: Chengzhi Li, Riccardo Bettati, Wei Zhao
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The implementation of bounded-delay services over integrated services networks relies admission control mechanisms that in turn use end-to-end delay computation algorithms. For guaranteed-rate scheduling algorithms, such as fair queueing, delay computation based on Cruz' service curve model performs very well. Many currently deployed networks, be they packet-switched or ATM based, rely on non-guaranteed-rate disciplines, most prominently FIFO and static-priority disciplines. We show that for this class of disciplines the service curve model performs poorly. We propose the Integrated Approach as alternative to the service curve model to cluster servers for delay computaton purposes, and show in a series of evaluations that this new approach outperforms approaches based on the service curve model as well as other currently used approaches.
Implementation Image Data Convolutions Operations in FPGA Reconfigurable Structures for Real-Time Vision Systems
Authors: Kazimierz Wiatr, Ernest Jamro
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In this paper, different architectures for real time image constant coefficient convolutions will be considered. Accordingly, Look-Up-Table (LUT) based Multiplication/Convolution, LUT based Distributed Arithmetic (DA) Convolution and Multiplierless Convolution (MC) implementations into FPGA structures has been investigated. In a result, the choice between these architectures depends on given coefficients values, however in most cases the MC preferable. Furthermore, the change of coefficient values in real time systems is also considered. This work is a contribution to worldwide intense research on developing reconfigurable and user dedicated Custom Computing Machines (CCM).