ppxscal/embedding_network huggingface dataset:
A neuroidal architecture for cognitive computation
Authors: Leslie G. Valiant
Venue: Journal of the ACM (JACM) (2000)

An architecture is described for designing systems that acquire and ma nipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the full those aspects of computational learning that are known to offer powerful solutions in the acquisition and maintenance of robust knowledge bases. The architecture makes explicit the requirements on the basic computational tasks that are to be performed and is designed to make this computationally tractable even for very large databases. The main claims are that (i) the basic learning and deduction tasks are provably tractable and (ii) tractable learning offers viable approaches to a range of issues that have been previously identified as problematic for artificial intelligence systems that are programmed. Among the issues that learning offers to resolve are robustness to inconsistencies, robustness to incomplete information and resolving among alternatives. Attribute-efficient learning algorithms, which allow learning from few examples in large dimensional systems, are fundamental to the approach. Underpinning the overall architecture is a new principled approach to manipulating relations in learning systems. This approach, of independently quantified arguments, allows propositional learning algorithms to be applied systematically to learning relational concepts in polynomial time and in modular fashion.
Dynamic minimization of word-level decision diagrams
Authors: S. Höreth, R. Drechsler
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Word-Level Decision Diagrams (WLDDs), like *BMDs and K*BMDs, have recently been introduced as a data structure for verification. The size of WLDDs largely depends on the chosen variable ordering, i.e. the ordering in which variables are encountered, and on the decompositions carried out in each node. In this paper we present a framework for dynamic minimization of WLDDs. We discuss the difficulties with previous techniques if applied to WLDDs and present a new approach that efficiently adapts both variable ordering and decomposition type choice. Experimental results demonstrate that this method outperforms ``classical'' reordering with respect to run-time and representation size during dynamic minimization of word-level functions.
Exploring Internet e-business programming technologies
Authors: Minta Royster
Venue: Journal of Computing Sciences in Colleges (2001)

E-Businesses are being created at incredible rates every year. More and more companies are realizing the importance of having their company exposed on the web. Being able to create both an effective and highly efficient web site are the two most essential aspects when developing a web site for a potential client. Having an e-business that is user friendly is key. It is necessary to react as quickly as possible to clicks issued by clients, take inputs from a form, store data into databases, and dynamically respond to user requests. This research explores various tools to implement these tasks.
An interactive command generating facility
Authors: Charles A. Grant
Venue: Communications of the ACM (1970)

A facility to permit conversationally controlled tasks to be executed in a noninteractive environment is proposed. A means by which programs can generate interactive time-sharing commands and receive the corresponding output response is presented. The commands will be invoked as if they had been typed at a console keyboard. It is argued that this facility will help overcome some of the current limitations in man-computer communication. A set of functions to accomplish the above which could be embedded into any string processing language is suggested, and necessary information pertinent to implementation of the facility on existing time-sharing systems is given.
On the Use of Enumeration for Investigating the Performance of HypothesisTests for Economic Models with a Discrete Response Variable
Authors: Simon Peters, Andrew Chesher
Venue: Computational Economics (2000)

This article notes that it is now practical to use the method of enumeration to analyse the performance of estimators and hypothesis tests of fully parametric binary data models. The general method is presented and then employed to investigate the power performance of a common misspecification test for the Probit model. The advantages, disadvantages and limitations of enumeration compared with standard Monte Carlo simulation are then discussed. Finally, an example from experimental economics is used to demonstrate that the methodology can also be used in small empirical studies.
Techniques for interactive video cubism (poster session)
Authors: Sidney Fels, Eric Lee, Kenji Mase
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

This paper presents an interactive video visualization technique called video cubism. With this technique, video data is considered to be a block of three dimensional data where frames of video data comprise the third dimension. The user can observe and manipulate a cut plane or cut sphere through the video data. An external real-time video source may also be attached to the video cube. The visualization leads to images that are aesthetically interesting as well as being useful for image analysis.
The COBOL sorting verb
Authors: J. B. Paterson
Venue: Communications of the ACM (1963)

The COBOL-61 specifications have recently been augmented with a number of extensions, one of which is a SORT verb. COBOL was designed initially for use in the processing of data-files stored on serially-accessed input-output devices. In applications of this general type of processing, the sorting of data files is frequently found to be necessary. Furthermore, it is often convenient and economical to carry out other operations at the same time, such as pre-editing or pre-selection of data records as they enter the sorting process, or editing, merging, or report preparation as the records emerge from the sort. It is a great convenience to the user to be able to express all of these operations in the same procedural language that he is using for his other data-processing applications, instead of having to use a sorting system in which first pass and last pass own coding must be expressed in some other language. Furthermore, COBOL itself is not well adapted to the writing of efficient sorting programs. Accordingly, a sort function appeared to be a very desirable addition to the COBOL specifications.
The choice of base
Authors: W. S. Brown, P. L. Richman
Venue: Communications of the ACM (1969)

A digital computer is considered, whose memory words are composed of N r-state devices plus two sign bits (two state devices). The choice of base &bgr; for the internal representation of floating-point numbers on such a computer is discussed. It is shown that in a certain sense &bgr; = r is best.
The SINIX Consultant &ndash; Towards a TheoreticalTreatment of Plan Recognition
Authors: Matthias Hecking
Venue: Artificial Intelligence Review (2000)

We have realized the help system SINIX Consultant (SC) for SINIX1 users. The system is capable of answering &ndash; in German &ndash; natural language questions concerning SINIX commands, objects, and concepts. But not only does this help system react to inquiries &ndash; additionally, the system is capable of activating itself. If the user employs a sequence of SINIX commands (a plan) in order to reach a specific goal, the help system proposes a sequence which reaches the same goal, but, with fewer commands. In this paper, a brief survey of the SINIX Consultant and the realized plan recognizer REPLIX is first given. Then, an initial attempt of a theoretical treatment of plan recognition is presented. This is done within the logical framework. We show how we can use an interval-based logic of time to describe actions, atomic plans, non-atomic plans, action execution, and simple plan recognition. We also show that the recognition of inserted sub-plans managed by REPLIX can be handled as well. Then, we present a problem which cannot be treated in the formalism. Thus, in this paper, we don't present a full developed theory but nevertheless, a step towards it.
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks
Authors: Chun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

We show that the cyclic-cubes defined by Ada W.C. Fu and S.C. Chau [1] are isomorphic to $k$-ary wrapped butterfly networks.
A pilot study for developing a quantitative model for outcomes assessment in the computer science program at a Small University
Authors: Robert O. Jarman, Sankara N. Sethuraman
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

This paper examines a prototype model for outcomes assessment of a Computer Science Program. The model explores correlating student's scores on the Major Field Test (MFT) in Computer Science with academic performance. The model's goal is identifying key factors (course offerings) and their contribution to MFT performance and student success.
Spar: a set of extensions Java for scientific computation
Authors: C. van Reeuwijk, F. Kuijlman, H. J. Sips
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

In this paper we present a set of language extensions that improve the expressiveness and performance of Java for scientific computation. First of all, the language extensions allow the manipulation of multi-dimensional arrays to be expressed more naturally, and to be implemented more efficiently. Furthermore, data-parallel programming is supported, allowing efficient parallelization of a large class of operations on arrays. We also provide language extensions to construct specialized array representations, such as symmetric, block, and sparse matrices. These extensions are: tuples, parameterized types, array subscript overloading, and the inline modifier. These extensions are not only useful to construct special array representations, but are also useful in their own right. Finally, we add complex numbers as a primitive type to the language. We evaluate our language extensions using performance results. We also compare relevant code fragments of our extended language with standard Java implementations and language extensions proposed by others.
Landing CG on EARTH: a case study of fine-grained multithreading on an evolutionary path
Authors: Kevin B. Theobald, Gagan Agrawal, Rishi Kumar, Gerd Heber, Guang R. Gao, Paul Stodghill, Keshav Pingali
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We report on our work in developing a fine-grained multithreaded solution for the communication-intensive Conjugate Gradient (CG) problem. In our recent work, we have developed a simple, yet very efficient, solution to executing matrix-vector multiply on a multithreaded system. This paper presents an effective mechanism for the reduction-broadcast phase, which is implemented and integrated with the sparse MVM resulting in a scalable implementation of the complete CG application. Three major observations from our experiments on the EARTH multithreaded testbed are: (1) The scalability of our CG implementation is impressive, e.g., speedup is 90 on 120 processors for the NAS CG class B input. (2) Our dataflow-style reduction-broadcast network based on fine-grain multithreading is twice as fast as a serial reduction scheme on the same system. (3)By slowing down the netwok by a factor of 2, no notable degradation of overall CG performance was observed.
A method for finding Hamilton paths and Knight's tours
Authors: Ira Pohl
Venue: Communications of the ACM (1967)

The use of Warnsdorff's rule for finding a knight's tour is generalized and applied to the problem of finding a Hamilton path in a graph. A graph-theoretic justification for the method is given.
Designing an Efficient and Scalable Server-side Asynchrony Model for CORBA
Authors: Darrell Brunsch, Carlos O'Ryan, Douglas C. Schmidt
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

When the Asynchronous Method Invocation (AMI) model was introduced into the CORBA specification, client applications benefited from the ability to invoke non-blocking two-way requests. In particular, AMI improved the scalability of clients by removing the restrictions associated with Synchronous Method Invocations (SMI). Server request handling remained synchronous, however, which minimized the benefits of AMI for middle-tier servers, such as firewall gateways and front-end database servers.This paper describes our strategy for implementing a scalable server-side asynchrony model for CORBA. We first outline the key design challenges faced when developing an Asynchronous Method Handling (AMH) model for CORBA and then describe how we are resolving these challenges in TAO, our high-performance, real-time CORBA ORB. In general, AMH-based CORBA servers provide more scalability than existing concurrency models, with only a moderate increase in programming complexity. Although targeted for CORBA, similar techniques can also be used in other method-oriented middleware, such as COM+ and Java RMI.
Implementation of Strassen's algorithm for matrix multiplication
Authors: Steven Huss-Lederman, Elaine M. Jacobson, Anna Tsao, Thomas Turnbull, Jeremy R. Johnson
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

In this paper we report on the development of an efficient and portable implementation of Strassen's matrix multiplication algorithm for matrices of arbitrary size. Our technique for defining the criterion which stops the recursions is more detailed than those generally used, thus allowing enhanced performance for a larger set of input sizes. In addition, we deal with odd matrix dimensions using a method whose usefulness had previously been in question and had not so far been demonstrated. Our memory requirements have also been reduced, in certain cases by 40 to more than 70 percent over other similar implementations. We measure performance of our code on the IBM RS/6000, CRAY YMP C90, and CRAY T3D single processor, and offer comparisons to other codes. Finally, we demonstrate the usefulness of our implementation by using it to perform the matrix multiplications in a large application code.
Combinatorial approximation algorithms for the maximum directed cut problem
Authors: Eran Halperin, Uri Zwick
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We describe several combinatorial algorithms for the maximum directed cut problem. Among our results is a simple linear time 9/20-approximation algorithm for the problem, and a somewhat slower &frac12;-approximation algorithm that uses a bipartite matching routine. No better combinatorial approximation algorithms are known even for the easier maximum cut problem for undirected graphs. Our algorithms do not use linear programming, nor semidefinite programming. They are based on the observation that the maximum directed cut problem is equivalent to the problem of finding a maximum independent set in the line graph of the input graph, and that the linear programming relaxation of the problem is equivalent to the problem of finding a maximum fractional independent set of that line graph. The maximum fractional independent set problem can be easily reduced to a bipartite matching problem. As a consequence of this relation, we also get that the maximum directed cut problem for bipartite digraphs can be solved in polynomial time.
Floorplan area minimization using Lagrangian relaxation
Authors: F. Y. Young, C. C. N. Chu, W. S. Luk, Y. C. Wong
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplanning stage. Area minimization in general non-slicing floorplan is a complicated problem. Many previous works have attempted to tackle this problem [9; 6; 5; 1] using heuristics or numerical methods but none of them can solve it optimally and efficiently. In this paper, we show how this problem can be solved optimally by a geometric programming using Lagrangian relaxation. The resulting Lagrangian relaxation subproblem is so simple that the size of each module can be found in constant time. We implemented our idea in a simulated annealing framework based on the sequence pair representation. The area minimization procedure is invoked in every iteration of the annealing process but the total execution time is still very much faster than that of the most updated previous work [4]. For a benchmark data with 49 modules, we take 19.5 hours using a 270 MHz Sun Ultra 5 while the convex programming approach in [4] takes seven days using a 250 MHz DEC Alpha. This area minimization method will be applicable to any other floorplanning algorithm which uses constraint graphs to find module positions in the final packing.
The description list of concepts
Authors: R. B. Banerji
Venue: Communications of the ACM (1962)

A concept is defined as a class of objects whose members can be distinguished by processing its properties. Property is defined to mean a partition of the set of all objects into disjoint classes. The formal definition of a concept is recursive in nature. A concept is described by a list structure. A one-to-one correspondence is established between the recursive definition of a concept and its description list structure. Like the definition, the description list structure of a concept is also built up from elementary list structures by a recursive process. The list structures obtained this way are compared with the description list structure discussed by the author in a previous publication.
An operational semantics for parallel lazy evaluation
Authors: Clem Baker-Finch, David J. King, Phil Trinder
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

We present an operational semantics for parallel lazy evaluation that accurately models the parallel behaviour of the non-strict parallel functional language GpH. Parallelism is modelled synchronously, that is, single reductions are carried out separately then combined before proceeding to the next set of reductions. Consequently the semantics has two levels, with transition rules for individual threads at one level and combining rules at the other. Each parallel thread is modelled by a binding labelled with an indication of its activity status. To the best of our knowledge this is the first semantics that models such thread states. A set of labelled bindings corresponds to a heap and is used to model sharing.The semantics is set at a higher level of abstraction than an abstract machine and is therefore more manageable for proofs about programs rather than implementations. At the same time, it is sufficiently low level to allow us to reason about programs in terms of parallelism (i.e. the number of processors used) as well as work and run-time with different numbers of processors.The framework used by the semantics is sufficiently flexible and general that it can easily be adapted to express other evaluation models such as sequential call-by-need, speculative evaluation, non-deterministic choice and others.
Automatic predicate abstraction of C programs
Authors: Thomas Ball, Rupak Majumdar, Todd Millstein, Sriram K. Rajamani
Venue: ACM SIGPLAN Notices (2001)

Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, state-space explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant interest in applying model checking to software. For infinite-state systems like software, abstraction is even more critical. Techniques for abstracting software are a prerequisite to making software model checking a reality. We present the first algorithm to automatically construct a predicate abstraction of programs written in an industrial programming language such as C, and its implementation in a tool &mdash; C2BP. The C2BP tool is part of the SLAM toolkit, which uses a combination of predicate abstraction, model checking, symbolic reasoning, and iterative refinement to statically check temporal safety properties of programs. Predicate abstraction of software has many applications, including detecting program errors, synthesizing program invariants, and improving the precision of program analyses through predicate sensitivity. We discuss our experience applying the C2BP predicate abstraction tool to a variety of problems, ranging from checking that list-manipulating code preserves heap invariants to finding errors in Windows NT device drivers.
Interpolation with rounded ramp functions
Authors: Rolf O. Lagerlöf
Venue: Communications of the ACM (1974)

A new interpolation function is introduced. It has infinitely many continuous derivatives and is a composition of ramp functions with smoothed bends called Rounded Ramp Functions. How the interpolation function can be extended to more than one variable is shown. An efficient Fortran program is given by which the interpolation function can be obtained for a given point set.
Analysis of decay-type data
Authors: Beatrice H. Worsley
Venue: Communications of the ACM (1964)

A comparative study has been made of a variety of numerical techniques for fitting experimental data of the decay type by forms involving the sums of exponentials. Statistical errors of the fitted parameters are also calculated. These methods have been applied to artificially-generated sets of data as well as to the results of experiments with radioactive tracers on both human and animal subjects. Results show that the values of the fitted parameters are very sensitive to variations in the fitting procedure. Therefore great care must be exercised in identifying such values with physical constants. Although the values of functions derived from these fitted parameters which can definitely be associated with physical entities are generally more stable under variations in the fitting techniques, error bounds can be so large that no great confidence can be placed even in them. It would therefore appear best to select a uniform technique both for running the experiments and for analyzing the data, and then to consider as significant only relative results between one subject and the next.