ppxscal/embedding_network huggingface dataset:
CHIMAERA: a high-performance architecture with a tightly-coupled reconfigurable functional unit
Authors: Zhi Alex Ye, Andreas Moshovos, Scott Hauck, Prithviraj Banerjee
Venue: Proceedings of the 27th annual international symposium on Computer architecture (2000)

Reconfigurable hardware has the potential for significant performance improvements by providing support for application-specific operations. We report our experience with Chimaera, a prototype system that integrates a small and fast reconfigurable functional unit (RFU) into the pipeline of an aggressive, dynamically-scheduled superscalar processor. Chimaera is capable of performing 9-input/1-output operations on integer data. We discuss the Chimaera C compiler that automatically maps computations for execution in the RFU. Chimaera is capable of: (1) collapsing a set of instructions into RFU operations, (2) converting control-flow into RFU operations, and (3) supporting a more powerful fine-grain data-parallel model than that supported by current multimedia extension instruction sets (for integer operations). Using a set of multimedia and communication applications we show that even with simple optimizations, the Chimaera C compiler is able to map 22% of all instructions to the RFU on the average. A variety of computations are mapped into RFU operations ranging from as simple as add/sub-shift pairs to operations of more than 10 instructions including several branches. Timing experiments demonstrate that for a 4-way out-of-order superscalar processor Chimaera results in average performance improvements of 21%, assuming a very aggressive core processor design (most pessimistic RFU latency model) and communication overheads from and to the RFU.
Compus: visualization and analysis of structured documents for understanding social life in the 16th century
Authors: Jean-Daniel Fekete, Nicole Dufournaud
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

This article describes the Compus visualization system that assists in the exploration and analysis of structured document corpora encoded in XML. Compus has been developed for and applied to a corpus of 100 French manuscript letters of the 16th century, transcribed and encoded for scholarly analysis using the recommendations of the Text Encoding Initiative. By providing a synoptic visualization of a corpus and allowing for dynamic queries and structural transformations, Compus assists researchers in finding regularities or discrepancies, leading to a higher level analysis of historic source. Compus can be used with other richly encoded text corpora as well.
Practical considerations for passive reduction of RLC circuits
Authors: Altan Odabasioglu, Mustafa Celik, Lawrence T. Pileggi
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Krylov space methods initiated a new era for RLC circuit model order reduction. Although theoretically well-founded, these algorithms can fail to produce useful results for some types of circuits. In particular, controlling accuracy and ensuring passivity are required to fully utilize these algorithms in practice. In this paper we propose a methodology for passive reduction of RLC circuits based on extensions of PRIMA, that is both broad and practical. This work is made possible by uncovering the algebraic connections between this passive model order reduction algorithm and other Krylov space methods. In addition, a convergence criteria based on an error measure for PRIMA is presented as a first step towards intelligent order selection schemes. With these extensions and error criterion, examples demonstrate that accurate approximations are possible well into the RF frequency range even with expansions about s=0.
Performance of image and video processing with general-purpose processors and media ISA extensions
Authors: Parthasarathy Ranganathan, Sarita Adve, Norman P. Jouppi
Venue: Proceedings of the 26th annual international symposium on Computer architecture (1999)

This paper aims to provide a quantitative understanding of the performance of image and video processing applications on general-purpose processors, without and with media ISA extensions. We use detailed simulation of 12 benchmarks to study the effectiveness of current architectural features and identify future challenges for these workloads.Our results show that conventional techniques in current processors to enhance instruction-level parallelism (ILP) provide a factor of 2.3X to 4.2X performance improvement. The Sun VIS media ISA extensions provide an additional 1.1X to 4.2X performance improvement. The ILP features and media ISA extensions significantly reduce the CPU component of execution time, making 5 of the image processing benchmarks memory-bound.The memory behavior of our benchmarks is characterized by large working sets and streaming data accesses. Increasing the cache size has no impact on 8 of the benchmarks. The remaining benchmarks require relatively large cache sizes (dependent on the display sizes) to exploit data reuse, but derive less than 1.2X performance benefits with the larger caches. Software prefetching provides 1.4X to 2.5X performance improvement in the image processing benchmarks where memory is a significant problem. With the addition of software prefetching, all our benchmarks revert to being compute-bound.
Building self-contained websites on CD-ROM
Authors: John English
Venue: ACM SIGCSE Bulletin (1999)

The BURKS Project has for the past three years produced non-profit CD-ROMs of resources for students of Computer Science. Now in its third edition, BURKS is a self-contained website which incorporates a pre-installed web browser and which now spans a set of two CD-ROMs. This paper describes the techniques used to implement this product.
Comparison of Two Regimens of &beta;-Adrenergics in Acute Asthma
Authors: Michael F. McDermott, Isam Nasr, Robert J. Rydman, Marco Cordero, Linda M. Kampe, Rebecca Lewis, Lauren Portman, Jeffrey Wajda, Michael Macuga, Robert Buckley
Venue: Journal of Medical Systems (1999)

Background and Methods: Inhaled adrenergics and steroids are the main agents used in acute asthma. Dosing recommendations for adrenergics, while generally becoming more aggressive, lack prospective validation. A double blind, randomized trial of two regimens of nebulized metaproterenol was conducted in patients presenting to an Emergency Department with an acute asthma exacerbation. Asthmatics age 16&ndash;55, with no other cardio-pulmonary disease, presenting with peak expiratory flow rate (PEFR) <30% of predicted and greater than 80L/m were enrolled. All patients received 125 mg of methylprednisolone and theophylline, if needed, to reach therapeutic levels. The experimental group received 0.3 cc metaproterenol in 2.5 cc of saline at times 0, 20&Prime;, 40&Prime;, 1&prime;, 2&prime;, 3&prime;, 4&prime;, 5&prime;, 6&prime;, and 7&prime;. The control group received metaproterenol at times 0,1 hr, and hours 3, 5, and 7. Placebo was given to control group patients at 20&Prime;, 40&Prime;, 2&prime;, 4&prime;, and 6&prime;. PEFR and vital signs were measured 10 min after each treatment. Study end points included discharge upon reaching set criteria or admission if patients were not discharged following the hour 7 treatment.Results: Seventy one patients were enrolled, 40 in experimental group and 31 in the control group. The group characteristics did not differ at entry in any significant way, and the groups began with mean expected PEFR of 23.4% and 24.5%, respectively. There were no significant differences at any point in PEFR outcomes, time to discharge, or admission rate. The experimental group showed a greater increase in pulse rate and a reduced diastolic blood pressure at 20, 40 and 60 min. The experimental group had a 12- and 8-fold increase in the risk of a pulse rate >140 at 40 and 60 min, respectively. This group also had two moderate complications, both near the 60-minute mark. These were an induction of atrial fibrillation in one patient and ischemic electrocardiographic changes in another. Conclusion: Three treatments in the first hour, and hourly thereafter showed no benefit over treatments initially, at one hour, and every other hour in acute, moderate, or severe exacerbation of asthma. Side effects were markedly increased in the control group. Such dosing should not be recommended as routine therapy.
Combining constructive and equational geometric constraint-solving techniques
Authors: R. Joan-Arinyo, A. Soto-Riera
Venue: ACM Transactions on Graphics (TOG) (1999)

In the past few years, there has been a strong trend towards developing parametric, computer-aided design systems based on geometric constraint solving. An effective way to capture the design intent in these systems is to define relationships between geometric and technological variables. In general, geometric constraint solving including functional relationships requires a general approach and appropriate techniques to achieve the expected functional capabilities. This work reports on a hybrid method that combines two geometric constraint solving techniques: constructive and equational. The hybrid solver has the capability of managing functional relationships between dimension variables and variables representing conditions external to the geometric problem. The hybrid solver is described as a rewriting system and is shown to be correct.
Some Remarks on the Equivalence between 2D and 3D Classical Snakes and Geodesic Active Contours
Authors: Gilles Aubert, Laure Blanc-Féraud
Venue: International Journal of Computer Vision (1999)

Recently, Caselles et al. have shown the equivalence between a classical snake problem of Kass et al. and a geodesic active contour model. The PDE derived from the geodesic problem gives an evolution equation for active contours which is very powerfull for image segmentation since changes of topology are allowed using the level set implementation. However in Caselles&lsquo; paper the equivalence with classical snake is only shown for 2D images and 1D curves, by using concepts of Hamiltonian theory which have no meanings for active surfaces. This paper propose to examine the notion of equivalence and to revisite Caselles et al. arguments. Then a notion equivalence is introduced and shown for classical snakes and geodesic active contours in the 2D (active contour) and 3D (active surface) case.
Using Spectral Subtraction for Suppression of Noise in Speech Signals with Analog Integrated Circuits
Authors: Stanislav Gruden, Baldomir Zajc
Venue: Analog Integrated Circuits and Signal Processing (1999)

A new modification of the spectral subtraction algorithm is presented which enables operating entirely in the time domain and is thus suitable for realization in analog integrated circuits. The noise spectrum is obtained during speechless intervals and stored for spectral subtraction when speech is present in the signal. The frequency range of interest of the speech signal is divided into narrow frequency bands by means of a bank of band-pass filters. For each frequency band the noise model is realized as an auxiliary signal multiplied by a particular weight. A subsystem is presented that produces an output signal whose power is equal to the difference between the input signal power and the noise model power for each frequency channel, thereby realizing the spectral subtraction. Circuits to achieve the described operation are outlined. Finally, simulation results of the noise removal algorithm are shown in the form of a spectrogram and the results showing improvement in automatic speech recognition are given.
Frequency interleaving as a codesign scheduling paradigm
Authors: JoAnn M. Paul, Simon N. Peffers, Donald E. Thomas
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

Frequency interleaving is introduced as a means of conceptualizing and co-scheduling hardware and software behaviors so that software models with conceptually unbounded state and execution time are resolved with hardware resources. The novel mechanisms that result in frequency interleaving are a shared memory foundation for all system modeling (from gates to software-intensive subsystems) and de-coupled, but interrelated time- and state-interleaved scheduling domains. The result for system modeling is greater accommodation of software as a configuration paradigm that loads system resources, a greater accommodation of shared memory modeling, and a greater representation of software schedulers as a system architectural abstraction. The results for system co-simulation are a lessening of the dependence on discrete event simulation as a means of merging physical and non-physical models of computation, and a lessening of the need to partition a system as computation and communication too early in the design. We include an example demonstrating its implementation.
AQR-toolkit: an adaptive query routing middleware for distributed data intensive systems
Authors: Ling Liu, Calton Pu, David Buttler, Wei Han, Henrique Paques, Wei Tang
Venue: ACM SIGMOD Record (2000)

Query routing is an intelligent service that can direct query requests to appropriate servers that are capable of answering the queries. The goal of a query routing system is to provide efficient associative access to a large, heterogeneous, distributed collection of information providers by routing a user query to the most relevant information sources that can provide the best answer. Effective query routing not only minimizes the query response time and the overall processing cost, but also eliminates a lot of unnecessary communication overhead over the global networks and over the individual information sources.The AQR-Toolkit divides the query routing task into two cooperating processes: query refinement and source selection. It is well known that a broadly defined query inevitably produces many false positives. Query refinement provides mechanisms to help the user formulate queries that will return more useful results and that can be processed efficiently. As a complimentary process, source selection reduces false negatives by identifying and locating a set of relevant information providers from a large collection of available sources. By pruning irrelevant information sources, source selection also reduces the overhead of contacting the information servers that do not contribute to the answer of the query.The system architecture of AQR-Toolkit consists of a hierarchical network (a directed acyclic graph) with external information providers at the leaves and query routers as mediating nodes. The end-point information providers support query-based access to their documents. At a query router node, a user may browse and query the meta information about information providers registered at that query router or make use of the router's facilitates for query refinement and source selection.
The ARBAC97 model for role-based administration of roles
Authors: Ravi Sandhu, Venkata Bhamidipati, Qamar Munawer
Venue: ACM Transactions on Information and System Security (TISSEC) (1999)

In role-based access control (RBAC), permissions are associated with roles' and users are made members of roles, thereby acquiring the roles; permissions. RBAC's motivation is to simplify administration of authorizations. An appealing possibility is to use RBAC itself to manage RBAC, to further provide administrative convenience and scalability, especially in decentralizing administrative authority, responsibility, and chores. This paper describes the motivation, intuition, and formal definition of a new role-based model for RBAC administration. This model is called ARBAC97 (administrative RBAC '97) and has three components: URA97 (user-role assignment '97), RPA97 (permission-role assignment '97), and RRA97 (role-role assignment '97) dealing with different aspects of RBAC administration. URA97, PRA97, and an outline of RRA97 were defined in 1997, hence the designation given to the entire model. RRA97 was completed in 1998. ARBAC97 is described completely in this paper for the first time. We also discusses possible extensions of ARBAC97.
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
Authors: Alberto Caprara
Venue: SIAM Journal on Discrete Mathematics (1999)

We analyze the strong relationship among three combinatorial problems, namely, the problem of sorting a permutation by the minimum number of reversals (MIN-SBR), the problem of finding the maximum number of edge-disjoint alternating cycles in a breakpoint graph associated with a given permutation (MAX-ACD), and the problem of partitioning the edge set of an Eulerian graph into the maximum number of cycles (MAX-ECD). We first illustrate a nice characterization of breakpoint graphs, which leads to a linear-time algorithm for their recognition. This characterization is used to prove that MAX-ECD and MAX-ACD are equivalent, showing the latter to be NP-hard. We then describe a transformation from MAX-ACD to MIN-SBR, which is therefore shown to be NP-hard as well, answering an outstanding question which has been open for some years. Finally, we derive the worst-case performance of a well-known lower bound for MIN-SBR, obtained by solving MAX-ACD, discussing its implications on approximation algorithms for MIN-SBR.
On the Computation of Optical Flow using the 3-D GaborTransform
Authors: Todd R. Reed
Venue: Multidimensional Systems and Signal Processing (1998)

The motion of brightness patterns in an image sequence (optical flow) is most intuitively considered as a spatiotemporal phenomenon. It has been shown, however, that motion has a characteristic signature in the spatiotemporal-frequency (Fourier) domain. This fact can be exploited for the computation of optical flow. However, for cases which involve a number of regions in a sequence with different motions, as in scenes with one or more objects moving against a stationary or moving background, the global nature of the Fourier transform makes it unsuitable for this task. The signatures of the different motions cannot be resolved in the Fourier domain, nor associated with their respective regions in the image sequence. Local frequency representations provide a means to address this problem. In this paper, we consider the application of a 3-D version of the widely used Gabor transform to the computation of optical flow.
Automatic loop transformations and parallelization for Java
Authors: Pedro V. Artigas, Manish Gupta, Samuel P. Midkiff, José E. Moreira
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

From a software engineering perspective, the Java programming language provides an attractive platform for writing numerically intensive applications. A major drawback hampering its widespread adoption in this domain has been its poor performance on numerical codes. This paper describes a prototype Java compiler which demonstrates that it is possible to achieve performance levels approaching those of current state-of-the-art C, C++ and Fortran compilers on numerical codes. We describe a new transformation called alias versioning that takes advantage of the simplicity of pointers in Java. This transformation, combined with other techniques that we have developed, enables the compiler to perform high order loop transformations (for better data locality) and parallelization completely automatically. We believe that our compiler is the first to have such capabilities of optimizing numerical Java codes. We achieve, with Java, between 80 and 100% of the performance of highly optimized Fortran code in a variety of benchmarks. Furthermore, the automatic parallelization achieves speedups of up to 3.8 on four processors. Combining this compiler technology with packages containing the features expected by programmers of numerical applications would enable Java to become a serious contender for implementing new numerical applications.
Logical logging to extend recovery to new domains
Authors: David Lomet, Mark Tuttle
Venue: ACM SIGMOD Record (1999)

Recovery can be extended to new domains at reduced logging cost by exploiting &ldquo;logical&rdquo; log operations. During recovery, a logical log operation may read data values from any recoverable object, not solely from values on the log or from the updated object. Hence, we needn't log these values, a substantial saving. In [8], we developed a redo recovery theory that deals with general log operations and proved that the stable database remains recoverable when it is explained in terms of an installation graph. This graph was used to derived a write graph that determines a flush order for cached objects that ensures that the database remains recoverable. In this paper, we introduce a refined write graph that permits more flexible cache management that flushes smaller sets of objects. Using this write graph, we show how: (i) the cache manager can inject its own operations to break up atomic flush sets; and (ii) the recovery process can avoid redoing operations whose effects aren't needed by exploiting generalized recovery LSNs. These advances permit more cost-effective recovery for, e.g., files and applications.
Problems and Our Solutions for Implementing Telemedicine Systems
Authors: Isao Nakajima, Yuhwsuke Sawada, Tsukasa Ashihara, Yoshihiro Takashima
Venue: Journal of Medical Systems (1999)

There are several problems on the practical use of telemedicine, for example, the difficulties involved in promoting communication between medical facilities, uncooperative clinicians, and the absence of high-speed circuits and high-resolution CRT. From the Japanese point of view, we suggest ways to resolve these problems. We will analyze and propose scenarios for realizing successful communications among medical institutions, medical communication and its characteristics, barriers to the promotion of communications among medical institutions, second-opinion centers, and separate satellites and separate circuits. We also mention the World Wide Web for teleconsultation, provision of assistance to people with data handicaps via a communications satellite, and assistance to programs designed for training telemedicine specialists. Using a communication satellite, we offer programs that explain preventive medicine, support activities for nursing at home, explain the risks of fast food, and support activities for the handicapped and women in a simple manner to computer illiterates.
A Nonlinear Noise-Shaping Delta-Sigma Modulator with On-Chip Reinforcement Learning^{*}
Authors: Gert Cauwenberghs
Venue: Analog Integrated Circuits and Signal Processing (1999)

The stability and quality of noise shaping is a concern in the design of higher-order delta-sigma modulators for oversampled analog-to-digital conversion. We reformulate noise-shaping modulation alternatively as a nonlinear control problem, where the objective is to find the binary modulation sequence that minimizes signal swing in a cascade of integrators operating on the difference between the input signal and the modulation sequence. Reinforcement learning is used to adaptively optimize a nonlinear neural classifier, which outputs modulation bits from the values of the input signal and integration state variables. Analogous to the pole balancing control problem, a punishment signal triggers learning whenever any of the integrators saturate. Experimental results obtained from a VLSI modulator with integrated classifier, trained to produce stable noise shaping modulation of orders one and two, are presented. The classifier contains an array of 64 locally tuned, binary address-encoded neurons and is trained on-chip with a variant on reinforcement learning.