ppxscal/embedding_network huggingface dataset:
Pencils of Hyperconics in Projective Planes of CharacteristicTwo
Authors: James M. McQuillan
Venue: Designs, Codes and Cryptography (2000)

Let F be any field, finite or infinite, of characteristic 2. Put \pi=PG(2,F). Let H_1,H_2 be hyperconics in \pi. In this note we study the intersectionH_1\cap H_2 . In particular we obtain canonical forms for H_1,H_2 in the cases where |H_1\cap H_2|=4,5,6. One interesting consequence is that the case |H_1\cap H_2|=6 can only occur if F contains a subfield of order 4. Related results concerning &rsquo;&rsquo;pencils of hyperconics&lsquo;&lsquo; are presented in Theorems 6 through 9. This work also leads to an extension to general fields of characteristic 2 of the well-known even intersection property for hyperovals in PG(2,4) which is pursued elsewhere ([2]).
Compilation for two computers with NELIAC
Authors: Kleber S. Masterson,  Jr.
Venue: Communications of the ACM (1960)

NELIAC, a compiler based on ALGOL, was developed at the U. S. Navy Electronics Laboratory, San Diego, California, as a &ldquo;bootstrap&rdquo; compiler for the Remington Rand Univac COUNTESS computer. This compiler was used to generate a version of itself which, running as a COUNTESS program, generated machine code for the Control Data Corporation CDC-1604 computer. This second compiler was then used to generate a version of NELIAC for the CDC-1604. All three versions of NELIAC accepted essentially identical input language.
Address bus encoding techniques for system-level power optimization
Authors: L. Benini, G. De Micheli, E. Macii, D. Sciuto, C. Silvano
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The power dissipated by system-level buses is the largest contribution to the global power of complex VLSI circuits. Therefore, the minimization of the switching activity at the I/O interfaces can provide significant savings on the overall power budget. This paper presents innovative encoding techniques suitable for minimizing the switching activity of system-level address buses. In particular, the schemes illustrated here target the reduction of the average number of bus line transitions per clock cycle. Experimental results, conducted on address streams generated by a real microprocessor, have demonstrated the effectiveness of the proposed methods.
A workbench for quality based software re-engineering (Poster)
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 systems 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 case study is presented as a proof of concept.
Reflections on software research
Authors: Dennis M. Ritchie
Venue: Communications of the ACM (1984)

Can the circumstances that existed in Bell Labs that nurtured the UNIX project be produced again?
Timing driven gate duplication in technology independent phase
Authors: Ankur Srivastava, Chunhong Chen, Majid Sarrafzadeh
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

We propose a timing driven gate duplication algorithm for the technology independent phase. Our algorithm is a generalization of the gate duplication strategy suggested in [1]. Our technique gets a more global view by duplicating multiple gates at a time. We compare the minimum circuit delay obtained by SIS [2] with the delay obtained by using our gate duplication. Results show that up to 11% improvement in delay can be obtained. Our algorithm does not have an adverse effect on the overall synthesis time, indicating that gate duplication is an efficient strategy for timing optimization.
A wavelet-based approach for compressing kernel data in large-scale simulations of 3D integral problems
Authors: Kevin Amaratunga
Venue: Computing in Science and Engineering (2000)

Second-generation surface wavelets can be an effective tool for compressing integral operator matrices arising from large-scale simulations of 3D problems. The author's approach generalizes previously reported results on wavelet-based operator compression to nonuniform grids and fairly general domains.
Language analysis in the humanities
Authors: Sally Yeates Sedelow
Venue: Communications of the ACM (1972)

The use of the computer in the language-oriented humanities for exhaustive listing of detail (as in indices and concordances) is widespread and accepted as desirable. The implications of the computer for a &ldquo;science&rdquo; of the humanities&mdash;a science entailing gathering data for the construction and testing of models&mdash;are neither widely recognized nor accepted. This paper argues that the computer's major role as to language analysis in the humanities will be the establishing of such a science. Thus, for those areas of the humanities for which rigor and precision are necessary (e.g. analyzing literature or teaching a student to write a composition) the computer can be a critically important facilitator.
A priori system-level interconnect prediction: Rent's rule and wire length distribution models
Authors: Dirk Stroobandt
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

The exciting, new field of System-Level Interconnect prediction emerged from research of the early 1970's but it took until 1999 before a cohesive research community for interconnect prediction was established with the start of the SLIP Workshop two years ago. New research results are becoming available and the last couple of years have brought both more interest and more progress in the field than in the thirty years before. This tutorial is an introduction to the field and mainly provides an overview of the basic models in wire length prediction as well as an introduction to some of the recent advances in system-level interconnect prediction.The tutorial starts with a justification of the research subject (why do we want to predict wire lengths?) and then presents the basic models wire length prediction techniques are built on: a model for the circuit, a model for the architecture and a layout model. A significant amount of time is spent on Rent's rule which is the basic rule are introduced progressively from the earliest to the newest and from less accurate to more accurate. Finally, a few reent advances in the field are described in short.
The impact of gender differences on the career experiences of information systems professionals
Authors: Mary Sumner, Kay Werner
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

The purpose of this study is to examine the impact of gender differences on the career experiences and job success of information systems professionals. The study analyzes career experiences with respect to a number of variables, including feelings of acceptance, job discretion, met expectations, career support, career satisfaction, and organizational commitment. The study also examines which skills gained from educational preparation and work experience are viewed as most critical to successful performance. The study was accomplished by using in-depth interviews and a questionnaire. The findings showed that MIS careers offer challenge based upon technical competence, regardless of gender. The likelihood of reaching a technical plateau and the increasing transition of MIS roles into functional business units poses some career uncertainty.
A method for obtaining digital signatures and public-key cryptosystems
Authors: R. L. Rivest, A. Shamir, L. Adleman
Venue: Communications of the ACM (1983)

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intended recipient. Only he can decipher the message, since only he knows the corresponding decryption key. A message can be &ldquo;signed&rdquo; using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in &ldquo;electronic mail&rdquo; and &ldquo;electronic funds transfer&rdquo; systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d = 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n.
Picture generation with a standard line printer
Authors: Benson Perry, Mortimer L. Mendelsohn
Venue: Communications of the ACM (1964)

A method is described for producing gray-toned pictures on a line printer by utilizing the different degrees of blackness of standard print characters. Gray scales with 17, 32 and 64 levels have been devised. Scanned images of blood cells are used to display the technique.
Referencing lists by an edge
Authors: David S. Wise
Venue: Communications of the ACM (1976)

An edge reference into a list structure is a pair of pointers to adjacent nodes. Such a reference often requires little additional space, but its use can yield efficient algorithms. For instance, a circular link between the ends of a list is redundant if the list is always referenced by that edge, and list traversal is easier when that link is null. Edge references also allow threading of nonrecursive lists, can replace some header, cells, and enhance the famous exclusive-or trick to double-link lists.
The UNIX time-sharing system
Authors: Dennis M. Ritchie, Ken Thompson
Venue: Communications of the ACM (1983)

UNIX is a general-purpose, multi-user, interactive operating system for the Digital Equipment Corporation PDP-11/40 and 11/45 computers. It offers a number of features seldom found even in a larger operating systems, including: (1) a hierarchical file system incorporating demountable volumes; (2) compatible file, device, and inter-process I/O; (3) the ability to initiate asynchronous processes; (4) system command language selectable on a per-user basis; and (5) over 100 subsystems including a dozen languages. This paper discusses the nature and implementation of the file system and of the user command interface.
The blue-C (poster session): integrating real humans into a networked immersive environment
Authors: Oliver G. Staadt, Markus H. Gross, Andreas Kunz, Markus Meier
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

In this paper, we report ongoing work in a new project, The Blue-C. The goal of this project is to build a collaborative, immersive virtual environment which will eventually integrate real humans, captured by a set of video cameras. Two Blue-C.s will be interconnected via a high-speed network. This will allow for bi-directional collaboration and interaction between two persons sharing virtual spaces. The video streams are used for both texture and geometry extraction. We will generate a 3-D light field inlay enriched with the reconstructed geometry, which will be integrated into the virtual environment. The design and construction of the Blue-C. environment, including both hardware and software, is an interdisciplinary effort with participants from the departments of computer science, architecture, product development, and electrical engineering. Parallel to the development of the core system, we are designing new applications in the areas of computer aided architectural design, product reviewing, and medicine, which will highlight the versatility of the Blue-C.
The stability of the fourth order Runge-Kutta method for the solution of systems of differential equations
Authors: Abbas I. Abdel Karim
Venue: Communications of the ACM (1966)

The problem of the region of stability of the fourth order-Runge-Kutta method for the solution of systems of differential equations is studied. This region can be characterized by means of linear transformation but can not be given in a closed form. In the paper, this region is determined by the electronic digital computer Z22.
Expanding Options for Clustering
Authors: Ken Dove
Venue: Linux Journal (2001)

The role of Linux in the future of clustering.
Precise Candidate Selection for Large Character Set Recognition by Confidence Evaluation
Authors: Cheng-Lin Liu, Masaki Nakagawa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper proposes a precise candidate selection method for large character set recognition by confidence evaluation of distance-based classifiers. The proposed method is applicable to a wide variety of distance metrics and experiments on Euclidean distance and city block distance have achieved promising results. By confidence evaluation, the distribution of distances is analyzed to derive the probabilities of classes in two steps: output probability evaluation and input probability inference. Using the input probabilities as confidences, several selection rules have been tested and the rule that selects the classes with high confidence ratio to the first rank class produced best results. The experiments were implemented on the ETL9B database and the results show that the proposed method selects about one-fourth as many candidates with accuracy preserved compared to the conventional method that selects a fixed number of candidates.
Bottom-Up Induction of Feature Terms
Authors: Eva Armengol, Enric Plaza
Venue: Machine Learning (2000)

The aim of relational learning is to develop methods for the induction of hypotheses in representation formalisms that are more expressive than attribute-value representation. Most work on relational learning has been focused on induction in subsets of first order logic like Horn clauses. In this paper we introduce the representation formalism based on feature terms and we introduce the corresponding notions of subsumption and anti-unification. Then we explain INDIE, a heuristic bottom-up learning method that induces class hypotheses, in the form of feature terms, from positive and negative examples. The biases used in INDIE while searching the hypothesis space are explained while describing INDIE's algorithms. The representational bias of INDIE can be summarised in that it makes an intensive use of sorts and sort hierarchy, and in that it does not use negation but focuses on detecting path equalities. We show the results of INDIE in some classical relational datasets showing that it's able to find hypotheses at a level comparable to the original ones. The differences between INDIE's hypotheses and those of the other systems are explained by the bias in searching the hypothesis space and on the representational bias of the hypothesis language of each system.
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach
Authors: Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

Explicit-multithreading (XMT) is a parallel programming approach for exploiting on-chip parallelism. XMT introduces a computational framework with 1) a simple programming style that relies on fine-grained PRAM-style algorithms; 2) hardware support for low-overhead parallel threads, scalable load balancing, and efficient synchronization. The missing link between the algorithmic-programming level and the architecture level is provided by the first prototype XMT compiler. This paper also takes this new opportunity to evaluate the overall effectiveness of the interaction between the programming model and the hardware, and enhance its performance where needed, incorporating new optimizations into the XMT compiler. We present a wide range of applications, which written in XMT obtain significant speedups relative to the best serial programs. We show that XMT is especially useful for more advanced applications with dynamic, irregular access pattern, where for regular computations we demonstrate performance gains that scale up to much higher levels than have been demonstrated before for on-chip systems.
Determinants of program repair maintenance requirements
Authors: Lee L. Gremillion
Venue: Communications of the ACM (1984)

Considerable resources are devoted to the maintenance of programs including that required to correct errors not discovered until after the programs are delivered to the user. A number of factors are believed to affect the occurrence of these errors, e.g., the complexity of the programs, the intensity with which programs are used, and the programming style. Several hundred programs making up a manufacturing support system are analyzed to study the relationships between the number of delivered errors and measures of the programs' size and complexity (particularly as measured by software science metrics), frequency of use, and age. Not surprisingly, program size is found to be the best predictor of repair maintenance requirements. Repair maintenance is more highly correlated with the number of lines of source code in the program than it is to software science metrics, which is surprising in light of previously reported results. Actual error rate is found to be much higher than that which would be predicted from program characteristics.
FastSlim: prefetch-sfe trace reduction for I/O cache simulation
Authors: Wei Jin, Xiaobai Sun, Jeffrey S. Chase
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2001)

Trace-driven simulation is a valuable tool for evaluating I/O systems. This article presents a new algorithm, called FASTSLIM, that reduces the size of I/O traces and improves simulation performance without compromising simulation accuracy. FASTSLIM is more general than existing trace reduction algorithms in two ways. First, it is prefetch-safe: traces reduced by FASTSLIM yield provably exact simulations of I/O systems that use prefetching, a key technique for improving I/O performance. Second, FASTSLIM is compatible with a wide range of replacement policies, including common practical approximations to LRU. FASTSLIM-reduced traces are safe for simulations of storage hierarchies and systems with parallel disks. This article gives a formal treatment of prefetching and replacement issues for trace reduction, introduces the FASTSLIM algorithm, proves that FASTSLIM and variants are safe for a broad range of I/O caching and prefetching systems, and presents empirical results comparing FASTSLIM to competing trace reduction algorithms.
On knowledge-based programming with sensing in the situation calculus
Authors: Ray Reiter
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

We consider a class of knowledge-based Golog programs with sense actions. These programs refer explicitly to an agent's knowledge, and are designed to execute on-line, and under a dynamic closed-world assumption on knowledge. On-line execution of sense actions dynamically updates the background axioms with sentences asserting knowledge of the sense actions' outcomes. We formalize what all this might mean, and show that under suitable assumptions the knowledge modality in such programs can be implemented by provability. This leads to an on-line Golog interpreter for such programs, which we demonstrate on a knowledge-based program with sensing for the blocks world.
A middleware toolkit for client-initiated service specialization
Authors: Greg Eisenhauer, Fabián E. Bustamante, Karsten Schwan
Venue: ACM SIGOPS Operating Systems Review (2001)

As the Internet matures, streaming data services are taking an increasingly important place alongside traditional HTTP transactions. The need to dynamically adjust the delivery of such services to changes in available network and processing resources has spawned substantial research on application-specific methods for dynamic adaptation, including video and audio streaming applications. Such adaptation techniques are well developed, but they are also highly specialized, with the client (receiver) and server (sender) implementing well-defined protocols that exploit content-specific stream properties. This paper describes our efforts to bring the benefits of such content-aware, application-level service adaptation to all types of streaming data and to do so in a manner that is efficient and flexible. Our contribution in this domain is ECho, a high-performance event-delivery middleware system. ECho's basic functionality provides efficient binary transmission of event data with unique features that support dynamic data-type discovery and service evolution. ECho's contribution to data stream adaptation is in the mechanisms it provides for its clients to customize their data flows through type-safe dynamic server extension.
How conceptual system architecture leads to business process
Authors: Hernán Astudillo
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

While designing a global bank's Money-Link, the clustering of non-functional properties suggested two &ldquo;lobes&rdquo;: (1) transactional (enabling payments among affiliate banks), which required high-availability, high-security, and geographical distribution; and (2) analytic, with traditional database requirements. These purely architectural components coincided with business processes separately identified by business analysts. Architecture provided problem domain insight.
High level programming for distributed computing
Authors: Jerome A. Feldman
Venue: Communications of the ACM (1979)

Programming for distributed and other loosely coupled systems is a problem of growing interest. This paper describes an approach to distributed computing at the level of general purpose programming languages. Based on primitive notions of module, message, and transaction key, the methodology is shown to be independent of particular languages and machines. It appears to be useful for programming a wide range of tasks. This is part of an ambitious program of development in advanced programming languages, and relations with other aspects of the project are also discussed.
Parallel programs: proofs, principles, and practice
Authors: Gregory R. Andrews
Venue: Communications of the ACM (1981)

Several principles are identified from work on the verification of parallel programs. Concrete examples of the ways these principles can be applied, even when formal verification is not the goal, are then described. The purpose of this paper is to demonstrate ways in which the concepts of program verification yield insight into the programming process, programming languages, and program properties.