ppxscal/embedding_network huggingface dataset:
Law-governed interaction: a coordination and control mechanism for heterogeneous distributed systems
Authors: Naftaly H. Minsky, Victoria Ungureanu
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2000)

Software technology is undergoing a transition form monolithic systems, constructed according to a single overall design, into conglomerates of semiautonomous, heterogeneous, and independently designed subsystems, constructed and managed by different organizations, with little, if any, knowledge of each other. Among the problems inherent in such conglomerates, none is more serious than the difficulty to control the activities of the disparate agents operating in it, and the difficulty for such agents to coordinate their activities with each other. We argue that the nature of coordination and control required for such systems calls for the following principles to be satisfied: (1) coordination policies need to be enforced: (2) the enforcement needs to be decentralized; and (3) coordination policies need to be formulated explicitly&mdash;rather than being implicit in the code of the agents involved&mdash;and they should be enforced by means of a generic, broad spectrum mechanism; and (4) it should be possible to deploy and enforce a policy incrementally, without exacting any cost from agents and activities not subject to it. We describe a mechansim called law-governed interaction (LGI), currently implemented by the Moses toolkit, which has been designed to satisfy these principles. We show that LGI is at least as general as a conventional centralized coordination mechanism (CCM), and that it is more scalable, and generally more efficient, then CCM.
Monte Carlo debugging: a brief tutorial
Authors: R. Charles Bell
Venue: Communications of the ACM (1983)

Monte Carlo debugging, which has been relied upon for some applications at the author's data center, is briefly discussed with the presentation of some guidelines.
What is a code?
Authors: G. W. Patterson
Venue: Communications of the ACM (1960)

The etymology of the word code is most interesting. It seems evident that in its original form it has reference to the paginated format of a book as distinguished from the earlier scrolls. Books with leaves fastened together at a common edge were apparently used in Roman times to record compilations of laws, and this is the basis for the original meanings of code, as a systematic collection, compilation, or formulation of laws, principles, rules or regulations.
Analysis of a file addressing method
Authors: G. Schay,  Jr., W. G. Spruth
Venue: Communications of the ACM (1962)

This paper presents a new file addressing method based on the calculation of an address from the identification of a record. For large recirculating type files, it seems to be more advantageous than customary ones. The probability distribution of the displacement of records from their calculated address, which is one less than the number of probes required to address a record, is computed on the basis of a Markov chain model. For the reader not interested in the mathematics, the introduction and the summary should be sufficient.
Nanometer Technology Challenges for Test and Test Equipment
Authors: Wayne M. Needham
Venue: Computer (1999)

Designers can now place millions of transistors on a single chip and propagate a signal through them at speeds approaching one gigahertz. With all this progress on the design front, it's easy to overlook a simple fact: More complex designs also pose problems for manufacturing and test. The challenges are especially acute in test. Test costs traditionally rise as frequency, transistors, and pin counts increase. Without substantial changes in test technology, the billion-transistor ICs projected within the next 12 years could cost many times more to test than the 40-million-transistor microprocessors of today. Test costs today are already high. Large testers can cost up to $6 million, as each pin costs between $5,000 and $10,000. Current IC pin counts are in the hundreds. Nanometer designs are anticipated to have pin counts in the thousands. Manufacturers will continue to pay these high test equipment costs for some time because the cost of changing systems is even more staggering. Why are these costs so high and how are they affected by nanometer technologies? The authors answer these questions by looking to the defects that occur in semiconductor manufacturing. In looking at the future, the test community sees staggering challenges based on the predictions in The 1997 National Technology Roadmap for Semiconductors, including the development testers with accuracies of a few picoseconds.
The Influence of Strain Relaxation on the Electrical Properties of Submicron Si/SiGe Resonant-Tunneling Diodes
Authors: P. W. Lukey, J. Caro, T. Zijlstra, E. van der Drift, S. Radelaar
Venue: Analog Integrated Circuits and Signal Processing (2000)

Resonant tunneling devices (RTDs) and resonant tunneling transistors (RTTs) are possible building blocks with increased functionality of future microelectronic circuits. These quantum devices can be made in the Si/SiGe system, which is compatible with Si technology. We have fabricated Si/SiGe RTDs with submicron lateral dimensions and have studied their electrical properties. In particular, we have measured the size-dependence of these properties in p-type mesa-etched dots and wires. We find that the I-V characteristics can be strongly influenced by strain relaxation at the side walls of the heterostructure. Here we study this effect of strain relaxation on the quantum-well subbands. The lateral dimensions of the devices ranged from 10 &mu;m down to 230 nm. It was found that both the subband-edge energy and the kinetic energy associated with the in-plane motion of holes are strongly influenced by the size and shape of the device. This result is explained by analyzing the effect of strain relaxation on the valence band for the two geometries.
Strategy game programming projects
Authors: Timothy Huang
Venue: Journal of Computing Sciences in Colleges (2001)

In this paper, we show how programming projects centered around the design and construction of computer players for strategy games can play a meaningful role in the educational process, both in and out of the classroom. We describe several game-related projects undertaken by the author in a variety of pedagogical situations, including introductory and advanced courses as well as independent and collaborative research projects. These projects help students to understand and develop advanced data structures and algorithms, to manage and contribute to a large body of existing code, to learn how to work within a team, and to explore areas at the frontier of computer science research.
Software profiling for hot path prediction: less is more
Authors: Evelyn Duesterwald, Vasanth Bala
Venue: ACM SIGPLAN Notices (2000)

Recently, there has been a growing interest in exploiting profile information in adaptive systems such as just-in-time compilers, dynamic optimizers and, binary translators. In this paper, we show that sophisticated software profiling schemes that provide highly accurate information in an offline setting are ill-suited for these dynamic code generation systems. We experimentally demonstrate that hot path predictions must be made early in order to control the rising cost of missed opportunity that result from the prediction delay. We also show that existing sophisticated path profiling schemes, if used in an online setting, offer no prediction advantages over simpler schemes that exhibit much lower runtime overheads.Based on these observation we developed a new low-overhead software profiling scheme for hot path prediction. Using an abstract metric we compare our scheme to path profile based prediction and show that our scheme achieves comparable prediction quality. In our second set of experiments we include runtime overhead and evaluate the performance of our scheme in a realistic application: Dynamo, a dynamic optimization system. The results show that our prediction scheme clearly outperforms path profile based prediction and thus confirm that less profiling as exhibited in our scheme will actually lead to more effective hot path prediction.
Data Dependence Analysis of Assembly Code
Authors: Wolfram Amme, Peter Braun, François Thomasset, Eberhard Zehendner
Venue: International Journal of Parallel Programming (2000)

Determination of data dependences is a task typically performed with high-level language source code in today's optimizing and parallelizing compilers. Very little work has been done in the field of data dependence analysis on assembly language code, but this area will be of growing importance, e.g., for increasing instruction-level parallelism. A central element of a data dependence analysis in this case is a method for memory reference disambiguation which decides whether two memory operations may access (or definitely access) the same memory location. In this paper we describe a new approach for the determination of data dependences in assembly code. Our method is based on a sophisticated algorithm for symbolic value propagation, and it can derive value-based dependences between memory operations instead of just address-based dependences. We have integrated our method into the Salto system for assembly language optimization. Experimental results show that our approach greatly improves the precision of the dependence analysis in many cases.
OMEGA: a language and system for on-line monitoring of software-intensive processes
Authors: Sorana Cîmpan, Flavio Oquendo
Venue: ACM SIGSOFT Software Engineering Notes (2000)

This paper presents an environment for monitoring software-intensive processes: the Omega environment (Omega stands for On-line Monitoring Environment: General and Adaptable). The environment provides the language Omega/MDL (Monitoring Definition Language) for defining monitoring models as well as a mechanism for the execution of such models Omega/EM (Execution Mechanism). The executing monitoring models (i.e. monitoring systems), observe the subject process and detect deviations between it and an expected behavior, i.e. indicated by the process model instantiation. For monitoring modeling, Omega proposes a novel approach based on fuzzy logic. This approach allows to establish the level of conformance between the process enactment and the process model for different aspects of the process, like progress, cost, structure (order between activities), etc. The use of fuzzy logic enables the system to cope with uncertain and imprecise information.
Jigsaw: A Revolutionary Web Server for Linux
Authors: Ibrahim F. Haddad
Venue: Linux Journal (2000)

The design philosophy and essential features of the Jigsaw Web Server exposed.
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
Authors: Martin Skutella, Gerhard J. Woeginger
Venue: Mathematics of Operations Research (2000)

We consider the problem of scheduling a set ofn jobs onm identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the strong sense. The best approximation result known so far was a 1/2 (1 + 2)-approximation algorithm that has been derived by Kawaguchi and Kyan back in 1986. The contribution of this paper is a polynomial time approximation scheme for this setting, which settles a problem that was open for a long time. Moreover, our result constitutes the =rst known approximation scheme for a strongly NP-hard scheduling problem with minsum objective.
Statistical computations based upon algebraically specified models
Authors: J. E. Schlater, W. J. Hemmerle
Venue: Communications of the ACM (1966)

Based upon a machine-readable statistical model and related symbolic specifications, an efficient method of performing calculations for statistical models of a balanced complete nature is presented. Fixed, mixed, and random analysis of variance models are considered. A procedure for obtaining variance components and calculated F statistics for the model terms is included.
Evaluation, Strength, and Relevance of Variables of Boolean Functions
Authors: Peter L. Hammer, Alexander Kogan, Uriel G. Rothblum
Venue: SIAM Journal on Discrete Mathematics (2000)

Given a Boolean function f, we define the importance of a set S of variables by an expression measuring to what extent the variables in S determine the value of f. This "evaluation" uses a "constancy" measure which is assumed to be a real-valued convex function defined on [0,1]. In spite of the generality of the constancy measure, it is shown that any such evaluation is in strong agreement with the classical concept of the Winder-strength of variables of a monotone Boolean function. Further, we study a special class of evaluations called relevances, characterize completely the cases of extreme relevance value, relating the sets of maximum relevance to fictitious (dummy) variables and support sets, and establish a lower bound on the relevance of sets "containing" implicants or implicates of a Boolean function.
Polynomial root finding using iterated Eigenvalue computation
Authors: Steven Fortune
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

We analyze an iterative algorithm that approximates all roots of a univariate polynomial. The algorithm is based on (hardware) floating-point eigenvalue computation of a generalized companion matrix. With some assumptions, we show that it approximates the roots to floating-point accuracy within about log&rgr;/e X(P) iterations, where &isin; is the relative error of floating-point arithmetic, &rgr; is the relative separation of the roots, and X(P) is the condition number of the polynomial. Each iteration requires an n &times; n floating-point eigenvalue computation, n the polynomial degree, and evaluation of the polynomial to floating-point accuracy at n points. On some hard examples of ill-conditioned polynomials, e.g. high-degree Wilkinson polynomials, the algorithm is an order of magnitude faster than the best alternative.
A Simple Least-Squares Design of M-D IIR Filters with Fixed Separable Denominator Based on Multivariate Division Algorithm
Authors: Hiroshi Hasegawa, Isao Yamada, Kohichi Sakaniwa
Venue: Multidimensional Systems and Signal Processing (2000)

In this paper, we propose a simple algorithmic solution to the best approximation problem of finding the nearest multivariate rational function, with a fixed separable denominator polynomial, from a given multivariate polynomial, where the numerator polynomial is desired to minimize the integral of the squared error over the distinguished boundary of the unit polydisc. The proposed algorithm does not require any numerical integration or numerical root finding technique because this is realized based on the standard multivariate division algorithm. A simple observation of the proposed algorithm leads to an ideal membership problem characterizing the solution to the problem. A relation of this characterization and a multivariate generalization of the Walsh's Theorem is also discussed with another ideal membership problem derived by applying a corollary of the Hilbert Nullstellensatz to the Walsh's Theorem. Although the discussion to derive the latter ideal membership problem seems to be roundabout, such a characterization would be useful for further generalization, for example to some weighted least-squares approximation. Numerical examples demonstrate the practical applicability of the proposed method to design problems of multidimensional IIR filters.
A Counterexample of the Convexity of Sums of Singular Values
Authors: Liu Hongwei, Liu Sanyang
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

In this note we present a counterexample to Seeger's conjecture on the convexity of sums of singular values of rectangular matrices. Thus we answer the related open question in the negative.
Properties of Rescheduling Size Invariance for Dynamic Rescheduling-Based VLIW Cross-Generation Compatibility
Authors: Thomas M. Conte, Sumedh Sathaye
Venue: IEEE Transactions on Computers (2000)

The object-code compatibility problem in VLIW architectures stems from their statically scheduled nature. Dynamic rescheduling (DR) [1] is a technique to solve the compatibility problem in VLIWs. DR reschedules program code pages at first-time page faults, i.e., when the code pages are accessed for the first time during execution. Treating a page of code as the unit of rescheduling makes it susceptible to the hazards of changes in the page size during the process of rescheduling. This paper shows that the changes in the page size are only due to insertion and/or deletion of NOPs in the code. Further, it presents an ISA encoding, called list encoding, which does not require explicit encoding of the NOPs in the code. Algorithms to perform rescheduling on acyclic code and cyclic code are presented, followed by the discussion of the property of rescheduling-size invariance (RSI) satisfied by list encoding.
A fast method for solving a class of tridiagonal linear systems
Authors: Michael A. Malcolm, John Palmer
Venue: Communications of the ACM (1974)

The solution of linear systems having real, symmetric, diagonally dominant, tridiagonal coefficient matrices with constant diagonals is considered. It is proved that the diagonals of the LU decomposition of the coefficient matrix rapidly converge to full floating-point precision. It is also proved that the computed LU decomposition converges when floating-point arithmetic is used and that the limits of the LU diagonals using floating point are roughly within machine precision of the limits using real arithmetic. This fact is exploited to reduce the number of floating-point operations required to solve a linear system from 8n - 7 to 5n + 2k - 3, where k is much less than n, the order of the matrix. If the elements of the subdiagnals and superdiagonals are 1, then only 4n + 2k - 3 operations are needed. The entire LU decomposition takes k words of storage, and considerable savings in array subscripting are achieved. Upper and lower bounds on k are obtained in terms of the ratio of the coefficient matrix diagonal constants and parameters of the floating-point number system. Various generalizations of these results are discussed.
Research on extracting subject from Chinese text (poster session)
Authors: Han Kesong, Wang Yongcheng, Wu Fangfang
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

Because of the agility and diversity of natural languages, extracting the subject of text is one of the most difficult but important tasks in natural language processing (NLP). Due to the unique linguistics and grammar structures of Chinese, we now can only adopt non-semantic based approaches to extract subject from Chinese text. Three different approaches of extracting subject from Chinese text are presented in this paper. The first one is based a component-word dictionary, the second one is based on a subject-word dictionary and the third one is based on a statistic method. We introduce the process of the approaches. To test our approaches, we develop three independent systems and design a comparison experiment. The experimental results are illuminating and inspiring: every system can extract the text's subject to some extent, however, we may need combine these approaches to get a better one.
An array grammar programming system
Authors: Andrew Mercer, Azriel Rosenfeld
Venue: Communications of the ACM (1973)

A package of Fortran programs has been developed that permits a user to interactively design and test array grammars. The user can control the rule selection procedure in a derivation or parse, using weighted programming matrices; he also has a choice of instance selection schemes (raster, random, parallel). Examples are given involving array languages consisting of simple geometrical patterns, as well as a language of &ldquo;neuron pictures.&rdquo;
Finding the right cutting planes for the TSP
Authors: Matthew S. Levine
Venue: Journal of Experimental Algorithmics (JEA) (2000)

Given an instance of the Traveling Salesman Problem (TSP), a reasonable way to get a lower bound on the optimal answer is to solve a linear programming relaxation of an integer programming formulation of the problem. These linear programs typically have an exponential number of constraints, but in theory they can be solved efficiently with the ellipsoid method as long as we have an algorithm that can take a solution and either declare it feasible or find a violated constraint. In practice, it is often the case that many constraints are violated, which raises the question of how to choose among them so as to improve performance. For the simplest TSP formulation it is possible to efficiently find all the violated constraints, which gives us a good chance to try to answer this question empirically. Looking at random two dimensional Euclidean instances and the large instances from TSPLIB, we ran experiments to evaluate several strategies for picking among the violated constraints. We found some information about which constraints to prefer, which resulted in modest gains, but were unable to get large improvements in performance.
A Linear Algorithm for Computing the Homography from Conics in Correspondence
Authors: Akihiro Sugimoto
Venue: Journal of Mathematical Imaging and Vision (2000)

This paper presents a study, based on conic correspondences, on the relationship between two perspective images acquired by an uncalibrated camera. We show that for a pair of corresponding conics, the parameters representing the conics satisfy a linear constraint. To be more specific, the parameters that represent a conic in one image are transformed by a five-dimensional projective transformation to the parameters that represent the corresponding conic in another image. We also show that this transformation is expressed as the symmetric component of the tensor product of the transformation based on point/line correspondences and itself. In addition, we present a linear algorithm for uniquely determining the corresponding point-based transformation from a given conic-based transformation up to a scale factor. Accordingly, conic correspondences enable us to easily handle both points and lines in uncalibrated images of a planar object.
Computer programs are patentable
Authors: Kenneth B. Hamlin
Venue: Communications of the ACM (1964)

It is not surprising that computer programs are not listed in the patent statutes as one of the categories of patentable invention. When these categories were defined many years ago, computers and computer programs were unknown. Therefore, if computer programs are to be patentable within the framework of existing patent law they must fall within one of the specifically defined categories of processes, machines, manufactures or compositions of matter.
Linearly Tunable Transconductor Using Modified CDBA
Authors: Ali Zeki, Ali Toker, Serdar Özo uz
Venue: Analog Integrated Circuits and Signal Processing (2001)

With a slight modification in current differencing buffered amplifier (CDBA), a new block, namely differential-input current feedback amplifier (DFCA), is obtained. It is shown that, with two additional MOSFETs, this modified CDBA structure can be utilized as a linearly tunable transconductor, which can also be converted to a variable-gain amplifier or an analogue multiplier.