ppxscal/embedding_network huggingface dataset:
APL[LAVAL] used as an interactive tool for the description, simulation and micro-programming of digital computers
Authors: Louis P.A. Robichaud, Yves Ouellet, Gerard Simian
Venue: Proceedings of seventh international conference on APL (1975)

This paper presents the use of APL [LAVAL] for the complete study of a digital computer at the micro-programmed control level. For us such a study signifies the description, simulation (i.e. behavorial description), and the creation of a set of micro-programming aids such as: an appropriate micro-programming language, its assembler and its linkage editor. A general and systematic approach will be presented concerning the description and simulation phase. This method has been used to study a number of existing machines and could be applied in the design phase of new machines.
York APL-total database interface
Authors: Ian M. Cuthill
Venue: Proceedings of the eighth international conference on APL (1976)

In 1973, we installed York APL on our system, which, besides the regular APL features, provided a very useful file I/O interface to OS datasets. Since York was, until recently, our only TP monitor, we explored the possibility of using it to provide an online database capability for our TOTAL batch users. Having determined that an on-line extension would be a very useful enhancement to TOTAL, and to provide the maximum benefit with minimum overhead, we decided to implement our own interface. The following system requirements were defined for the interface: 1) easy to use 2) existing file I/O compatibility 3) input and update-in-place modes 4) data independence 5) high performance 6) low core overhead 7) maximum use of existing York facilities The interface system was designed to achieve these goals, and the main aspects of the implementation are described in the following sections. Details on how an APL application programmer would use the system are shown in the Appendix, which is taken from the Users Guide.
A learning process suitable for mechanization
Authors: Joseph M. Wier
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

A good deal of speculation has gone into the subject of mechanizing learning processes. The various schemes known to the author may be shown to be mechanizations of some general plan devised by the designer for analyzing the environment with which the device is to deal. The method proposed in this paper is another such plan. It is hoped, however, that the rules for doing this are simpler than most and that the environment in which the device is designed to operate has some small trace of generality. Let it be required to produce a device which can be used to analyze an environment which consists of a finite number of variables, each of which may at any instant assume one of a finite number of conditions. It is not necessary that each of the variables be able to assume the same number of distinct conditions, nor is it required that all or any fixed number of the variables be present at any time. It is also assumed that the changes in the variables are made instantaneously and if more than one variable changes, all may change instantaneously together if so desired. Let the analyzing device be able to observe the various changes that take place in the environment. Also let it be required that the learning device be able to find some functional relationships between the variables such that if all but one of the variables are known, the condition of that one may be found from a knowledge of the other variables. Three cases are apparent. 1. The environment is entirely predictable on observation of a given state. 2. The environment is partially predictable. 3. The environment is completely random in action and thus is unpredictable. Case 3 is of no interest because no relationships exist which are inherent in the environment. Case 2 may be usefully examined in an attempt to note the degree of predictability present. However, case 1 will be treated first as it may be used to demonstrate the learning process to its greatest advantage.
Academic and administrative computing in small and medium sized colleges
Authors: Francis L. Schneider
Venue: Proceedings of the ACM 1980 annual conference (1980)

The problems of computer usage at small and medium sized colleges range from inadequate staffing for computer science course offerings and programs to having to share the computer resource with administrative staff. Of course, the sharing of the computer does in fact put a strain on administrative staff as well. In addition, the high salaries paid by industry make it difficult to recruit and retain qualified people. Representatives from administration, computer science faculty, and computer science faculty who are now part of business and industry will meet and discuss these and other related problems as they apply to their particular school organization. Hopefully a set of partial solutions and/or a call for action will result from this pannel discussion.
Environment parameters and basic functions for floating-point computation
Authors: W. S. Brown, S. I. Feldman
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

This paper presents a language-independent proposal for environment parameters and basic functions for floating-point computation, and suggests a specific representation in terms of generic functions for Fortran 77. The environment parameters were originally introduced in 1967 by Forsythe and Moler [1], who attributed the essentials of their theory to Wilkinson [2]. These parameters are also used in the PORT mathematical subroutine library [3], with precise definitions in terms of a more recent model of floating-point computation [4], and a similar set has been proposed by the IFIP Working on Numerical Software [5]. Three of the basic functions are taken from a proposal by Ford, Reid, and Smith [6], but redefined in terms of the parameters and the model to provide a firm theoretical foundation. The other three basic functions can be expressed in terms of these, but we feel they should be provided separately for convenience. The stated purpose of the model is to capture the fundamental concepts of floating-point computation in a small set of parameters and a small set of axioms. In this paper we extend the earlier work by proposing basic functions to analyze, synthesize, and scale floating-point numbers, and to provide sharp measures of roundoff error.
An approach to microprogram optimization considering resource occupancy and instruction formats
Authors: Mario Tokoro, Eiji Tamura, Kazuhiko Takase, Kiichiro Tamaru
Venue: ACM SIGMICRO Newsletter (1977)

This paper describes a microprogram optimization technique considering resource occupancy and microinstruction format. This technique is applicable to machines whose microoperation occupies several machine cycles on a submachine cycle basis, and whose microinstruction format varies from horizontal to partially encoded, to vertical. &ldquo;Microtemplate&rdquo; is proposed to represent fetch timing and period of resource usage for a microoperation on a machine cycle and submachine cycle basis. An algorithm is shown, which detects concurrency of sequentially written microoperations through manipulation of microtemplates. An algorithm of microinstruction format selection is also discussed which decides one instruction format when several candidates exist. Effectiveness of this technique is evaluated. Efficient object codes are generated when applied to a practical sophisticated microprogrammable computer.
Electronic funds transfer networks: The impact of performance and security considerations
Authors: John C. Comfort, Pamela K. Coats
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

Bankers need a tool to help them make constructive economical decisions about the design and feasibility of electronic funds transfer (EFT) systems. The current research presents a preliminary design of a secure, reliable EFT system for the state of Florida. The system is simulated to evaluate the effect of different network topologies, message arrival rates, and communication line speeds on system response time and line loading. In addition, a fault study is performed to assess system performance under component failure. Simulation results, preliminary conclusions and suggestions for further research are provided.
Least squares estimation of C.E.S. production function's non-linear parameters
Authors: G. Soda, E. G. Vichi
Venue: Proceedings of the eighth international conference on APL (1976)

The Marouardt method for a direct non-linear least squares estimation is described. The corresponding algorithm, implemented by an APL functions set, is applied to a C.E.S. production function. The results on the Italian series of capital, production and labor from 1952 to 1971 are presented. These results, obtained by means of a C.E.S. of degree 1, are also compared with those obtained from a C.E.S. function whose degree of returns to scale is considered as a further parameter to estimate.
Serving the servers: Machine-machine user services
Authors: Kenneth J. Klingenstein
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Due to recent technological advances, the traditional role of user services to provide assistance for a human-central computer interaction is being augmented by a new role of providing the expertise for a machine-central system interaction. User-owned machines may span the spectrum from smart data acquisition laboratory instruments to sophisticated but dedicated mainframes; in addition, system level interfaces may be requested for user machines as diverse as microprocessors handling departmental clerical activities or private ad hoc networks created from the growing number of inexpensive used computers. This paper begins by summarizing the causes of this demand for new user services and the resulting types of requested interactions. We then explore the critical issues that tend to emerge in hardware, software, politics, and financing, suggesting a layered approach in solutions. Finally we evolve a set of criteria to guide user services policy.
Report on acm's activity on community and junior college curriculum career program in computer programming
Authors: Joyce Currie Little, Harice Seeds, Ronald Lenhardt, John Dineen, John Maniotes
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

A Workshop in Two Year College Programs in Computer Science was held August 11-13, 1975 in Gloucester Point, Virginia. Sponsored by the ACM's Special Interest Group in Computer Science Education (SIGCSE), it brought thirteen community and junior college participants together at the Virginia Institute for Marine Science (VIMS) to work toward recommendations for a two year program. Representing ACM were Dr. Richard Austing, Chairman, SIGCSE, Associate Professor in the Computer Science Department of the University of Maryland, and Dr. Gerald L. Engel, Executive Secretary of the ACM Curriculum Committee on Computer Science (C S), Director of Computing and Statistical Services at VIMS, Dr. Bruce Barnes of the National Science Foundation also attended. Joyce C. Little, Chairman of the ACM's Two Year College Subcommittee of C S and Professor and Chairman of the Data Processing and Computing Sciences Department at the Community College of Baltimore, served as Chairman of the Workshop. This panel presentation, given by participants in the workshop, is the first public discussion of the material under development by this group, being chaired by Joyce Currie Little, Chairman of the Ad Hoc Subcommittee for 3 Community and Junior College Curriculum, serving under the Curriculum Committee in Computer Science (C S). Reaction to, and discussion of, the preliminary findings of this group, will been couraged from the audience.
Some ideas on the educational use of computers
Authors: Harald Wertz
Venue: Proceedings of the ACM '81 conference (1981)

In this paper we will develop a new point of view on the educational use of computers, stressing its possibility for interactive use and the intellectual implications of the programming activity. After giving a rather detailed analysis of programming viewed as a cognitive process we propose a dual model centered on the notions of piloting and programming, followed by some snapshots of the interaction of a child with a computer. We will end with a proposition for the construction of an intelligent and convivial user environment.
Application of simulation techniques to scheduling and monitoring of computer installations
Authors: Leo J. Boelhouwer, Dennis M. Gilbert
Venue: Proceedings of the 5th conference on Winter simulation (1971)

RAAM is a facilities management company. It does all of the applications design, programming and data-processing for manufacturing, distribution and retail businesses. The use of resources must be carefully budgeted to maintain a healthy financial position. It has two machines. One a System 360/Model 40, the other a System 360/Model 30. The question was posed if we could augment the Model 40 by means of extra core and multi-programming and return the Model 30 to the vendor. Savings were estimated at &dollar;15,000 a month.
Region-Based Modeling and Tree Edit Distance as a Basis for Gesture Recognition
Authors: John Bellando, Ravi Kothari
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Towards developing a gesture-based interface for Human Computer Interaction (HCI), we propose a method which represents the shape of a hand as the union of a set of identically parameterized (disk-shaped) regions. Connectivity between the disk shaped regions is then imposed to allow for the accurate modeling of the hand. Signatures for gestures are then generated based on minimizing the edit distance between the model (consisting of both the disks and a connectivity preserving tree structure) obtained from image frames acquired at successive time instants.
Dyta: An Intelligent System for Moving Target Detection
Authors: Yi L. Murphey, Henry Lu, Sridhar Lakshmanan, Robert Karlsen, Grant Gerhart, Thomas Meitzler
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper we present an intelligent system, Dyta (Dynamic Target Analysis), for moving target detection. Dyta consists of two levels of processes. At the first level it attempts to identify possible moving objects and compute the texture feature of the moving objects. At the second level, Dyta inputs the texture features of each moving object to a fuzzy intelligent system to produce the probability of moving targets. The three major algorithms of Dyta, moving target tracking algorithm, Gabor multi-channel filtering, fuzzy learning and inference, are present in the paper. We have conducted extensive experiments on the Dyta system using images captured in outdoor environments. The experiment results and the performance analysis are presented in the paper.
The ECLIPSE&reg; MV/8000 Microsequencer
Authors: David I. Epstein
Venue: ACM SIGMICRO Newsletter (1980)

The MV/8000 Microsequencing subsection is presented as a case study of a microprogrammed CPU engine. A brief, but comprehensive, description of the micro-orders are discussed with both hardware and firmware aspects considered. Features that are highlighted include: Micro-interruptability (a micro-trapping mechanism); True microsubroutining of macroinstructions (IPOP); Micro-dispatching capability; and test and toggle micro-controllable flags.
Issues in design data management (Panel Session)
Authors: Randy H. Kat
Venue: Proceedings of the ACM '82 conference (1982)

Design data management is an emerging sub-discipline of database systems that is concerned with the management of data quite unlike that found in conventional banking, personnel, or order-entry data- bases. They contain information describing the design of complicated &ldquo;engineered&rdquo; objects, such as ships, buildings, mechanical devices, and integrated circuits. These objects are designed by teams of engineers who need concurrent, yet controlled access to the data. Very often the view of an object as seen by one group will be different from that of others (e.g., the plumber's view of a building is very different from the electrician's view). The members of the panel include Mr. Steven Hoffman, Calma Corporation, Mr. Douglas Gilbert, Sperry-Univac, and Dr. Roger Haskin, IBM. After a brief presentation by each panelist describing his experience with design data and his assessment of how it should be managed, the panel will discuss the following questions. Audience participation is invited, of course.
Creating and updating space occupancy and building plans using interactive graphics
Authors: R. A. Scoble
Venue: Proceedings of the 18th Design Automation Conference (1981)

Interactive graphics systems have been used for generating integrated circuit and printed circuit layouts. Now these systems are being used to create building plans as well. This paper discusses the mechanization of &ldquo;rent plans&rdquo; (a set of plans which shows how building space is occupied), its background, several applications, and possible future developments.
Function and context
Authors: Stephen Taylor
Venue: Proceedings of the international conference on APL (1983)

This paper tackles three areas of difficulty in APL. The first is the subjection to APL syntax of the work presently performed by system commands under user intervention. The second is the growing diversity of object types noted by Crick. The third arises from the matter of assigning functions raised by Iverson and Wooster. All three areas are addressed by proposed extensions to the definition and concept of functions. The extended definition is shown to incorporate workspaces, groups, workspace libraries, file subsystems and namespaces as special cases, and to make certain system commands redundant.
Adapting large systems to small machines
Authors: Thomas Stuart
Venue: ACM SIGPLAN Notices (1976)

An evaluation of software available on mini-computers and its adequacy was made. It led to extension of a systems implementation language to two minicomputers. The language LITTLE was chosen for its machine independence and efficiency. Techniques for code generation and storage allocation are recounted with a special emphasis on producing compact code.
An approach to software design documentation
Authors: Mike Burlakoff
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This paper presents an approach to developing system design documentation and then programming the software code directly into the specifications. An introduction to the purpose and content of design documentation is given, along with a description of current practices which are used in the development process. It is recommended that the documents be developed using automated methods. The code is then implemented directly into the files containing the specifications. These techniques should result in better configuration management and control of software changes. It is more likely that the specifications will be kept current throughout the life cycle of the system. The documentation should be more useful to the maintenance software engineer. The methods should be less costly compared to current techniques.
Treating information as an asset
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The fifth generation of computing presents a unique position for the value, protection, and support of information. This session addresses the needs of corporations and organizations by presenting and discussing information being treated as an asset. Robert Abbott, in his keynote address, will relate the seriousness and effort that corporations and government agencies expend to protect their information. K. Lucey and T. Brannan's paper addresses the corporate power plays that can occur by identifying the checks and balances necessary to assure protection and privacy. L. Becker's paper correlates recent legislative proposals with the impacts and problems of computer security issues.
Information and transformations on general arrays
Authors: L. Wheaton Smith
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

A paper by T. B. Steel, Jr., &ldquo;The Foundations of a Theory of Data Processing&rdquo;, discusses the concept of a general array that has been developed by the SHARE Theory of Information Handling Committee. The definition of general array in that paper is used here without further formal discussion. This paper will illustrate some applications of this concept as well as present a context that may indicate the range of its utility.
Performance
Venue: ACM SIGOPS Operating Systems Review (1975)

Interprocess Communications play an important role in system performance in the throughput as well as in its reliability. McQuillan and Walden describe such design considerations as buffering and pipelining, error control, multiplexing and addressing, and flow control in interprocess communications. Danthine and Bremer proposed a model for representing protocols which can be used to verify the definition of the protocol and evaluate its system performance. Opderbeck presents measurement esults on performance of control procedures of the ARPA Network, which reveals that efficiency of the current protocol can be as low as 20% of line efficiency. While using a new host-to-host protocol an average of 30-40% efficiency can be achieved. In order to reduce the overhead in interprocess communications, much thought must be given on the efficient implementation and use of protocols, rather than only on their feasibility. Much more work is needed to be done in this area.
The financial planning system - the application of APL to financial modeling
Authors: Paul A. Tava
Venue: Proceedings of the sixth international conference on APL (1974)

APL, by it's design, has all the characteristics of an ideal base language for financial modeling. This paper describes each of these characteristics as they were applied in the design and development of STSC's &ldquo;Financial Planning System&rdquo;.
The complexity of parameter passing in polymorphic procedures
Authors: Daniel Leivant
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

Our subject is at the confluence of two foundational research areas: formal independence results, and higher order data types. A central problem with polymorphism is the impact of involved polymorphic types on termination of program executions and on the complexity of types occurring therein. It is known thattermination of chains of procedure calls is guaranteed for all polymorphic procedures [5]; however, M. O'Donnell [16] and S. Fortune [4] have independently shown that this statement cannot be proved in usual (Peano's) first-order arithmetic, attesting to the potentially complex effect of polymorphic types. Our main result is that termination of polymorphic argument-passing is a statement that cannot be proved even in full (impredicative) second order arithmetic, a theory whose exceeding strength is briefly illustrated.