ppxscal/embedding_network huggingface dataset:
Automated Lesion Detection Methods for 2D and 3D Chest X-Ray Images
Authors: Takeshi Hara, Hiroshi Fujita, Yongbum Lee, Hitoshi Yoshimura, Shoji Kido
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The purpose of this work is to present some technical approaches of our computer-aided detection (CAD) system for chest radiograms and helical CT scans, and also evaluate that by using three databases. The CAD includes some methods to detect lesions and to eliminate false-positive findings. The detective methods consist of template matching and artificial neural network approaches. Genetic Algorithm (GA) was employed in template matching to select a matched image from various reference patterns. Artificial Neural Networks (ANN) were also applied to eliminate the false-positive candidates. The sensitivity and the number of false-positives were 73% and 11FPs per image on chest radiogram CAD and 77% with 2.6 FPs per image on helical CT scan CAD. These preliminary results imply that the GA and ANN based detective methods may be effective to indicate lesions on chest radiograms and helical CT scans.
Statistical analysis of simulation output data
Authors: Robert G. Sargent
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

This paper is a tutorial paper on how to obtain point estimates and confidence intervals of steady state means of simulation output data. The methods of using replications, batch means, and regenerative cycles for obtaining these point and interval estimates are discussed in detail and are applied to a simple time-shared computer model to illustrate their use. A brief discussion is included on using time series methods to obtain these estimates. The advantages and disadvantages of the various methods are given, including specific recommendations as to when certain methods might be used.
Fuzzy residue
Authors: Eugene McDonnell
Venue: Proceedings of the international conference on APL: part 1 (1979)

Certain pairs of arguments to the residue function, as implemented on many APL systems, give results which make it seem as if the ordinary decimal relationships we remember from grade school no longer hold. As far as we can tell, it looks as if a given modulus should divide the right argument, but the implementation tells us it doesn't. A definition for a fuzzed residue function is proposed which resolves the difficulties users have complained of. However, certain points of continuing difficulty remain, where the limitations of machine arithmetic continue to defeat the attempt to model the real number system. The representation function is defined in terms of the residue function, and so is affected by the change in residue. The nature of this effect is also discussed in this paper.
The pros and cons of minis: A user's perspective
Authors: Sally D. Haerer
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

The use of minicomputers on the university campus has dramatically increased over the past several years. Minis have been emerging on campuses to meet various needs. One mini might be used for a lab-type environment (i.e., Computer Science or Electrical Engineering) for hands-on experience and control, or hardware/software developmental experiments. Another minicomputer might be used by a department to provide courses to satisfy accreditation board requirements. More recently perhaps, another mini might be used to alleviate mainframe access problems. As minis permeate the university community, this role and usage is becoming an important issue. This paper has been developed to explore this growing concern from the user's view. It is hoped that it will shed some light on the ramifications, pros and cons, of the influx of minicomputers. To accomplish this task, the writer has conducted an open-ended survey at the University of Arkansas. Topics were discussed in person with various users from different levels of contact with computer usage (occasional and frequent) and different positions within the institution (administrators, directors, department chairpersons, faculty, and students). Generally, these discussions led to lengthy, diverse, non-quantitative views and information. These users generally seemed cooperative and eager to discuss the subject; their wealth of information has proven to be quite interesting and helpful. From this foundation, user opinions have been acquired on minicomputer-related topics. The University of Arkansas has gone through the evolutionary introduction of minicomputers into the university environment and, as a result, has developed a plan to cope with the issues facing this campus. It is, therefore, the further intent of this paper to describe this plan for the insight that it may provide other institutions that are in a similar position.
1983 Acm annual conference: &ldquo;Health and safety aspects of office automation - the European scene&rdquo;
Authors: Graham Briscoe
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

&ldquo;The number of people in the United Kingdom working with Visual Display Units (VDUs) as part of their job is increasing daily. A large proportion of them are prevented from getting the maximum use out of their VDU because they ere experiencing practical problems which make it more tiring or difficult to use. The source of these difficulties usually lies in poor ergonomic design (or adjustability) of the VDU, the workplace or the working environment. Because of this many UK and European users and their associated unions have, since the late 70's, insisted on minimum ergonomic standards for new equipment before it can be introduced. Some of the standards have been disputed, and in the United Kingdom (UK) it has resulted in a &ldquo;Guidance Note on VDUs&rdquo; (June 1983) from the Health and Safety Executive. This paper reviews the UK response along with current developments in this area in other European Countries&rdquo;.
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
Authors: Robert E. Bleier
Venue: Proceedings of the 1967 22nd national conference (1967)

An important consideration in the design of programming systems for the management of large files of data is the method of treating hierarchical data (that is, data among which logical relationships exist at more than two levels). Recent systems have accomplished this by simply duplicating some essential item of data at several levels. Such duplication makes the storage of even small data bases inefficient; for large masses of data, storage becomes economically unfeasible. Other systems have provided the means to specify and construct hierarchies, but none have provided language that affords control over retrieval and output levels, and control over the scope of output. Within the Time-Shared Data Management System (TDMS), currently being produced at System Development Corporation, a method has been devised for maintaining hierarchical associations within logical entries of a data base. Basically, the technique permits the automatic association of related data through a device known as a repeating group. The term &ldquo;repeating group&rdquo; is not new, but the TDMS treatment of the repeating group concept is. This paper describes how this technique is implemented in the language and tables of TDMS.
SIPE: A TSS/360 software measurement technique
Authors: W. R. Deniston
Venue: Proceedings of the 1969 24th national conference (1969)

Analysis of the operation of a large-scale, complex operating system requires data that can be obtained only from &ldquo;inside&rdquo; the system as it is running. Such data can supplement that obtained via hardware measurements, and can support simulation models by providing realistic calibration data. The primary attribute of an internal software measurement technique is that it has access to, and can selectively record, system data stored in memory. This paper describes the methods employed in developing and using such a technique within the IBM System/360 Time Sharing System (TSS/360). A prime consideration in developing a software measurement technique to obtain internal data is that a suitable compromise between resolution and system degradation must be achieved, since the traditional hardware tools for gathering external data provided high resolution without degradation. This was accomplished in the design of the System Internal Performance Evaluation (SIPE) program, which functions as a physical extension to the TSS/360 resident supervisor and records significant events as they occur. When control reaches one of the SIPE &ldquo;hooks,&rdquo; which are strategically located in the supervisor, SIPE is entered to record an event. When SIPE has accumulated a quantity of events, it transfers the data to tape. Off-line reduction techniques subsequently permit detailed reconstruction of system data and logical flow. SIPE has been operational for over a year. Experience in using it has indicated that the actual degradation is so small that continuous recording during development, primarily for debugging, can readily be justified.
Autonetics planned production line evaluation simulator (APPLES)
Authors: P. J. Moore
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Production line evaluation at Autonetics for the manufacture of electronic and electromechanical aerospace products, is facilitated by APPLES, a model written in GPSS/360 Version 5. The model may be applied to a large variety of production lines with differing configurations through the use of standard data forms. It is designed for use by production engineers that are unskilled in GPSS. A simulation analyst provides consulting services to the engineer as input data are prepared and assists as necessary in the experimentation. However, each user is sufficiently briefed that he is able to submit his data and conduct his study independently. APPLES is primarily intended for specialized production lines which are to be treated as systems or subsystems in the study of their production capability. Facility dedications, manpower availabilities, work assignments and scheduling alternatives are readily evaluated wherein productivity, yield, and process times are the major stochastic variables. The basic program is easily adaptable to any unique application by the addition of subroutines that simulate the unique relationships. Thus, a single development activity has provided a generally useful tool that can quickly and directly solve ordinary problems and shortcut the development of very complex models. The content and format of the output reports generated by APPLES are designed to relate performance results to production cost factors. A cost per unit index is calculated for each experimental run. The paper describes the simulator's design, illustrates its applicability and discusses the experience achieved at Autonetics.
UMPIRE: An automatic Kriegsspiel referee for a time-shared computer
Authors: John F. Burger
Venue: Proceedings of the 1967 22nd national conference (1967)

This paper describes a computer program called UMPIRE that performs all the functions of an actual live referee for the game of Kriegsspiel. The program is written in LISP 1.5 for the System Development Corporation Q-32 Time-Sharing System. With slight modifications to the I/O functions, UMPIRE could be made operable on any computer having a LISP 1.5 compiler. The basic functions of the program are translatable into LISP 2.
An algorithm for building rectangular floor-plans
Authors: Sany M. Leinwand, Yen-Tai Lai
Venue: Proceedings of the 21st Design Automation Conference (1984)

Previous reports [1, 3] have shown how to build an optimal floor-plan assembly starting with a planar structure graph in terms of components and their connections. The existing methods are based on exhaustively inspecting all possible rectangular duals until an optimal one is found. However, expensive computational resources are wasted when no rectangular dual exists. This paper presents a graph-theoretical formulation for the existence of rectangular floor-plans. It is shown that any triangulated graph (planar graph with all regions triangular) admits a rectangular dual if and only if it does not contain complex triangular faces. This result is the basis of a fast algorithm for checking admissibility of solutions.
SKIM - The S, K, I reduction machine
Authors: T. J.W. Clarke, P. J.S. Gladstone, C. D. MacLean, A. C. Norman
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

SKIM is a computer built to explore pure functional programming, combinators as a machine language and the use of hardware to provide direct support for a high level language. Its design stresses simplicity and aims at providing minicomputer performance (in its particular application areas) for microcomputer costs. This paper discusses the high level reduction language that SKIM supports, the way in which this language is compiled into combinators and the hardware and microcode that then evaluate programs.
Topological analysis for VLSI circuits
Authors: Paul Losleben, Kathryn Thompson
Venue: Proceedings of the 16th Design Automation Conference (1979)

Algorithms are presented which use a bit map approach to derive connectivity checks, design rule checks, and electrical parameters for VLSI circuit artwork.
CODESIM: A compact discrete event simulator
Authors: Lawrence L. Rose
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

CODESIM is a compact software facility1 that supports discrete event simulation modeling. Written in Fortran, the CODESIM routines enable facile model construction with a maximum of modeler independence. CODESIM requires no inputs, handles queuing without buffer movement, provides built-in trace control, and permits arbitrary user naming and typing of entity attributes. Statistical routines for data collection and reporting are provided by the CODESIM software&mdash;all outputs are in the user domain, as are additional model input parameters, etc. Thus, CODESIM represents a no-frills tool for discrete event simulation. Its advantages include a free programmer structure, speed, size, interactive use, and potential for both machine and language portability.
A simulation model for evaluating the effectiveness of various stock market strategies
Authors: P. Krolak, R. Berquist, R. Conn, H. Gilliland
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

This paper developes a simulation model which can be used to investigate a wide variety of stock market investment strategies. A brief review of the literature of stock market forecasting is given. The paper describes the details that any simulation of a stock market investor would have to include if the model is to be realistically compared to the performance of real investors. An outline of the necessary features of any program which is to be used to investigate many different combinations of investment strategies and forecasting devices is also given. The program is described in detail and a few preliminary results are given.
Teaching Database design through an Entity-Relationship approach
Authors: C. Chrisman
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

This paper will describe how the Entity-Relationship approach is used in teaching an advanced Database course at Northern Illinois University. The Entity-Relationship approach provides a framework for the course to study basic issues in Database design and implementations in the major commercial Database Management Systems.
Interactive simulation of biomechanical systems: The kinematics and stress of the human knee
Authors: Frederic I. Parke, Mark Friedell
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The application of real-time shaded computer graphics to the visualization of certain biomechanical aspects of the human knee. The published work of various researchers in the biomechanics of the knee is incorporated into a computer model. Interactive techniques are utilized to visualize the dynamics and stress of the knee joint based on this biomechanical model.
Array processing on an array processor
Authors: David B. Erickson
Venue: ACM SIGPLAN Notices (1975)

Central memory is distributed across several processing elements on the ILLIAC-IV and similar array processors. This causes memory to appear two dimensional and raises special problems in the handling of arrays. Assignment of arrays to storage, and development of efficient array mapping functions and accessing techniques are all much more difficult than on conventional machines with &ldquo;linear&rdquo; memories. This paper discusses these problems as they relate to IVTRAN, a Fortran-like compiler for the ILLIAC-IV. Alternate solutions, useful in a different environment, are also explored. We shall start by giving a brief overview of the pertinent features of the ILLIAC-IV. The paper then describes IVTRAN constructs which may be used in expressing parallelism and the implications that these constructs have for array storage. Next, array mapping formulas are developed and the array packing problem is treated. Finally, argument passage and Fortran COMMON and EQUIVALENCE statements are discussed.
SEQUEL: A structured English query language
Authors: Donald D. Chamberlin, Raymond F. Boyce
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

In this paper we present the data manipulation facility for a structured English query language (SEQUEL) which can be used for accessing data in an integrated relational data base. Without resorting to the concepts of bound variables and quantifiers SEQUEL identifies a set of simple operations on tabular structures, which can be shown to be of equivalent power to the first order predicate calculus. A SEQUEL user is presented with a consistent set of keyword English templates which reflect how people use tables to obtain information. Moreover, the SEQUEL user is able to compose these basic templates in a structured manner in order to form more complex queries. SEQUEL is intended as a data base sublanguage for both the professional programmer and the more infrequent data base user.
Automatic programming and compilers III: A report on the status of SMALGOL
Authors: E. L. Manderfield
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE SUBCOMMITTEE on Common Languages for Small Computers of the Joint Users Group, since renamed the Subcommittee on Programming Languages in Development and extended in scope, was formed in June, 1961, when it was felt that an effort had to be made to provide a common problem-oriented language for small computers. The year which has intervened since the formulation of SMALGOL has seen the initiation of a number of SMALGOL compilers on small computers. Many of these were not consciously patterned after the SMALGOL report, but were the results of realistic compromises with time schedules and memory capacity, and have resulted nevertheless in compilers which will have most of the limitations of SMALGOL.
Ulisse: An Italian project for a multifunctional terminal system
Authors: R. Cerretti, D. Jasilli, D. R. Matteucci
Venue: ACM SIGARCH Computer Architecture News (1977)

The paper describes a project conducted in collaboration between CNUCE, an Institute of the Italian National Research Council, and a private research center, concerning a multifunctional system (Ulisse) capable of operating both as a stand alone unit for office administration and automation (word processsing, file management and retrieval) and as an intelligent terminal with local facilities for text editing, text formatting and storage. The first results of the application of Ulisse in the environment of the scientific users of CNUCE are illustrated.
Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting
Authors: Stanley C. Eisenstat, Andrew H. Sherman
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

In this paper we consider the solution of the system of linear equations A @@@@ &equil; @@@@ (1.1) where A is an N&times;N nonsymmetric matrix and @@@@ and @@@@ are vectors of length N. Such systems arise frequently in the numerical solution of partial differential equations, almost always with the property that N is large and A is sparse (i.e., most aij &equil; 0). Thus it is often essential to be able to solve large sparse systems of linear equations efficiently.
The early history and characteristics of PL/I
Authors: George Radin
Venue: ACM SIGPLAN Notices (1978)

Source material for a written history of PL/I has been preserved and is available in dozens of cartons, each packed with memos, evaluations, language control logs, etc. A remembered history of PL/I is retrievable by listening to as many people, each of whom was deeply involved in one aspect of its progress. This paper is an attempt to gather together and evaluate what I and some associates could read and recall in a few months. There is enough material left for several dissertations. The exercise is important, I think, not only because of the importance of PL/I, but because of the breadth of its subject matter. Since PL/I took as its scope of applicability virtually all of programming, the dialogues about its various parts encompass a minor history of computer science in the middle sixties. There are debates among numerical analysts about arithmetic, among language experts about syntax, name scope, block structure, etc., among systems programmers about multi-tasking, exception handling, I/O, and more.
Application of multi-valued logics to the study of human movement control and of movement disorders
Authors: Ladislav Kohout
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

This paper is concerned with applications of modal and multi-valued ligics to brain modelling of neuromuscular disabilities and to modelling of movement control. After a brief introduction to the problems of hierarchic movement control, some failures of binary logics in biological applications are examined. The need to introduce modal logics in neurological applications is argued. It is shown that movement control can be formalised as a problem of reachability, controllability and stability in an appropriate control space. It is shown that natural logics for this purpose are not the Boolean algebras but rather the modal logics. An example of movement disorder in Parkinson's disease is then analysed and importance of multi-valued logics for evaluation of experimental data concerning movement coordination is discussed.
Inference machine: From sequential to parallel
Authors: Shunichi Uchida
Venue: ACM SIGARCH Computer Architecture News (1983)

In this paper, the research and development plan for computer architecture in the fifth generation computer system project ( FGCS Project) is described, focusing on the research on the inference machine.
Hidden Multiresolution Random Fields and Their Application to Image Segmentation
Authors: Roland Wilson, Chang-Tsun Li
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper, a new class of Random Field, defined on a multi-resolution array structure, is described. Some of the fundamental statistical properties of the model are established. Estimation from noisy data is then considered and a new procedure: Multi-resolution Maximum a Posteriori estimation, is defined. These ideas are then applied to the problem of segmenting images containing a number of regions. Implementation of the Bayesian approach is based on a multi-resolution form of Gibbs sampling. It is shown that the model forms an excellent basis for the segmentation of such images, which works with no a priori information on the number or sizes of the regions.