ppxscal/embedding_network huggingface dataset:
N.mPc: An adaptable software system to support the development of microprocessor-based systems
Authors: Charles W. Rose
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

The use and development of new microprocessor (microcomputer) families has surpassed the construction of software tools to support the digital engineer and programmer in their implementation tasks. N.mPc is an adaptable software system to assist the development of hardware and firmware for microprocessors. By embedding a machine description capability into the components of N.mPc, the software processors can be adapted to support new and different microprocessor systems. N.mPc consists of three related software processors. A general microassembler (metaMicro) is used by the programmer to code and a-semble his firmware. The ISP' compiler, which is based on the Instruction Set Processor description language, is used to describe the hardware elements in the microprocessor system, including the instruction set of the microprocessors. The compiler output modules are linked together using a description of the network topology (netSim ecologist), producing a program image which simulates the semantics and timing of the hardware network under firmware control. Since ISP' modules are linked together in a standard fashion, the network may contain more than one microprocessor element. The microassembler has been implemented in the C language on a PDP-11/45 under the UNIX generating system; the compiler and the remainder of the simulator equipment are in implementation.
Some distributional and convergence properties of the finite element method, with applications in nonlinear elastodynamics
Authors: J. T. Oden
Venue: Proceedings of the ACM annual conference (1973)

Variational methods of approximation have become very popular in recent years among engineers and numerical analysts. In particular, the finite element method has established itself as one of the most powerful techniques available for the approximate solution of boundary-value problems. In the present paper, we outline a number of mathematical properties of the method which are partially responsible for its success; we discuss certain error estimates and convergence results, and we describe some results obtained in applications of the method to a class of nonlinear problems in elastodynamics.
A new vectorization-based approach to the skeletonization of binary images
Authors: Kuo-Chin Fan, Den-Fong Chen, Ming-Gang Wen
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

Thinning is a very important preprocessing step for many image analysis operations. The main drawbacks of traditional thinning algorithms are slow speed and serious deformation. To remedy these problems, a novel approach which generates the skeleton of binary patterns via block decomposition and contour vector matching is proposed. The performance of the proposed algorithm is compared with the existing algorithm. Experimental results confirm the superiority of the new approach.
Relaxation-Based Pattern Matching Using Automatic Differentiation for Off-Line Character Recognition
Authors: Takeshi Nagasaki, Tadashi Yanagida, Masaki Nakagawa
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes a relaxation-based matching method for off-line character recognition. This method employs elastic stroke models as standard character patterns. Pattern similarity between a standard and an input pattern is defined by fuzzy logic. The matching process is formalized as a maximization problem of the similarity and computed by the steepest descent technique. To implement this technique, we adopted automatic differentiation, which made it possible to calculate the partial derivatives of the target function automatically, only given the definition of that function. Results of computer experiments targeting 46 hiragana characters from the ETL8B database revealed a maximum recognition rate of 98.8% for 20 input sets when combining stroke springs with relative location springs.
Human factors design criteria in man-computer interaction
Authors: Charles J. Testa, Douglas B. Dearie
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The need for better understanding of human behavior in the Management Information Systems (MIS) environment has been recognized. One method of examining this behavior is to describe man as an information processor and focus on his ability to store, retrieve and utilize information. The use of design criteria which explicitly recognize man's limitations in these areas can enhance overall system performance. Consideration of several criteria to be used in the design of interactive languages is given. Finally, the hypothesis that with an interactive system &ldquo;perceived&rdquo response time is more important than actual response time is presented. Results of preliminary experiments are included.
Automated information systems as social resources in policy making
Authors: Rob Kling
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Automated information systems have been suggested by a number of theorists to aid public policy makers in acquiring more accurate, timely, and relevant information. This paper reports a study of the uses and impacts of automated systems for policy analysis in 42 municipal governments. Automated analyses are commonly used in municipal governments and are used to support policy suggestions which are often implemented. Automated systems in these settings serve in both educational and political roles. The utility of automated data systems for both rational and political uses increases with the extent that automated data is available in a given municipal government. In addition, we investigate the influence of computer-based policy analyses on the distribution of power in municipal governments. We find that computer-based systems reinforce the existing distribution of power in American municipalities. They provide differential support to mayors and city managers in smaller cities and to departments in the larger cities. More generally, this analysis indicates that the political arrangements of the social setting in which a computer-based system is utilized must be well understood, in addition to the technical features of the system, to predict its likely uses and impacts. This principle undermines the sufficiency of the formulations of rational and organizational process theorists who emphasize the technical characteristics of systems and neglect the political dynamics of the settings in which automated data systems are utilized.
Report of evening session protection
Authors: Peter G. Neumann
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

The session began late following an almost three hour dinner for some of us! (Southern hospitality?) Discussion centered on access control mechanisms in operating systems and/or in languages, weaknesses in the state of the art, and desirabilities for secure systems. Should protection be specifiable within the base language of a system? Jack Dennis: a resounding &ldquo;yes&rdquo;. It is highly desirable to associate protection with accessing. (There was some disagreement here). Barbara Liskov: Some help obtainable from type checking during compilation where privileges can be specified at compile time. (Beware of subsequent modifications). Gio Wiederhold: Subsets of types can be useful here.
The software engineering laboratory: Objectives
Authors: Victor R. Basili, Marvin V. Zelkowitz
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

A great deal of time and money has been and will continue to be spent in developing software. Much effort has gone into the generation of various software development methodologies that are meant to improve both the process and the product ([MYER, 75], [BAKE, 74], [WOLV, 72]). Unfortunately, it has not always been clear what the underlying principles involved in the software development process are and what effect the methodologies have; it is not always clear what constitutes a better product. Thus progress in finding techniques that produce better, cheaper software depends on developing new deeper understandings of good software and the software development process through studying the underlying principles involved in software and the development process. At the same time we must continue to produce software. A better understanding of the factors that affect the development of software and their interrelationships is required in order to gain better insights into the underlying principles. The Software Engineering Laboratory has been established, in August 1976, at NASA Goddard Space Flight Center in cooperation with the University of Maryland to promote such understanding. The next section gives an overview of the research objectives and experiments being performed at the Laboratory. Section III contains the current list of factors that affect the software development process or product and are to be studied or neutralized. The data collection and data management activities are discussed in Section IV. The last section contains information on the current status and future plans for the Laboratory.
A distributed approach to queueing network simulation
Authors: J. Kent Peacock, J. W. Wong, Eric Manning
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

Discrete simulation is a widely used technique for system performance evaluation. The conventional approach to discrete simulation (e.g., GPSS, Simscript) does not attempt to exploit the parallelism typically available in queueing network models. In this paper, a distributed approach to discrete simulation is presented. It involves the decomposition of a simulation into components and the synchronization of these components by message passing. This approach can result in the speedup of the total time to complete a given simulation if a network of processors is available. The architecture of a microcomputer network suitable for distributed simulation is described and some results concerning the distributed approach are presented.
Extensible language - where are we going
Authors: T. E. Cheatham,  Jr.
Venue: Proceedings of the international symposium on Extensible languages (1971)

It has now been several years that work in that area of programming languages and systems which we at this conference choose to call &ldquo;Extensible Languages&rdquo; has been going on. Indeed it has been a few years since &ldquo;Extensible Languages&rdquo; were being touted as the &ldquo;wave of the future&rdquo; and promised for delivery &ldquo;tomorrow.&rdquo; There are clearly many at this conference who feel that we are still not there - that we have a long way to go in basic research and development of extensible languages and their host facilities; I do not share this opinion. Rather, I think that in a very strong sense &ldquo;we have arrived&rdquo; - that there exist languages and host systems which fulfill the goals of extensibility. I would cite, as one example the ECL systems discussed in several other papers in these proceedings. (see [2], [3]) This is not to suggest that the problem is completely solved. Indeed, there is a great deal of work still necessary to tune, adjust, adapt, and exploit the languages and systems now just becoming available. However, it is my position that further research in extensible language, per se, is probably destined to yield only marginal results until such time as a significant period of exploitation has clearly pinpointed issues with which a new wave of extensible language research might attempt to contend.
Comparison of concurrent software reliability models
Authors: Ramadan Moawad
Venue: Proceedings of the 7th international conference on Software engineering (1984)

A comparsion of three concurrent software reliability models (Littlewood/Verrall, Musa, and Goel/Okumoto) has been performed. A set of criteria for evaluating a software reliability model is devoloped and a method for model assessment is presented. Then this assessment method is applied to the three selected models.
The Standard Transistor Array (star) (Part II automatic cell placement techniques)
Authors: Glenn W. Cox, B. D. Carroll
Venue: Proceedings of the 17th Design Automation Conference (1980)

Layout of a STAR device consists of the placement of standard cells (circuit elements) on the array and the routing of conductors between cells. Cell placement must be such that routing is not hindered. Also, placement procedures must be cost effective and easy to implement on a digital computer. A placement procedure for STARs is described in this paper that satisfies these characteristics. The procedure attempts to optimize the placement with respect to several criteria including expected routing channel usage and routing VIA requirements. Computer implementations of the procedure are discussed. Experimental results are presented which indicate that the procedure yields near-optimum results in computationally convenient amounts of time.
Improving white collar productivity
Authors: R. K. Wiersba
Venue: Proceedings of the ACM 1980 annual conference (1980)

Productivity is one of the most critical of our nation's economic problems. [1][2] Productivity is very difficult to measure, but has been defined by economists very simply: &ldquo;Basic output divided by basic input&rdquo;. Whatever we determine these &ldquo;basics&rdquo; to be in white collar work, in order to increase the output/input ratio we will need the following: reorganization and/or automation. Probably large amounts of both will be required.
Transparency for computer synthesized images
Authors: Douglas Scott Kay, Donald Greenberg
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

Simple transparency algorithms which assume a linear transparency over an entire surface are the type most often employed to produce computer synthesized images of transparent objects with curved surfaces. Although most of the images created with these algorithms do give the impression of transparency, they usually do not look realistic. One of the most serious problems is that the intensity of the light that is transmitted through the objects is generally not proportional to the amount of material through which it must pass. Another problem is that the image seen behind the objects is not distorted as would naturally occur when the light is refracted as it passes through a material of different density. Use of a non-linear transparency algorithm can provide a great improvement in the realism of an image at a small additional cost. Making the transparency proportional to the normal to the surface causes it to decrease towards the edges of the surface where the path of the light through the object is longer. The exact simulation of refraction, however, requires that each sight ray be individually traced from the observer, through the picture plane and through each transparent object until an opaque surface is intersected. Since the direction of the ray would change as each material of differing optical density was entered, the hidden surface calculations required would be very time consuming. However, if a few assumptions are made about the geometry of each object and about the conditions under which they are viewed, a much simplier algorithm can be used to approximate the refractive effect. This method proceeds in a back to front order, mapping the current background image onto the next surface, until all surfaces have been considered.
Cambridge project (Panel Session): The consistent system
Authors: Cynthia Crawford, John Klensin
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This session presents a panel discussion of the goals and aims of the Consistent System. There will be a presentation of the foundations and principles of the system, followed by discussion by a few participants of their work and its relation to the rest of the project. There will also be a discussion of the ideas underlying the system by Mark Eisner of the National Bureau of Economic Research.
A graphic workflow simulator for factory simulation
Authors: Ralph R. Duersch, Marc A. Laymon
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

This paper describes the features and an implementation of a discrete systems simulator developed to simulate most manufacturing operations, to predict their performance. It is a tool intended for use by planners and manufacturing engineers who have little if any experience using them, The simulator incorporates graphics and question-and-answer interfaces to build the simulation without the user's need to know any programming language. It presents the results of the simulations in easy-to-understand animation and graphs.
Polling in a multidrop communication system: Waiting line analysis
Authors: Alan G. Konheim, Bernd Meister
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

A communication system is considered which consists of buffered input terminals linked by means of a multidrop line to an output device. Data enters the system through the terminals and the service operation is the transfer of data units to the output device. The terminals are sequentially polled; each terminal holds the channel until its buffer is emptied. The input processes are assumed to be independent and to have stationary independent increments. The stationary queue length distribution is calculated.
A model for the local area of a data communication network objectives and hardware organization
Authors: R. A. Scantlebury
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

This paper, together with its companions(1)(2) describes the experimental data communication network being implemented at the National Physical Laboratory. The purpose of the work is two-fold. Firstly, it will act as a model of the 'local area' network assumed, but never analysed in detail, in the NPL proposal for a possible National Data Communication System(3)(4)(5). Secondly, it will provide data communications between a wide variety of devices. These range from computers to teletypes and are spread over the 78 acres of the Laboratory site.
Two-dimensional channel routing and channel intersection problems
Authors: M. Wiesel, D. A. Mlynski
Venue: Proceedings of the 19th Design Automation Conference (1982)

A two-dimensional channel routing program for hierarchical IC layout with orthogonal building blocks of variable size and shape is presented. A two dimensional channel model and a one layer channel router are used. A detailed description of the routing scheme which avoids the generation of &ldquo;switch box&rdquo; problems is given. The behavior of the two-dimensional routing algorithm to single and coupled channel intersections is demonstrated.
Applications of a numerical geometry system in engineering
Authors: J. P. Mayfield, R. M. Burkley
Venue: Proceedings of the 13th Design Automation Conference (1976)

In December of 1972, a study effort was undertaken at TRA to determine if it was feasible to create a computer based system that would significantly improve the generation, usage and dissemination of geometric information in an engineering, design and manufacturing environment. The effort was divided into several phases: study, system design and economic evaluation and, finally, implementation. The system which has been implemented is a highly interactive keystroke driven system which executes under the TSO (Time Sharing Option) provided on IBM computers. The specific functional capabilities provided by the system appear to the end user as an extension of the time sharing system command language.
A self-defining dynamic data management system using multiple access methods
Authors: Normand R. Montour
Venue: Proceedings of the international conference on APL (1982)

The advent of Generalized Arrays introduces a broad range of new possibilities for Application Systems. This is the description of such a system that introduces two new concepts. The first concept is the use of different access methods, written in APL, on the same data base using Generalized Arrays. The second one is the use of an algorithm to monitor the Data Base and initiate prompting for action-by-the-user function.
The dynamics of a general aviation pilot promotion campaign
Authors: Michael A. Duffy
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

The General Aviation Dynamics (GAD) model is the result of a series of research programs conducted by Battelle's Columbus Laboratories (BCL). It is a dynamic simulation model built upon the causal interactions displayed between the various sectors of the general aviation system; viz, the pilot supply sector, the aircraft demand sector, and the aircraft utilization sector. Previous applications of the GAD model have addressed the impact on GA activity of proposed regulatory changes which would result in increased user costs. This paper is an evaluation of the General Aviation Manufacturers' Association's three-year Takeoff program which is attempting to double the expected private pilot population by 1980. If the Takeoff program is successful, the GAD model indicates that there will be approximately 50,000 additional active general aviation aircraft by 1985.
The use of computer-simulated radiances to retrieve total atmospheric ozone data from satellite-mounted infrared multifilter radiometers
Authors: Patrick P. Weidhaas
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

Between March 1977 and February 1980, four satellites equipped with multichannel filter radiometer (MFR) sensors supplied infrared radiance data at various spectral channels. The Satellite Ozone Analysis Center (SOAC) at the Lawrence Livermore National Laboratory received the radiance data from the U.S. Air Force. An ozone retrieval model was developed by SOAC in order to derive total ozone values from the radiance data. Statistical comparison against a network of ground observatories which measure total ozone with a Dobson spectrophotometer showed good agreement between MFR-derived ozone data and Dobson measurements. Thus, the scientific feasibility of SOAC's ozone retrieval model was established. Currently, SOAC has begun to automate the processing and archiving of the MFR data. Daily computer-generated contour maps of the global ozone distribution will be produced for dissemination to the scientific community. Extensive data analysis is also in progress.
Machine Instruction Count Program
Authors: John E. Gaffney,  Jr.
Venue: Selected papers of the 1982 ACM SIGMETRICS workshop on Software Metrics: part 1 (1982)

The Machine Instruction Count Program (MIC Program) was originally developed in 1978 to produce 'operator' and 'operand' counts of object programs written for the AN/UYK-7 military computer. In 1981, its capability was expanded so that it could apply to the AN/UYS-1 (or &ldquo;Advanced Signal Processor&rdquo;) military computer. The former machine, made by UNIVAC, hosts the IBM-developed software for the sonar and defensive weapons system/command system for the TRIDENT missile launching submarine and the software for the sonar for the new Los Angeles-class attack submarines. The second machine, made by IBM, is incorporated into several military systems including the LAMPS anti-submarine warfare system. The MIC program has been applied to collect a large amount of data about programs written for the AN/UYK-7 and AN/UYS-1 computers. From these data, various of the well-known software 'metrics'(1) such as 'volume', 'language level', and 'difficulty' have been calculated. Some of the results obtained have been reported in the literature (3,4). Probably, the most significant practical use of these data, so far, has been the development of formulas for use in the estimation of the amount of code to be written(2,5) as a function of measures of the requirements that they are to implement or the (top-level) design that they are to implement.