ppxscal/embedding_network huggingface dataset:
A new approach to aperture synthesis using frequency diversity imaging
Authors: F. Ahmad, S. A. Kassam
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We consider imaging arrays and apertures from the point of view of their performance in the imaging of spatially incoherent source distributions. The concept of coarray is used to provide an interesting insight into the aperture synthesis process using frequency diversity imaging. Simulation results are also provided. The proposed methods are applicable to imaging of coherent distribution of reflectors as well.
Computer based human communication: Lessons of the seventies, directions for the eighties
Authors: Roxanne Hiltz
Venue: Proceedings of the 1979 annual conference (1979)

This will be a panel session in which representatives of the researchers who designed and studied the prototype message and conference systems in the 70's will review the characteristics of the systems that have enjoyed large scale use, the reactions of users and the impacts on users; and research currently underway in new system capabilities or applications of computer communication-information systems. After a brief review of developments in the seventies, the panel members will present their predictions for developments that will occur in the 80's in terms of new system features and applications. There will be four speakers. Each will make a fifteen minute presentation. The remainder of the time will be devoted to debate among panel members and questions and comments from the panel moderator and the audience.
The Mission Effectiveness Program: An Analyst's viewpoint
Authors: Wilhelm H. Bortels
Venue: Proceedings of the 12th conference on Winter simulation (1980)

The Mission Effectiveness Assessment Program simulation framework (MEAP) is being developed to provide Navy decision makers with a means to quantify the military value of naval combat units and combat unit elements in applications to realistic naval warfare engagements. This paper presents an overview of MEAP from a Naval Analyst (user) viewpoint.
A model of the performance of a rollback algorithm
Authors: Fred J. Maryanski, Kirk A. Norsworthy
Venue: Proceedings of the 1979 annual conference (1979)

The performance characteristics of a rollback algorithm are analyzed in a simulation experiment. An overview of the operation of the rollback algorithm is presented, followed by a discussion of the simulation model and its parameters. The model, as implemented, consists of data definition, data manipulation command processing, and rollback facilities. The model is parameterized in terms of number of application tasks and amount of data sharing and driven by randomized streams of data manipulation language commands. The simulation experiment applies the model to a CODASYL DBMS in an environment in which the rollback algorithm is initiated by a deadlock detection procedure. The overhead of the rollback algorithm in this environment is projected in terms of CPU utilization and file accesses. The results indicate that the factors having the strongest influence upon the performance of the rollback algorithm are update frequency and the degree of data sharing among programs. The performance projections indicate that the rollback algorithm introduces only a small amount of overhead even in worst case situations.
An integrated system for interactive editing of schematics, logic simulation and PCB layout design
Authors: Hedayat Markus Bayegan, Einar Aas
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper describes the basic concepts and features of an integrated PCB design system currently under development. The system includes facilities for interactive editing of schematics, logic simulation, placement and routing. A set of postprocessors will enable the designer to generate the necessary documents and drawings. The central part of the system consists of a Design File (DF) in which the different design steps are linked together. Once the schematic drawing has been produced, utilizing the versatile interactive graphic facilities in CASS (Computer Aided Schematic System), the schematic data will be automatically translated to a topological circuit description, which in turn will be exploited by the logic simulator and the layout system. The use of simulation during the design process is considerably simplified by operating the simulator from an interactive graphic terminal.
Numerical analysis II: Iteration in predictor-corrector procedures
Authors: T. E. Hull, A. L. Creemer
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

IN DECIDING which predictor-corrector procedure to use, one is mainly concerned with choosing a predictor formula, a corrector formula, a step-size, and a rule for iterating with the corrector formula. One would like to choose in such a way that the required calculation can be done, to within the required accuracy, at a minimum cost. This paper will present a study of how the relationship between accuracy and cost depends on the choice of predictor-corrector formulas and the iteration rule. Our main result is that the best procedures involve only one application of the corrector formula. We will also show that the order of the best procedures can be expected to increase as the accuracy requirements are made more stringent.
Two typical representation theorems for symmetrical Heyting algebras of order n
Authors: Luisa Iturrioz
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The theory of the many-valued logics related to classical and intuitionistic ones has been developed in the past. On the other hand, as an attempt to study symmetries on formal logic, Moisil has introduced a propositional calculus, called general symmetrical modal. In connection with the latter, we have built up, in a standard way, a many-valued propositional calculus. In order to consider this many-valued logic from an algebraic standpoint, we introduce the notion of a symmetrical Heyting algebra of order n. We present here only two typical representation theorems for these algebraic structures.
Simulation of input-output units
Authors: C. Frasson
Venue: Proceedings of the workshop on virtual computer systems (1973)

The concept of simulation - hardware or software - has been expanded to the creation of logical entities that correspond to real identities, to existing machines, or even to configurations that have no physical counterpart. Here we deal with the Input/Output aspect only. In order to simulate an input/output unit, we propose to define a comprehensive language, easy to use, and capable of describing operations of the device on line with any computer. Only devices using 360 or 370 architecture may be described, but there are no difficulties to describe any kind of device with a slight extension of the language.
ABLE: A LISP-based layout modeling language with user-definable procedural models for storage/logic array design
Authors: Gary B. Goates, Suhas S. Patil
Venue: Proceedings of the 18th Design Automation Conference (1981)

ABLE, an array-based linguistic editor, is a layout modeling language for storage/logic arrays (SLA's) that is based on the LISP programming language. This paper describes ABLE's design, presents an ABLE layout program, and evaluates ABLE's usefulness in SLA-based circuit design. ABLE embodies a linguistic approach to computer-aided design (CAD) for very large scale integrated (VLSI) circuits; digital system designers can represent SLA-based integrated circuits as relatively abstract and highly flexible ABLE layout programs. The informational complexity of VLSI design can be reduced both by using straightforward CAD algorithms based on the SLA structured logic layout technique, and by using user-definable procedural models within LISP-based layout modeling languages.
Decision optimization for GASP IV simulation models
Authors: Claude Dennis Pegden, Michael P. Gately
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

This paper describes an optimization module which can be added to the GASP IV software package to provide automated optimization of a set of user defined decision variables. The optimization procedure is a variation of the Hooke-Jeeves pattern search and can be used for decision optimization in discrete, continuous, and combined simulation models. The application of the optimization module is illustrated with two examples.
An assessment of computer generated space situation map projections
Authors: Mark D. Phillips, James E. Allison, Valor S. Dodd
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

C3 environments have increasingly incorporated computer controlled maps as decision aids. The design of map displays in space oriented C3 systems has taken on greater importance due to the complex spatial relationships among orbiting objects. The large number of objects orbiting the globe and their great speeds further complicates efforts to quickly and accurately portray their positions graphically. This paper describes an experimental plan aimed at evaluating a new 2D/3D &ldquo;hybrid&rdquo; space situation map display. The Hybrid display is created by opening a globe at the south pole and flattening it into a platter. A third dimension is obtained by tilting the platter. It was hypothesized that the Hybrid display would offer an advantage to C3 system operators and analysts dealing with three dimensional problems. The test plan focuses on perceptual parameters and user preference issues concerning conventional and Hybrid display techniques. The results of this study will be examined to direct future work on dynamic displays, and the impact of display design approach on cognitive performance.
Languages for Simulation
Authors: George E. Heidorn, Nicholas R. Hurst, A. Alan B. Pritsker, Lee Rogin, Jerry Katzke, Jim Nickerson, Julian Reitman, R. F. Zant, Paul F. Wyman, Arnold Ockene, Robert H. Downs
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Simulation languages are past adolescence and nearing maturity. This is seen in the two papers in this session that describe improved and extended versions of the widely-used simulation languages GPSS and GASP, and by the papers that bring linguistics and mathematics to bear in providing more useful and usable simulation tools.
Protection in an information processing utility
Authors: Robert M. Graham
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

In this paper we will define and discuss a solution to some of the problems concerned with protection and security in an information processing utility. This paper is not intended to be an exhaustive study of all aspects of protection in such a system. Instead, we concentrate our attention on the problems of protecting both user and system information (procedures and data) during the execution of a process. We will give special attention to this problem when shared procedures and data are permitted.
The data processing Curriculum of the National Technical Institute for the Deaf: A suggested implementation for an AAS degree program in computer programming
Authors: Donald H. Beil
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

An Associate degree (AAS) program designed to prepare students for entry level employment as computer programmers is presented. In the development of the curriculum, the Model Curricula in Computer Programming prepared by the Committee on Curriculum in Computer Science, Community and Junior College Sub-Committee, was considered. The curriculum at the National Technical Institute for the Deaf is presented as an implementation of that Model Curricula.
APL: A profitability language
Authors: William G. vonBerg
Venue: ACM SIGAPL APL Quote Quad (1982)

SYBRON Corporation is a diversified manufacturing company operating in twenty-one countries around the world. The complexity and geographical distribution of SYBRON operations have increased as the company has grown. In the last eight years, innovative APL systems combined with an extensive communications network have provided corporate and division executives with powerful new tools for management decision making. Timely information is an invaluable resource. At SYBRON, it is available in similar form from common databases at appropriate levels of management regardless of geographical constraints. The power to acquire, analyze and distribute information, however, is not an end in itself. It has positive impact on the corporate 'bottom line' only if it is continuously responsive to organizational goals and business objectives. SYBRON's organizational goal is to provide a favorable return on investment to our shareholders. APL systems are a valuable tool in achieving that objective.
Applying structured tools and techniques to the development of software for a small computer system
Authors: Michael W. Farrell, Jerry R. Myers
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

Structured tools and techniques were applied to the software design process of an information system for a local health care agency. The design process was based upon a hierarchical decomposition of user requirements into detail system specifications. The tools and techniques included data flow diagrams, pseudo code, a data model based upon the relational approach, and a data dictionary. Together, the design process and the tools and techniques represented an approach to bridge the gap between readily available small computer hardware and an information system that is totally integrated into the organization.
Toward a theory of test data selection
Authors: John B. Goodenough, Susan L. Gerhart
Venue: Proceedings of the international conference on Reliable software (1975)

This paper examines the theoretical and practical role of testing in software development. We prove a fundamental theorem showing that properly structured tests are capable of demonstrating the absence of errors in a program. The theorem's proof hinges on our definition of test reliability and validity, but its practical utility hinges on being able to show when a test is actually reliable. We explain what makes tests unreliable (for example, we show by example why testing all program statements, predicates, or paths is not usually sufficient to insure test reliability), and we outline a possible approach to developing reliable tests. We also show how the analysis required to define reliable tests can help in checking a program's design and specifications as well as in preventing and detecting implementation errors.
Distributed MIMD multiprocessor system with MicroAda/SuperMicro(TM) for asynchronous concurrent Newton's algorithms
Authors: Shohei Fujita
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

This paper presents a pragmatic example of how to use Ada tasks with Add machines such as SuperMicro(TM) for scientific computing. First, a class of asynchronous concurrent Newton's algorithms: Purely-Asynchronous (PAN), Asynchronous (AN), and Semi-Asynchronous (SAN) algorithms are introduced for distributed computing environment. A sufficient condition is shown to guarantee local convergence of these asynchronous algorithms. Moreover, it is proved that the PAN algorithm is linearly convergent, the AN algorithm is super-linearly convergent, and the SAN algorithm is quadratically convergent. The order of convergence depends on the degree of interaction among computing modules. Second, a non-deterministic program for the asynchronous algorithm is provided by using Ada tasks. The asynchronous algorithm/program is superior to the synchronized counterpart with respect to computation speed and reliability. Lastly, this paper describes a way where the asynchronous algorithm/program can be realized as a hierarchic distributed system with Ada machines. A preliminary result is shown with MicroAda/SuperMicro(TM).
A technique for precise computation with factorials in a digital computer
Authors: F. J. Corbato
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Computation involving factorials in a digital computer has various hazards. Foremost of the hazards is the rapid build-up of magnitude with argument n, for 10: @@@@ 106 and 20: @@@@ 1018. Clearly a fixed-point representation will not suffice to avoid overflow except for trivial values of n; a floating-point representation will offer a reprieve for the range overflow but will contain only a limited number of significant figures. For most purposes computing indirectly with a &ldquo;compression-function&rdquo; such as the logarithm will eliminate range overflow problems; however the accuracy at best will be limited since the error produced by the n-2 additions required to form ln(n!) will be the sum of the errors in the individual logarithms of the integers and will be transmitted through the exponential function to the result. These accuracy limitations are usually not a problem when the terms involving factorials all have like signs and no cancellations occur. There are instances, however, when terms involving rational fractions of factorials are of similar magnitude and alternate in sign. Such a case arises in the decomposition of products of spherical harmonics.
A polynomial linear search algorithm for the n-dimensional knapsack problem
Authors: Friedhelm Meyer auf der Heide
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We present a Linear Search Algorithm which decides the n-dimensional knapsack problem in n4log(n) + 0.(n3) steps. This algorithm works for inputs consisting of n numbers for some arbitrary but fixed integer n. This result solves an open problem posed for example in [6] and [7] by Dobkin / Lipton and A.C.C. Yao, resp.. It destroys the hope of proving large lower bounds for this NP-complete problem in the model of Linear Search Algorithms.
Test generation costs analysis and projections
Authors: Prabhakar Goel
Venue: Proceedings of the 17th Design Automation Conference (1980)

Empirical observations are used to derive analytic formulae for test volumes, parallel fault simulation costs, deductive fault simulation costs, and minimum test pattern generation costs for LSSD logic structures. The formulae are significant in projecting growth trends for test volumes and various test generation costs with increasing gate count G. Empirical data is presented to support the thesis that test volume grows linearly with G for LSSD structures that cannot be partitioned into disjoint substructures. Such LSSD structures are referred to as &ldquo;coupled&rdquo; structures. Based on empirical observation that the number of latches in an LSSD logic structure is proportional to the gate count G, it is shown that the logic test time for coupled structures grows as G2. It is also shown that (i) parallel fault simulation costs grow as G3, (ii) deductive fault simulation costs grow as G2, and (iii) the minimum test pattern generation costs grow as G2. Based on these projections some future testing problems become apparent.
A formal design verification system based on an automated reasoning system
Authors: Anthony S. Wojcik, Joseph Kljaich, Nagendra Srinivas
Venue: Proceedings of the 21st Design Automation Conference (1984)

In recent years, interest has grown in the possibility of developing a formal design verification approach as an alternative to standard simulation techniques for verification. Several researchers have used, or suggested the use of, artificial intelligence techniques in such a formal system. The purpose of this paper is to briefly describe the ongoing work on the development of a viable formal design verification system based on an automated reasoning system. This system, called LMA (Logic Machine Architecture), has been developed at Argonne National Laboratory. This paper describes the basic ideas underlying this formal system for verification and discusses several of the current research projects.
A general multi-microprocessor interconnection mechanism for non-numeric processing
Authors: Hoo-min D. Toong, Svein O. Strommen, Earl R. Goodrich,  II
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

MMPS interconnection problems are discussed in terms of a single time-shared bus. The performance drawbacks usually associated with the single bus alternative are attributed to the high bus utilization at the basic building block level. The Pended Transaction Bus protocol is presented as a general solution to such utilizations. Such a bus is developed to support more than 50 processors without severe contention. The basic protocol of the MC68000 as a current generation microprocessor is investigated, and shown ineffective for true multi-microprocessor systems.
The Numerical Control Information utility: Concepts and considerations
Authors: Gastone Chingari
Venue: Proceedings of the 1967 22nd national conference (1967)

The concept of Numerical Machine Tool Control has extensive applications to many metalworking-manufacturing processes. An entirely new industrial demand for computer processing services is emerging because of Numerical Control (N/C), primarily at this time by industries with a large engineering and metalworking base. The emergence, at the same time, of the Computer Utility poses some interesting questions concerning the use of publicly available computer power to support planning, programming and control of N/C operations. This paper was written with several objectives in mind, namely to 1) discuss the concepts of numerical machine tool control in order to define the environment of computer application, 2) review organization and operation of computer-communications systems currently being used for N/C data processing, 3) discuss overall functions and characteristics of a Numerical Control Information Utility, and to identify the nature of services needed by the N/C user community, 4) analyze the requirements of computer assisted N/C programming in terms of on-line type software facilities and utility-user operations and 5) briefly discuss the types of data-base services for numerical control, their nature and impact on the manufacturing process.
A remote design station for customer Uncommitted Logic Array designs
Authors: Frank R. Ramsay
Venue: Proceedings of the 18th Design Automation Conference (1981)

The paper describes a low cost remote design station that can be installed in customers offices, giving them the full C.A.D. facilities required to specify, design and verify an Uncommitted Logic Array. The designers can enter and check their logic, layouts and test programs via this remote station. Access is then available, via modem links, to the main Ferranti C.A.D. facility for running of design verification programs etc. The need for such a system came after many years experience in handling customer designed circuits.
A project-oriented course (Computer Programming II)
Authors: David B. Teague
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

In our first programming course we introduce elements of machine organization and JCL, and the balance of the course is FORTRAN and algorithm development in equal portions. To support the second course, we introduce the concept of program structure and top-down design, although there is not enough time to treat these adequately in a one semester course. Documentation is taught: internal, external, user, and maintenance. Structured control constructs and their implementation within FORTRAN are given. Our objectives are to teach structured design and programming and to provide a setting that reinforces student use of software engineering techniques.