ppxscal/embedding_network huggingface dataset:
Interconnect pipelining in a throughput-intensive FPGA architecture
Authors: Amit Singh, Arindam Mukherjee, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

Wave-steering is a new design methodology that realizes high throughput circuits by embedding layout friendly synthesized structures in silicon. In the wave-steering design methodology, cirðcuits inherently utilize latches. Inside the synthesized structures they are used for signal skewing, and on the interconnects to guarðantee the correct arrival times at the inputs. Recently, we proposed a novel high-throughput FPGA architecture based on the wave-steering design principle to handle throughput-intensive applicaðtions. Previously our work was focussed mainly on the Logic Block (LB) design. In this paper we discuss a pipelined interconðnect scheme to support the strict timing requirements that is necesðsitated by the wave-steered design style. We characterize designs that best fit the new architecture and show that as technology scales down towards deep submicron (DSM), this FPGA fabric shows an increasing throughput performance.
SISAL: A Safe and Efficient Language for Numerical Calculations
Authors: D. J. Raymond
Venue: Linux Journal (2000)

The benefits of SISAL and a call for action.
Vertex Operators for Standard Bases of the Symmetric Functions
Authors: Mike Zabrocki
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

We present formulas for operators which add a row or a column to the partition indexing the power, monomial, forgotten, Schur, homogeneous and elementary symmetric functions. As an application of these operators we show that the operator that adds a column to the Schur unctions can be used to calculate a formula for the number of pairs of standard tableaux the same shape and height less than or equal to a fixed i>k.
A simply extended and modified batch environment graphical system (SEMBEGS)
Authors: J. W. Wendorf
Venue: Communications of the ACM (1978)

SEMBEGS is a complete batch environment graphical system containing components for handling graphical data files, for displaying the contents of these files on a variety of graphical hardware, and for performing graphical batch input operations. SEMBEGS is easy to extend and modify to meet the growing needs of a large batch environment, and is even extendable to a fully interactive system. The paper presents the conceptual view of graphics leading to the design of SEMBEGS and outlines the major components of the system. The design of SEMBEGS is founded upon the basic assumption that the true aim of computer graphics is to describe graphical entities, rather than, as commonly held, to provide graphical input and output functional capabilities. SEMBEGS is built around a Basic Graphical Data Management System (BAGDAMS) which provides a common means of communicating the descriptions of graphical entities between the various components of SEMBEGS. BAGDAMS provides facilities for storing, retrieving, and manipulating the descriptions of graphical entities provided by, and received by application programs, graphics packages, and graphical devices.
MPICH-GQ: quality-of-service for message passing programs
Authors: Alain J. Roy, Ian Foster, William Gropp, Brian Toonen, Nicholas Karonis, Volker Sander
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Parallel programmers typically assume that all resources required for a program's execution are dedicated to that purpose. However, in local and wide area networks, contention for shared networks, CPUs, and I/O systems can result in significant variations in availability, with consequent adverse effects on overall performance. We describe a new message-passing architecture, MPICH-GQ, that uses quality of service (QoS) mechanisms to manage contention and hence improve performance of message passing interface (MPI) applications. MPICH-GQ combines new QoS specification, traffic shaping, QoS reservation, and QoS implementation techniques to deliver QoS capabilities to the high-bandwidth bursty flows, complex structures, and reliable protocols used in high-performance applications-characteristics very different from the low-bandwidth, constant bit-rate media flows and unreliable protocols for which QoS mechanisms were designed. Results obtained on a differentiated services testbed demonstrate our ability to maintain application performance in the face of heavy network contention.
High Bandwidth On-Chip Cache Design
Authors: Kenneth M. Wilson, Kunle Olukotun
Venue: IEEE Transactions on Computers (2001)

In this paper, we evaluate the performance of high bandwidth cache organizations employing multiple cache ports, multiple cycle hit times, and cache port efficiency enhancements, such as load all and line buffer, to find the organization that provides the best processor performance. Using a dynamic superscalar processor running realistic benchmarks that include operating system references, we use execution time to measure processor performance. When the cache is limited to a single cache port without enhancements, we find that two cache ports increase processor performance by 25 percent. With the addition of line buffer and load all to a single ported cache, the processor achieves 91 percent of the performance of the same processor containing a cache with two ports. When the processor is not limited to a single cache port, the results show that a large dual-ported multicycle pipelined SRAM cache with a line buffer maximizes processor performance. A large pipelined cache provides both a low miss rate and a high CPU clock frequency. Dual-porting the cache and using a line buffer provide the bandwidth needed by a dynamic superscalar processor. The line buffer makes the pipelined dual-ported cache the best option by increasing cache port bandwidth and hiding cache latency.
Configuring role-based access control to enforce mandatory and discretionary access control policies
Authors: Sylvia Osborn, Ravi Sandhu, Qamar Munawer
Venue: ACM Transactions on Information and System Security (TISSEC) (2000)

Access control models have traditionally included mandatory access control (or lattice-based access control) and discretionary access control. Subsequently, role-based access control has been introduced, along with claims that its mechanisms are general enough to simulate the traditional methods. In this paper we provide systematic constructions for various common forms of both of the traditional access control paradigms using the role-based access control (RBAC) models of Sandhu et al., commonly called RBAC96. We see that all of the features of the RBAC96 model are required, and that although for the manatory access control simulation, only one administrative role needs to be assumed, for the discretionary access control simulations, a complex set of administrative roles is required.
Loop Transformations for Architectures with Partitioned Register Banks
Authors: Xianglong Huang, Steve Carr, Philip Sweany
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

Embedded systems require maximum performance from a processor within significant constraints in power consumption and chip cost. Using software pipelining, processors can often exploit considerable instruction-level parallelism (ILP), and thus significantly improve performance, at the cost of substantially increasing register requirements. These increasing register requirements, however, make it difficult to build a high-performance embedded processor with a single, multi-ported register file while maintaining clock speed and limiting power consumption. Some digital signal processors, such as the TI C6x, reduce the number of ports required for a register bank by partitioning the register bank into multiple banks. Disjoint subsets of functional units are directly connected to one of the partitioned register banks. Each register bank and its associate functional units is called a cluster. Clustering reduces the number of ports needed on a per-bank basis, allowing an increased clock rate. However, execution speed can be hampered because of the potential need to copy &ldquo;non-local&rdquo; operands among register banks in order to make them available to the functional unit performing an operation. The task of the compiler is to both maximize parallelism and minimize the number of remote register accesses needed. Previous work has concentrated on methods to partition virtual registers amongst the target architecture's clusters. In this paper, we show how high-level loop transformations can enhance the partitioning obtained by low-level schemes. In our experiments, loop transformations improved software pipelining by 27% on a machine with 2 clusters, each having 1 floating-point and 1 integer register bank and 4 functional units. We also observed a 20% improvement on a similar machine with 4 clusters of 2 functional units. In fact, by performing the described loop transformations we were able to show improvements of greater than 10% over schedules (for un-transformed loops) generated with the unrealistic assumption of a single multi-ported register bank.
A single-inductor dual-output integrated DC/DC boost converter for variable voltage scheduling
Authors: Dongsheng Ma, Wing-Hung Ki, Chi-Ying Tsui, Philip K. T. Mok
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

An integrated boost DC/DC converter that provides two different outputs with a 1.8V input using only one inductor is presented. The converter works in discontinuous conduction mode and employs time division multiplexing in switching the inductor current to the two outputs. Synchronous rectification for high efficiency is implemented. Techniques for current sensing, inductor ringing suppression and controller design are discussed. At an oscillator frequency of 1MHz, the conversion efficiency reaches 90% at 350mW.
Viewing meeting captured by an omni-directional camera
Authors: Yong Rui, Anoop Gupta, J. J. Cadiz
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

One vision of future technology is the ability to easily and inexpensively capture any group meeting that occurs, store it, and make it available for people to view anytime and anywhere on the network. One barrier to achieving this vision has been the design of low-cost camera systems that can capture important aspects of the meeting without needing a human camera operator. A promising solution that has emerged recently is omni-directional cameras that can capture a 360-degree video of the entire meeting.The panoramic capability provided by these cameras raises both new opportunities and new issues for the interfaces provided for post-meeting viewers &mdash; for example, do we show all meeting participants all the time or do we just show the person who is speaking, how much control do we provide to the end-user in selecting the view, and will providing this control distract them from their task. These are not just user interface issues, they also raise tradeoffs for the client-server systems used to deliver such content. They impact how much data needs to be stored on the disk, what computation can be done on the server vs. the client, and how much bandwidth is needed. We report on a rototype system built using an omni-directional camera and results from user studies of interface preferences expressed by viewers.
A new policy for algorithms?
Authors: A. J. Perlis
Venue: Communications of the ACM (1966)

Debate is under way concerning the Algorithms section of the Communications. Specifically, there is considerable sentiment in favor of also publishing algorithms in languages other than ALGOL.
Transpupillary laser phototherapy of tumors and vascular anomalies of retina and choroid: theoretical approach and clinical implications
Authors: F. Fankhauser, H. Giger, P. Niederer, T. Seiler
Venue: Technology and Health Care (2000)

Background: Small retinal and choroidal tumors situated near the optic nerve or macula, such as retinoblastomas and malignant melanomas, as well as various other anomalies, in particular vascular malformations, may successfully be treated by photocoagulation. Model assumptions geared towards maximizing efficiency and minimizing undesirable side effects are forwarded, and the most important parameters subserving photothermal destruction, such as radiation field and thermal energy, analyzed. The influence exerted by physical traits of various tissues involved are also considered. Methods: The model approximations presented are based on classical radiation and absorption laws, as well as on the scattering properties of the various tissues implicated, these being considered as a function of wavelength and their relevance to the photodestructive task at hand. Particular attention is paid to the rate processes and reaction kinetics of irradiated proteins. Conclusions: Radiation sources emitting in the near-infrared range of the electromagnetic spectrum, such as the diode (810 nm) and the cw Nd:YAG (1064 nm) lasers, are optimal for the treatment of tumors and large, voluminous entities (such as Hippel-Lindau angiomas), owing to the good tissue penetration properties of their light. Those emitting in the shorter wavelength range, such as the argon ion (488 and 514 nm) and first harmonic -- mode Nd:YAG (532 nm) lasers, are not suitable for such tasks, but they are ideal for the destruction of fine sanguinous structures, within which their light is strongly absorbed but through which it penetrates poorly. For the treatment of large anomalous structures, a combinded short/long wavelength -- strategy should also be considered as a viable alternative. Such a "wavelength mixture" is emitted by the xenon high pressure lamp of the once renowned Meyer-Schwickerath light coagulator. The precision and safety of photothermal destruction methods depend, in the first approximation, upon the details of the pulse energy deposition (wavelength, pulse hight and duration, pulse dynamics, mode composition, focussing), the choice of which is determined by the optical and thermal constants of the irradiated tissues. Higher pulse energies will, of course, be more effective in destroying neoplastic cells, but the risk of producing undesired collateral heat damage will also increase concomitantly. Until we can ascertain the physical properties of the pathological tissues treated with certainty, we will hardly be able to achieve more than an approximation of an ideal treatment strategy. But with increasing developments in in vivo-diagnostic techniques, we expect that this goal will be attainable in the not too distant future.
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
Authors: Shankar Krishnan, Mark Foskey, Tim Culver, John Keyser, Dinesh Manocha
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitives like curves and surfaces. The algorithms designed for these problems make decisions based on signs of geometric predicates or on the roots of polynomials characterizing the problem. The reliability of the algorithm depends on the accurate evaluation of these signs and roots. In this paper, we present a {\em naive precision-driven computational model} to perform these computations reliably and demonstrate its effectiveness on a certain class of problems like sign of determinants with rational entries, boundary evaluation and curve arrangements. We also present a novel algorithm to compute all the roots of a univariate polynomial to any desired accuracy. The computational model along with the underlying number representation, precision-driven arithmetic and all the algorithms are implemented as part of a stand-alone software library, PRECISE.
Design and implementation of a diagnostic compiler for PL/I
Authors: Richard W. Conway, Thomas R. Wilcox
Venue: Communications of the ACM (1973)

PL/C is a compiler for a dialect for PL/I. The design objective was to provide a maximum degree of diagnostic assistance in a batch processing environment. For the most part this assistance is implicit and is provided automatically by the compiler. The most remarkable characteristic of PL/C is its perseverance&mdash;it completes translation of every program submitted and continues execution until a user-established error limit is reached. This requires that the compiler repair errors encountered during both translation and execution, and the design of PL/C is dominated by this consideration. PL/C also introduces several explicit user-controlled facilities for program testing. To accommodate these extensions to PL/I without abandoning compatibility with the IBM compiler, PL/C permits &ldquo;pseudo comments&rdquo;&mdash;constructions whose contents can optionally be considered either source text or comment. In spite of the diagnostic effort PL/C is a fast and efficient processor. It effectively demonstrates that compilers can provide better diagnostic assistance than is customarily offered, even when a sophisticated source language is employed, and that this assistance need not be prohibitively costly.
Information science: a computer-based degree that emphasizes data
Authors: William Mitchell
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

The author has participated in the development of a new baccalaureate degree program entitled Information Science. This paper reviews the motivation for starting a new branch of undergraduate computing that is distinct from Computer Science and describes the principles that have been incorporated in the new curriculum. Although the program is only two years old, its assessment and accreditation procedures are already under development.
A technique for reading gapless tapes makes electrocardiograph analysis feasible on the IBM 7090
Authors: Alice S. Maher
Venue: Communications of the ACM (1964)

To study arrhythmias and higher frequency components of the electrocardiogram, long series of patient heart cycles must be examined before valid comparison of different heart beats can be made. A technique is presented for the automatic analysis of long series heart cycles via a digital computer.
Weakly Hard Real-Time Systems
Authors: Guillem Bernat, Alan Burns, Albert Llamosi
Venue: IEEE Transactions on Computers (2001)

In a hard real-time system, it is assumed that no deadline is missed, whereas, in a soft or firm real-time system, deadlines can be missed, although this usually happens in a nonpredictable way. However, most hard real-time systems could miss some deadlines provided that it happens in a known and predictable way. Also, adding predictability on the pattern of missed deadlines for soft and firm real-time systems is desirable, for instance, to guarantee levels of quality of service. We introduce the concept of weakly hard real-time systems to model real-time systems that can tolerate a clearly specified degree of missed deadlines. For this purpose, we define four temporal constraints based on determining a maximum number of deadlines that can be missed during a window of time (a given number of invocations). This paper provides the theoretical analysis of the properties and relationships of these constraints. It also shows the exact conditions under which a constraint is harder to satisfy than another constraint. Finally, results on fixed priority scheduling and response-time schedulability tests for a wide range of process models are presented.
Rational Chebyshev approximations to the Bessel function integrals Kis(x)
Authors: I. Gargantini, T. Pomentale
Venue: Communications of the ACM (1964)

The second Remes algorithm is used to approximate the integrals Kis by rational functions. The related coefficients for the approximations of Ki1, Ki2, Ki3 are given for different precisions.
Closed Form Solutions for Reconstruction Via Complex Analysis
Authors: R. A. Hicks, D. Pettey, K. Daniilidis, R. Bajcsy
Venue: Journal of Mathematical Imaging and Vision (2000)

We address the problem of control-based recovery of robot pose and environmental lay-out. Panoramic sensors provide a 1D projection of characteristic features of a 2D operation map. Trajectories of these projections contain information about the position of a priori unknown landmarks in the environment. We introduce the notion of spatiotemporal signatures of projection trajectories. These signatures are global measures, characterized by considerably higher robustness with respect to noise and outliers than the commonly applied point correspondence. By modeling the 2D motion plane as the complex plane we show that by means of complex analysis the reconstruction problem can be reduced to a quadratic&mdash;or even linear in some cases&mdash;equation. The algorithm is tested in simulations and in a real experiment.
Region representation: boundary codes from quadtrees
Authors: Charles R. Dyer, Azriel Rosenfeld, Hanan Samet
Venue: Communications of the ACM (1980)

There has been recent interest in the use of quadtrees to represent regions in an image. It thus becomes desirable to develop efficient methods of conversion between quadtrees and other types of region representations. This paper presents an algorithm for converting from quadtrees to a simple class of boundary codes. The algorithm is shown to have an execution time proportional to the perimeter of the region.
Logic programming revisited: logic programs as inductive definitions
Authors: Maurice Bruynooghe, Victor Marek
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

Logic programming has been introduced as programming in the Horn clause subset of first-order logic. This view breaks down for the negation as failure inference rule. To overcome the problem, one line of research has been to view a logic program as a set of iff-definitions. A second approach was to identify a unique canonical, preferred, or intended model among the models of the program and to appeal to common sense to validate the choice of such model. Another line of research developed the view of logic programming as a nonmonotonic reasoning formalism strongly related to Default Logic and Autoepistemic Logic. These competing approaches have resulted in some confusion about the declarative meaning of logic programming. This paper investigates the problem and proposes an alternative epistemological foundation for the canonical model approach, which is not based on common sense but on a solid mathematical information principle. The thesis is developed that logic programming can be understood as a natural and general logic of inductive definitions. In particular, logic programs with negation represent nonmonotone inductive definitions. It is argued that this thesis results in an alternative justification of the well-founded model as the unique intended model of the logic program. In addition, it equips logic programs with an easy-to-comprehend meaning that corresponds very well with the intuitions of programmers.
On sharing secrets and Reed-Solomon codes
Authors: R. J. McEliece, D. V. Sarwate
Venue: Communications of the ACM (1981)

Shamir's scheme for sharing secrets is closely related to Reed-Solomon coding schemes. Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method.