ppxscal/embedding_network huggingface dataset:
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
Authors: David Eppstein
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems; 3-SAT is equivalent to (2, 3)-CSP while the other problems above are special cases of (3, 2)-CSP. We give a fast algorithm for (3, 2)-CSP and use it to improve the time bounds for solving the other problems listed above. Our techniques involve a mixture of Davis-Putnam-style backtracking with more sophisticated matching and network flow based ideas.
Teaching design effectively in the introductory programming courses
Authors: Ahmad Ghafarian
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

Teaching program design in an introductory programming course is a big challenge for instructors. Over the past few years many studies have been performed on how and when to apply design in CS 1. Some researchers suggest that design methodologies and problem solving techniques should be introduced before any programming is taught, while others believe in the gradual integration of design into programming courses. We believe that the gradual integration of design into programming courses can be done effectively provided that appropriate measures of implementation are included. In this paper we present an approach to integrate design into the first programming course. The outcome of this integration is also presented.
Listening to the future: a 22nd century retrospective
Authors: Paula Underwood
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

In many Native American traditions no decision is made without considering its impact on the Seventh Generation hence. This may be the earliest form of an Environmental Impact Statement, but such evaluations included educational and social impacts as well. Each decision we make in cyberspace changes the nature of who we become as a people. Will the Seventh Generation hence bless or blame what we do now? Equity of access is vital in a functional democracy, but who is considering how we are changing with each step taken?
Natural language question-answering systems: 1969
Authors: Robert F. Simmons
Venue: Communications of the ACM (1970)

Recent experiments in programming natural language question-answering systems are reviewed to summarize the methods that have been developed for syntactic, semantic, and logical analysis of English strings. It is concluded that at least minimally effective techniques have been devised for answering questions from natural language subsets in small scale experimental systems and that a useful paradigm has evolved to guide research efforts in the field. Current approaches to semantic analysis and logical inference are seen to be effective beginnings but of questionable generality with respect either to subtle aspects of meaning or to applications over large subsets of English. Generalizing from current small-scale experiments to language-processing systems based on dictionaries with thousands of entries&mdash;with correspondingly large grammars and semantic systems&mdash;may entail a new order of complexity and require the invention and development of entirely different approaches to semantic analysis and question answering.
Asymmetric memory hierarchies
Authors: John G. Williams
Venue: Communications of the ACM (1973)

A study is presented of some of the system implications of memory hierarchies in which the backing or secondary store has a very small read time, relative to both the time required for writing and to the read time of conventional backing storage devices. Several analytic models are introduced, and it is shown that such hierarchies may operate in ways which differ from those of more conventional hierarchies. In particular, it is shown that it may not be necessary to multiprogram in such a situation. In the past, backing storage devices have been roughly symmetric with respect to their read and write times. This situation may not continue, as several devices are currently under development which may have a very small read-time/write-time ratio. This study places particular emphasis on one such system&mdash;the RCA read/write holographic optical memory.
On context and ambiguity in parsing
Authors: Douglas T. Ross
Venue: Communications of the ACM (1964)

This note is by way of commentary on the notions of &ldquo;bounded context&rdquo; of Floyd [1] and &ldquo;structural connections&rdquo; of Irons [2], as these notions relate to as yet unpublished researches growing out of the development of the author's Algorithmic Theory of Language [3, 4]. In the closing paragraphs of [3], the author made comments concerning further developments of the theory which would include &ldquo;context dependence&rdquo; and &ldquo;resolution of apparent syntactic ambiguities.&rdquo; The work on parsing reported here was carried out in early September, 1962 (an earlier version in March, 1962), but has not been polished or reduced to final form because, for the purpose of the total theory, parsing should not be considered separately, and the complexities of the proper treatment of the &ldquo;precedence string&rdquo; (which relates to semantic structure as distinct from syntactic structure of parsing) have not yet been satisfactorily resolved.
Effect of dependency relationships and ordered co-occurrence of words on Japanese information retrival (poster session)
Authors: Atsushi Matsumura, Atsuhiro Takasu, Jun Adachi
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

We propose two Japanese information retrieval methods that enhance retrieval effectiveness using relationships between words. One is a method using dependency relationships between words in a sentence, and another is a method using the ordered co-occurrence information of words in a sentence as an approximation to the dependency relationships between them. Through retrieval experiments using the Japanese test collection for information retrieval systems NTCIR-1, we showed our two methods are superior to the TF-IDF method in retrieval effectiveness and the difference between our two methods is small. These results are independent of the document set and of the search topic set.
An improvement to iterative methods of polynomial factorization
Authors: John A. C. Bingham
Venue: Communications of the ACM (1967)

Methods of polynomial factorization which find the zeros one at a time require the division of the polynomial by the accepted factor. It is shown how the accuracy of this division may be increased by dividing in order of both ascending and descending powers of the variable and choosing a crossover point which minimizes a very simply calculated error criterion.
Standard fixpoint iteration for Java bytecode verification
Authors: Zhenyu Qian
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

Java bytecode verification forms the basis for Java-based Internet security and needs a rigorous description. One important aspect of bytecode verification is to check if a Java Virtual Machine (JVM) program is statically well-typed. So far, several formal specifications have been proposed to define what the static well-typedness means. This paper takes a step further and presents a chaotic fixpoint iteration, which represents a family of fixpoint computation strategies to compute a least type for each JVM program within a finite number of iteration steps. Since a transfer function in the iteration is not monotone, we choose to follow the example of a nonstandard fixpoint theorem, which requires that all transfer functions are increasing, and monotone in case the bigger element is already a fixpoint. The resulting least type is the artificial top element if and only if he JVM program is not statically well-typed. The iteration is standard and close to Sun's informal specification and most commercial bytecode verifiers.
A format language
Authors: A. J. Perlis
Venue: Communications of the ACM (1964)

One of the most primitive parts of a formula language is its specification of input-output actions within the framework of the language. While the specification is intrinsically more complex, say, than the evaluation of an arithmetic expression, most of the difficulties associated with input-output specification arise from the fact that the desired operations have not been properly defined using the framework of a programming language. Indeed, the complexity largely disappears when a programming language is constructed to specify input-output actions. The point to be made here is that the definition of an appropriate programming language makes more rational and simpler all three phases of the input-output programming cycle: (i) source program construction, (ii) object program construction, (iii) object program execution.
An implemented graph algorithm for winning Shannon Switching Games
Authors: Stephen M. Chase
Venue: Communications of the ACM (1972)

In this tutorial paper a computer program which wins Shannon Switching Games is described. Since these games are played on graphs, the program is a good example of the implementation of graph algorithms. The two players in a Shannon Switching Game, CONNECT and CUT, have nonsimilar goals. Either CONNECT, CUT, or the player moving first is guaranteed the existence of a winning strategy. The simple strategy explained in this paper is valid in all three cases. In fact, the major routines never need to know whether the computer is CONNECT or CUT.
Security for infinite networks
Authors: Ruth Nelson, Hilary Hosmer
Venue: Proceedings of the 1995 workshop on New security paradigms (1995)

Although network security theory forbids many connections to large networks as being too risky, the reality is that large numbers of sensitive systems are connected to the Internet and that connectivity is increasing at a rapid rate. Firewalls and host protection mechanisms are used in a somewhat arbitrary fashion, depending more on the availability of products than on a clear understanding of security principles. We need to expand security theory to protect large networks.This paper proposes a new paradigm for security in large networks, based on an understanding of the sometimes conflicting requirements for security, connectivity and functionality. The paradigm, called FICS-IT, consists of a philosophy, an approach, a framework and a collection of components. It is based on an understanding of security as risk management and includes local resource control; multiple, tailored security policies; layered, functoinal access control; and recognition of heterogeneity in architecture, ownership and policy.
Supply-Chain Synchronization: Lessons from Hyundai Motor Company
Authors: Chan K. Hahn, Edward A. Duplaga, Janet L. Hartley
Venue: Interfaces (2000)

One of the challenges of supply-chain management is developing ways to effectively integrate activities across organizations on the supply chain. Hyundai Motor Company developed mechanisms to coordinate production planning and scheduling activities among supply-chain members. Hyundai Motor's production-and-sales-control (P/SC) department uses regularly scheduled cross-functional meetings and scheduling policies to coordinate supply-chain activities. When implementing this process, the P/SC department overcame structural, environmental, and behavioral problems. Although Hyundai management concedes that the process is not perfect, communication among supply-chain members has improved, and the P/SC group has successfully promoted mutual understanding and respect among functional areas. The primary benefit, ultimately, is improved customer satisfaction through better integration of functional activities.
The UNIX time-sharing system
Authors: Dennis M. Ritchie, Ken Thompson
Venue: Communications of the ACM (1974)

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 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.
Algorithm 421: complex gamma function with error control [S14]
Authors: Hirondo Kuki
Venue: Communications of the ACM (1972)

This Fortran program computes either the gamma function or the loggamma function of a complex variable in double precision. In addition, it provides an error estimate of the computed answer. The calling sequences are: CALL CDLGAM (Z, W, E, 0) for the loggamma, and CALL CDLGAM (Z, W, E, 1) for the gamma, where Z is the double precision complex argument, W is the answer of the same type, and E is a single precision real variable. Before the call, the value of E is an estimate of the error in Z, and after the call, it is an estimate of the error in W.
PlanMine: Predicting Plan Failures Using Sequence Mining
Authors: Mohammed J. Zaki, Neal Lesh, Mitsunori Ogihara
Venue: Artificial Intelligence Review (2000)

This paper presents the PlanMine sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because previous data mining algorithms were overwhelmed by the staggering number of very frequent, but entirely unpredictive patterns that exist in the plan database. This paper combines several techniques for pruning out unpredictive and redundant patterns which reduce the size of the returned rule set by more than three orders of magnitude. PlanMine has also been fully integrated into two real-world planning systems. We experimentally evaluate the rules discovered by PlanMine, and show that they are extremely useful for understanding and improving plans, as well as for building monitors that raise alarms before failures happen.
PHOSPHORUS: a task-based agent matchmaker
Authors: Yolanda Gil, Surya Ramachandran
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

PHOSPHORUS is an agent matchmaking service that exploits domain ontologies, description logic, and a highly declarative language to reason about task-related agent capabilities. PHOSPHORUS uses the EXPECT goal language to represent the tasks that agents are capable of accomplishing, as well as requests to locate agents with a required capability. PHOSPHORUS supports matching through subsumption, reverse subsumption, and several kinds of goal reformulation.
Computing curricula 2001 how will it work for you?
Authors: Eric Roberts, Gerald Engel, C. Fay Cover, Andrew McGettrick, Carl Chang, Ursula Wolz
Venue: ACM SIGCSE Bulletin (2001)

In the fall of 1998, the ACM Education Board and the Educational Activities Board of the IEEE Computer Society appointed representatives to a joint task force to prepare Computing Curricula 2001 (CC2001), the next installment in a series of reports on the undergraduate computer science curriculum that began in 1968 and was then updated in 1978 and 1991. Interim reports on the initial planning of the curriculum were presented at the SIGCSE symposium and the IEEE Frontiers in Education Conference in both 1999 and 2000. The CC2001 Task Force released its first draft report at the 2000 SIGCSE conference and plans to release its penultimate draft at SIGCSE 2001. The purpose of this session is to describe how we expect the recommendations of the report to apply in practice. The panelists represent a range of institutions and can therefore speak to the questions that audience members from similar institutions might have.
Computer technology students - what skills do they really need?
Authors: Elizabeth Haywood, Jane Madden
Venue: Proceedings of the Australasian conference on Computing education (2000)

As part of a continuing desire to improve the employability of computer technology students, we are focussing on the knowledge and skills that graduates need in the workforce. In order to do this we solicited the opinion of working graduates with regard to the usefulness of technical and non-technical knowledge in the workplace and to the skills that they learnt during their studies at University. This paper analyses the replies that graduates made to a questionnaire and describes both the teaching methods and the content of the three key subjects that are offered as co-requisites in the Bachelor of Science, Computer Technology. This work is of interest to all educators, especially those involved in course development and those interested in graduate outcomes. The ranking of time management as the most important skill to be learned and applied in the workplace was unexpected, but on reflection, given the calibre of many of the students, is understandable.
Social presence in Web surveys
Authors: Mick P. Couper, Roger Tourangeau, Darby M. Steiger
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Social interface theory has widespread influence in the field of human-computer interaction. The basic thesis is that humanizing cues in a computer interface can engender responses from users similar to human-human interaction. In contrast, the survey interviewing literature suggests that computer administration of surveys on highly sensitive topics reduces or eliminates social desirability effect, even when such humanizing features as voice are used.In attempting to reconcile these apparently contradictory findings, we varied features of the interface in a Web survey (n=3047). In one treatment, we presented an image of 1) a male researcher, 2) a female researcher, or 3) the study logo at several points. In another, we varied the extent of personal feedback provided. We find little support for the soical interface hypothesis. We describe our study and discuss possible reasons for the contradictory evidence on social interfaces
A note on hash linking
Authors: Daniel G. Bobrow
Venue: Communications of the ACM (1975)

In current machine designs, a machine address gives the user direct access to a single piece of information, namely the contents of that machine word. This note is based on the observation that it is often useful to associate additional information, with some (relatively few) address locations determined at run time, without the necessity of preallocating the storage at all possible such addresses. That is, it can be useful to have an effective extra bit, field, or address in some words without every word having to contain a bit (or bits) to mark this as a special case. The key idea is that this extra associated information can be found by a table search. Although it could be found by any search technique (e.g. linear, binary sorted, etc.), we suggest that an appropriate low overhead mechanism is to use hash search on a table in which the key is the address of the cell to be augmented.
Scan conversion algorithms for a cell organized raster display
Authors: R. C. Barrett, B. W. Jordan,  Jr.
Venue: Communications of the ACM (1974)

Raster scan computer graphics with &ldquo;real time&rdquo; character generators have previously been limited to alphanumeric characters. A display has been described which extends the capabilities of this organization to include general graphics. Two fundamentally different scan conversion algorithms which have been developed to support this display are presented. One is most suitable to noninteractive applications and the other to interactive applications. The algorithms were implemented in Fortran on the CDC6400 computer. Results obtained from the implementations show that the noninteractive algorithms can significantly reduce display file storage requirements at little cost in execution time over that of a conventional raster display. The interactive algorithm can improve response time and reduce storage requirements.
The fifth generation project &mdash; a trip report
Authors: Ehud Y. Shapiro
Venue: Communications of the ACM (1983)

As part of Japan's effort to become a leader in the computer industry, the Institute for New Generation Computer Technology has launched a revolutionary ten-year plan for the development of large computer systems which will be applicable to knowledge information processing systems. These Fifth Generation computers will be built around the concepts of logic programming. In order to refute the accusation that Japan exploits knowledge from abroad without contributing any of its own, this project will stimulate original research and will make its results available to the international research community.
A capstone course for a computer information systems major
Authors: Sharon M. Tuttle,  Ph.D.
Venue: Journal of Computing Sciences in Colleges (2001)

This paper describes the current form and organization of Humboldt State University's CIS 492: Systems Design and Implementation, the capstone course for the Computer Information Systems (CIS) major. Since Spring 1998, this course has combined a team programming experience on a large-scale database project with discussions of a software engineering classic, Frederick Brooks Jr.'s &ldquo;The Mythical Man Month&rdquo;[1]. Students seem to find this combination valuable, and it is hoped that this paper can impart some useful ideas to others in designing a CIS/MIS capstone course.
Some complete calculi for matrices
Authors: Rudolf Bayer, Christoph Witzgall
Venue: Communications of the ACM (1970)

A matrix calculus is introduced with the intention of developing data structures suitable for a high level algorithmic language for mathematical programming. The paper investigates how the special structure of matrices can be described and utilized for efficient computing by saving memory space and superfluous operations. Sequences of matrices (and sequences of sequences of matrices) are considered, and matrix operators are extended to sequence operators and cumulative operators. Algorithms are given which use symbol manipulation of matrix expressions so as to find the forms best suited for computation. These forms are called normal forms. Several completeness results are obtained in the sense that for each expression an equivalent expression in normal form can be found within a specified calculus.
A linear sieve algorithm for finding prime numbers
Authors: David Gries, Jayadev Misra
Venue: Communications of the ACM (1978)

A new algorithm is presented for finding all primes between 2 and n. The algorithm executes in time proportional to n (assuming that multiplication of integers not larger than n can be performed in unit time). The method has the same arithmetic complexity as the algorithm presented by Mairson [6]; however, our version is perhaps simpler and more elegant. It is also easily extended to find the prime factorization of all integers between 2 and n in time proportional to n.
Clinical trial remote data capture client/server solution
Authors: Russel L. Traher,  II
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

This presentation illustrates a software and hardware solutions that provides a speedy but reliable and secure delivery of patient clinical trial data to a research data center. A wireless data entry terminal captures patient data and performs data cleaning during data entry. The data is later uploaded to a remote database via a wireless service gateway that is connected to the Internet over a high-speed broadband connection. This data is available immediately after being uploaded to the clinical database. The significant reduction in data delivery cycle time provides a considerable reduction in trial costs and faster time to market for the new procedure or device.