ppxscal/embedding_network huggingface dataset:
A collaborative learning trial between New Zealand and Sweden-using Lotus Notes Domino in teaching the concepts of Human Computer Interaction
Authors: A. G.(Tony) Clear
Venue: ACM SIGCSE Bulletin (1999)

This paper reports the results of a collaborative learning exercise between students at Auckland Institute of Technology and Uppsala University. The exercise was conducted using both a Lotus Notes Domino trade; collaborative database and electronic mail to support students working in remote groups to perform a common task. Issues concerning the logistics of such an exercise, student participation and evaluations of the process, ethical considerations and the quality of the learning process are discussed. Some conclusions are drawn concerning the value of Group Ware technology to support this form of collaborative learning, and suggestions are made for future developments.
Parallel Partial Stabilizing Algorithms for Large Linear Control Systems
Authors: Peter Benner, Maribel Castillo, Enrique S. Quintana-Ortí, Vicente Hernández
Venue: The Journal of Supercomputing (2000)

In this paper we present parallel algorithms for stabilizing large linear control systems on multicomputers. Our algorithms first separate the stable part of the linear control system and then compute a stabilizing feedback for the unstable part. Both stages are solved by means of the matrix sign function which presents a high degree of parallelism and scalability.The experimental results on an IBM SP2 platform show the performance of our approach.
Asynchronous Parallel Prefix Computation
Authors: Rajit Manohar, José A. Tierno
Venue: IEEE Transactions on Computers (1998)

The prefix problem is to compute all the products $x_1 \otimes x_2 \otimes \cdots \otimes x_k,$ for 1 ¿k¿n, where $\otimes$ is an associative binary operation. We start with an asynchronous circuit to solve this problem with O(log n) latency and O(n log n) circuit size, with $O(n)\ \otimes\!\!-{\rm operations}$ in the circuit. Our contributions are: 1) a modification to the circuit that improves its average-case latency from O(log n) to O(log log n) time, and 2) a further modification that allows the circuit to run at full-throughput, i.e., with constant response time. The construction can be used to obtain a asynchronous adder with O(log n) worst-case latency and O(log log n) average-case latency.
Temporal Partitioning and Scheduling Data Flow Graphs for Reconfigurable Computers
Authors: Karthikeya M. Gajjala Purna, Dinesh Bhatia
Venue: IEEE Transactions on Computers (1999)

FPGA-based configurable computing machines are evolving rapidly. They offer the ability to deliver very high performance at a fraction of the cost when compared to supercomputers. The first generation of configurable computers (those with multiple FPGAs connected using a specific interconnect) used statically reconfigurable FPGAs. On these configurable computers, computations are performed by partitioning an entire task into spatially interconnected subtasks. Such configurable computers are used in logic emulation systems and for functional verification of hardware. In general, configurable computers provide the ability to reconfigure rapidly to any desired custom form. Hence, the available resources can be reused effectively to cut down the hardware costs and also improve the performance. In this paper, we introduce the concept of temporal partitioning to partition a task into temporally interconnected subtasks. Specifically, we present algorithms for temporal partitioning and scheduling data flow graphs for configurable computers. We are given a configurable computing unit (RPU) with a logic capacity of $S_{RPU}$ and a computational task represented by an acyclic data flow graph$G=(V,E)$. Computations with logic area requirements that exceed $S_{RPU}$ cannot be completely mapped on a configurable computer (using traditional spatial mapping techniques). However, a temporal partitioning of the data flow graph followed by proper scheduling can facilitate the configurable computer based execution. Temporal partitioning of the data flow graph is a $k$-way partitioning of $G=(V,E)$ such that each partitioned segment will not exceed $S_{RPU}$ in its logic requirement. Scheduling assigns an execution order to the partitioned segments so as to ensure proper execution. Thus, for each segment in $\{ s_1, s_2, \cdots, s_k \}$, scheduling assigns a unique ordering $ s_i \rightarrow j$, $1 \leq i \leq k$, $1 \leq j \leq k$, such that the computation would execute in proper sequential order as defined by the flow graph $G=(V,E)$.
Optimization of high-performance superscalar architectures for energy efficiency
Authors: V. Zyuban, P. Kogge
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

In recent years reducing power has become a critical design goal for high-performance microprocessors. This work attempts to bring the power issue to the earliest phase of high-performance microprocessor development. We propose a methodology for power-optimization at the micro-architectural level. First, major targets for power reduction are identified within superscalar microarchitecture, then an optimization of a superscalar micro-architecture is performed that generates a set of energy-efficient configurations forming a convex hull in the power-performance space. The energy-efficient families are then compared to find configurations that dissipate the lowest power given a performance target, or, conversely, deliver the highest performance given a power budget. Application of the developed methodology to a superscalar micro-architecture shows that at the architectural level there is a potential for reducing power up to 50%, given a performance requirement, and for up to 15% performance improvement, given a power budget.
PDB_ISL: an intermediate sequence library for protein structure assignment
Authors: S. A. Teichmann, C. Chothia, G. M. Church, J. Park
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

For large scale structural assignment to sequences, as in computational structural genomics, a fast yet sensitive homology search procedure is essential. A new approach using intermediate sequences was tested as a shortcut to iterative multiple sequence search methods such as PSI-BLAST and hidden Markov models. A library containing potential intermediate sequences for proteins of known structure (PDB_ISL) was constructed. The sequences in the library were collected from a large sequence database using the sequences of the domains of proteins of known structure as the query sequences and the program PSI-BLAST. Sequences of proteins of unknown structure can be matched to distantly related proteins of known structure by using any pairwise sequence comparison methods to find homologues in PDB_ISL. Searches of PDB_ISL were calibrated, and the number of correct matches found at a given error rate was the same as that found by PSI_BLAST. The advantage of this library is that it uses pairwise sequence comparison methods, such as FASTA or BLAST2, and can, therefore, be searched easily and, in many cases, much more quickly than an iterative multiple sequence comparison method. The procedure is roughly twenty times faster than PSI-BLAST for small genomes and several hundred times for large genomes such as C. elegans. Sequences can be submitted to the PDB_ISL servers at http://stash.mrc-lmb.cam.ac.uk/PDB_ISL/ ftp://ftp.ebi.ac.uk/pub/databases/pdb_isl/
Topic Distillation and Spectral Filtering
Authors: Soumen Chakrabarti, Byron E. Dom, David Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
Venue: Artificial Intelligence Review (1999)

This paper discuss topic distillation, an information retrieval problem that is emerging as a critical task for the www. Algorithms for this problem must distill a small number of high-quality documents addressing a broad topic from a large set of candidates. We give a review of the literature, and compare the problem with related tasks such as classification, clustering, and indexing. We then describe a general approach to topic distillation with applications to searching and partitioning, based on the algebraic properties of matrices derived from particular documents within the corpus. Our method &ndash; which we call special filtering &ndash; combines the use of terms, hyperlinks and anchor-text to improve retrieval performance. We give results for broad-topic queries on the www, and also give some anecdotal results applying the same techniques to US Supreme Court law cases, US patents, and a set of Wall Street Journal newspaper articles.
Next-generation generic programming and its application to sparse matrix computations
Authors: Nikolay Mateev, Keshav Pingali, Paul Stodghill, Vladimir Kotlyar
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

The contributions of this paper are the following.We introduce a new variety of generic programming in which algorithm implementors use a different API than data structure designers, the gap between the API's being bridged by restructuring compilers. One view of this approach is that it exploits restructuring compiler technology to perform a novel kind of template instantiation.We demonstrate the usefulness of this new generic programming technology by deploying it in a system that generates efficient sparse codes from high-level algorithms and specifications of sparse matrix formats.We argue that sparse matrix formats should be viewed as indexed-sequential access data structures (in the database sense), and show that appropriate abstractions of the index structure of common formats can be conveyed to a restructuring compiler through the type system of a modern language that supports inheritance and templates.
Face Detection From Color Images Using a Fuzzy Pattern Matching Method
Authors: Haiyuan Wu, Qian Chen, Masahiko Yachida
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

This paper describes a new method to detect faces in color images based on the fuzzy theory. We make two fuzzy models to describe the skin color and hair color, respectively. In these models, we use a perceptually uniform color space to describe the color information to increase the accuracy and stableness. We use the two models to extract the skin color regions and the hair color regions, and then comparing them with the prebuilt head-shape models by using a fuzzy theory based pattern-matching method to detect face candidates.
A simple, efficient method for realistic animation of clouds
Authors: Yoshinori Dobashi, Kazufumi Kaneda, Hideo Yamashita, Tsuyoshi Okita, Tomoyuki Nishita
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

This paper proposes a simple and computationally inexpensive method for animation of clouds. The cloud evolution is simulated using cellular automaton that simplifies the dynamics of cloud formation. The dynamics are expressed by several simple transition rules and their complex motion can be simulated with a small amount of computation. Realistic images are then created using one of the standard graphics APIs, OpenGL. This makes it possible to utilize graphics hardware, resulting in fast image generation. The proposed method can realize the realistic motion of clouds, shadows cast on the ground, and shafts of light through clouds.
Multiple Capacity Vehicle Routing on Paths
Authors: D. J. Guan, Xuding Zhu
Venue: SIAM Journal on Discrete Mathematics (1998)

Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest tour for the vehicle to transport all objects from their initial vertices to their destination vertices is called the vehicle routing problem. The problem is multiple capacity if the vehicle can handle more than one objects at a time. The problem is preemptive if objects can be unloaded at the intermediate vertices. In this paper, we present an O(kn+n2) time algorithm for multiple capacity preemptive vehicle routing problem on paths, where k is the number of objects to be moved and n is the number of vertices in the path.
Performance of routing schemes in wireless personal networks
Authors: Anna Della Torre Hać, Zhu Della Torre Zhu
Venue: International Journal of Network Management (1999)

Routing efficiency in wireless communication networks depends critically on the propagation of location information into the network. We propose new dynamic traffic and state-dependent routing algorithms which are suitable for the demands of future wireless personal communications networks. Copyright &copy; 1999 John Wiley Sons, Ltd.
Functional multiple-output decomposition with application to technology mapping for lookup table-based FPGAs
Authors: Bernd Wurth, Ulf Schlichtmann, Klaus Eckl, Kurt J. Antreich
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1999)

Functional decomposition is an important technique for technology mapping to look up table-based FPGA architectures. We present the theory of and a novel approach to functional disjoint decomposition of multiple-output functions, in which common subfunctions are extracted during technology mapping. While a Boolean function usually has a very large number of subfunctions, we show that not all of them are useful for multiple-output decomposition. We use a partition of the set of bound set vertices as the basis to compute preferable decomposition functions, which are sufficient for an optimal multiple-output decomposition. We propose several new algorithms that deal with central issues of functional multiple-output decomposition. First, an efficient algorithm to solve the variable partitioning problem is described. Second, we show how to implicitly compute all preferable functions of a single-output function and how to identify all common preferable functions of a multiple-output function. Due to implicit computation in the crucial steps, the algorithm is very efficient. Experimental results show significant reductions in area.
Ripple joins for online aggregation
Authors: Peter J. Haas, Joseph M. Hellerstein
Venue: ACM SIGMOD Record (1999)

We present a new family of join algorithms, called ripple joins, for online processing of multi-table aggregation queries in a relational database management system (DBMS). Such queries arise naturally in interactive exploratory decision-support applications. Traditional offline join algorithms are designed to minimize the time to completion of the query. In contrast, ripple joins are designed to minimize the time until an acceptably precise estimate of the query result is available, as measured by the length of a confidence interval. Ripple joins are adaptive, adjusting their behavior during processing in accordance with the statistical properties of the data. Ripple joins also permit the user to dynamically trade off the two key performance factors of on-line aggregation: the time between successive updates of the running aggregate, and the amount by which the confidence-interval length decreases at each update. We show how ripple joins can be implemented in an existing DBMS using iterators, and we give an overview of the methods used to compute confidence intervals and to adaptively optimize the ripple join &ldquo;aspect-ratio&rdquo; parameters. In experiments with an initial implementation of our algorithms in the POSTGRES DBMS, the time required to produce reasonably precise online estimates was up to two orders of magnitude smaller than the time required for the best offline join algorithms to produce exact answers.
Smart Memories: a modular reconfigurable architecture
Authors: Ken Mai, Tim Paaske, Nuwan Jayasena, Ron Ho, William J. Dally, Mark Horowitz
Venue: ACM SIGARCH Computer Architecture News (2000)

Trends in VLSI technology scaling demand that future computing devices be narrowly focused to achieve high performance and high efficiency, yet also target the high volumes and low costs of widely applicable general purpose designs. To address these conflicting requirements, we propose a modular reconfigurable architecture called Smart Memories, targeted at computing needs in the 0.1&mgr; technology generation. A Smart Memories chip is made up of many processing tiles, each containing local memory, local interconnect, and a processor core. For efficient computation under a wide class of possible applications, the memories, the wires, and the computational model can all be altered to match the applications. To show the applicability of this design, two very different machines at opposite ends of the architectural spectrum, the Imagine stream processor and the Hydra speculative multiprocessor, are mapped onto the Smart Memories computing substrate. Simulations of the mappings show that the Smart Memories architecture can successfully map these architectures with only modest performance degradation.
A better mythology for system design
Authors: Jed Harris, Austin Henderson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

The past decades have seen huge improvements in computer systems but these have proved difficult to translate into comparable improvements in the usability and social integration of computers. We believe that the problem is a deeply rooted set of assumptions about how computer systems should be designed, and about who should be doing that design. Human organizations are continually evolving to meet changing circumstances of resource and need. In contrast, computers are quite rigid, incapable of adaptation on their own. Therefore when computer systems are incorporated into human organizations, those organizations must adapt the computers to changing circumstances. This adaptation is another human activity that technology should support, but our design philosophies are oddly silent about it. This paper explores the origins of these problems in the norms developed for managing human organizations, proposes partial solutions that can be implemented with current systems technology, and speculates about the long-term potential for radical improvements in system design.
C for Econometricians
Authors: Francisco Cribari-Neto
Venue: Computational Economics (1999)

Fortran has long been the mother-tongue of the scientific community. This note looks at the C programming language from the viewpoint of numerical computing with the emphasis placed on econometric applications. C can be used as a replacement for other lower level programming languages, and also a replacement or as a complement to higher level matrix programming languages such as GAUSS, MATLAB, Ox, and S-PLUS.
Teams need a process!
Authors: Thomas B. Hilburn
Venue: ACM SIGCSE Bulletin (2000)

This paper begins with a discussion of the importance of software development and the problems encountered by those trying to work effectively on software project teams. It is argued that for students to be effective in working on teams they need the discipline and organization offered by a rigorous team software process. The author describes his experiences in using the Team Software Process (TSP) to teach an introductory course in software engineering. The structure and key elements of the process are presented, along with techniques used in selecting and forming teams. The paper examines the TSP quality assurance features and finishes with a discussion of the techniques used to acquire feedback and to evaluate the affect of the TSP on student learning.
A Novel (N + 1/2) Pulse Swallow Programmable Divider for the Prescaler PLL Frequency Synthesizer
Authors: Shigeki Obote, Kouichi Syoubu, Yutaka Fukui, Yasuaki Sumi
Venue: Analog Integrated Circuits and Signal Processing (1999)

In this paper, we propose a new speedup method of frequency switching time of the prescaler PLL frequency synthesizer using (N+ {{1}\over {2}}) pulse swallow programmable divider. The (N+{{1}\over {2}}) pulse swallow programmable divider can set half the division ratio ({{D}\over {2}}) in comparison with the desired division ratio D. In the improved prescaler method, since the total division ratio including ({{1}\over {2}}) fixed prescaler becomes desired division ratio D, the reference frequency which is two times bigger than that of the conventional prescaler method can be used. Therefore, the loop gain, the natural angular frequency and the damping factor are increased, and the frequency switching time can be speeded up. By the experimental results, it is observed that the frequency switching time of the improved prescaler method is two times faster than that of the conventional prescaler method.
RESCU: dynamic hybrid packet-loss recovery for video transmission over the Internet (poster session)
Authors: Srinath R. Joshi, Injong Rhee
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

The current Internet is not reliable; packet loss rates are frequently high, and varying over time. Transmitting high-quality interactive video over the Internet is challenging because the quality of compressed video is very susceptible to packet losses. Loss of packets belonging to a video frame manifests itself not only in the reduced quality of that frame but also in the propagation of that distortion to successive frames. This error propagation problem is inherent in many motion-based video codecs due to the interdependence of encoded video frames. This paper presents a dynamic loss recovery scheme, called RESCU, to address the error propagation problem. In this new scheme, picture coding patterns are dynamically adapted to current network conditions in order to maximize the effectiveness of hybrid transport level recovery (employing both forward error correction and retransmission) in reducing error propagation. Since RESCU does not introduce any playout delay at the receiver, it is suitable for interactive video communication. An experimental study based on actual Internet transmission traces representing various network conditions shows that dynamic hybrid RESCU exhibits better error resilience and incurs much less bit overhead than existing error recovery techniques such as NEWPRED and Intra-H.261.
Comparative analysis of five XML query languages
Authors: Angela Bonifati, Stefano Ceri
Venue: ACM SIGMOD Record (2000)

XML is becoming the most relevant new standard for data representation and exchange on the WWW. Novel languages for extracting and restructuring the XML content have been proposed, some in the tradition of database query languages (i.e. SQL, OQL), others more closely inspired by XML. No standard for XML query language has yet been decided, but the discussion is ongoing within the World Wide Web Consortium and within many academic institutions and Internet-related major companies. We present a comparison of five, representative query languages for XML, highlighting their common features and differences.