ppxscal/embedding_network huggingface dataset:
Algorithm 448: number of multiply-restricted partitions
Authors: Terry Beyer, D. F. Swinehart
Venue: Communications of the ACM (1973)

Given a positiver integer m and an ordered k-tuple c = (c1, &middot;&middot;&middot; , ck) of not necessarily distinct positive integers, then any ordered k-tuple s = (s1, &middot;&middot;&middot; , sk) of nonnegative integers such that m = &sum;ki-1 sici is said to be a partition of m restricted to c. Let Pc(m) denote the number of distinct partitions of m restricted to c. The subroutine COUNT, when given a k-tuple c and an integer n, computes an array of the values of Pc(m) for m = 1 to n. Many combinatorial enumeration problems may be expressed in terms of the numbers Pc(m). We mention two below.
Generating Decision Trees for Decoding Binaries
Authors: Henrik Theiling
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

Tools reading binary code, like analysers, debuggers, disassemblers, etc., need to decode the target's machine code. A decision tree is often used to represent the decoding function. Manually writing a decoder is a lengthy and error-prone task. It is desirable to be able to use the vendor's instruction code manual and to easily transform the documentation into a specification that a tool can use to generate a decoder. This paper presents a novel algorithm that computes a decision tree from machine code bit patterns alone. Neither the bit fields of the machine code, nor the width of the machine command, nor the order in which the bits should be decoded need to be specified. The decoding algorithm accesses any significant bit exactly once during decoding.
Each Invertible Sharply d-Transitive Finite Permutation Set withd &ge; 4 is a Group
Authors: Arrigo Bonisoli, Pasquale Quattrocchi
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

All known finite sharply 4-transitive permutation sets containing the identity are groups, namely i>S4, i>S5, i>A6 and the Mathieu group of degree 11. We prove that a sharply 4-transitive permutation set on 11 elements containing the identity must necessarily be the Mathieu group of degree 11. The proof uses direct counting arguments. It is based on a combinatorial property of the involutions in the Mathieu group of degree 11 (which is established here) and on the uniqueness of the Minkowski planes of order 9 (which had been established before): the validity of both facts relies on computer calculations. A permutation set is said to be invertible if it contains the identity and if whenever it contains a permutation it also contains its inverse. In the geometric structure arising from an invertible permutation set at least one block-symmetry is an automorphism. The above result has the following consequences. i) A sharply 5-transitive permutation set on 12 elements containing the identity is necessarily the Mathieu group of degree 12. ii) There exists no sharply 6-transitive permutation set on 13 elements. For i>d &ge; 6 there exists no invertible sharply i>d-transitive permutation set on a finite set with at least i>d + 3 elements. iii) A finite invertible sharply i>d-transitive permutation set with i>d &ge; 4 is necessarily a group, that is either a symmetric group, an alternating group, the Mathieu group of degree 11 or the Mathieu group of degree 12.
Production systems: or can we do better than BNF
Authors: Henry F. Ledgard
Venue: Communications of the ACM (1974)

Since the development of BNF, the definition of the syntax of programming languages has been almost universally associated with context-free requirements. Yet numerous interesting and difficult issues in syntax stem from the context-sensitive requirements, notably the compatibility between the declaration of an identifier and its uses, the correspondence between actual and formal parameters, and issues arising from block structure. This paper explores the use of a formal notation called Production Systems in providing a readable and complete formal definition of syntax. As a practical illustration, a small but significant subset of PL/I is considered. A more detailed presentation, as well as the application to define abstract syntax and translations between languages, is given in a previous paper by the author.
Protection in operating systems
Authors: Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman
Venue: Communications of the ACM (1976)

A model of protection mechanisms in computing systems is presented and its appropriateness is argued. The &ldquo;safety&rdquo; problem for protection systems under this model is to determine in a given situation whether a subject can acquire a particular right to an object. In restricted cases, it can be shown that this problem is decidable, i.e. there is an algorithm to determine whether a system in a particular configuration is safe. In general, and under surprisingly weak assumptions, it cannot be decided if a situation is safe. Various implications of this fact are discussed.
ICMP datagrams in traceroute algorithms (student paper)
Authors: Tony Mendolia
Venue: Proceedings of the twelfth annual CCSC South Central conference on The journal of computing in small colleges (2001)

One of the most commonly used utilities in network debugging is traceroute. Traceroute is a utility that will display the route a packet takes to a given destination. However as technology improves, it is sometimes necessary to examine the algorithm to ensure that we cannot make performance enhancements
On translation of Boolean expressions
Authors: H. H. Bottenbruch, A. A. Grau
Venue: Communications of the ACM (1962)

A program which translates an algorithmic language such as ALGOL into the machine language of an electronic computer performs the following functions: Analysis. From the program in algorithmic language are determined the operations which the computer must perform in the execution of the target program and the logical interdependence of these. Optimization. Of the many possibilities for optimization that exist, two are pertinent to this note: (2a) the elimination of superfluous operations, and (2b) the execution at translation time of those operations which do not depend on results produced by the target program. Synthesis. The sequence of operations which arise from steps 1 and 2 is expressed in the language of the computer and placed into the target program.
Fuzzy-logic digital-analogue interfaces for accurate mixed-signal simulation
Authors: T. J. Kazmierski
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

A new approach to mixed-signal circuit interfacing based on fuzzy logic models is presented. Due to their continuous rather than discrete character, fuzzy logic models offer a significant improvement compared with the classical D-A interface models. Fuzzy logic D-A interfaces can represent the boundary between the digital and analogue worlds accurately without a significant loss of computational efficiency. The potential of mixed-signal interfacing based on fuzzy logic is demonstrated by an example of spike propagation from the digital to analogue world. A model of inertial propagation delay and non-linear DC gain suitable for fuzzy logic gates is also suggested.
Consistent floorplanning with super hierarchical constraints
Authors: Shigetoshi Nakatake, Yukiko Kubo, Yoji Kajitani
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

Sequence-Pair based floorplanning has been revealed its limit of usefulness in VLSI physical design. Among reasons, the key issue is in its being non-hierarchical and indifferent to the preceding step of partitioning. This paper restructure the algorithm by the idea that the partition algorithm produces the constraint that is imposed on the sequence-pair data. The partition algorithm is the one based on the balanced-bipartition that works hierarchically. Thus a new floorplan algorithm that is consistent with the hierarchical partition algorithm is constructed. This is enhanced to include other algorithms that are based on the binary search. Here, a clock-tree synthesis by H-tree is shown to be consistent. Experiments are given to show better achievements in length and wire-density.
Application of game tree searching techniques to sequential pattern recognition
Authors: James R. Slagle, Richard C. T. Lee
Venue: Communications of the ACM (1971)

A sequential pattern recognition (SPR) procedure does not test all the features of a pattern at once. Instead, it selects a feature to be tested. After receiving the result of that test, the procedure either classifies the unknown pattern or selects another feature to be tested, etc. Medical diagnosis is an example of SPR. In this paper the authors suggest that SPR be viewed as a one-person game played against nature (chance). Virtually all the powerful techniques developed for searching two-person, strictly competitive game trees can easily be incorporated either directly or by analogy into SPR procedures. In particular, one can incorporate the &ldquo;miniaverage backing-up procedure&rdquo; and the &ldquo;gamma procedure,&rdquo; which are the analogues of the &ldquo;minimax backing-up procedure&rdquo; and the &ldquo;alpha-beta procedure,&rdquo; respectively. Some computer simulated experiments in character recognition are presented. The results indicate that the approach is promising.
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
Authors: Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
Venue: Mathematics of Operations Research (2000)

We develop an algorithm for solving a system of diophantine equations with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction. It first finds a short vector satisfying the system of diophantine equations, and a set of vectors belonging to the nullspace of the constraint matrix. Due to basis reduction, all these vectors are relatively short. The next step is to branch on linear combinations of the null-space vectors, which either yields a vector that satisfies the bound constraints or provides a proof that no such vector exists. The research was motivated by the need for solving constrained diophantine equations as subproblems when designing integrated circuits for video signal processing. Our algorithm is tested with good results on real-life data, and on instances from the literature.
Design and characteristics of a variable-length record sort using new fixed-length record sorting techniques
Authors: Martin A. Goetz
Venue: Communications of the ACM (1963)

This paper describes the application of several new techniques for sorting fixed-length records to the problem of variable-length record sorting. The techniques have been implemented on a Sylvania 9400 computer system with 32,000 fixed-length words of memory. Specifically, the techniques sequence variable-length records of unrestricted size, produce long initial strings of data, merge strings of data at the power of T - 1, where T is the number of work tapes in a system, and do not restrict the volume of input data.
Computer science laboratory projects: Breadth through depth
Authors: Richard Rasala, Viera K. Proulx, Jeff Raab
Venue: Journal of Computing Sciences in Colleges (2001)

We present a Java toolkit platform (Java Power Tools) to support GUI's and IO in a safe way that takes advantage of the Java Swing capabilities and provides a framework for GUI design. Java Power Tools provides support for input and display of all types of data through safe conversion to and from a String (by implementing the Stringable Interface). recursively defined Displays allow for combining simple display panels into complex user interfaces. The design is based on Model-View-Controller paradigm. The design of all components is clean and extensible and provides a model for building user interfaces that students can first use with ease, and later study to learn the proper design techniques in Java. JPT will be available for testing and a suite of projects and laboratory assignments will be available by October 2000. This tutorial will focus on the pedagogical aspects of the toolkits and present ideas for use in student projects.
Comparative analysis of six XML schema languages
Authors: Dongwon Lee, Wesley W. Chu
Venue: ACM SIGMOD Record (2000)

As XML [5] is emerging as the data format of the internet era, there is an substantial increase of the amount of data in XML format. To better describe such XML data structures and constraints, several XML schema languages have been proposed. In this paper, we present a comparative analysis of six noteworthy XML schema languages.
Optimum positioning of base stations for cellular radio networks
Authors: Rudolf Mathar, Thomas Niessen
Venue: Wireless Networks (2000)

Finding optimum base station locations for a cellular radio network is considered as a mathematical optimization problem. Dependent on the channel assignment policy, the minimization of interferences or the number of blocked channels, respectively, may be more favourable. In this paper, a variety of according analytical optimization problems are introduced. Each is formalized as an integer linear program, and in most cases optimum solutions can be given. Whenever by the complexity of the problem an exact solution is out of reach, simulated annealing is used as an approximate optimization technique. The performance of the different approaches is compared by extensive numerical tests.
Audit trail compaction for database recovery
Authors: John Kaunitz, Louis van Ekert
Venue: Communications of the ACM (1984)

Total elapsed recovery time from disk-based database corruption can be shortened by reprocessing the audit trail off-line and thereby avoiding excessive resource utilization penalties. Using a bit map, the audit trail is compacted by eliminating irrelevant or superseded records. The compacted trail is then partitioned, and the partitions are processed in parallel.
Structure of Expansion-Contraction Matrices in the Inclusion Principle for Dynamic Systems
Authors: Lubomír Bakule, José Rodellar, Josep M. Rossell
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

This paper characterizes a general structure of complementary matrices involved in the input-state-output inclusion principle for linear time invariant dynamic systems. Aggregations and restrictions are adopted as two practically important classes within this scheme. Further, contractibility conditions for feedback controllers are presented, including the decentralized control design. The identified structure enables the formulation of conditions on the complementary matrices which can be useful for analysis and synthesis of control problems.
A programmer's description of L6
Authors: Kenneth C. Knowlton
Venue: Communications of the ACM (1966)

Bell Telephone Laboratories' Low-Level Linked List Language L6 (pronounced &ldquo;L-six&rdquo;) is a new programming language for list structure manipulations. It contains many of the facilities which underlie such list processors as IPL, LISP, COMIT and SNOBOL, but permits the user to get much closer to machine code in order to write faster-running programs, to use storage more efficiently and to build a wider variety of linked data structures.
Efficient oblivious transfer protocols
Authors: Moni Naor, Benny Pinkas
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

1 Introduction Oblivious Transfer (OT) protocols allow one party, the sender, to transmit part of its inputs to another party, the chooser, in a manner that protects both of them: the sender is assured that the chooser does not receive more information than it is entitled, while the chooser is assured that the sender does not learn which part of the inputs it received. OT is used as a key component in many applications of cryptography. Its computational requirements are quite demanding and they are likely to be the bottleneck in many applications that invoke it. 1.1 Contributions. This paper presents several significant improvements to oblivious transfer (OT) protocols of strings, and in particular: (i) Improving the efficiency of applications which many invocations of oblivious transfer. (ii) Providing the first two-round OT protocol whose security analysis does not invoke the random oracle model.
Mathematics for undergraduate computer scientists
Authors: William F. Atchison
Venue: Communications of the ACM (1966)

The mathematical requirements for an undergraduate program in Computer Science are a subject of debate. The Association for Computing Machinery's Curriculum Committee, however, believes that these requirements are essentially the same as the mathematical content of physical sciences undergraduate programs. The Committee believes that these requirements should assure the student of a broad mathematical background and should enable him to take a wide variety of courses in other scientific disciplines. The Committee's concern is to develop a solid scientific approach to Computer Science.
Problem of determination trustworthy software—hardware computings
Authors: Volodymyr Ovsiak
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

The inductional method of algorithms investion, whith descripted by means of algorithms algebra, for solution of the problem of determination trustworthy sofware &mdash; hardware computings is worked up.
Modeling score distributions for combining the outputs of search engines
Authors: R. Manmatha, T. Rath, F. Feng
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In this paper the score distributions of a number of text search engines are modeled. It is shown empirically that the score distributions on a per query basis may be fitted using an exponential distribution for the set of non-relevant documents and a normal distribution for the set of relevant documents. Experiments show that this model fits TREC-3 and TREC-4 data for not only probabilistic search engines like INQUERY but also vector space search engines like SMART for English. We have also used this model to fit the output of other search engines like LSI search engines and search engines indexing other languages like Chinese.It is then shown that given a query for which relevance information is not available, a mixture model consisting of an exponential and a normal distribution can be fitted to the score distribution. These distributions can be used to map the scores of a search engine to probabilities. We also discuss how the shape of the score distributions arise given certain assumptions about word distributions in documents. We hypothesize that all 'good' text search engines operating on any language have similar characteristics.This model has many possible applications. For example, the outputs of different search engines can be combined by averaging the probabilities (optimal if the search engines are independent) or by using the probabilities to select the best engine for each query. Results show that the technique performs as well as the best current combination techniques.
A class of dynamic memory allocation algorithms
Authors: Daniel S. Hirschberg
Venue: Communications of the ACM (1973)

A new dynamic memory allocation algorithm, the Fibonacci system, is introduced. This algorithm is similar to, but seems to have certain advantages over, the &ldquo;buddy&rdquo; system. A generalization is mentioned which includes both of these systems as special cases.
Efficient and practical DHEKE protocols
Authors: Chun-Li Lin, Hung-Min Sun, Tzonelih Hwang
Venue: ACM SIGOPS Operating Systems Review (2001)

In 1992, Bellovin and Merritt proposed Encrypted Key Exchange (EKE) protocols for preventing dictionary attacks on weak chosen passwords. In 1995, Steiner, Tsudik, and Waidner proposed a minimal DHEKE protocol which simplified the Diffie-Hellman based one of Bellovin and Merritts' protocols. In this paper, we propose two improvements on the minimal DHEKE protocol. These two improvements can reduce the computational cost further.
The operational versus the conventional approach to software development
Authors: Pamela Zave
Venue: Communications of the ACM (1984)

The conventional approach to software development is being challenged by new ideas, many of which can be organized into an alternative decision structure called the &ldquo;operational&rdquo; approach. The operational approach is explained and compared to the conventional one.
A workbench for quality based software re-engineering (Doctoral Symposium)
Authors: Ladan Tahvildari, Kostas Kontogiannis
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

This research presents a re-engineering workbench and architecture that allows for legacy system written in procedural languages to be migrated to new object oriented platforms. This methodology allows for specific design and quality requirements of the target migrant system to be considered during the re-engineering process through an iterative and incremental process. The migration process recovers an object model from the procedural code and incrementally refines it by taking into consideration the design requirements for the migrant system.
A Framework for High Level Estimations of Signal Processing VLSI Implementations
Authors: J. Ph. Diguet, D. Chillet, O. Sentieys
Venue: Journal of VLSI Signal Processing Systems (2000)

This paper deals with the presentation of a framework for the rapid prototyping of Digital Signal Processing applications. The BSS framework enables both synthesis of dedicated VLSI circuits and cost, performance estimation. The latter can be used at different accuracy levels and can help the designer in selecting a proper algorithm in order to improve the global performance of its implementation. The cost estimation takes into account both the processing unit, including operators, registers, interconnections, and memory units. The implemented estimation techniques are presented and include functional unit number bound calculation, probabilistic cost estimation of processing unit components, and memory unit area evaluation. We demonstrate, on a real application, that cost/signal processing quality trade-offs can be achieved while changing the type of algorithm and the number of filter taps for a given algorithm specification.
Nearly optimal importance sampling for Monte Carlo simulation of loss systems
Authors: Pasi E. Lassila, Jorma T. Virtamo
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2000)

In this paper we consider the problem of estimating blocking probabili ties in the multiservice loss system via simulation, applying the static Monte Carlo method with importance sampling. Earlier approaches to this problem include the use of either a single exponentially twisted version of the steady state distribution of the system or a composite of individual exponentially twisted distributions. Here, a different approach is introduced, where the original estimation problem is first decomposed into independent simpler subproblems, each roughly corresponding to estimating the blocking probability contribution from a single link. Then two importance sampling distributions are presented, which very closely approximate the ideal importance sampling distribution for each subproblem. In both methods, the idea is to try to generate samples directly into the blocking state region. The difference between the methods is that the first method, the inverse convolution method, achieves this exactly, while the second one, using a fitted Gaussian distibution, only approximately. The inverse convolution algorithm, however, has a higher memory requirement. Finally, a dynamic control algorithm is given for optimally allocating the samples between different subproblems. The numerical results demonstrate that the variance reduction obtained with the methods, especially with the inverse convolution method, is tryly remarkable, between 670 and 1,000,000 in the examples under consideration.