ppxscal/embedding_network huggingface dataset:
An intelligent analyzer and understander of English
Authors: Yorick Wilks
Venue: Communications of the ACM (1975)

The paper describes a working analysis and generation program for natural language, which handles paragraph length input. Its core is a system of preferential choice between deep semantic patterns, based on what we call &ldquo;semantic density.&rdquo; The system is contrasted: with syntax oriented linguistic approaches, and with theorem proving approaches to the understanding problem.
SIVIL: a true visual programming language for students
Authors: Timothy F. Materson, R. Mark Meyer
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

This paper discusses the advantages and disadvantages of using SIVIL (SImple VIsual Language), a new visual programming language in development at Canisius College, to teach novice programmers to think more deeply about programming. In consideration of how SIVIL meets its goal of making programming easier for beginners, the paper will look at Bloom's Taxonomy, specifically at Bloom's levels of learning and how a visual language might aid or speed up the learning curve for students endeavoring to join the world of programming.
Mesh Independence of Matrix-Free Methods for Path Following
Authors: W. R. Ferng, C. T. Kelley
Venue: SIAM Journal on Scientific Computing (1999)

In this paper we consider a matrix-free path following algorithm for nonlinear parameter-dependent compact fixed point problems. We show that if these problems are discretized so that certain collective compactness and strong convergence properties hold, then this algorithm can follow smooth folds and capture simple bifurcations in a mesh-independent way.
Matrix computations with Fortran and paging
Authors: Cleve B. Moler
Venue: Communications of the ACM (1972)

The efficiency of conventional Fortran programs for matrix computations can often be improved by reversing the order of nested loops. Such modifications produce modest savings in many common situations and very significant savings for large problems run under an operating system which uses paging.
COBOL: a sample problem
Authors: Thomas N. Mackinson
Venue: Communications of the ACM (1961)

COBOL (COmmon Business Oriented Language) is an English Language programming system which is capable of being implemented on a wide variety of electronic digital computers for use in the solution of business data processing problems. The idea was conceived in May, 1959 at a meeting called in the Pentagon by Mr. Charles Phillips of the Office of the Assistant Secretary of Defense, Comptroller. The purpose of this meeting was to consider the desirability and the feasibility of establishing a common language for the programming of electronic computers for data processing. Representatives from computer user installations, both government and industrial, computer manufacturers, universities, and others concerned with computers were present. There was almost unanimous agreement that the project was both desirable and feasible. The COnference on DAta SYstems Languages (CODASYL) was established, and three committees were defined and staffed. These committees were the Short Range Committee, the Intermediate Range Committee, and the Long Range Committee. Each committee had its own goal and its own time scale. The coordination of the work to be performed was to be accomplished by an Executive Committee.
Real-time lab excercises: a teacher's dilemma
Authors: Erik Herzog, Peter Loborg, Simin Nadjm-Tehrani
Venue: ACM SIGCSE Bulletin (2001)

This paper describes our design of real-time systems laboratories in an integrated theme of study which includes automatic control. The theme appears at the end of the third year of a 4,5 year master of engineering programme, which adopts Problem-Based Learning (PBL) as a main pedagogical method. We describe the rationale behind our choice of application area, the lab environment, and the operating system used. The paper concludes by giving some qualitative evaluations as well as some quantitative measures based on limited data.
Irreducible trinomials over finite fields
Authors: Joachim von zur Gathen
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

A necessary criterion for irreducibility of a trinomial over a finite field, based on classical results of Stickelberger and Swan, is established. It is applied in the special case F3.
Layered memory using backward-chaining
Authors: Joshua Gay
Venue: Journal of Computing Sciences in Colleges (2001)

This is a progress report on my research project to design a model for layered memory in an intelligent agent. I am using the cognitive model of human memory [4] as the design reference. It defines three layers: sensory information storage (SIS); short-term memory (STM); and long-term memory (LTM). SIS processes sensory inputs and motor skills. It is fast but `brittle' in being difficult to reprogram. It can be implemented as neural networks. STM is the seat of rationality and goal-setting. It is relatively fast, but its storage is small (perhaps seven semantic `chunks'). It can be implemented as a knowledge-base (KB). LTM stores vivid sensory impressions, heuristic rules, and syntactic knowledge. Its storage is large but slow; reconstruction of STM state from LTM may be unreliable. It can be implemented as a database. The focus of my research at this point is the STM layer. A key feature of my STM model is backward-chaining inference. I present here a prototype of my layered memory model and the important points I have learned in implementing the STM layer.
Ordering and Parameterizing Scattered 3D Data for B-Spline Surface Approximation
Authors: Fernand S. Cohen, Walid Ibrahim, Chuchart Pintavirooj
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Surface representation is intrinsic to many applications in medical imaging, computer vision, and computer graphics. We present a method that is based on surface modeling by B-Spline. The B-Spline constructs a smooth surface that best fits a set of scattered unordered 3D range data points obtained from either a structured light system (a range finder), or from point coordinates on the external contours of a set of surface sections, as for example in histological coronal brain sections. B-Spline stands as of one the most efficient surface representations. It possesses many properties such as boundedness, continuity, local shape controllability, and invariance to affine transformations that makes it very suitable and attractive for surface representation. Despite its attractive properties, however, B-Spline has not been widely applied for representing a 3D scattered nonordered data set. This may be due to the problem in finding an ordering and a choice for the topological parameters of the B-Spline that lead to a physically meaningful surface parameterization based on the scattered data set. The parameters needed for the B-Spline surface construction, as well as finding the ordering of the data points, are calculated based on the geodesics of the surface extended Gaussian map. The set of control points is analytically calculated by solving a minimum mean square error problem for best surface fitting. For a noise immune modeling, we elect to use an approximating rather than an interpolating B-Spline. We also examine ways of making the B-Spline fitting technique robust to local deformation and noise.
Grouping and parameterizing irregularly spaced points for curve fitting
Authors: A. Ardeshir Goshtasby
Venue: ACM Transactions on Graphics (TOG) (2000)

Given a large set of irregularly spaced points in the plane, an algorithm for partitioning the points into subsets and fitting a parametric curve to each subset is described. The points could be measurements from a physical phenomenon, and the objective in this process could be to find patterns among the points and describe the phenomenon analytically. The points could be measurements from a geometric model, and the objective could be to reconstruct the model by a combination of parametric curves. The algorithm proposed here can be used in various applications, especially where given points are dense and noisy. Examples demonstrating the behavior of the algorithm under noise and density of the points are presented and discussed.
Electronic document addressing: dealing with change
Authors: Helen Ashman
Venue: ACM Computing Surveys (CSUR) (2000)

The management of electronic document collections is fundamentally different from the management of paper documents. The ephemeral nature of some electronic documents means that the document address (i.e., reference details of the document) can become incorrect some time after coming into use, resulting in references, such as index entries and hypertext links, failing to correctly address the document they describe. A classic case of invalidated references is on the World Wide Web&mdash;links that point to a named resource fail when the domain name, file name, or any other aspect of the addressed resource is changed, resulting in the well-known Error 404. Additionally, there are other errors which arise from changes to document collections.This paper surveys the strategies used both in World Wide Web software and other hypertext systems for managing the integrity of references and hence the integrity of links. Some strategies are preventative, not permitting errors to occur; others are corrective, discovering references errors and sometimes attempting to correct them; while the last strategy is adaptive, because references are calculated on a just-in-time basis, according the current state of the document collection.
An analysis of operating system behavior on a simultaneous multithreaded architecture
Authors: Joshua A. Redstone, Susan J. Eggers, Henry M. Levy
Venue: ACM SIGPLAN Notices (2000)

This paper presents the first analysis of operating system execution on a simultaneous multithreaded (SMT) processor. While SMT has been studied extensively over the past 6 years, previous research has focused entirely on user-mode execution. However, many of the applications most amenable to multithreading technologies spend a significant fraction of their time in kernel code. A full understanding of the behavior of such workloads therefore requires execution and measurement of the operating system, as well as the application itself.To carry out this study, we (1) modified the Digital Unix 4.0d operating system to run on an SMT CPU, and (2) integrated our SMT Alpha instruction set simulator into the SimOS simulator to provide an execution environment. For an OS-intensive workload, we ran the multithreaded Apache Web server on an 8-context SMT. We compared Apache's user- and kernel-mode behavior to a standard multiprogrammed SPECInt workload, and compared the SMT processor to an out-of-order superscalar running both workloads. Overall, our results demonstrate the micro-architectural impact of an OS-intensive workload on an SMT processor and provide insight into the OS demands of the Apache Web server. The synergy between the SMT processor and Web and OS software produced a greater throughput gain over superscalar execution than seen on any previously examined workloads, including commercial databases and explicitly parallel programs.
Imprecise data computation for high performance asynchronous processors
Authors: Jeong-Gun Lee
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Instruction level parallelism(ILP) is strictly limited by various dependencies. In particular , data dependency is the major performance bottleneck of data intensive applications. To accelerate the execution of sequential code serialized due to data dependencies, this paper proposes an imprecise computation as a fast data computing technique for a high-performance asynchronous processor. To show the performance benefits of the suggested computing model, simulation results are presented. The imprecise computation can be used effectively in data intensive processing with a microprocessor, a Digital Signal Processor or a multimedia processor.
L3&mdash;towards an open learning environment
Authors: Torsten Leidig
Venue: Journal on Educational Resources in Computing (JERIC) (2001)

This article describe the use of dedicated ontology for teaching in the context of the L3 project, a national joint project for deploying further vocational education in Germany. The requirements for the open L3 learning infrastructure are presented in order to motivate our approach to metamodeling learning resources and services by using dedicated ontolgies of pedagogics and didactics. The basic concepts and parts of the pedagogical ontology are outlined, and the practical implications for several of today's problems such as authoring and design, retrieval and adaptive of training resources are illustrated. An overview of the L3 runtime architecture shows how the didactical ontology is used to deliver adaptive learning.
Circumcision in paediatric surgery using an ultrasound dissection scalpel
Authors: A. Fette, J. Schleef, A. Haberlik, U. Seebacher
Venue: Technology and Health Care (2000)

In contrast to electrocautery, the ultrasound dissection scalpel allows tissue dissection and haemostasis to be performed without the danger of thermal tissue damage or burning caused by uncontrolled active current. In a clinical application study performed on 24 boys with an average age of six years, we examined whether the use of this instrument is also practical in a routine operation such as circumcision. It was possible to perform all operations with the ultrasound dissection scalpel (Ultracision$^{\rm R}$, manufactured by Ethicon) by the classic technique without the additional use of electrocautery for haemostasis. Although dissecting speed is slower than with conventional instruments, the fact that simultaneous haemostasis is possible meant that operations could be carried out quickly and with minimal bleeding. There were no perioperative complications such as haemorrhaging or burning. All children were examined postoperatively over an average of 3 weeks (range 1--8 weeks). Wound healing was completely without complications for 22 patients (92%) patient (4%) week. One further patient (4%) from an extended chronic inflammation of the prepuce, developed pronounced swelling postoperatively. Heavy scarring occured subsequently in both cases. Our results show that the advantages of the ultrasound dissection scalpel, e. g. gentle tissue dissection with simultaneous haemostasis, can also be used to advantage for a technically simple operation such as circumcision without having to fear the risks of electrocautery.
Simulation of traffic flows in a network
Authors: Toshiyuki Sakai, Makoto Nagao
Venue: Communications of the ACM (1969)

A computer simulation program which deals with traffic flows in the network of a large area is described. Each road is segmented into blocks of several ten-meter lengths and is represented by a bidirectional list in computer memory. The movement of cars, i.e. the transfer of cars from one block to the next, is expressed by a proper formula. This formula is based on the supposition that the speed of cars in a block is determined only by the density of cars in the block, and this speed-versus-density curve is empirically given the numerical values. This simulation scheme has its excellent point in that it makes it possible to trace the dynamic behavior of traffic flows in a variety of situations, some examples of which are given for an actual area of the city of Kyoto, Japan.
Approximate multivariate polynomial factorization based on zero-sum relations
Authors: Tateaki Sasaki
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Conventional algorithms for approximate factorization of multivariate polynomial suffer from a dilemma: a polynomial-time algorithm which is based on zero-sum relations among power-series roots is practically very time-consuming and unstable, while practically stable algorithms are of combinatorial nature. In this paper, we present two ideas: one is a numeric matrix manipulation method to find zero-sum relations efficiently and the other is a method to utilize power-series roots expanded at different points. We analyze the methods theoretically and investigate their practicality by applying to several examples. We also discuss numerical stability of the matrix method.
Solution of a problem in concurrent programming control
Authors: E. W. Dijkstra
Venue: Communications of the ACM (1983)

A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the &ldquo;critical section&rdquo; of its cycle.
A computational model and classification framework for social navigation
Authors: Mark O. Riedl
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

Social navigation is the process of making navigational decisions in real or virtual environments based on social and communicative interaction with others. A computational model for social navigation is presented as an extension to an existing framework for general navigation, reducing decision-making to the minimization of cognitive costs. Consideration for social navigation gives rise to a classification framework based on the synchronicity, directness, and social presence during social interaction, each of which has direct effect on the cognitive costs of navigational tasks. Finally, a new recommender system, TRAILGUIDE, is presented as a tool that facilitates social navigation by allowing authors to explicitly publish "trails" within and between World Wide Web pages.
Beyond the wall: computing with molecules
Authors: David I. Lewin
Venue: Computing in Science and Engineering (2001)

Silicon-based transistors and circuits are just too big, say a small group of researchers in the new field of nanoelectronics. To create electronic devices far smaller than those currently available, researchers are turning to single, electron-conducting molecules or small groups of metal atoms. The effort has received support from the Defense Advanced Research Projects Agency in the United States and from the European Commission abroad.
A critque of the stage hypothesis: theory and empirical evidence
Authors: Izak Benbasat, Albert S. Dexter, Donald H. Drury, Robert C. Goldstein
Venue: Communications of the ACM (1984)

The stage hypothesis on the assimilation of computing technology provides one of the most popular models for describing and managing the growth of administrative information systems. Despite little formal evidence of its reliability or robustness, it has achieved a high level of acceptance among practitioners. We describe and summarize the findings of seven empirical studies conducted during the past six years that tested various hypotheses derived from this model. The accumulation of evidence from these studies casts considerable doubt on the validity of the stage hypothesis as an explanatory structure for the growth of computing in organizations. 3~
A heuristic for page turning in a multiprogrammed computer
Authors: John W. Weil
Venue: Communications of the ACM (1962)

One school of thought for future computer systems involves the use of large computer complexes, time-shared among many users. Because internal computer speeds are so much greater than communication speeds with the outside world, machine efficiency requires that a large system be capable of working on many programs at once, and working on each in turn while others are completing input-output operations. One approach [1] to a successful multi-programmed computer has been called &ldquo;page turning&rdquo;, where the object programs are automatically broken into blocks of a fixed size (pages) and these pages are then shuffled in and out of the main store automatically by the operator system as reference to the data or instructions contained in each page may dictate. Experience to date indicates that this process is prohibitively time-consuming if significant hardware features are not included to aid the executive program in carrying out this task. It is not the purpose of this note to discuss these hardware features but to address specifically a single aspect of the situation which remains a problem even if adequate hardware features are provided.
Characterizing Web user sessions
Authors: Martin Arlitt
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

This paper presents a detailed characterization of user sessions to the 1998 World Cup Web site. This study analyzes data that was collected from the World Cup site over a three month period. During this time the site received 1.35 billion requests from 2.8 million distinct clients. This study focuses on numerous user session characteristics, including distributions for the number of requests per session, number of pages requested per session, session length and inter-session times. This paper concludes with a discussion of how these characteristics can be utilized in improving Web server performance in terms of the end-user experience.
Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design
Authors: Robert J. Hall
Venue: Proceedings of the third workshop on Formal methods in software practice (2000)

With a few exceptions, previous formal methods for reactive system design have focused on finite state machines represented in terms of boolean states and boolean next-state functions. By contrast, in many reactive system domains requirements engineers and developers think in terms of complex data types and expressive next-state functions. Formal methods for reactive system design must be extended to meet their needs as well. I term a reactive system function rich if expressing its state, next-state function, or output function naturally requires this higher expressive power. ISAT, a prototype formal-methods based tool environment, is intended to assist in the creation of function rich reactive systems. This paper describes a case study I have carried out using ISAT to design, validate, synthesize, and evolve controllers for the email agent components making up a novel spam-free email system that I deployed in a user trial in July 1999. The trial has been running since, with high availability, through several evolutionary specification changes and resulting software releases. In addition to summarizing ISAT and the trial, this paper discusses tool requirements placed by the domain and task, the simple and powerful platform/controller/pure-functions software architecture of the components, as well as lessons learned from the study.