ppxscal/embedding_network huggingface dataset:
A fully digital controlled off-chip IDDQ measurement unit
Authors: B. Straka, H. Manhaeve, J. Vanneuville, M. Svajda
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The paper describes a new Digital controlled Off-Chip IDDQ Measurement Unit (DOCIMU), which provides reliable precision and relatively fast measurements, even with a high capacitive load, while the Device Under Test (DUT) is unaffected. The maximal resolution is 50nA and the accurate measurement range is 1mA. Unlike other IDDQ monitors, the DOCIMU copes with external interference, as it needs no analogue pin to set the IDDQ limit and the noise at the VDD is eliminated via a special S/H feature. The DOCIMU is also a testable IDDQ monitor, which is another unique feature.
Optimizing threaded MPI execution on SMP clusters
Authors: Hong Tang, Tao Yang
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

Our previous work has shown that using threads to execute MPI programs can yield great performance gain on multiprogrammed shared-memory machines. This paper investigates the design and implementation of a thread-based MPI system on SMP clusters. Our study indicates that with a proper design for threaded MPI execution, both point-to-point and collective communication performance can be improved substantially, compared to a process-based MPI implementation in a cluster environment. Our contribution includes a hierarchy-aware and adaptive communication scheme for threaded MPI execution and a thread-safe network device abstraction that uses event-driven synchronization and provides separated collective and point-to-point communication channels. This paper describes the implementation of our design and illustrates its performance advantage on a Linux SMP cluster.
An improved index sequential access method using hashed overflow
Authors: James K. Mullin
Venue: Communications of the ACM (1972)

The Index Sequential Access Method (ISAM) is one of the most important file management systems used with moveable head disk devices. This study investigates the use of an unconventional method of treating overflow records. The method is to use hashing techniques to allocate space for such records. If certain conditions are satisfied, this is superior to the conventional ISAM method of chaining the overflow records via linked list techniques. These conditions are: long overflow chains with significant overflow; lack of tight disk space constraints; record keys which are small compared to the total record size; and significant use of the file in the index as opposed to the sequential mode. Using hashed overflow, the time to locate a record is dependent not on the total volume of overflow records as in conventional ISAM, but on the percentage use of space dedicated to overflow records.
Synthesis of communicating controllers for concurrent hardware/software systems
Authors: R. Niemann, P. Marwedel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Two main aspects in hardware/software co-design are hardware/software partitioning and co-synthesis. Most co-design approaches work only on one of these problems. In this paper, an approach coupling hard-ware/software partitioning and co-synthesis will be presented, working fully-automatic. The techniques have been integrated in the co-design tool COOL1 supporting the complete design flow from system specification to board-level implementation for multi-processor and multi-ASIC target architectures for data-flow dominated applications.
n-dimensional codes for detecting and correcting multiple errors0
Authors: Morris Rubinoff
Venue: Communications of the ACM (1961)

The paper introduces a new family of codes for detecting and correcting multiple errors in a binary-coded message. The message itself is arranged (conceptually) into a multidimensional rectangular array. The processes of encoding and error detection are based upon parity evaluations along prescribed dimensions of the array. Effectiveness of the codes is increased by introducing a &ldquo;system check bit&rdquo;, which is essentially a parity check on the other parity bits. Only three-dimensional codes are discussed in this paper, with parity evaluations along the horizontal, the vertical, and one main diagonal. However, the family of codes is not restricted to three dimensions, as evidenced by the discussion by Minnick and Ashenhurst on a similar multidimensional single-bit selection plan used for another purpose [6]. A four-dimensional code, correcting three and detecting four errors, has been developed; the extension to higher-dimensional codes with greater correction power is straightforward.
The composition of semantics in Algol 68
Authors: P. Branquart, J. Lewi, M. Sintzoff, P. L. Wodon
Venue: Communications of the ACM (1971)

The main features of Algol 68 are explained from a semantic point of view. It is shown how the language permits the composition of values and actions, i.e. ultimately programs, from a minimum set of primitives with a few fundamental recursive rules of composition. The associated syntax is briefly reviewed. An attempt has been made to obtain a structured and simple introduction to both Algol 68 and its orthogonal desgn.
Detection and Modeling of Buildings from Multiple Aerial Images
Authors: Sanjay Noronha, Ramakant Nevatia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Automatic detection and description of cultural features, such as buildings, from aerial images is becoming increasingly important for a number of applications. This task also offers an excellent domain for studying the general problems of scene segmentation, 3D inference, and shape description under highly challenging conditions. We describe a system that detects and constructs 3D models for rectilinear buildings with either flat or symmetric gable roofs from multiple aerial images; the multiple images, however, need not be stereo pairs (i.e., they may be acquired at different times). Hypotheses for rectangular roof components are generated by grouping lines in the images hierarchically; the hypotheses are verified by searching for presence of predicted walls and shadows. The hypothesis generation process combines the tasks of hierarchical grouping with matching at successive stages. Overlap and containment relations between 3D structures are analyzed to resolve conflicts. This system has been tested on a large number of real examples with good results, some of which are included in the paper along with their evaluations.
Certifications of algorithms 117 and 118 magic square (odd and even orders)2
Authors: K. M. Bosworth
Venue: Communications of the ACM (1963)

The proof of the non-existence of a phrase structure grammar for ALGOL 60 by Robert W. Floyd [Comm. ACM 5 (Sept. 1962)] depends on the assumption that a syntactically correct ALGOL program must be a block. The concept of &ldquo;program&rdquo; is defined ambiguously in the ALGOL Report, as pointed out by Naur [1], but it is generally accepted that a program is defined as a self-contained statement. If this definition is taken, Floyd's proof becomes incomplete in that it ignores the fact that the following are syntactically correct ALGOL programs: begin; end begin end &lpargt;dummy statement&rpargt;
The evaluation to the quality of coding a speech signal in vocoders systems (abstract only)
Authors: Alexander Tymchenko, Mohammod Abul Kashem
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

Signal-to-noise ration and amount frequent subrange a partition spectrum of speech signal vocoders of system is analyzed with the purpose deriving a minimum transfer of rate signal.
Impact of video frame rate on communicative behaviour in two and four party groups
Authors: Matthew Jackson, Anne H. Anderson, Rachel McEwan, Jim Mullin
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

There has been relatively little research on the impact of different levels of video quality on users of multimedia communication systems. This paper describes a study examining the impact of two levels of video frame rate on pairs and groups of four engaged on a design task, looking at one particular aspect of communication, namely reference. It was found that a low frame rate made speakers more communicatively cautious, using longer descriptions and more elaborations to refer to pictures used in the task, possibly as a result of being less certain that they had been understood. This only occurred in the two party groups despite a prediction that groups of four would be affected most by the frame rate manipulation. This study shows that video quality can have subtle effects on communication and that identical levels of quality may have different effects depending on the situation.
A case for network musical performance
Authors: John Lazzaro, John Wawrzynek
Venue: Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video (2001)

A Network Musical Performance (NMP) occurs when a group of musicians, located at different physical locations, interact over a network to perform as they would if located in the same room. In this paper, we present a case for NMP as a practical Internet application, and describe a method to ameliorate the effect of late and lost packets on NMP. We describe an NMP system that embodies this concept, that combines several existing standards (MIDI, MPEG 4 Structured Audio, RTP/AVP, and SIP) with a new RTP packetization for MIDI performance. We analyze NMP experiments performed on CalREN2 hosts on the UC Berkeley, Stanford, and Caltech campuses.
Computer generation of gamma random variates with non-integral shape parameters
Authors: N. D. Wallace
Venue: Communications of the ACM (1974)

When the shape parameter, &agr;, is integral, generating gamma random variables with a digital computer is straightforward. There is no simple method for generating gamma random variates with non-integral shape parameters. A common procedure is to approximately generate such random variables by use of the so-called probability switch method. Another procedure, which is exact, is due to J&ouml;hnk. This paper presents a rejection method for exactly generating gamma random variables when &agr; is greater than 1. The efficiency of the rejection method is shown to be better than the efficiency of J&ouml;hnk's method. The paper concludes that when &agr; is non-integral the following mix of procedures yields the best combination of accuracy and efficiency: (1) when &agr; is less than 1, use J&ouml;hnk's method; (2) when 1 is less than &agr; and &agr; is less than 5, use the rejection method; (3) when &agr; is greater than 5, use the probability switch method.
Anchor text mining for translation extraction of query terms
Authors: Wen-Hsiang Lu, Lee-Feng Chein, Hsi-Jian Lee
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

This paper presents an approach to automatically extracting the bilingual translations of many Web query terms through mining the Web anchor texts. Some preliminary experiments are conducted on using 109,416 Web pages containing both Chinese and English anchor texts in their in-links to extract Chinese translations of 200 English queries selected from popular query terms in Taiwan. It is found that the effective translations of 75% of the popular query terms can be extracted, in which 87.2% cannot be obtained in common translation dictionaries.
The swept surface of an elliptic cylinder
Authors: Stephen Mann, Sanjeev Bedi, David Roth
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

In this poster, we present a method for computing a piecewise linear approximation to the surface swept by a moving rotating elliptic cylinder. Our method is a generalization of the imprint point method we developed for computing points on a surface of revolution [1]. The method is based on on identifying grazing points on the surface of revolution at a sequence of positions, and for each position connecting the grazing points with a piecewise linear curve. A collection of grazing curves is joined to approximate the swept surface and stitched into a solid model. Previously this method has been tested on cylinders, toruses, and cones. We reduce the problem of finding grazing points on the elliptic cylinder to that of finding points on an ellipse by slicing the elliptic cylinder with planes perpendicular to the tool axis. The method for finding the grazing points an a circular slice of a surface of revolution works because the normals to the surface along each circle pass through the axis of revolution. This allowed us to express the direction of motion of a point on the surface as the sum of the motion of a point on the axis plus a rotation around that point on the axis. This simple method for finding grazing points fails for an elliptic cylinder because the normals of a slice of the elliptic cylinder do not pass through center of ellipse. Worse, in the case of a twisted cylinder, the normals to the surface do not lie in the plane of the elliptical slice. However, these problems are readily resolved by setting up a small system of equations that we can solve for the grazing points on an elliptic slice. We begin by solving the problem for the elliptic cylinder, after which we will show how to generalize the solution to the twisted elliptic cylinder.
Optimising student cognitive load in computer education
Authors: Juhani E. Tuovinen
Venue: Proceedings of the Australasian conference on Computing education (2000)

Cognitive Load Theory provides a coherent way to optimise students cognitive processing load during learning. A range of principles identified in this theory can be applied to improve student processing during learning computing content. These principles range from the goal free problem solving to worked examples, split-attention, redundancy and variability effects. However, these principles need to be applied strategically. In this paper the most important consideration for strategic planning of computer education, ranging from the content element interactivity, mental effort measurement to student prior knowledge, are organised into a set of instructional choices. These choices are summarised in a flow chart, which can be used in the educational planning, as a tool to help ensure the identified issues are considered in an optimal sequence.
ATTac-2000: an adaptive autonomous bidding agent
Authors: Peter Stone, Michael L. Littman, Satinder Singh, Michael Kearns
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The First Trading Agent Competition (TAC) was held from June 22 to July 8, 2000. TAC was designed to create a benchmark problem in the complex domain of e-marketplaces and to motivate researchers to apply unique approaches to a common task. This paper describes \attac, the first-place finisher in TAC. \attac\ uses a principled bidding strategy that includes several elements of {adaptivity\/}. In addition to the success at the competition, isolated empirical results are presented indicating the robustness and effectiveness of \attac's adaptive strategy.
Nonlinear regression and the solution of simultaneous equations
Authors: Robert M. Baer
Venue: Communications of the ACM (1962)

If one has a set of observables (z1, &middot;&middot;&middot; , zm) which are bound in a relation with certain parameters (a1, &middot;&middot;&middot; , an) by an equation &zgr;(z1, &middot;&middot;&middot; , a1, &middot;&middot;&middot;) = 0, one frequently has the problem of determining a set of values of the ai which minimizes the sum of squares of differences between observed and calculated values of a distinguished observable, say zm. If the solution of the above equation for zm, zm = &eegr;(z1, &middot;&middot;&middot; ; a1, &middot;&middot;&middot;) gives rise to a function &eegr; which is nonlinear in the ai, then one may rely on a version of Gaussian regression [1, 2] for an iteration scheme that converges to a minimizing set of values. It is shown here that this same minimization technique may be used for the solution of simultaneous (not necessarily linear) equations.
Generalized working sets for segment reference strings
Authors: Peter J. Denning, Donald R. Slutz
Venue: Communications of the ACM (1978)

The working-set concept is extended for programs that reference segments of different sizes. The generalized working-set policy (GWS) keeps as its resident set those segments whose retention costs do not exceed their retrieval costs. The GWS is a model for the entire class of demand-fetching memory policies that satisfy a resident-set inclusion property. A generalized optimal policy (GOPT) is also defined; at its operating points it minimizes aggregated retention and swapping costs. Special cases of the cost structure allow GWS and GOPT to simulate any known stack algorithm, the working set, and VMIN. Efficient procedures for computing demand curves showing swapping load as a function of memory usage are developed for GWS and GOPT policies. Empirical data from an actual system are included.
Efficient multiprogramming resource allocation and accounting
Authors: R. G. Hamlet
Venue: Communications of the ACM (1973)

Although sometimes thought of as only a component of time-sharing operation, multiprogramming can involve broader questions of resource allocation, since fairness is not required to meet a response criterion. In a multiprogrammed system, it may serve maximal resource use to be unfair, for example by holding an input/output channel idle for a program while it completes a small amount of processor usage, enabling further use of the channel. Several applications of this principle are given, and it is suggested that a multiprogramming executive might dynamically adjust its allocation algorithms to gain efficiency. Allocation of resources is closely connected to accounting for those resources, raising the problems of repeatability, minimal uncharged overhead, and relative weighting of charges for dependent resources. Since weightings may depend on allocation algorithms, these are not arbitrary accounting parameters. Often the only repeatable accounting is one which omits an extensive overhead; this overhead can be multiple-charged to all programs which benefit from it, so that in the worst case the overhead will be paid, and should multiprogramming prove efficient, overcharges will result. Multiprogramming turns on allocation of the memory resource essential to control of other resources. The general suggestions for allocation and accounting are applied to this question, and some details provided for the case of a monitor which controls a virtual-memory machine.
Parallel smoothed aggregation multigrid: aggregation strategies on massively parallel machines
Authors: Ray S. Tuminaro
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers and scientists wishing to solve linear systems. In this paper we consider parallelization of the smoothed aggregation multigrid method. Smoothed aggregation is one of the most promising algebraic multigrid methods. Therefore, developing parallel variants with both good convergence and efficiency properties is of great importance. However, parallelization is nontrivial due to the somewhat sequential aggregation (or grid coarsening) phase. In this paper, we discuss three different parallel aggregation algorithms and illustrate the advantages and disadvantages of each variant in terms of parallelism and convergence. Numerical results will be shown on the Intel Teraflop computer for some large problems coming from nontrivial codes: quasi-static electric potential simulation and a fluid flow calculation.
Another method of converting from hexadecimal to decimal
Authors: M. V. Kailas
Venue: Communications of the ACM (1970)

There is a simple paper-and-pencil method of converting arithmetic a hexadecimal number N to decimal.
Effects of ad hoc layer medium access mechanisms under TCP
Authors: Ken Tang, Mario Correa, Mario Gerla
Venue: Mobile Networks and Applications (2001)

Mobile computing is the way of the future, as evident by such initiatives as Bluetooth, Iceberg and HomeRF. However, for mobile computing to be successful, an obvious layer, the MAC layer, must be efficient in channel access and reservation . Therefore, in-dpeth understanding is needed of the wireless MAC layerif wireless computing is to takeoff. Many random access wireless MAC protocols have been proposed and even standardized. However, there has yet been an attempt to understand why certain designs are used and what makes certain protocols better than others. In this paper, we survey several popular, contemporary, wireless, random access MAC protocols and determine the effects behind the design choices of these protocols.
High-performance Java codes for computational fluid dynamics
Authors: Christopher Riley, Siddhartha Chatterjee, Rupak Biswas
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

The computational science community is reluctant to write large-scale computationally-intensive applications in Java due to concerns over Java's poor performance, despite the claimed software engineering advantages of its object-oriented features. Naive Java implementations of numerical algorithms can perform poorly compared to corresponding Fortran or C implementations. To achieve high performance, Java applications must be designed with good performance as a primary goal. This paper presents the object-oriented design and implementation of two real-world applications from the field of Computational Fluid Dynamics (CFD): a finite-volume fluid flow solver (LAURA, from NASA Langley Research Center), and an unstructured mesh adaptation algorithm (2D_TAG, from NASA Ames Research Center). This work builds on our previous experience with the design of high-performance numerical libraries in Java. We examine the performance of the applications using the currently available Java infrastructure and show that the Java version of the flow solver LAURA performs almost within a factor of 2 of the original procedural version. Our Java version of the mesh adaptation algorithm 2D_TAG performs within a factor of 1.5 of its original procedural version on certain platforms. Our results demonstrate that object-oriented software design principles are not necessarily inimical to high performance.
A new constructive root bound for algebraic expressions
Authors: Chen Li, Chee Yap
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Computing effective root bounds for constant algebraic expressions is a critical problem in the Exact Geometric Computation approach to robust geometric programs. Classical root bounds are often non-constructive. Recently, various authors have proposed bounding methods which might be called constructive root bounds. For the important class of radical expressions, Burnikel et al (BFMS) have provided a constructive root bound which, in the division-free case, is an improvement over previously known bounds and is essentially tight. In the presence of division, their bound requires a quadratic blowup in root bit-bound compared to the division-free case. We present a new constructive root bound that avoids this quadratic blowup and which is applicable to a more general class of algebraic expressions. This leads to dramatically better performance in some computations. We also give an improved version of the degree-measure bound from Mignotte and BFMS. We describe our implementation in the context of the Core Library, and report on some experimental results.