ppxscal/embedding_network huggingface dataset:
Note on generalization in experimental algorithmics
Authors: Naren Ramakrishnan, Raúl E. Valdés-Pérez
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

A recurring theme in mathematical software evaluation is the generalization of rankings of algorithms on test problems to build knowledge-based recommender systems for algorithm selection. A key issue is to profile algorithms in terms of the qualitative characteristics of benchmark problems. In this methodological note, we adapt a novel all-pairs algorithm for the profiling task; given performance rankings for m algorithms on n problem instances, each described with p features, identify a (minimal) subset of p that is useful for assessing the selective superiority of an algorithm over another, for all pairs of m algorithms. We show how techniques presented in the mathematical software literature are inadequate for such profiling purposes. In conclusion, we also address various statistical issues underlying the effective application of this technique.
Ukrainian computer terminology (abstract only)
Authors: Orest Kossak
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

The problems of the Ukrainian contemporary computer science terminology are considered.
VLSI floorplanning with boundary constraints based on corner block list
Authors: Yuchun Ma, Sheqin Dong, Xianiong Hong, Yici Cai, Chung-Kuan Cheng, Jun Gu
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In floorplanning of typical VLSI design, some modules are required to satisfy some placement constraints in the final packing. Boudary Constraint is one kind of those placement constraints to pack some modules along one of the four sides: on the left, on the right, at the bottom or at the top of the final floorplan. We implement the boundary constraint algorithm for general floorplan by extending the Corner Block List (CBL) - a new efficient topology representation for non-slicing floorplan. Our contribution is to find the necessary and sufficient characterization of the modules along the boundary represented by Corner Block List. So that we can check the boundary constraints by scanning the intermediate solutions in the linear time during the simulated annealing process and fix the corner block list in case the constraints are violated. The experiment results are demonstrated by several examples of MCNC benchmarks and the performance is remarkable.
Time-sharing and batch-processing: an experimental comparison of their values in a problem-solving situation
Authors: Michael M. Gold
Venue: Communications of the ACM (1969)

An experimental comparison of problem-solving using time-sharing and batch-processing computer systems conducted at MIT is described in this paper. This study is the first known attempt to evaluate two such systems for what may well be the predominant user population within the next decade&mdash;the professionals who, as nonprogrammers, are using the computer as an aid in decision-making and problem-solving rather than as a programming end in itself. Statistically and logically significant results indicate equal cost for usage of the two computer systems; however, a much higher level of performance is attained by time-sharing users. There are indications that significantly lower costs would have resulted if the time-sharing users had stopped work when they reached a performance level equal to that of the batch users. The users' speed of problem-solving and their attitudes made time-sharing the more favorable system.
A fast random number generator for IBM 360
Authors: Dominic S. Seraphin
Venue: Communications of the ACM (1969)

Marsaglia and Bray [1] recommend incorporating two-line random number generators directly into FORTRAN programs. One of the advantages of this is the time saved in avoiding linkage to and fro from a subroutine. Implicit in their FORTRAN routine for IBM 360 for Lehmer's multiplicative congruence method, namely; Uk+1 = &lgr;Uk (mod P), Xk+1 = Uk+1/P is the use of 232 as the value of modulus P.
The distribution of granule accesses made by database transactions
Authors: Annie W. Shum, Andrew M. Langer
Venue: Communications of the ACM (1982)

The problem of characterizing the number of granules (or blocks) accessed by a transaction is important in modeling the performance of database management systems and other applications. Different expressions for this quantity have appeared in the literature under different probabilistic assumptions. These expressions along with one new result are presented with a uniform notation and a clear statement of the assumptions underlying each. The partial order relating the predictions of the expected number of granules accessed is presented.
Scalar- and planar-valued curve fitting using splines under tension
Authors: A. K. Cline
Venue: Communications of the ACM (1974)

The spline under tension was introduced by Schweikert in an attempt to imitate cubic splines but avoid the spurious critical points they induce. The defining equations are presented here, together with an efficient method for determining the necessary parameters and computing the resultant spline. The standard scalar-valued curve fitting problem is discussed, as well as the fitting of open and closed curves in the plane. The use of these curves and the importance of the tension in the fitting of contour lines are mentioned as application.
CASPER: concurrent hardware-software co-synthesis of hard real-time aperiodic and periodic specifications of embedded system architectures
Authors: B. P. Dave, N. K. Jha
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Hardware-software co-synthesis of an embedded system requires mapping of its specifications into hardware and software modules such that its real-time and other constraints are met. Embedded system specifications are generally represented by acyclic task graphs. Many embedded system applications are characterized by aperiodic as well as periodic task graphs. Aperiodic task graphs can arrive for execution at any time and their resource requirements vary depending on how their constituent tasks and edges are allocated. Traditional approaches based on a fixed architecture coupled with slack stealing and/or on-line determination of how to serve aperiodic task graphs are not suitable for embedded systems with hard real-time constraints, since they cannot guarantee that such constraints would always be met. In this paper, we address the problem of concurrent co-synthesis of aperiodic and periodic specifications of embedded systems. We estimate the resource requirements of aperiodic task graphs and allocate execution slots on processing elements and communication links for executing them. Our approach guarantees that the deadlines of both aperiodic and periodic task graphs are always met. We have observed that simultaneous consideration of aperiodic task graphs while performing co-synthesis of periodic task graphs is vital for achieving superior results compared to the traditional slack stealing and dynamic scheduling approaches. To the best of our knowledge, this is the first co-synthesis algorithm which provides simultaneous support of periodic and aperiodic task graphs with hard real-time constraints. Application of the proposed algorithm to several examples from real-life telecom transport systems shows that up to 28% and 34% system cost savings are possible over co-synthesis algorithms which employ slack stealing and rate-monotonic scheduling, respectively.
Gadgets, Approximation, and Linear Programming
Authors: Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson
Venue: SIAM Journal on Computing (2000)

We present a linear programming-based method for finding "gadgets," i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in this method is a simple observation which limits the search space to a finite one. Using this new method we present a number of new, computer-constructed gadgets for several different reductions. This method also answers a question posed by Bellare, Goldreich, and Sudan [SIAM J. Comput., 27 (1998), pp. 804--915] of how to prove the optimality of gadgets: linear programming duality gives such proofs.The new gadgets, when combined with recent results of Hå stad [ Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 1--10], improve the known inapproximability results for MAX CUT and MAX DICUT, showing that approximating these problems to within factors of $16/17 + \epsilon$ and $12/13+ \epsilon,$ respectively, is NP-hard for every $\epsilon > 0$. Prior to this work, the best-known inapproximability thresholds for both problems were 71/72 (M. Bellare, O. Goldreich, and M. Sudan [ SIAM J. Comput., 27 (1998), pp. 804--915]). Without using the gadgets from this paper, the best possible hardness that would follow from Bellare, Goldreich, and Sudan and Hå{s}tad is $18/19$. We also use the gadgets to obtain an improved approximation algorithm for MAX3 SAT which guarantees an approximation ratio of .801. This improves upon the previous best bound (implicit from M. X. Goemans and D. P. Williamson [ J. ACM, 42 (1995), pp. 1115--1145]; U. Feige and M. X. Goemans [ Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995, pp. 182--189]) of .7704.
On a FEM--BEM Formulation for an Exterior Quasilinear Problem in the Plane
Authors: Salim Meddahi, María González, Pablo Pérez
Venue: SIAM Journal on Numerical Analysis (2000)

We use a version of the FEM--BEM method introduced by Costabel [ Boundary Elements IX, Vol. 1, C. A. Brebbia et al., eds., Springer-Verlag, 1987] and Han [ J. Comput. Math., 8 (1990), pp. 223--232] to discretize an exterior quasilinear problem. We provide error estimates for the Galerkin method and propose a fully discrete scheme based on simple quadrature formulas. Furthermore, we show that these numerical integration schemes preserve the optimal rates of convergence. Finally, we present results of numerical experiments involving our discretization method.
Learning image similarities and categories from content analysis and relevance feedback
Authors: Zijun Yang, C. -C. Jay Kuo
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

In this work, a scheme that learns image similarities and categories from relevance feedback is presented. First, we choose the most suitable features to describe images by content analysis and categorize each image by predicting its semantic meanings. During the retrieval process, users are allowed to confirm semantic classification of the query example and evaluate retrieval results with relevance feedback. By analyzing the feedback information, the system learns both image similarities and semantic meanings. In similarity learning, the retrieving results are refined by modifying the similarity metric. Semantic learning is performed by using the decision tree training algorithm.
High-level design for asynchronous logic
Authors: Ross Smith, Michiel Ligthart
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Asynchronous, self-timed, logic is often eschewed in digital design because of its ad-hoc methodologies and lack of available design tools. This paper describes a complete High Level Design flow for asynchronous circuits based on Register Transfer Level (RTL) VHDL using commercial simulation and synthesis tools. Contrary to previous asynchronous approaches, the proposed RTL methodology closely resembles familiar synchronous design styles.
Design issues in multimedia messaging for next generation wireless systems
Authors: Darin Nelson, S. Muthukrishnan
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

Current wireless systems allow simple messaging services such as one- or two-way text messaging using Short Messaging Service (SMS), paging and voicemail. Motivated by the convergence of messaging (eg., emails) with information services (eg., request for stock quotes), entertainment (eg., interactive games), commerce (eg., advertisements) etc. in the wireless space, emerging wireless telecommunication systems envisage messaging applications with much richer media involving audio, video, web and text. In this paper, we discuss various design issues that arise in multimedia messaging from a telecommunications carrier point of view. We present a simple system design that addresses many of these issues, a key challenge being data management of (shared) multimedia messaging content.
Sequential equivalence checking without state space traversal
Authors: C. A. J. van Eijk
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Because general algorithms for sequential equivalence checking require a state space traversal of the product machine, they are computationally expensive. In this paper, we present a new method for sequential equivalence checking which utilizes functionally equivalent signals to prove the equivalence of both circuits, thereby avoiding the state space traversal. The effectiveness of the proposed method is confirmed by experimental results on retimed and optimized ISCAS'89 benchmarks.
Chinese input with keyboard and eye-tracking: an anatomical study
Authors: Jingtao Wang, Shumin Zhai, Hui Su
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Chinese input presents unique challenges to the field of human computer interaction. This study provides an anatomical analysis of today's standard Chinese input process, which is based on pinyin, a phonetic spelling system in Roman characters. Through a combination of human performance modeling and experimentation, our study decomposed the Chinese input process into sub-tasks and found that choice reaction time and numeric keying, two component resulted from the large number of homophones in Chinese, were the major usability bottlenecks. Choice reaction alone took 36% of the total input time in our experiment. Numeric keying for multiple candidates selection tends to take the user's attention away from the computer visual screen. We designed and implemented the EASE (Eye Assisted Selection and Entry) system to help maintaining complete touch-typing experience without diverting visual (spacebar) and implicit eye-tracking to replace the numeric keystrokes. Our experiment showed that such a system could indeed work, even with today's imperfecteye-tracking technology.
A fast procedure for generating normal random variables
Authors: G. Marsaglia, M. D. MacLaren, T. A. Bray
Venue: Communications of the ACM (1964)

A technique for generating normally distributed random numbers is described. It is faster than those currently in general use and is readily applicable to both binary and decimal computers.
Language and Compiler Support for Adaptive Distributed Applications
Authors: Vikram Adve, Vinh Vi Lam, Brian Ensink
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

Many distributed applications have to meet their performance or quality-of-service goals in environments where available resources change contantly. Important classes of distributed applications (including distributed multimedia codes, applications for mobile devices, and computational grid codes) use runtime adaptation in order to achieve their goals. The adaptation behavior in these applications is usually programmed in ad hoc code that is directly incorporated into the base application, resulting in systems that are complex to develop, maintain, modify, and debug. Furthermore, it is virtually impossible to extract high-level information about adaptive behaviour using program analysis, even if there were compiler and runtime sytems that could exploit such information. The goal of our research is to develop compiler and programming language support to simplify the development and improve the performance of adaptive distribtued applications. We describe a simple set of language extensions for adaptive distributed applications, and discuss potential compiler techniqes to support such appliations. We also propose a task-graph-based framework that can be used to formalize the description of a wide range of adaptation operations.
Job turnover among MIS professionals: an exploratory study of employee turnover
Authors: Fred Niederman, Mary R. Sumner
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

The paper addresses the issue of IT worker turnover. It reports on a survey IT workers who graduated over the past decade (1990-1999) from Saint Louis University. Research questions target IT worker demographics, such as age and gender and job satisfaction, salary, job tasks, and opportunity factors for both prior and current employment. Results included ranking of different factors comprising job satisfaction (satisfaction with financial compensation was high and with fringe benefits was low), observation of significant differences between several satisfaction measures but no task measures between prior and current job, and observation of few correlations between specific tasks performed and salary levels.
First-order conditional logic for default reasoning revisited
Authors: Nir Friedman, Joseph Y. Halpern, Daphne Koller
Venue: ACM Transactions on Computational Logic (TOCL) (2000)

Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to confound statistical conditionals over the domain (such as &ldquo;most birds fly&rdquo;), and subjective conditionals over possible worlds (such as &ldquo;I believe that Tweety is unlikely to fly&rdquo;). We then address the issue of ascribing semantics to first-order conditional logic. As in the propositional case, there are many possible semantics. To study the problem in a coherent way, we use plausibility structures. These provide us with a general framework in which many of the standard approaches can be embedded. We show that while these standard approaches are all the same at the propositional level, they are significantly different in the context of a first-order language. Furthermore, we show that plausibilities provide the most natural extension of conditional logic to the first-order case:we provide a sound and complete axiomatization that contains only the KLM properties and standard axioms of first-order modal logic. We show that most of the other approaches have additional properties, which result in an inappropriate treatment of an infinitary version of the lottery paradox.
A Boolean matrix method for the computation of linear precedence functions
Authors: David F. Martin
Venue: Communications of the ACM (1972)

A modified version of Bell's Boolean matrix method for the computation of linear precedence functions associated with a conflict-free matrix of precedence relations is given. This algorithm not only detects when the precedence functions do not exist, but also provides an indication of why they do not exist, so that corrective action can be taken if possible. Necessary and sufficient conditions for the existence of precedence functions are given. The use of Boolean matrices to prove the existence of precedence functions associated with classes of conflict-free grammars is illustrated through an example.
An object-oriented job execution environment
Authors: Lance Smith, Rod Fatoohi
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

This is a project for developing a distributed job execution environment for highly iterative jobs. An iterative job is one where the same binary code is run hundreds of times with incremental changes in the input values for each run. An execution environment is a set of resources on a computing platform that can be made available to run the job and hold the output until it is collected. The goal is to design a complete, object-oriented scheduling system that will run a variety of jobs with minimal changes. Areas of code that are unique to one specific type of job are decoupled from the rest. The system allows for fine-grained job control, timely status notification and dynamic registration and deregistration of execution platforms depending on resources available. Several objected-oriented technologies are employed: Java, CORBA, UML, and software design patterns. The environment has been tested using a CFD code, INS2D.
Distributed projects tackle protein mystery
Authors: Keri Schreiner
Venue: Computing in Science and Engineering (2001)

A computing paradigm popularized by the search for life in outer space is now being directed at understanding life from the inside. Two recently launched programs--one independent, the other under the auspices of Stanford University--have developed SETI@home-like distributed computing programs that rely on lay participants' computing power to help them unlock the biological mystery of how proteins fold.
A unified DFT architecture for use with IEEE 1149.1 and VSIA/IEEE P1500 compliant test access controllers
Authors: Bulent I. Dervisoglu
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

This paper discusses some of the critical issues that may prevent IEEE P1500 from becoming an acceptable standard and offers some suggestions for their solution. In particular, the inadequacy of the proposed P1500 and the VSIA solutions in handling hierarchical implementations is addressed. Support for hierarchical implementations is seen as an essential feature in a test access methodology that is intended for use in System on a Chip (SoC) designs. The author is actively pursuing some of these solutions through the working groups.
Parallel hierarchical solvers and preconditioners for boundary element methods
Authors: Ananth Grama, Vipin Kumar, Ahmed Sameh
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

The method of moments is an important tool for solving boundary integral equations arising in a variety of applications. It transforms the physical problem into a dense linear system. Due to the large number of variables and the associated computational requirements, these systems are solved iteratively using methods such as GMRES, CG and its variants. The core operation of thes itertive solvers is the application of the system matrix to a vector. This requres O(n2) operations and memory using accurate dense methods. The computational complexity can be reduced to O(n log n) and the memory requirement to O(n) using hierarchical approximation techniques. The algorithmic speedup from approximation can be combined with parallelism to yield very fast dense solvers. In this paper, we present efficient parallel formulations of dense iterative solvers based on hierarchical approximations for solving the integral form of Laplace equation. We study the impact of various parameters on the accuracy and performance of the parallel solver. We present two preconditioning techniques for accelerating the convergence of the iterative solver. Thes techniques are based on an inner-outer scheme and a block diagonal scheme based on a truncated Green's function. We present detailed experimental results on up to 256 processors of a Cray T3D.