ppxscal/embedding_network huggingface dataset:
Cross-level hierarchical high-level synthesis
Authors: O. Bringmann, W. Rosenstiel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a new approach to cross-level hierarchical high-level synthesis. A methodology is presented, that supports the efficient synthesis of hierarchical specified systems while preserving the hierarchical structure. After synthesis of each subsystem the determined component schedule and the synthesized RT-structure are added to its algorithmic specification. This provides an automatic selection of optimized complex components. Furthermore, the component schedule enables the sharing of unused subcomponents across different hierarchical levels of the design.
Regulation of electronic funds transfer: impact and legal issues
Authors: Ahmed S. Zaki
Venue: Communications of the ACM (1983)

This paper investigates the implications and impact of current legislation on the future of the electronic funds transfer systems (EFT). The relevant statutes are introduced and analyzed. Problem areas are discussed together with examples of court rulings. The investigation reveals that the regulations do not provide enough safeguards for the consumer and do not clear up the ambiguities from a combination of competing laws, regulations, and conflicting jurisdictions. Legislators, on both the national and state level, and federal and state governments need to cooperate more closely to produce uniform legislation that specifically addresses the current problems in an EFT environment. Courts need to realize the legislature's intent and the benefits that can be gained before ruling on the current issues.
An application of heuristic search methods to edge and contour detection
Authors: Alberto Martelli
Venue: Communications of the ACM (1976)

This paper presents a method for detecting edges and contours in noisy pictures. The properties of an edge are embedded in a figure of merit and the edge detection problem becomes the problem of minimizing the given figure of merit. This problem can be represented as a shortest path problem on a graph and can be solved using well-known graph search algorithms. The relations between this representation of the minimization problem and a dynamic programming approach are discussed, showing that the graph search method can lead to substantial improvements in computing time. Moreover, if heuristic search methods are used, the computing time will depend on the amount of noise in the picture. Some experimental results are given; these show how various information about the shape of the contour of an object can be embedded in the figure of merit, thus allowing the extraction of contours from noisy pictures and the separation of touching objects.
A SIMSCRIPT-FORTRAN case study
Authors: Arla E. Weinert
Venue: Communications of the ACM (1967)

Two programs for a vehicle dispatching model, one written in 7040 SIMSCRIPT and the other in 7040 FORTRAN IV are compared. The comparison is made in terms of basic program design decisions, storage requirements, computer time used, and the ease of making changes. In the SIMSCRIPT program, the primary design considerations center around the choice of model variables, model changing events, and model testing. In the FORTRAN program, basic design problems relate to the representation of the passage of time, the allocation of storage, and the organization of input data. The comparison of these differently designed programs shows that the SIMSCRIPT program uses more computer storage and more computer time, but requires fewer program changes to introduce model revisions.
The ATSC data broadcast Standard
Authors: Regis J. Crinon, Edwin A. Heredia
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

The Advanced Television Systems Committee (ATSC) is about to complete its data broadcast standard. This specification will enable multimedia content providers to deliver applications using the broadband channels of digital television. This specification will also enable the integration of data based information technologies and television audio-visual services. The purpose of the paper is to provide a description of the most important principles making up the specification. More specifically, four components are presented: A collection of unidirectional delivery protocols, an application signaling framework for service discovery, an MPEG-2 Transport buffer model and finally, a Profile and Level-based classification of data services. The functionality provided by each of these components is reviewed.
An Optimal Allocation of Carry-Save-Adders in Arithmetic Circuits
Authors: Junhyung Um, Taewhan Kim
Venue: IEEE Transactions on Computers (2001)

Carry-save-adder (CSA) is one of the most widely used components for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocation of CSAs in arithmetic circuits. Namely, we present a polynomial time algorithm which finds an optimal-timing CSA allocation for a given arithmetic expression. We then extend our result for CSA allocation to the problem of optimizing arithmetic expressions across the boundary of design hierarchy by introducing a new concept, called auxiliary ports. Our algorithm can be used to carry out the CSA allocation step optimally and automatically and this can be done within the context of a standard RTL synthesis environment.
The quadratic quotient method: a hash code eliminating secondary clustering
Authors: James R. Bell
Venue: Communications of the ACM (1970)

Secondary clustering as a cause of hash code inefficiency is discussed, and a new hashing method based on its eliminiation is presented. Comparisons with previous methods are made both analytically and empirically.
A class of matrices to test inversion procedures
Authors: Randall E. Cline
Venue: Communications of the ACM (1964)

The test matrices given by M. L. Pei [Comm. ACM 5, 10 (Oct. 1962), 508] and R. D. Rodman [Comm. ACM 6, 9 (Sept. 1963, 515] are special cases of a general class of matrices with complex elements for which an explicit form of the inverse can be exhibited. This class of matrices is such that eigenvalues and a set of associated eigenvectors can also be obtained. Then not only inverses, but also eigenvalues of the Pei matrix given by W. S. Lasor [Comm. ACM 6, 3 (Mar. 1963), 102] and eigenvectors given by A. R. C. Newberry [Comm. ACM 6, 9 (Sept. 1963), 515], and eigenvalues of the Rodman matrix follow as special cases.
Interconnect characteristics of 2.5-D system integration scheme
Authors: Yangdong Deng, Wojciech P. Maly
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

Growing number of excessively long on-chip wires in modern monolithic ICs is a byproduct of growing chip size. To address this problem instead of placing all systems components in one layer (i.e. in 2-D space) one can use a stack of single layer monolithic ICs (called here a 2.5-D integrated IC). To assess the potential benefits of such a 2.5-D integration schema this paper compares wire length distributions, obtained for 2-D and 2.5-D implementations of benchmark circuits. In the assessment two newly developed floorplanning and placement tools were used. Significant reductions in both total wirelength and worst-case wirelength was observed for the systems implemented as 2.5-D ICs.
Weighted increment linear search for scatter tables
Authors: Fabrizio Luccio
Venue: Communications of the ACM (1972)

A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n = 2r. It allows full table searching, and practically eliminates primary clustering at a very low cost.
Hand eye coordination patterns in target selection
Authors: Barton A. Smith, Janet Ho, Wendy Ark, Shumin Zhai
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

In this paper, we describe the use of eye gaze tracking and trajectory analysis in the testing of the performance of input devices for cursor control in Graphical User Interfaces (GUIs). By closely studying the behavior of test subjects performing pointing tasks, we can gain a more detailed understanding of the device design factors that may influence the overall performance with these devices. Our Results show them are many patterns of hand eye coordination at the computer interface which differ from patterns found in direct hand pointing at physical targets (Byrne, Anderson, Douglass, Matessa, 1999).
The GRE advanced test in computer science
Authors: Richard H. Austing
Venue: Communications of the ACM (1977)

This report describes the Advanced Test in Computer Science which was recently introduced in the Graduate Record Examination Program. The GRE program is described in general, and, the events leading to the establishment of the Advanced Computer Science Test are discussed. Content specifications and their rationale are given. A set of sample questions is included.
The computation of constrained dynamical systems: Matching physical modeling with numerical methods
Authors: Bud Fox, Leslie Jennings, Albert Y. Zomaya
Venue: Computing in Science and Engineering (2001)

Researchers have investigated modeling and computation of constrained dynamical systems, but scientists and engineers sometimes overlook consistent matching of mathematical modeling and numerical methods. The authors use multibody system software to study off-highway vehicles, automobile and android crash simulation, and planetary ephemerides.
Computer programs for detecting and correcting spelling errors
Authors: James L. Peterson
Venue: Communications of the ACM (1980)

With the increase in word and text processing computer systems, programs which check and correct spelling will become more and more common. Peterson investigates the basic structure of several such existing programs and their approaches to solving the problems which arise when this type of program is created. The basic framework and background necessary to write a spelling checker or corrector are provided.
Metadata standards for data warehousing: open information model vs. common warehouse metadata
Authors: Thomas Vetterli, Anca Vaduva, Martin Staudt
Venue: ACM SIGMOD Record (2000)

Metadata has been identified as a key success factor in data warehouse projects. It captures all kinds of information necessary to analyse, design, build, use, and interpret the data warehouse contents. In order to spread the use of metadata, enable the interoperability between repositories, and tool integration within data warehousing architectures, a standard for metadata representation and exchange is needed. This paper considers two standards and compares them according to specific areas of interest within data warehousing. Despite their incontestable similarities, there are significant differences between the two standards which would make their unification difficult.
Semantic evaluation from left to right
Authors: Gregor V. Bochmann
Venue: Communications of the ACM (1976)

This paper describes attribute grammars and their use for the definition of programming languages and compilers; a formal definition of attribute grammars and a discussion of some of its important aspects are included. The paper concentrates on the evaluation of semantic attributes in a few passes from left to right over the derivation tree of a program. A condition for an attribute grammar is given which assures that the semantics of any program can be evaluated in a single pass over the derivation tree, and an algorithm is discussed which decides how many passes from left to right are in general necessary, given the attribute grammar. These notions are explained in terms of an example grammar which describes the scope rules of Algol 60. Practical questions, such as the relative efficiency of different evaluation schemes, and the ease of adapting the attribute grammar of a given programming language to the left-to-right evaluation scheme are discussed.
Smart pixel implementation of a 2-D parallel nucleic wavelet transform for mobile multimedia communications
Authors: A. M. Rassau, K. Eshraghian, H. Cheung, S. W. Lachowicz, T. C. B. Yu, W. A. Crossland, T. D. Wilkinson
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

A novel Smart Pixel Opto-VLSI architecture to implement a complete 2-D wavelet transform of real-time captured images is presented. The Smart Pixel architecture enables the realization of a highly parallel, compact, low power device capable of real-time capture, compression, decompression and display of images suitable for Mobile Multimedia Communication applications.
Structured online interactions: improving the decision-making of small discussion groups
Authors: Shelly Farnham, Harry R. Chesley, Debbie E. McGhee, Reena Kawal, Jennifer Landau
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

A quantitative research experiment was used to examine whether a group's computer-mediated decision-making could be improved by providing a scripted structure to the groups text chat discussion. The study compared a regular chat discussion to a scripted chat discussion using Lead Line, a program that allows people to add a layer of pre-authored structure to regular text chat. We found that groups were more likely to come to consensus in structured chat discussions. In addition, groups applied the structure they learned to subsequent regular chat sessions.
Computer preparation of a poetry concordance
Authors: James A. Painter
Venue: Communications of the ACM (1960)

A concordance is an alphabetical index of the words used by a major writer, or group of writers, showing each word in its context. It is one of the basic research tools for scholars in the Humanities. Concordances are very useful in studies of language, vocabulary, and the history of ideas in literature and philosophy. Use of a concordance is probably the only way to interpret critically, or sometimes even to understand, a symbolist writer. It can also be used to help determine the age or even the author of a piece of anonymous writing.
Monitoring Your UPS with apcupsd
Authors: Riccardo Facchetti
Venue: Linux Journal (2000)

We delve into the details of apcupsd, a program for monitoring and controlling APC UPSes.
Olfactory Classification via Interpoint Distance Analysis
Authors: Carey E. Priebe
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Detection of the presence of a single prespecified chemical analyte at low concentration in complex backgrounds is a difficult application for chemical sensors. This article considers a database of artificial nose observations designed specifically to allow for the investigation of chemical sensor data analysis performance on the problem of trichloroethylene (TCE) detection. We consider an approach to this application which uses an ensemble of subsample classifiers based on interpoint distances. Experimental results are presented indicating that our nonparametric methodology is a useful tool in olfactory classification.
Tridiagonalization by permutations
Authors: Norman E. Gibbs, William G. Poole,  Jr.
Venue: Communications of the ACM (1974)

Tridiagonalizing a matrix by similarity transformations is an important computational tool in numerical linear algebra. Consider the class of sparse matrices which can be tridiagonalized using only row and corresponding column permutations. The advantages of using such a transformation include the absence of round-off errors and improved computation time when compared with standard transformations. A graph-theoretic algorithm which examines an arbitrary n &times; n matrix and determines whether or not it can be permuted into tridiagonal form is given. The algorithm requires no arithmetic while the number of comparisons, the number of assignments, and the number of increments are linear in n. This compares very favorably with standard transformation methods. If the matrix is permutable into tridiagonal form, the algorithm gives the explicit tridiagonal form. Otherwise, early rejection will occur.
Triggered Updates for Temporal Consistency in Real-TimeDatabases
Authors: Quazi N. Ahmed, Susan V. Vrbsky
Venue: Real-Time Systems (2000)

A real-time database system has temporal consistency constraints in addition to timing constraints. The timing constraints require a transaction to be completed by a specified deadline, and the temporal consistency constraints require that temporal data read by a transaction be up-to-date. If a transaction reads out-of-date data, it will become temporally inconsistent. A real-time database system consists of different types of temporal data objects, including derived objects. The value of a derived object is computed from a set of other objects, known as the read-set of the derived object. The derived object may not always reflect the current state of its read-set; a derived object can become out-of-date even if its read-set is up-to-date. Any subsequent transaction reading the derived object will then become temporally inconsistent. In this case, in order to read up-to-date objects, a transaction will have to wait until some other transaction updates the out-of-date object. However, in doing so, the waiting transaction may miss its deadline, particularly if the update is not periodic but instead arrives randomly. We propose to update the outdated objects so that not only is the temporal consistency improved, but also the number of missed deadlines does not increase significantly, and as a result there is an overall improvement in the performance of the system. We propose, implement and study a novel approach, to be known as triggered updates, to improve temporal consistency in firm real-time database systems when updates are not periodic. We identify properties of triggered updates and explain how they work by giving both an intuitive and a probabilistic analysis. We present strategies for generating triggered updates, discuss their suitability in various contexts and perform a detailed simulation study to evaluate their performance. Results show that it is possible to improve temporal consistency without degrading the timeliness of real- time database systems to a great deal.
Automorphisms of Constant Weight Codes and of DivisibleDesigns
Authors: Ralph-Hardo Schulz, Antonino Giorgio Spera
Venue: Designs, Codes and Cryptography (2000)

We show that the automorphism group of a divisible design \cD is isomorphic to a subgroup H of index 1 or 2 in the automorphism group \Aut \cC(\cD) of the associated constant weight code. Only in very special cases H is not the full automorphism group.
Structure from Motion: Beyond the Epipolar Constraint
Authors: Tomáš Brodský, Cornelia Fermüller, Yiannis Aloimonos
Venue: International Journal of Computer Vision (2000)

The classic approach to structure from motion entails a clear separation between motion estimation and structure estimation and between two-dimensional (2D) and three-dimensional (3D) information. For the recovery of the rigid transformation between different views only 2D image measurements are used. To have available enough information, most existing techniques are based on the intermediate computation of optical flow which, however, poses a problem at the locations of depth discontinuities. If we knew where depth discontinuities were, we could (using a multitude of approaches based on smoothness constraints) accurately estimate flow values for image patches corresponding to smooth scene patches&semi; but to know the discontinuities requires solving the structure from motion problem first. This paper introduces a novel approach to structure from motion which addresses the processes of smoothing, 3D motion and structure estimation in a synergistic manner. It provides an algorithm for estimating the transformation between two views obtained by either a calibrated or uncalibrated camera. The results of the estimation are then utilized to perform a reconstruction of the scene from a short sequence of images.The technique is based on constraints on image derivatives which involve the 3D motion and shape of the scene, leading to a geometric and statistical estimation problem. The interaction between 3D motion and shape allows us to estimate the 3D motion while at the same time segmenting the scene. If we use a wrong 3D motion estimate to compute depth, we obtain a distorted version of the depth function. The distortion, however, is such that the worse the motion estimate, the more likely we are to obtain depth estimates that vary locally more than the correct ones. Since local variability of depth is due either to the existence of a discontinuity or to a wrong 3D motion estimate, being able to differentiate between these two cases provides the correct motion, which yields the &ldquo;least varying&rdquo; estimated depth as well as the image locations of scene discontinuities. We analyze the new constraints, show their relationship to the minimization of the epipolar constraint, and present experimental results using real image sequences that indicate the robustness of the method.
A graph-based framework for feature recognition
Authors: Sashikumar Venkataraman, Milind Sohoni, Vinay Kulkarni
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

This paper discusses a feature recognition system for recognizing User Defined Features (UDF). The feature recognizer uses a graph-based approach to represent and recognize features. An attributed face adjacency graph consisting of topological and geometric attributes is used to represent UDF's. The feature recognition step involves finding similar subgraphs in the part graph. The novelty of the framework lies in the usage of a rich set of attributes to recognize a wide range of features efficiently. A unique representation using graph grammars has also been developed to define family of features such as pockets with variable number of side faces. The feature recognizer also addresses many kinds of feature interactions by progressive suppression of the identified features. New techniques have been implemented for suppressing degenerate or virtual features. The feature recognizer also consists of a parameterization module to extract user-defined parameters from the recognized features.
Video card game: an augmented environment for user centred design discussions
Authors: Jacob Buur, Astrid Soendergaard
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

In User Centred Design, the integration of knowledge of users work practice, preferences etc. into the design process is crucial to success. For this reason, video recording has become a widespread tool for documenting user activities observed in field studies, usability tests and user workshops. To make sense of video recordings - though a rewarding experience - is time consuming and mostly left to experts. Even though developers may ask for expert advice on usability matters, chances are that they will not follow it, given the technical and commercial trade-offs in every project. In this paper we will argue that, to achieve user friendly products, working with user video should be an integral part of the activities of the design team, not a specialised task of experts. To support this, video must be made available as a resource in design discussions and developers must be allowed to form their own understanding and conclusions. This paper presents a technique for turning video into tangible arguments to support design teams work. Furthermore it discusses how this technique can be improved with Augmented Reality and presents an augmented prototype session.