ppxscal/embedding_network huggingface dataset:
The use of theorem-proving techniques in question-answering systems
Authors: C. Cordell Green, Bertram Raphael
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

For the purpose of this paper, a question-answering system is a computer program that has at least the following three characteristics: (1) The ability to accept statements of fact and store them in its memory (2) The ability to search stored information efficiently and to recognize items that are relevant to a particular query (3) The ability to respond appropriately to a question by identifying and presenting the answer if it is present in memory, and by deducing a reasonable logical response from relevant knowledge if the complete answer is not explictly available.
VEEP vehicle economy, emissions, and performance program
Authors: Donald A. Heimburger, Marcia A. Metcalfe
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

VEEP is a general-purpose discrete event simulation program being developed to study the performance, fuel economy, and exhaust emissions of a vehicle modeled as a collection of its separate components. It is written in SIMSCRIPT II.5. The purpose of this paper is to present the design methodology, describe the simulation model and its components, and summarize the preliminary results. Topics include chief programmer team concepts, the SDDL design language, program portability, user-oriented design, the program's user command syntax, the simulation procedure, and model validation.
GPSS extended capabilities and modifications
Authors: J. W. Walton, L. W. Terry
Venue: Proceedings of the second conference on Applications of simulations (1968)

The following paper is a description of a Boeing Modeling Technique (BMT) System. The system was derived from GPSS II-B and contains some desirable GPSS/360 capabilities in addition to extended capabilities and modifications.
REDUCE 2: A system and language for algebraic manipulation
Authors: Anthony C. Hearn
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

A description of a new version of the algebraic manipulation system REDUCE is presented. In its latest form, REDUCE provides a complete language for interactive symbol manipulation by computer in addition to increased facilities for the simplification of algebraic expressions.
ALTAC, FORTRAN, and compatibility
Authors: Saul Rosen
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

One of the major aims in the development of universal or common problem-oriented languages has been to permit a user to make the transition from one computer to another without the necessity of a complete reprogramming job. The ALTAC compiler, compatible with FORTRAN II, has been used to implement such a transition from the IBM 704 to the PHILCO 2000 at a number of installations. To the best of my knowledge this is the first time that a compiler has assumed the major burden of transition from a large scale computer of one manufacturer to an even larger scale computer of another manufacturer.
&ldquo;Do I press return?&rdquo;
Authors: Liz Levine, Beverly Woolf, Rich Filoramo
Venue: ACM SIGCSE Bulletin (1984)

The introductory programming course at this university attempts to serve some 1500 students each semester. The attrition rate, due in part to the overload on the system and in part to the students' difficulties in &ldquo;keeping up&rdquo;, has, at times, approached 25%. In response to this situation we have revised and reordered the curriculum for use in an experimental course designed for the novice user. The course is directed toward discovering and addressing the confusions of new programming students. It facilitates our ongoing study of the novice programmers' response to graphics, friendly interface packages and the revised curriculum which includes the teaching of procedures and control structures at the beginning of the course. In studying these responses we have learned some techniques in aiding the novice user to unravel some of the mysteries surrounding the acquisition of programming skills. The course is constantly undergoing development in addition to being in its second semester as a departmental offering. It is detailed in this paper.
A tool for program grading: The Jacksonville university scale
Authors: R. Wayne Hamm, Kenneth D. Henderson,  Jr., Marilyn L. Repsher, Kathleen M. Timmer
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

The main purpose of this paper is to discuss about the Jacksonville University Scale, a tool for program grading and it's advantages.
Resource controller tasks in ADA: Their structure and semantics
Authors: Krithivasan Ramamritham
Venue: Proceedings of the 7th international conference on Software engineering (1984)

The focus of this paper is on the processes that control access to shared resources in concurrent systems. Processes that access a shared resource send access requests to the controller of the shared resource which in turn services requests based on such criteria as the conditions enabling the requests, the fairness specified, etc. In this paper we examine the structure of resource controllers, in particular, we show how resource controllers manifest themselves in Ada. Our prime motivation for this work is to develop schemes by which controllers with complex resource control policies can be implemented using the tasking constructs of Ada. To enable the verification of Ada resource controllers, we provide a temporal semantics for the tasking constructs as well as for the resource controller components.
Toward CAM-oriented CAD
Authors: Farhad Arbab, Larry Lichten, Michel A. Melkanoff
Venue: Proceedings of the 19th Design Automation Conference (1982)

A new solid modeling scheme is proposed and developed as the core of an integrated approach to the computer aided design and manufacture of mechanical parts. The benefits of this methodology, which considers the manufacturing process during the design phase, are discussed in the context of an integrated CAD/CAM system.
Computer management studies for developing countries
Authors: Gordon Davies, Charles D. Easteal
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

This paper describes the postgraduate course in Computer Management Studies given to students from developing countries at University College London. A brief historical introduction is followed by a discussion of the objectives and philosophy of the course; our experiences of the problems encountered by the students on the course, both before they arrive in London and while resident in London, are described. Our proposals for an improved, but probably shorter, course are followed by syllabuses and statistics relating to participants.
Caddie an interactive design environment
Authors: Björn Pehrson, Joachim Parrow
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

The paper reports on a design methodology and an experimental CAD system, named Caddie, based on this methodology. Caddie supports specification, analysis and synthesis of objects that can be described as communicating processes, e.g. electronic circuits, sequential networks, digital processors and programs. Basic ideas behind Caddie are: - top-down hierarchical design. Specifications are broken down hierarchically by stepwise refinement - integrated design. Design objects from different design phases are described in the same formalism. This technique allows universal design operations. - formal systems with varying descriptive and decisive powers are exploited - incremental design. Parts can be modified separately without effect on other parts. - interactive design, i.e. the designer can interact with the design tools in real time Caddie is implemented in Concurrent-lisp, an extension of lisp supporting concurrent programming. Automatic programming tools have been used in the implementation. Caddie consists of - an interactive parallel programming environment - automatic design procedures - a run-time system for execution of design objects (real-time and branching or exhaustive simulation)
Panel on military data networks: Present plans and future requirements
Authors: Irwin Lebow, Robert E. Lyons, Chris N. Wilcox, Thomas Bartee
Venue: Proceedings of the sixth symposium on Data communications (1979)

In the first talk, Dr. Lebow will discuss DoD plans for providing secure voice for three disparate communities within DoD: 1. Narrowband Tactical (datarate: up to 2.4 KB), 2. Wideband Tactical (16 and 32 KB) and 3. Long-haul Strategic (DCS-based, up to 9.6 KB). Dr. Lebow will compare advantages and deficiencies of the three systems and will discuss the evolution of these systems into a two-rate architecture in the 1990's., In the second paper, Dr. Lyons will discuss the DoD system architecture concept for the evolutionary growth of defense data networks: the Integrated AUTODIN System Architecture (IASA). The third paper, presented by Lt. Col. Wilcox will discuss DoD plans for the integrated development of standard Automated Message Handling (AMH) systems for military end-user applications. The final paper, by Dr. Bartee, is a discussion of protocol standardization requirements for the interconnection of present and future DoD data networks such ARPANET, AUTODIN I II, and other DoD data handling networks such as Intelligence community's COINS II (Community On-line Intelligence Network System), and IDHSC II (Intelligence Data Handling System Communications). Bartee will conclude his talk with a discussion of database management problems in computer networks. The discussion will emphasize the data acquisition problem. The session will conclude with a panel discussion among the authors, with questions from the session chairman and the audience.
Computational aspects on the use of cutting planes in global optimization
Authors: P. B. Zwart
Venue: Proceedings of the 1971 26th annual conference (1971)

Minimization of a nonconvex objective function subject to linear inequality constraints can involve many local minima. Cutting plane methods for solving such problems have been proposed in the literature. This paper reports computational experience indicating that cutting methods do poorly on problems with dimension as low as ten. A geometric analysis of the conditions involved in cutting a polyhedron shows that: 1)The effect of a fixed depth cut decreases rapidly as dimension is increased, and 2)The approximation of a polyhedron by the cone formed by faces coincident to a given extreme point, becomes rapidly worse as dimension is increased.
Multi-resolution backward video coding
Authors: A. Nosratinia, M. T. Orchard
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

Hierarchical decomposition of images and their relationship with motion fields continues to be a hotly pursued topic, and the role of backward motion information in coding is beginning to capture the interest of video coding community. This paper simultaneously addresses some of the fundamental issues in multi-resolution and backward motion systems. From a coding viewpoint, a multi-resolution motion hierarchy should be coupled with an estimation system that deals with a maximally subsampled wavelet decomposition of the frames, to avoid redundancy of representation. Given the known difficulties of band-to-band motion compensated estimation in a wavelet domain, we use an alternative approach for estimation of detail bands, using lowpass bands of the anchor frames at higher resolutions. The resulting estimation errors are coded through a zerotree quantizer. Simulations show that a prototype coder of this type is very competitive, with a performance better than conventional forward (block-based) coders.
Computer-assisted template layout
Authors: Kenneth E. Smith
Venue: Proceedings of the 7th Design Automation Workshop (1970)

This paper discusses a mnemonic coding language and translation program used to produce master sheet metal templates on a computer-controlled flatbed plotter. The major advantage of computer-assisted template layout is the ability to reproduce identical templates for use at different locations or to replace mutilated templates by simply reprocessing the original input data cards through a computer-plotter combination. A typical template required about two hours for preparation of the input data and seventeen minutes computer-plotter processing time.
Functional testing of digital systems
Authors: Kwok-Woon Lai, Daniel P. Siewiorek
Venue: Proceedings of the 20th Design Automation Conference (1983)

Functional testing is testing aimed at validating the correct operation of a digital system with respect to its functional specification. We have designed and implemented a practical test generation methodology that can generate tests directly from a system's high-level specification. Solutions adopted include multi-level fault models and multi-stage test generation. Tests generated from the methodology were compared against test programs supplied by a computer manufacturer and were found to detect more faults with much better efficiency. The experiment demonstrated that functional testing can be both practical and efficient. Automatic generation of design validation tests is now closer to reality.
APLSV for a flexible man-computer dialog
Authors: J. Beetz
Venue: Proceedings of seventh international conference on APL (1975)

Despite a lot of talk about &ldquo;user-friendly&rdquo; systems, little is seen when it comes down to the implementation, mainly because most programming languages and time-sharing systems make it relatively difficult to give life to the theoretical concepts. To demonstrate the various features of APLSV truly facilitating the implementation of user-friendly systems, we use a very simple application: mailing lists. This comprises of: - creation and maintenance of a moderate-sized data base (ca. 60 K characters). - selection of addresses by descriptors combined with boolean logic operators. The following topics will be discussed: 1. System Description What does the system do (as far as understanding the following general conclusions is concerned)? 2. HELP-Feature What is a simple yet powerful mechanism of aiding the inexperienced user? 3. User Reaction How behaves the &ldquo;average&rdquo; user? What problems does he have and how are they solved? 4. Design Stability Since the only constant thing in (programming) life is change, where are the major features requiring frequent adaption? 5. End-User and Programmer Productivity Why and to what end was this effort undertaken, and how much work did go into it? 6. Program Structure Where did a top-down design show its benefits and what (if any) are the drawbacks? 7. Programming Tricks and Tips Where are the features of APLSV exploited, like the &ldquo;call by name&rdquo; provided by the &ldquo;execute&rdquo; operator? 8. General Observations What are the DOs and DON'Ts in designing man-computer dialogs? 9. Outlook From the observation of the acceptance of the current version of the system, what areas of required enhancements become visible? What is the summary of the experience?
KINSYN: A minicomputer-based interactive mechanism design system
Authors: Andrew J. Rubel, Roger E. Kaufman
Venue: Proceedings of the 13th Design Automation Conference (1976)

An interactive graphical linkage design system is here described in text and captioned photos. This design system, KINSYN, is highly dependent on graphics for its man-computer interaction. Dialogue with the computer has been carefully devised to take best advantage of both human decision making and machine computational abilities. No computer expertise is required to use the system. KINSYN has capabilities for closed-form synthesis of four-link mechanisms and for numerical synthesis of linkages of most other topologies. It can analyze and animate pin and slider-jointed planar devices of nearly any topology.
Urban problems
Authors: Philip F. Schweizer, Lucius J. Riccio, Grace Carter, Edward Ignall, Warren Walker, Richard C Larson, Daniel Alesch, John Jennings, James Kakalik
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The panel examines several operational uses of simulation in the urban problem solving environment. Papers range from an attempt to develop a generalized urban planning model capable of managing substantive areas as varied as health and education, all the way through to a very specific example of a police patroling dispatching simulation. Other examples include an effort to understand, model and improve a portion of New York's troubled judicial system and a deployment model used by the New York Fire Department. The emphases throughout are serious and operational. Discussants have been chosen not only because of their technical qualifications to comment on model specification, construction and operation but also because they each have had considerable experience dealing with the specific substantive issues treated in the discussed simulations.
Comments on sources and types of service
Authors: Whitney Johnson
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

I'd like to ask for a show of hands: How many of you represent state-supported institutions? How many represent private institutions? Looks like Just about half and half. Okay. I think that we all know, and it probably is appropriate to re-emphasize, that the computing needs of any educational institution fall into several categories. We may narrow these down to three, roughly, as being the instructional support area, the research support area, and the administrative support area. (keeping grades, student records, registration, and what-have-you). Of course some would have to add extensions to public service and other areas, but you can usually break those down into components that fit into one of these three. Whether you have a small institution with a hundred students, or an institution with thirty or forty or fifty thousand students, you have all of these components having a need for computing at your institution. Now some of you are only interested in one of them. But someone at your institution also has to be interested in the others. As our keynote speaker indicated, there are cases where you simply can't afford to get involved with the computer in some of the administrative tasks, and I think we should recognize that. We, as the computer people on campus, need to look at projects to make a decision, or to help our administration make a decision as to whether it is cost-effective to do it this way, or should we really just say, &ldquo;Keep doing it by hand. It's the best way.&rdquo;? When you get involved with a statewide system of higher education some way, you find that the people begin to look at the money you spend in a little different manner. They begin to say, &ldquo;Well now, let's see. We don't care, really, whether it costs you more from your budget to do it this particular way. In the end result, it costs the state and the taxpayer less to do it this way.&rdquo; So very frequently the concern is not with the cost on an individual campus. The concern turns out to be with the cost to the taxpayer and the state system. So you have movements around the country towards setting up large, massive central systems to serve the needs of the state.
Some results in tree automata
Authors: L. S. Levy, A. K. Joshi
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

In this paper, we will essentially present three results in tree automata. Two of these are concerned with certain open problems posed by Rounds [1] and Martin and Vere [3], and the third one is related to the result of Peters and Ritchie [4]. First we will briefly state the results and then describe them in some detail in Sections 2, 3, and 4.
Datenbank-Pascal an extendable database management system for personal computer networks
Authors: J. Karszt, G. Lausen, W. Stucky
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

Datenbank-Pascal is a database management system (dbms) for personal computers which supports a three level architecture. On different levels of extension it is running on different scaled personal computers (8/16/32 bit). The dbms programming interface is integrated into the Pascal programming language. A multi-user dbms environment can be achieved by connecting several personal computers to a disk-system which contains the shared database. First, the architecture of the dbms is described. Then, the data models on the conceptual and external level and the concepts for the Pascal language integration are explained. Finally, the paper contains a high-level description of the transaction management in the disk-based personal computer network. This work was partially supported by the Deutsche Forschungsgemeinschaft, Project-No. Stu 98/2.
Design Automation System for ESS in FUJITSU
Authors: M. Okui, A. Kuroda, K. Wada
Venue: Proceedings of the 10th Design Automation Workshop (1973)

This paper describes the history, the present status of this DA and also the problems to be solved to meet the age of LSIs.
GAP - a GPSS/FORTRAN package
Authors: Robert J. Wimmert
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

The GAP package has been developed to permit the linking of standard GPSS models to a series of FORTRAN subprograms. Since the GAP subprograms are transparent to the user, knowledge of the FORTRAN language is not needed. GAP provides an easy mechanism to obtain, among other things, values from a number of standard statistical distributions, permits the loading of MSAVEVALUEs and other SNAs using data cards and provides statistical analysis of the GPSS model output.
Base line correction for handwritten word recognition
Authors: S. Tsuruoka, N. Watanabe, N. Minamide, F. Kimura, Y. Miyake, M. Shridhar
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

The authors have researched two-letter state name (state name abbreviation) recognition and full state name recognition. According to this research, they think that the accuracy of the character segmentation is essential to recognize the word correctly, and it depends on the normalization of the word image. The normalization includes smoothing, underline removal, spurious blob removal, slant and base line correction etc. They present a new base line correction algorithm for the off-line handwritten words, which include cursive (continuous or running) words and hand-printed words. It uses background region analysis with the lower convex hull which is background area closed for three directions (upper, right, left), and the upper and bottom profiles of the merged convex hull. The authors show that the new method of base line correction is very powerful for most word images for city names of the USPS mail address database. The resulting image is useful for the holistic approach, and it's effective even when the image includes parts under the base line, for example, "f", "g", "j", or a very large character.
Comparison of polynomial-time reducibilities
Authors: Richard Ladner, Nancy Lynch, Alan Selman
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Comparison of the polynomial-time-bounded reducibilities introduced by Cook [1] and Karp [4] leads naturally to the definition of several intermediate truth-table reducibilities. We give definitions and comparisons for these reducibilities; we note, in particular, that all reducibilities of this type which do not have obvious implication relationships are in fact distinct in a strong sense. Proofs are by simultaneous diagonalization and encoding constructions. Work of Meyer and Stockmeyer [7] and Gill [2] then leads us to define nondeterministic versions of all of our reducibilities. Although many of the definitions degenerate, comparison of the remaining nondeterministic reducibilities among themselves and with the corresponding deterministic reducibilities yields some interesting relationships.