ppxscal/embedding_network huggingface dataset:
A training program in computer applications in the health sciences
Authors: Robin B. Lake
Venue: ACM SIGCSE Bulletin (1976)

Case Western Reserve University has developed an intensive 12-month post-graduate Training Program to educate health professionals in the application of computer technology. A Master of Science degree is awarded upon completion of a set of formal courses and implementation of a computer-based project. The program emphasizes computer applications for the structuring, manipulation, and display of medical information.
Geometric complexity
Authors: Michael Ian Shamos
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The complexity of a number of fundamental problems in computational geometry is examined and a number of new fast algorithms are presented and analyzed. General methods for obtaining results in geometric complexity are given and upper and lower bounds are obtained for problems involving sets of points, lines, and polygons in the plane. An effort is made to recast classical theorems into a useful computational form and analogies are developed between constructibility questions in Euclidean geometry and computability questions in modern computational complexity.
Hierarchical layout verification
Authors: Todd J. Wagner
Venue: Proceedings of the 21st Design Automation Conference (1984)

As custom designs approach one million transistor complexity, more emphasis must be placed on hierarchical verification and synthesis tools. This paper describes a hierarchical layout verification system that includes schematic to layout netlist comparison and design rule checking. A hierarchical cell structure definition is presented along with some of the restrictions deemed necessary for a practical implementation. A method for oversizing and undersizing geometries in the context of this hierarchical cell structure, and some of the ramifications of hierarchical design are also discussed.
Procedures and policies on use of and rates charged for computing center facilities
Authors: John Hamblen
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The procedures and policies on use of and rates charged for computing center facilities will vary somewhat depending upon the organizational structure of the university with respect to the computing center. Rather than try to cover all possible types, recommendations will be made for the following: a) The research computing center which serves research and instructional uses only and whose director reports to an administrative official equal to or higher than any of the heads of the academic subdivisions such as deans, research directors, etc. b) Centers which serve the administrative information processing as well as the research and instructional uses of computer facilities and whose director reports to an administrative official equal to or higher than the head of any other administrative academic or research unit.
Fault-secure algorithms for multiple-processor systems
Authors: Prithviraj Banerjee, Jacob A. Abraham
Venue: ACM SIGARCH Computer Architecture News (1984)

In this paper we describe techniques for achieving fault secureness with low cost in multiple processor7 systems. In order to do this we consider the relationshipsN between algorithms, parallel architectures, and fault tolerance. The concept of fault-secure algorithms, described in this paper, involves the application of the ideas of fault tolerance at the system level to high-performance multiple-processor algorithms to make the results of the computation reliable. Algorithms are classified into broad classes called paradigms which are determined exclusively by the communication patterns of the processors. Fault-secure techniques are presented for three powerful paradigms: the multiplex, the recursive combination, and the multiplex-demultiplex paradigms. The basic idea used in the design of fault-tolerant algorithms is that the algorithms operate on encoded input data and produce encoded output data such that the over-head in time and number of processors is not high. This technique is distinguished by three characteristics: the encoding of the data used by the algorithm, the re-design of the algorithm to operate on the encoded data, and the distribution of the computation steps in the algorithm among the computation units.
A steady&mdash;state enzyme kinetics modeling system
Authors: Nancy Schatz, Chan F. Lam
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

A technique is presented to generate rate equations for random enzymatic mechanisms in a systematic manner. The generation of constraint equations arrived from the principle of detailed balance is also discussed. The rate constants of the reaction mechanisms are then estimated by a stepwise least squares algorithm.
A general simulation model for information systems: A report on a modelling concept
Authors: A. L. Buchanan, R. B. Waina
Venue: Proceedings of the third conference on Applications of simulation (1969)

It is possible to simulate a variety of classes of systems with a single model structure by describing the systems in terms of their information flows. The design and application of such a model is presented and discussed.
A cost effective modeling technique for polling systems
Authors: Peter L. Haigh
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

The run time of a polling system simulation model may be significantly reduced by replacing the polling function with a formula to predict the polling wait time. This eliminates the simulation of polling when there is no information to be transferred. Two models of a multi-station half duplex SDLC network are compared: one which simulates all polling and one which uses the formula. Results indicate that, for systems which operate at less than saturation traffic levels, significant reductions in model run times may be achieved with minimal error in queue statistics.
An integrated system of graphics software
Authors: Marguerite A. Boisvert
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Plotting devices are items of hardware that have generally been available only to the sophisticated few. The Calcomp 936 drum plotter at Syracuse University is probably typical. In order to access the plotter through the standard software, the user had to be a fairly competent Fortran programmer and had to learn to think and work in terms of fundamental drum and pen movements. The approach taken to make plotter abilities more accessible will be described in this paper. Topics to be discussed include the development of a number of software packages, the writing of an integrated set of documents and the use of non-credit mini courses.
Designing systems for performance
Authors: J. C. Browne
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

Real-time systems and systems to interface human work environments will dominate the growth of computer applications over the next decade. These systems must execute their functions with the time-liness and responsiveness required in these environments. The design, development and testing of such systems must guarantee performance as well as functionality and reliability. There is not yet in place a technology to support this requirement for engineering of performance. The research and development community in performance has focused primarily on analysis and deduction rather than the performance arena. This talk will define and discuss the tasks of engineering performance into software systems and describe the recent progress towards this goal.
A New Evolutionary Learning Model for Handwritten Character Prototyping
Authors: L. P. Cordella, C. de Stefano, A. della Cioppa, A. Marcelli
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The work reported in this paper is aimed to exploit evolutionary learning algorithms for producing the set of prototypes to be used by a handwriting recognition system. In this paper we propose a new evolutionary learning model that combines the power of search of a classical evolutionary algorithm, namely a breeder genetic algorithm, with a novel mechanism for implementing the interaction between the evolving population and the environment. The proposed model allows the system to search for the prototypes by means of a simple iterative strategy rather than through a parallel and adaptive search, as it generally happens in evolutionary learning. Experimental results on handwritten digits have shown that the performance of the proposed algorithm is similar to those exhibited by more complex evolutionary learning algorithms, and better than the one provided by a Neural Network.
Understanding mathematical expressions from document images
Authors: Jaekyu Ha, R. M. Haralick, I. T. Phillips
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper proposes a system that understands mathematical expressions on binarized printed document images. The system first extracts a set of "primitives" from the image. Each of the extracted primitives is associated with a "bounding box" and its label. Using the attributes of the primitives, the system constructs an initial hierarchy. Construction of an initial hierarchy includes merging a group of primitives into a key word. Next, the system checks the validity of the hierarchy according to conventional mathematical syntax rules. If any syntax error is detected, the system makes attempts to correct the errors. The modification step includes reconfiguring the initial hierarchy, revisiting the original image for possible missing primitives, placing dummy primitives into missing spots in the hierarchy, and so on. The corrected hierarchical structure can be converted into the format for a particular publication system such as T/sub E/X.
Design of an Oncology Clinical Information System
Authors: Bruce I. Blum, Raymond E. Lenhard,  Jr.
Venue: Proceedings of the 1977 annual conference (1977)

The use of complex multimodality treatment plans and the necessity for detailed, precisely timed collection of measurements of tumor response, drug toxicity, biochemical markers, and other specific parameters of therapeutic evaluation has created the need for a clinically oriented data system which can assist the oncologist in the organization, collection, and analysis of multiple pieces of research and treatment related data. To serve this need, a prototype computer - based system is in routine use at the Johns Hopkins Oncology Center, and an interactive Oncology Clinical Information System (OCIS) is being implemented to replace it. The OCIS will support the functions of therapy planning, data evaluation, and medical record keeping; it will also be integrated with the Johns Hopkins Hospital Medical Information System. This paper describes the structure of the OCIS.
Some thoughts on reasons, definitions and tasks to achieve &ldquo;functional&rdquo; computer literacy
Authors: Michael J. Neill
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

Computer literacy, according to Richard Austing (1), is a major category of computer science education. Although computer literacy potentially involves the greatest number of people, achieving an ongoing program presents computer educators with formidable problems. My concern is with the concept of &ldquo;functional&rdquo; computer literacy, that is, a level of computer literacy expected of everyone living in a computer society. Functional computer literacy can be developed by implementing a curriculum for junior and senior high school students. Two requirements for achieving a computer literacy curriculum are 1) to develop a philosophy which is both &ldquo;computer&rdquo; and &ldquo;literacy&rdquo; and 2) to identify minimum requirements for being computer literate.
An Enhanced Skew Angle Estimation Technique for Binary Document Images
Authors: Huiye Ma, Zhenwei Yu
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper , an improved skew angle estimation technique is presented. Skew angle detection is an important part of any Optical Character Recognition (OCR) and document analysis system. The method considers the lowermost pixels of some selected characters of the text, which maybe subject to Hough transform for skew angle detection. A fast approach is also proposed which works almost as accurately as Hough transform for skew angle detection. Experimental results are presented and compared with results on several other skew detection methods.
Automatic workspace analysis and documentation
Authors: Joseph Specht
Venue: Proceedings of the eighth international conference on APL (1976)

In this paper, a program system will be presented which can analyse and list an unknown program packet stored in an APL-Workspace. The program, known as the &ldquo;Heidelberg Doc-System&rdquo; was conceived to cope with the well known problem of program documentation. Of course, this system can never replace a good verbal program description; however in many instances, it is a first step and, in other instances, the only step in the direction of complete program documentation. Especially for undescribed programs, whose authors are no longer on hand, an automatic WS-DOC-SYSTEM may represent an invaluable help for program maintenace.
Personnel turnover rates
Authors: Jack M. Wolfe
Venue: Proceedings of the 1977 annual conference (1977)

Awad (1) reported recently that the average firm experiences a 30% to 40% turnover in DP personnel because of voluntary resignations each year. We surveyed five of our client companies that use our Aptitude Assessment Battery: Programming test. One of these companies employs fewer than 50 programmers, two employ between 50 and 100 programmers, and the other two employ more than 100 programmers. The voluntary resignations in these five companies varied from a low of below one per cent to a high of 29%, with an average of less than 12%. The turnover rates due to inadequate capabilities for the work of programming in these companies varied from zero, in two of the companies, to a maximum of 5% with an overall average of less than 2%. The turnover rates due to unfavorable behavioral characteristics varied from zero to one percent.
Assembly drawings and bills of material creating system (ADMS)
Authors: Hiroyuki Mory
Venue: Proceedings of the 12th Design Automation Conference (1975)

ADMS is a computerized system creating assembly drawings and bills of material. ADMS is characterized by newly developed Assembly Description Language and its processor. This paper discusses new technologies for ADMS implementation.
Integrating solid image capability into a general purpose calligraphic graphics package
Authors: G. Laib, R. Puk, G. Stowell
Venue: ACM SIGGRAPH Computer Graphics (1980)

Raster scanned graphics terminals provide several features not found in standard line drawing displays. Among them are area fill and an extensive color palette. Hardware support for such functions is becoming cost effective and available in a variety of forms. What is now needed is high level, device independent software that assists in the generation of and interaction with these terminals. To accomplish this, a project has been undertaken jointly by Sandia Laboratories, Purdue University, and MEGATEK Corporation to integrate solid image capabilities into the Graphics Compatibility System, GCS. GCS is a widely used, general purpose calligraphic graphics package. Due to the similarity of the GCS model to that of the GSPC Core System, GCS provides a timely test bed for solid image extensions to a line drawing package. This paper will summarize the capabilities being implemented, the method and motivation behind each function, and suggestions for further work. The heart of the extensions is a hidden surface algorithm similar to Myers' approach which combines the simplicity of a Z buffer with the efficiency of a Watkin's algorithm. Facilities will be provided for hidden line removal as well as hidden surface processing in order to satisfy the basic GCS design goal of device independence. In this way, random vector terminals as well as raster devices will benefit. If a user does not require hidden object processing then very little additional overhead will remain in those routines which have been called. Hidden surface processing may also be intermixed with wire frame drawings and text. Two remaining issues are the user interface for 3D object definition and the specification of lighting models. Since the Myers algorithm requires N sided polygons as input, a basic call has been provided for such definitions. Higher level constructs, called &ldquo;shells&rdquo; and &ldquo;faces&rdquo;, which facilitate creation of complex 3D bodies, have been implemented. The specification of lighting models is an area of considerable debate. It has been concluded that a choice of a few common models will be made available to the user. These include interpolated and noninterpolated shading (smooth and flat). Objects may be color-shaded or black-and-white. A hook is provided for user definition of more exotic lighting models.
Effectiveness of an optimizing compiler for arithmetic expressions
Authors: James A. Painter
Venue: Proceedings of a symposium on Compiler optimization (1970)

This paper defines the notion of effectiveness of an optimizing compiler and presents a proof that a simple optimizing compiler is effective. An optimizing compiler typically consists of a basic compiler and a set of optimizations for special cases. The fundamental notion of effectiveness is that the basic compiler is correct, all of the optimization transformations preserve correctness, and produce essentially equivalent programs which have a smaller value relative to a specified weighting function.
Efficient placement and routing techniques for master slice LSI
Authors: Hiroshi Shiraishi, Fumiyasu Hirose
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper deals with placement and routing techniques for master slice LSIs. The basic idea of both techniques is to make wiring density on the chip more uniform. Algorithms and some experimental results are described.
Generalized procedure calling and content-directed invocation
Authors: Randall Davis
Venue: Proceedings of the 1977 symposium on Artificial intelligence and programming languages (1977)

We suggest that the concept of a strategy can profitably be viewed as knowledge about how to select from among a set of plausibly useful knowledge sources, and explore the framework for knowledge organization which this implies. We describe meta rules, a means of encoding strategies that has been implemented in a program called TEIRESIAS, and explore their utility and contribution to problem solving performance. Meta rules are also considered in the broader context of a tool for programming. We show that they can be considered a medium for expressing the criteria for retrieval of knowledge sources in a program, and hence can be used to define control regimes. The utility of this as a programming mechanism is considered. Finally, we describe the technique of content-directed invocation used by meta rules, and consider its use as a way of implementing strategies. It is also considered in historical perspective as a knowledge source invocation technique, and its advantage over some existing mechanisms like goal-directed invocation is considered. This work was supported in part by the Bureau of Health Sciences Research and Evaluation of HEW under Grant HS-01544 and by the Advanced Research Projects Agency under ARPA Order 2494. It was carried out on the SUMEX Computer System, supported by the NIH under Grant RR-00785. The views expressed are solely those of the author.
The decidability of the reachability problem for vector addition systems (Preliminary Version)
Authors: George S. Sacerdote, Richard L. Tenney
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Let V be a finite set of integral vectors in Euclidian N-space, and let &abarbelow; be an integral point in the first orthant of N-space. The reachability set R(&abarbelow;,V) is the set of integral points &bbarbelow; in the first orthant such that there is a polygonal path &ggr; from &abarbelow; to &bbarbelow; satisfying (i) all of &ggr; lies in the first orthant, and (ii) the edges of &ggr; are translates of the vectors in V. The reachability problem for the vector addition system (&abarbelow;,V) asks for an algorithm to decide which integral points &bbarbelow; are in R(&abarbelow;,V). In this paper we give an algorithm to solve this problem.
Analysis of concentrated ALOHA satellite links
Authors: Mart L. Molle, Leonard Kleinrock
Venue: Proceedings of the sixth symposium on Data communications (1979)

A conventional ALOHA satellite link uses a transponder which blindly echoes all up-channel traffic on the down-channel. An ALOHA channel can never be fully utilized, so an intelligent satellite could statistically multiplex the successful packets from several slotted ALOHA up-channels onto a single down-channel to conserve bandwidth, and hence reduce cost. We refer to this as a concentrated ALOHA system. Throughput, delay and stability effects are considered, varying the number of up-channels per down-channel and the satellite buffer size. Up- and down-channel bandwidths are assigned independent linear costs, and all performance comparisons are between constant cost systems. It is shown that the marginal increase in system performance drops off so quickly that a small number of up-channels maximizes throughput if up-channel bandwidth has a non-zero cost. This small number is a function of the buffer size and the relative cost of up- to down-channel bandwidth. It is also shown that, even if satellite buffer space is free, a small buffer minimizes average delay for some previously studied protocols of this type. A new protocol which improves performance and allows a large buffer to be used effectively is introduced and analyzed. Solving for throughput and delay in concentrated ALOHA systems provides new analytic and numeric results for the G/D/I queue with rest period equal to the service time.
Issues in the design of concurrent programming languages
Authors: Art Grand
Venue: Proceedings of the 1979 annual conference (1979)

The term 'concurrent programming language' is being used in the literature to describe languages meant for writing operating systems and real time applications. The use of this term displays a bias: it suggests that the problems of synchronization, mutual exclusion, etc. are the central problems in this area. I believe that many other issues are equally important. Various applications have very different language requirements. We will review several applications and discuss the degree to which languages such as CONCURRENT PASCAL [He] meet their needs. We will contrast these languages with the GYVE language [Sh] [Gr] currently being developed at the Courant Institute and discuss directions for future work.
An investigation of computer literacy as a function of attitude
Authors: J. D. Wilson, R. G. Trenary
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

A survey fo first and second year university students reveals the acceptance of a number of misconceptions about computers and computer applications, some on which indicate the presence of negative attitudes. A statistical analysis of the survey supports the proposition that previous computer experience is not always a corrective for unreasonable or even hostile attitudes. It is claimed that the achievement of computer literacy (in the sense of technical expertise) is possible for some populations only after attitudinal corrections, and that, in general, the strategy for achieving such corrections is dependent upon population characteristics.