ppxscal/embedding_network huggingface dataset:
A Direct Link Minimal Resource Allocation Network for Adaptive Noise Cancellation
Authors: Sun Yonghong, P. Saratchandran, N. Sundararajan
Venue: Neural Processing Letters (2000)

This paper presents a modification to the Minimal Resource Allocation Network (MRAN) of Yingwei et al. by introducing direct links from inputs to output and investigates its performance for noise cancellation problems. MRAN has the same structure as a Radial Basis Function network but uses a sequential learning algorithm that adds and prunes hidden neurons as input data is received sequentially so as to produce a parsimonious network. Earlier work by Sun Yonghong et al. has demonstrated the capability of MRAN to produce a compact network with excellent noise reduction properties. In this paper the capability of the direct link Minimal Resource Allocation Network (DMRAN) is evaluated by comparing it with MRAN on several nonlinear adaptive noise cancellation problems. The direct link MRAN uses the same learning algorithm as MRAN but with the introduction of direct links we are able to realise even smaller networks than MRAN with better noise reduction properties.
The treatment of data types in EL1
Authors: Ben Wegbreit
Venue: Communications of the ACM (1974)

In constructing a general purpose programming language, a key issue is providing a sufficient set of data types and associated operations in a manner that permits both natural problem-oriented notation and efficient implementation. The EL1 language contains a number of features specifically designed to simultaneously satisfy both requirements. The resulting treatment of data types includes provision for programmer-defined data types and generaic routines, programmer control over type conversion, and very flexible data type behavior, in a context that allows efficient compiled code and compact data representation.
Length of strings for a merge sort
Authors: Donald E. Knuth
Venue: Communications of the ACM (1963)

Detailed statistics are given on the length of maximal sorted strings which result from the first (internal sort) phase of a merge sort onto tapes. It is shown that the strings produced by an alternating method (i.e. one which produces ascending and descending strings alternately) tend to be only three-fourths as long as those in a method which produces only ascending strings, contrary to statements which have appeared previously in the literature. A slight modification of the read-backward polyphase merge algorithm is therefore suggested.
Analysis and optimization of thermal issues in high-performance VLSI
Authors: Kaustav Banerjee, Massoud Pedram, Amir H. Ajami
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

This paper provides an overview of various thermal issues in high-performance VLSI with especial attention to their implications for performance and reliability. More specifically, it examines the impact of thermal effects on both interconnect design and electromigration reliability and discusses their impact on the allowable current density limits. Furthermore, it also discusses how thermal and reliability constrained current density limits may conflict with those obtained through purely performance based criterion. Additionally, it is shown that chip level thermal effects can have a significant impact on large-scale circuit optimization techniques, including the clock-skew minimization scheme, and can influence other physical design problem formulations. Finally, high-current interconnect design rules for ESD and I/O circuits are also examined.
User performance with gaze contingent multiresolutional displays
Authors: Lester C. Loschky, George W. McConkie
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

One way to economize on bandwidth in single-user head-mounted displays is to put high-resolution information only where the user is currently looking. This paper summarizes results from a series of 6 studies investigating spatial, resolutional, and temporal parameters affecting perception and performance in such eye-contingent multi-resolutional displays. Based on the results of these studies, suggestions are made for the design of eye-contingent multi-resolutional displays.
On the numerical solution of an N-point boundary value problem for linear ordinary differential equations
Authors: James T. Day
Venue: Communications of the ACM (1965)

A method for the numerical solution of the n-point boundary value problem for homogeneous linear ordinary differential equations is developed. The method requires two Runge-Kutta integrations over the interval under consideration and the solution of a linear system of equations with n-1 unknowns.
Optimization of distributed, object-oriented systems
Authors: William J. Ray
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Object-Oriented (OO) computing is fast becoming the de-facto standard for software development. Distributed OO systems usually consist of object servers and client applications on a network of computers. Optimal deployment strategies for object servers change given deviations in object servers, client applications, operational missions, hardware modifications, and various other changes to the environment.
Training wheels in a user interface
Authors: John M. Carroll, Caroline Carrithers
Venue: Communications of the ACM (1984)

New users of high-function application systems can become frustrated and confused by the errors they make in the early stages of learning. A training interface for a commercial word processor was designed to make typical and troublesome error states &ldquo;unreachable,&rdquo; thus eliminating the sources of some new-user learning problems. Creating a training environment from the basic function of the system itself afforded substantially faster learning coupled with better learning achievement and better performance on a comprehension post-test. A control group spent almost a quarter of their time recovering from the error states that the training interface blocked off. We speculate on how this training strategy might be refined, and more generally, on how function should be organized in a user interface.
VLSI block placement using less flexibility first principles
Authors: Sheqin Dong, Xianlong Hong, Youliang Wu, Yizhou Lin, Jun Gu
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A deterministic algorithm for VLSI block placement was developed in this paper through human's accumulated experience in solving "packing" problem. Rectangle packing problem is just a simplified case of the polygon-shape stone plate packing problem that the ancient masons needed to face. Several "packing" principles derived from the so-called "less flexibility first" experience of the masons. A k-d tree data structure is used for manipulating the packed rectangles under the derived packing principles. Experiment results demonstrate that the algorithm is effective and promising in building block layout application.
Compact garbage collection tables
Authors: David Tarditi
Venue: ACM SIGPLAN Notices (2001)

Garbage collection tables for finding pointers on the stack can be represented in 20-25% of the space previously reported. Live pointer information is often the same at many call sites because there are few pointers live across most call sites. This allows live pointer information to be represented compactly by a small index into a table of descriptions of pointer locations. The mapping from program counter values to those small indexes can be represented compactly using several techniques. The techniques a assign numbers to call sites and use those numbers to index an array of small indexes. One technique is to represent an array of return addresses by using a two-level table with 16-bit off-sets. Another technique is to use a sparse array of return addresses and interpolate the exact number via disassembly of the executable code.
The logarithmic error and Newton's method for the square root
Authors: Richard F. King, David L. Phillips
Venue: Communications of the ACM (1969)

The problem of obtaining optimal starting values for the calculation of the square root using Newton's method is considered. It has been pointed out elsewhere that if relative error is used as the measure of goodness of fit, optimal results are not obtained when the inital approximation is a best fit. It is shown here that if, instead, the so-called logarithmic error is used, then a best initial fit is optimal for both types of error. Moreover, use of the logarithmic error appears to simplify the problem of determining the optimal initial approximation.
ACM 71: a suggestion
Authors: Walter M. Carlson
Venue: Communications of the ACM (1971)

This is being written on the day after the close of ACM 71 as I return to Europe for continuation of an interrupted vacation. Therefore, these remarks are going to be short, and they will not, of course, do justice to the results obtained from our annual meeting in Chicago.
Computer-made perspective movies as a scientific and communication tool
Authors: E. E. Zajac
Venue: Communications of the ACM (1964)

It is easy to program the basic transformation required for a perspective drawing. This fact plus the advent of high speed microfilm printers such as the General Dynamics Electronics S-C 4020 makes possible perspective movies as the direct output from a computer. The programming of such a movie is briefly described for studying the angular motions of a satellite containing an attitude control system. In the movie, a domino-shaped box represents the satellite and a sphere with circles of latitude and longitude represents the earth. The cost was approximately three to eight minutes of IBM 7090 time per one minute of movie.
An overview of the ISPL computer systems design
Authors: R. M. Balzer
Venue: Communications of the ACM (1973)

This paper explores the advantages of the concurrent design of the language, operating system, and machine (via microcode) to create an interactive programming laboratory. It describes the synergistic effect that the freedom to move and alter features from one of these domains to another has had on the design of this system (which has not been implemented). This freedom simplified both incremental compilation and the system's addressing structure, and centralized the communication mechanisms enabling the construction of hierarchical subsystems. It also suggested an important new concept for operating systems: separation of the scheduling from the maintenance functions in resource allocation. This separation enables incorporation of new scheduling algorithms (decision of what to do) without endangering the system integration (correctly performing the scheduling decisions).
A formal approach to component based development of synchronous programs
Authors: Partha S. Roop, A. Sowmya, S. Ramesh
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Synchronous languages may be used for specification and design of embedded systems. Assuming the availability of a library of synchronous programs, we propose a technique to enable reuse of these programs, via an algorithm for automatic matching of a design function to a program from the library. The algorithm, when successful, generates an interface which automatically adapts the program. The algorithm is based on a new simulation relation called synchronous forced simulation, which is shown to be necessary and sufficient for matching a given pair of function and program.
ADAM (Attrition Damage Assessment Model
Authors: B. A. Batchelder
Venue: Communications of the ACM (1961)

ADAM is a computer routine designed to do a Monte Carlo simulation of a one-sided air battle. ADAM requires as input plans for bombing missions (including targets) the initial condition of defense installations (missile sites, radar sites, and fighter bases) and bomber bases, and parameters determining aircraft characteristics and weapon effectiveness. Time is broken into short intervals (15 minutes as presently coded), and during each time interval ADAM carries out the action called for by the plans and computes the consequences, thus setting up a new set of conditions for the next time period. During this cycle the functions performed include: (1) flight following&mdash;the movement of aircraft is directed in accordance with the route specifications; fuel consumption, altitude, and distance traveled are computed; airborne operations such as refueling, air release of deception devices, the dropping of bombs, and communication of mission results are carried out; (2) attrition&mdash;radar detection of bombers and attacks by fighters and missiles are simulated; (3) targeting&mdash;designated ground zeros for bombs dropped over target are selected and the amount of information obtained by reconnaissance missions is determined; (4) damage&mdash;blast damage to bomber bases and defense installations is computed, as well as their restricted operation as a result of radioactive fallout from ground bursts. The output from ADAM consists of the final status of bomber bases and defense installations, a time history of all bombing missions, counters (these include such quantities as the number of aircraft killed by missiles or fighters, the number of bases and defense installations destroyed or rendered inoperable because of radiation), the actual ground zeros (from bomb drops at target points or attrited bombers), and the fighter engagements. A strike of 312 bombers against 71 bomber bases and 1158 defense installations takes about 15 minutes of 704 time.
Computer simulations of cardiac electrophysiology
Authors: John B. Pormann, Craig S. Henriquez
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

CardioWave is a modular system for simulating wavefront conduction in the heart. These simulations may be used to investigate the factors that generate and sustain life-threatening arrhythmias such as ventricular fibrillation. The user selects a set of modules which most closely reflects the simulation they are interested in and the simulator is built automatically. Thus, we do not present one monolithic simulator, but rather a simulator-generator which allows the researcher to make the trade-offs of complexity versus performance. The results presented here are from simulations run on an IBM SP parallel computer and a cluster of workstations. The performance numbers show excellent scalability up through 128 processors. With the larger memory of the parallel machines, we have been able to perform highly realistic simulations of the human atria. These simulations include realistic, 3-D geometries with inhomogeneity and anisotropy as well as highly complex membrane dynamics.
Reasoning about arrays
Authors: John C. Reynolds
Venue: Communications of the ACM (1979)

A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. The basic concepts include intervals and their partitions, functional restriction, images, pointwise extension of relations, ordering, single-point variation of functions, various equivalence relations for array values, and concatenation. The effectiveness of these ideas is illustrated by informal descriptions of algorithms for binary search and merging, and by a short formal proof.
Evaluating register file size in ASIP design
Authors: Manoj Kumar Jain, Lars Wehmeyer, Stefan Steinke, Peter Marwedel, M. Balakrishnan
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

Interest in synthesis of Application Specific Instruction Set Processors or ASIPs has increased considerably and a number of methodologies have been proposed for ASIP design. A key step in ASIP synthesis involves deciding architectural features based on application requirements and constraints. In this paper we observe the effect of changing register file size on the performance as well as power and energy consumption. Detailed data is generated and analyzed for a number of application programs. Results indicate that choice of an appropriate number of registers has a significant impact on performance.
A New Method for Mining Regression Classes in Large Data Sets
Authors: Yee Leung, Jiang-Hong Ma, Wen-Xiu Zhang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Extracting patterns and models of interest from large databases is attracting much attention in a variety of disciplines. Knowledge discovery in databases (KDD) and data mining (DM) are areas of common interest to researchers in machine learning, pattern recognition, statistics, artificial intelligence, and high performance computing. An effective and robust method, coined regression-class mixture decomposition (RCMD) method, is proposed in this paper for the mining of regression classes in large data sets, especially those contaminated by noise. A new concept, called ¿regression class¿ which is defined as a subset of the data set that is subject to a regression model, is proposed as a basic building block on which the mining process is based. A large data set is treated as a mixture population in which there are many such regression classes and others not accounted for by the regression models. Iterative and genetic-based algorithms for the optimization of the objective function in the RCMD method are also constructed. It is demonstrated that the RCMD method can resist a very large proportion of noisy data, identify each regression class, assign an inlier set of data points supporting each identified regression class, and determine the a priori unknown number of statistically valid models in the data set. Although the models are extracted sequentially, the final result is almost independent of the extraction order due to a novel dynamic classification strategy employed in the handling of overlapping regression classes. The effectiveness and robustness of the RCMD method are substantiated by a set of simulation experiments and a real-life application showing the way it can be used to fit mixed data to linear regression classes and nonlinear structures in various situations.
Revealing the realities of collaborative virtual reality
Authors: Mike Fraser, Tony Glover, Ivan Vaghi, Steve Benford, Chris Greenhalgh, Jon Hindmarsh
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

We look at differences between the experience of virtual environments and physical reality, and consider making the technical limitations which cause these differences 'visible', aiming to provide resources to enhance communication between users. Three causes of such discrepancies are considered to illustrate this idea: field-of-view; haptic feedback; and network delays. For each, we examine ways of revealing the limitations of the virtual world as resources to better understand the intricacies of system and co-user behaviour. These examples introduce a broader discussion of design issues involved in producing interfaces for day-to-day collaboration through virtual environments. Issues include: the application and activity undertaken through the virtual world; the ability to focus on the business at hand rather than the system in use; and extent of users' familiarity with application and system.
System design for usability
Authors: Richard A. Demers
Venue: Communications of the ACM (1981)

The factors underlying system design for usability are examined and the role and responsibilities of a usability committee described. Under the control of a usability committee, a balance between high levels of system function and usability was reached for the IBM System/38. The System/38 command language is presented to illustrate this balance.
Context-sensitive parsing
Authors: William A. Woods
Venue: Communications of the ACM (1970)

This paper presents a canonical form for context-sensitive derivations and a parsing algorithm which finds each context-sensitive analysis once and only once. The amount of memory required by the algorithm is essentially no more than that required to store a single complete derivation. In addition, a modified version of the basic algorithm is presented which blocks infinite analyses for grammars which contain loops. The algorithm is also compared with several previous parsers for context-sensitive grammars and general rewriting systems, and the difference between the two types of analyses is discussed. The algorithm appears to be complementary to an algorithm by S. Kuno in several respects, including the space-time trade-off and the degree of context dependence involved.
An olio of almost obscure programmers' products
Authors: Donald L. Shirer
Venue: Computing in Science and Engineering (2000)

With press releases arriving at an exponential rate, my "to be looked at" file is bulging and overflowing. Below are a few products, which fell out of the drawer the last time I opened it and seemed like a tasty menu of ingredients. But first, a short commercial. We are seeking volunteers for future reviews of statistical analysis programs as well as laboratory information systems. If you want to participate in either one, please contact me at donald.shirer@yale.edu. The more volunteers, the more we can cover. Now, on to the casserole.
Stereo Calibration from Rigid Motions
Authors: Radu Horaud, Gabriella Csurka, David Demirdjian
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

In this paper, we describe a method for calibrating a stereo pair of cameras using general or planar motions. The method consists of upgrading a 3D projective representation to affine and to Euclidean without any knowledge, neither about the motion parameters nor about the 3D layout. We investigate the algebraic properties relating projective representation to the plane at infinity and to the intrinsic camera parameters when the camera pair is considered as a moving rigid body. We show that all the computations can be carried out using standard linear resolutions techniques. An error analysis reveals the relative importance of the various steps of the calibration process: projective-to-affine and affine-to-metric upgrades. Extensive experiments performed with calibrated and natural data confirm the error analysis as well as the sensitivity study performed with simulated data.
Web caching using access statistics
Authors: Adam Meyerson, Kamesh Munagala, Serge Plotkin
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider the problem of caching web pages with the objective of minimizing latency of access. Demands for web domains/pages are computed using access statistics; the frequency with which these statistics change is considerably longer than the frequency of page requests. We model caches as being constrained by total size and total number of ports: each cache can handle only a limited request rate and can store only a limited number of domains (eg. modelling bounded update traffic). When the caches have fixed locations, we present a constant factor approximation to the optimum average latency while exceeding capacity constraints by a logarithmic factor. We demonstrate improved results in the special case where no replication of pages is allowed. In the alternate model where we are allowed to place our own caches in the network for a cost, we produce a constant approximation to the weighted sum of cost and average latency. Finally, we consider several other variants of the problem which might arise in practice.