ppxscal/embedding_network huggingface dataset:
3D RGB image compression for interactive applications
Authors: Chandrajit Bajaj, Insung Ihm, Sanghun Park
Venue: ACM Transactions on Graphics (TOG) (2001)

This paper presents a new 3D RGB image compression scheme designed for interactive real-time applications. In designing our compression method, we have compromised between two important goals: high compression ratio and fast random access ability, and have tried to minimize the overhead caused during run-time reconstruction. Our compression technique is suitable for applications wherein data are accessed in a somewhat unpredictable fashion, and real-time performance of decompression is necessary. The experimental results on three different kinds of 3D images from medical imaging, image-based rendering, and solid texture mapping suggest that the compression method can be used effectively in developing real-time applications that must handle large volume data, made of color samples taken in three- or higher-dimensional space.
Computer generation of gamma random variables
Authors: Pandu R. Tadikamalla
Venue: Communications of the ACM (1978)

A new method for generating random variables from the gamma distribution with nonintegral shape parameter &agr; is proposed. This method is similar to two other methods recently given by Wallace and Fishman. It is compared with Fishman's and Ahrens and Dieter's methods. The core storage requirements and programming effort for this method are similar to those of Fishman's method. The proposed method is the same as Fishman's method for 1 &le; &agr; < 2 and is faster than Fishman's method for 3 &le; &agr; &le; 19. Also, the proposed method is much simpler than Ahrens and Dieter's method and is faster for &agr; &le; 8.
Equivalence of Different Methods for Slant and Skew Corrections in Word Recognition Applications
Authors: Petr Slavík, Venu Govindaraju
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Normalization of slant and skew is often used in processing a word image before recognition. In this paper, we prove the theoretical equivalence of different methods for slant and skew corrections. In particular, we show that correcting first for skew by rotation and then for slant by a shear transformation in the horizontal direction is equivalent to first correcting for slant by a shear transformation in the horizontal direction and then for skew by a shear transformation in the vertical direction. Our proof can be easily modified to prove equivalence of other methods for correcting the slant and skew.
A model for automating file and program design in business application systems
Authors: Steven Alter
Venue: Communications of the ACM (1979)

This paper discusses a model for finding an efficient implementation of a business application system whose logical specifications have been determined in advance. The model views file and program design as a problem of systematically coordinating the configurations of datasets and computations. It uses a straightforward search technique to determine aggregations of computations, aggregations of datasets, device, organization, and key order for each dataset, key order for each computation, and access method for each dataset-computation pair. Although computational results are presented for a sample problem involving 54 computations and 49 datasets, the main point of the paper is that the underlying model works computationally and is simple enough to be adapted to many file design situations.
Architectural support for scalable speculative parallelization in shared-memory multiprocessors
Authors: Marcelo Cintra, José F. Martínez, Josep Torrellas
Venue: ACM SIGARCH Computer Architecture News (2000)

Speculative parallelization aggressively executes in parallel codes that cannot be fully parallelized by the compiler. Past proposals of hardware schemes have mostly focused on single-chip multiprocessors (CMPs), whose effectiveness is necessarily limited by their small size. Very few schemes have attempted this technique in the context of scalable shared-memory systems. In this paper, we present and evaluate a new hardware scheme for scalable speculative parallelization. This design needs relatively simple hardware and is efficiently integrated into a cache-coherent NUMA system. We have designed the scheme in a hierarchical manner that largely abstracts away the internals of the node. We effectively utilize a speculative CMP as the building block for our scheme. Simulations show that the architecture proposed delivers good speedups at a modest hardware cost. For a set of important non-analyzable scientific loops, we report average speedups of 4.2 for 16 processors. We show that support for per-word speculative state is required by our applications, or else the performance suffers greatly.
Reticle enhancement technology trends: resource and manufacturability implications for the implementation of physical designs
Authors: Warren Grobman, Robert Boone, Cece Philbin, Bob Jarvis
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

In this paper, we briefly describe the lithography developments known as RET (Resolution Enhancement Technologies),which include off-axis illumination in litho tools,Optical and Process Correction (OPC), and phase shifting masks (PSM). All of these techniques are adopted to allow ever smaller features to be reliably manufactured, and are being generally adopted in all manufacturing below 0.25 microns. However, their adoption also places certain restrictions on layouts. We explore these restrictions, and then provide suggestions for layout practices that will facilitate the use of these technologies, especially the generation of a clean target layout for use as input layers for photomask preparation, and the use of verification tools that use process simulation.
Significance arithmetic on a digital computer
Authors: Max Goldstein
Venue: Communications of the ACM (1963)

The 7090 at NYU has been modified to include a &ldquo;Significance Mode&rdquo; of operation which is intended to facilitate the identification of significant bits in the results of floating-point arithmetic operations. The manner in which floating-point arithmetic is handled in this mode is discussed. Several numerical experiments using this mode are described and comparisons are made with the ordinary &ldquo;normalized mode.&rdquo; Examples include power series evaluation, linear equations solution, determinant evaluation and matrix inversion.
A repository of knowledge about handling exceptions in multi-agent systems
Authors: Mark Klein
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

A critical challenge to creating effective agent- based systems is allowing them to operate effectively in environments where failures (' exceptions') can occur. An important barrier to achieving this has been the lack of systematized dissemination of exception handling techniques. This paper describes a semi- formal Web- accessible repository, built as an augmentation of the MIT Process Handbook, that is designed to enable learning about, adding to, and exploiting multiagent system exception handling expertise.
National Data Sources on the Care and Outcomes of Patients with Community Acquired Pneumonia
Authors: Michael J. Oinonen, Vivek Sansguiri, Mckenzie Smith
Venue: Journal of Medical Systems (2000)

Despite improved understanding and treatment of community acquired pneumonia (CAP), variations in clinical practice and patient outcomes still exists, resulting in excess healthcare dollars spent and decreased patient satisfaction. The use of treatment and outcomes research data can help providers improve their methods and standardize techniques to control costs and provide the best care for their patients. To better understand the utility and capabilities of this research, this article will compare several administrative and clinical databases. Two, data sources in particular, the EPI-Q&reg; Inc. CAP-Compare&trade; database and the University HealthSystem Consortium's (UHC) CAP Benchmarking Program contain clinical and utilization data specific to CAP. In addition there are several government and non-government sponsored data sources that include administrative data on many diagnosis including CAP. These include: Healthcare Benchmarking Systems International's EXPLORE&trade; database, the Center for Healthcare Industry Performance Studies database, the National Center for Health Statistics'&mdash;National Hospital Discharge Survey, and the Medicare Provider Analysis and Review data files.
Efficient Normal Basis Multipliers in Composite Fields
Authors: Sangho Oh, Chang Han Kim, Jongin Lim, Dong Hyeon Cheon
Venue: IEEE Transactions on Computers (2000)

It is well-known that a class of finite fields $GF(2^n)$ using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a bit-parallel multiplier.
Retaining IS talents in the new millennium: effects of socialization on IS professionals' role adjustment and organizational attachment
Authors: Ruth C. King, Weidong Xia
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

This study examined the effects of six organizational socialization tactics on new information systems (IS) professionals' role adjustment and organizational attachment. Data were collected from 187 newly hired IS professionals. The results showed that the six socialization tactics affected new IS professionals differently. Investiture tactics affected directly all the variables studied except role ambiguity. Serial tactics had a direct and positive effect on continuance commitment but a negative effect on intention to quit. Both sequential and collective tactics had direct effects on role ambiguity. Overall, the social aspects of the socialization process had the most significant effects on new IS professionals' role adjustment and organizational attachment. The results suggest that organizational socialization is an important strategy that needs to be considered in both IS research and practice.
State relaxation based subsequence removal for fast static compaction in sequential circuits
Authors: M. S. Hsiao, S. T. Chakradhar
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

We extend the subsequence removal technique to provide significantly higher static compaction for sequential circuits. We show that state relaxation techniques can be used to identify more or larger cycles in a test set. State relaxation creates more opportunities for subsequence removal and hence, results in better compaction. Relaxation of a state is possible since not all memory elements in a finite state machine have to be specified for a state transition. The proposed technique has several advantages: (1) test sets that could not be compacted by existing subsequence removal techniques can now be compacted, (2) the size of cycles in a test set can be significantly increased by state relaxation and removal of the larger sized cycles leads to better compaction, (3) only two fault simulation passes are required as compared to trial and re-trial methods that require multiple fault simulation passes, and (4) significantly higher compaction is achieved in short execution times as compared to known subsequence removal methods. Experiments on ISCAS89 sequential benchmark circuits and several synthesized circuits show that the proposed technique consistently results in significantly higher compaction in short execution times.
The beauty of simplicity
Authors: Kristiina Karvonen
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

In this paper we show how discussion about design quality or even usability is often discussion about aesthetics. First, we introduce some definitions of beauty in aesthetics. Then, we introduce how the beauty of the Web design affects the feeling of online trust, and bring forth observations about this design quality as an aesthetic notion. As a result, we present how simplicity and beauty affect the user's experience and interpretation of the design, and contemplate on how this perception may vary according to cultural background, age, and the amount of user experience. We will also envision some future trends for the aesthetics of user interfaces.
PHP4 and PostgreSQL: Building Serious Web Applications with Open-Source Software
Authors: Tim Perdue
Venue: Linux Journal (2000)

A walk-through of a simple web application to demonstrate the features of PHP and Postgres.
Levels of computer systems
Authors: Peter Bryant
Venue: Communications of the ACM (1966)

In building current computer systems, we tend to break them down into &ldquo;levels&rdquo; of control, command and communication; in using the system, we break our problems down correspondingly. The continued use of such a structure raises questions about its effects on the usefulness of future systems, particularly with regard to such trends as time sharing, parallel programming, and, eventually, systems which learn. In this essay some of these questions are posed, and the general attitude we must take in pursuing the problem further is discussed.
A simple technique for structured variable lookup
Authors: Geoffrey W. Gates, David A. Poplawski
Venue: Communications of the ACM (1973)

A simple technique for the symbol-table lookup of structured variables based on simple automata theory is presented. The technique offers a deterministic solution to a problem which is currently handled in a nondeterministic manner in PL/I and COBOL compilers.
On Periodic Billiard Trajectories in Obtuse Triangles
Authors: Lorenz Halbeisen, Norbert Hungerbühler
Venue: SIAM Review (2000)

In 1775, J. F. de Tuschis a Fagnano observed that in every acute triangle, the orthoptic triangle represents a periodic billiard trajectory, but to the present day it is not known whether or not in every obtuse triangle a periodic billiard trajectory exists. The limiting case of right triangles was settled in 1993 by F. Holt, who proved that all right triangles possess periodic trajectories. The same result had appeared independently in the Russian literature in 1991, namely in the work of G. A. Gal'perin, A. M. Stepin, and Y. B. Vorobets. The latter authors discovered in 1992 a class of obtuse triangles which contain particular periodic billiard paths. In this article, we review the above-mentioned results and some of the techniques used in the proofs and at the same time show for an extended class of obtuse triangles that they contain periodic billiard trajectories.
On the inevitable intertwining of specification and implementation
Authors: William Swartout, Robert Balzer
Venue: Communications of the ACM (1982)

Contrary to recent claims that specification should be completed before implementation begins, this paper presents two arguments that the two processes must be intertwined. First, limitations of available implementation technology may force a specification change. For example, deciding to implement a stack as an array (rather than as a linked list) may impose a fixed limit on the depth of the stack. Second, implementation choices may suggest augmentations to the original specification. For example, deciding to use an existing pattern-match routine to implement the search command in an editor may lead to incorporating some of the routine's features into the specification, such as the ability to include wild cards in the search key. This paper elaborates these points and illustrates how they arise in the specification of a controller for a package router.
A list-type storage technique for alphanumeric information
Authors: Henry J. Bowlden
Venue: Communications of the ACM (1963)

A method which is economic in terms of space and time is proposed for the storage and manipulation of character strings of arbitrary length in a fixed word-length computer. The method is illustrated in an application to Algol-type identifiers in an Algol-like block structure.
Neighborhood Information Dissemination in the Star Graph
Authors: Satoshi Fujita
Venue: IEEE Transactions on Computers (2000)

This paper studies two neighborhood information dissemination problems in the star graph (n-star): The neighborhood broadcast problem (NBP) is the problem of disseminating a message from the source vertex to all the vertices adjacent to the source vertex and the neighborhood gossiping problem (NGP) is the problem of exchanging messages among all neighboring vertices in the given graph. We propose two neighborhood information dissemination schemes in n-star under the single-port, half-duplex model: The first scheme completes a neighborhood broadcast in $1.5\log_2 n + O(1)$ time units and the second scheme completes a neighborhood gossiping in $2.88\log_2 n + o(\log n)$ time units. We also derive a lower bound on the neighborhood gossiping of $2.88\log_2 n + O(1)$ time units, which implies that the latter scheme is optimal with respect to the leading term.
An example in &ldquo;significant-digit&rdquo; arithmetic
Authors: R. H. Miller
Venue: Communications of the ACM (1964)

Different methods of handling the summing process for the geometric series are shown to give results indicating widely differing significances when carried out in a machine incorporating &ldquo;significant-digit&rdquo; arithmetic.
Absolute convergence: true trees from short sequences
Authors: Tandy Warnow, Bernard M. E. Moret, Katherine St. John
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since real-life sequences are of bounded length. However, of the half-dozen such methods proposed over the last few years, only two fulfill this condition without requiring knowledge of typically unknown parameters, such as the evolutionary rate(s) used in the model; this additional requirement severely limits the applicability of the methods. We say that methods that need such knowledge demonstrate relative fast convergence, since they rely upon an oracle. We focus on the class of methods that do not require such knowledge and thus demonstrate absolute fast convergence. We give a very general construction scheme that not only turns any relative fast-converging method into an absolute fast-converging one, but also turns any statistically consistent method that converges from sequence of length &Ogr;(e&Ogr;(diam(T))) into an absolute fast-converging method.
A mapping algorithm for computer-assisted exploration in the design of embedded systems
Authors: E. P. Mariatos, A. N. Birbas
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2001)

We present a technique for automatic exploration of architectural alternatives in the design of complex electronic embedded systems and systems-on-a-chip. The technique transforms the problem into a set of simple model-to-model operations and a mapping algorithm that becomes the core of the entire design process. The mapping algorithm is formulated as an assignment-type problem (ATP), which is, in turn, solved by a straightforward optimization method. The result is a design assistance tool, which is demonstrated through a telecommunication systems example.
Computational algorithms for product form queueing networks
Authors: K. Mani Chandy, Charles H. Sauer
Venue: Communications of the ACM (1980)

In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.
A futures market in computer time
Authors: I. E. Sutherland
Venue: Communications of the ACM (1968)

An auction method is described for allocating computer time that allows the price of computer time to fluctuate with the demand and the relative priority of users to be controlled so that more important projects get better access. This auction is free of the periodic fluctuation in computer use often associated with monthly schemes.
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
Authors: Randal E. Bryant, Steven German, Miroslav N. Velev
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as ordered Binary Decision Diagrams (BDDs) and Boolean satisfiability checkers to perform the verification. We can exploit characteristics of the formulas describing the verification conditions to greatly simplfy the propostional formulas generated. We identify a class of terms we call &ldquo;p-terms&rdquo; for which equality comparisons can only be used in monotonically positive formulas. By applying suitable abstractions to the hardware model, we can express the functionality of data values and instruction addresses flowing through an instruction pipeline with p-terms. A decision procedure can exploit the restricted uses of p-terms by considering only &ldquo;maximally diverse&rdquo; interpretations of the associated function symbols, where every function application yields a different value execept when constrainted by functional consistency. We present two methods to translate formulas in EUF into propositional logic. The first interprets the formula over a domain of fixed-length bit vectors and uses vectors of propositional variables to encode domain variables. The second generates formulas encoding the conditions under which pairs of terms have equal valuations, introducing propostional variables to encode the equality relations between pairs of terms. Both of these approaches can exploit maximal diversity to greatly reduce the number of propositional variables that need to be introduced and to reduce the overall formula sizes. We present experimental results demonstrating the efficiency of this approach when verifying pipelined processors using the method proposed by Burch and Dill. Exploiting positive equality allows us to overcome the experimental blow-up experienced previously when verifying microprocessors with load, store, and branch instructions.
Random limited-scan to improve random pattern testing of scan circuits
Authors: Irith Pomeranz
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

We propose a method of random pattern genration for at-speed testing of circuits with scan. The proposed method uses limited scan operations to achieve complete fault coverage. Under a limited scan operation, the circuit state is shifted by a number of positions which may be smaller than the number of state variables. Limited scan operations are inserted randomly to ensure that the complete test set can be generated by a random pattern generator with simple control logic.