ppxscal/embedding_network huggingface dataset:
Menus with APL, and other full-screen applications
Authors: Terry McKee
Venue: ACM SIGAPL APL Quote Quad (1979)

The full-screen manager for APL allows APL writers to take advantage of the facilities available on a display terminal. It allows the user to define fields anywhere on the screen for input or output, make them sensitive to the light pen, alter the intensity of the display, sound the audible alarm, make use of program-function keys and accept magnetic-badge reader input. What difference do they make to APL and the APL user? Do they enable the application programmer to produce better applications? Are they sufficiently easy to use for the problem solver? The new facilities are described in terms of what they do and no attempt is made to explain the mechanics of how they work. Examples of useful functions are given together with their APL code. This paper describes the use of local or remote 3270-compatible screens operating with IBM's VS APL. Through the use of utility functions, device-dependent coding has been avoided. Users of, for example, the IBM 5110 or other manufacturers' graphic displays will use similar routines provided with their devices or can write the functions using appropriate terminology, such as 'bell' for audible alarm, or 'cross hairs' for cursor.
Information systems: (Panel Discussion): A balanced approach to undergraduate computer curricula
Venue: Proceedings of the 1979 annual conference (1979)

&ldquo; Computer Science?&rdquo;any two individuals who call themselves Computer Scientists in a closed environment and before long the question is posed. Total agreement on an answer is rare, and perhaps the dynamic nature of our discipline is enhanced by the flexibility of its title. At the Computer Science and Industry Interface Meeting (June 4, 1978 at Anaheim) one group did state some conclusions: &ldquo;Computer Science was a profession rather than a science and that it was a profession that required a broad background in many subjects.... Computer Science was, or ought to be, an experimental discipline. Computer Science is an application-oriented activity centered around the computer itself. Systems and programs, design methodology and practice, applications and operation of computers, and theory are all part of Computer Science.&rdquo;
Design characteristics of the WATFOR compiler
Authors: D. D. Cowan, J. W. Graham
Venue: ACM SIGPLAN Notices (1970)

About 1960, it became fashionable to introduce computer techniques into many of the courses being taught at the university level. These courses tended to be technically oriented (Engineering, Science, Mathematics), and the language most often used was one of the versions of FORTRAN. Students were introduced to computing by a brief course in FORTRAN, and then were expected to apply their newly-discovered knowledge to the solution of numerous problems related to some discipline. Introducing large numbers of students to computing in this manner created an entirely new type of demand for computer services. These new demands for computer services had to satisfy the following needs. (i) The programmers were not professionals; thus, the proportion of errors in a given number of written statements was higher than usual. (ii) The programs themselves were often quite short, usually 30 to 50 statements in length. (iii) The volume of submitted programs was very high, in the order of hundreds of thousands per day. (iv) The debugged program tended to be run in production only once, and was set aside as a completed assignment.
iMAX: A multiprocessor operating system for an object-based computer
Authors: Kevin C. Kahn, William M. Corwin, T. Don Dennis, Herman D'Hooge, David E. Hubka, Linda A. Hutchins, John T. Montague, Fred J. Pollack
Venue: ACM SIGOPS Operating Systems Review (1981)

The Intel iAPX 432 is an object-based microcomputer which, together with its operating system iMAX, provides a multiprocessor computer system designed around the ideas of data abstraction. iMAX is implemented in Ada and provides, through its interface and facilities, an Ada view of the 432 system. Of paramount concern in this system is the uniformity of approach among the architecture, the operating system, and the language. Some interesting aspects of both the external and internal views of iMAX are discussed to illustrate this uniform approach.
Probabilistic encryption how to play mental poker keeping secret all partial information
Authors: Shafi Goldwasser, Silvio Micali
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text. Any implementation of a Public Key Cryptosystem, as proposed by Diffie and Hellman in [8], should possess this property. Our Encryption Scheme follows the ideas in the number theoretic implementations of a Public Key Cryptosystem due to Rivest, Shamir and Adleman [13], and Rabin [12].
The universality of various types of SIMD machine interconnection networks
Authors: Howard Jay Siegel
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

SIMD machine architects must choose an interconnection network to provide interprocessor communication. The universality of a network is its ability to simulate arbitrary interconnections of the processing elements. We examine the universality of five particular networks which cover the types used in the Illiac IV, STARAN, Omen, SIMDA, and RAP machines. They also cover the types discussed by Feng, Lang, Lawrie, Orcutt, Siegel, and Stone. We give O((log2N)2) algorithms, where N is the number of processing elements, for the Perfect Shuffle, PM21, WPM21, and Cube networks to simulate arbitrary interconnections (Orcutt has given an O(N1/2log2N) algorithm for the Illiac network). We analyze Batcher's bitonic sorting method and show how each network can implement it on an SIMD machine. We discuss how sorting destination tags is equivalent to simulating interconnections.
A digital computer simulation of a class of lumped and/or distributed four ports
Authors: M. A. Murray-Lasso
Venue: Proceedings of the 4th Design Automation Conference (1967)

In this paper a digital computer simulation of a class of lumped and/or distributed four-ports is given. The program is used in predicting the behavior of certain types of lumped and/or distributed directional couplers. The simulation is done in the frequency domain. For this purpose a digital computer program called COPLER is presented. The program obtains a matrix characterizing the four-port at a discrete set of requencies given the values of the discrete components or the values per unit length and lengths of the distributed components plus a code vector showing how they are connected. It also may perform a statistical tolerance analysis using a Monte Carlo method. Taking advantage of such a study it can also optimize the network through a random walk. Although the methods used in the program were motivated by a particular circuit design problem in the field of radar communications, in actual fact the same design philosophy has wide application for computer aided design in many areas.
Image restoration using layered neural networks and Hopfield networks
Authors: M. Muneyasu, K. Yamamoto, T. Hinamoto
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

An algorithm is developed for the restoration of an image degraded by a known two-dimensional (2-D) shift-invariant point-spread function, and corrupted with white Gaussian noise. A layered neural network and the Hopfield network are used for the edge detection, and the restoration and smoothing of a blurred image, respectively. In particular, a layered neural network is proposed for exact edge detection where the inputs consist of three pixel values and a local variance in a 2-D mask. This network can detect edges and suppress the noise in an image at the same time and its performance is adjusted by learning. Finally, an example is given to illustrate the utility of the proposed algorithm.
Polyvalues: A tool for implementing atomic updates to distributed data
Authors: Warren A. Montgomery
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

The coordination of atomic updates to distributed data is a difficult problem in the design of a distributed information system. A common goal for solutions to this problem is that the failure of a site should not prevent any processing that does not require the data stored at that site. While this goal has been shown to be impossible to achieve all of the time, several approaches have been developed that perform atomic updates such that most site failures do not affect processing at other sites. This paper presents another such approach, one that provides a mechanism by which processing can proceed even if a failure occurs during a critical moment in an atomic update. The solution presented is based on the notion of maintaining several potential current values (a polyvalue) for each database item whose exact value is not known, due to failures interrupting atomic updates. A polyvalue represents the possible set of values that an item could have, depending on the outcome of transactions that have been delayed by failures. Transactions may operate on polyvalues, and in many cases a polyvalue may provide sufficient information to allow the results of a transaction to be computed, even though the polyvalue does not specify an exact value. An analysis and simulation of the polyvalue mechanism shows that the mechanism is suitable for databases with reasonable failure rates and recovery times. The polyvalue mechanism is most useful where prompt processing is essential, but the results that must be produced promptly depend only loosely on the database state. Many applications, such as electronic funds transfer, reservations, and process control, have these characteristics.
A tool for automatic program restructuring
Authors: Domenico Ferrari
Venue: Proceedings of the ACM annual conference (1973)

A tool, called LOCALIZER, which improves the locality of programs for multiprogrammed virtual-memory computer systems, is described. The method of critical working sets, which is the basis of the tool, is presented. This method is especially suitable for those systems where primary memory is managed according to the working set strategy. The various modules of the tool are briefly described after a discussion of the general restructuring procedure. (This research was supported in part by the Advanced Research Projects Agency, under Contract No. DACH15 70C 0274.)
An alternative to curriculum 68
Authors: Robert J. Dumas, Anne E. Nieberding
Venue: Proceedings of the sixth SIGCSE technical symposium on Computer science education (1976)

The authors of this paper have had the opportunity to view computer science (CPS) curricula from three different perspectives - as students themselves, as professional applications programmers, and as employers of current computer science majors. We are concerned that the typical course of study is no longer adequate to prepare students for the real world of computer applications. The purpose of this paper is to point out some problem areas and to suggest an alternative.
Auto-Adaptation to Communication Environment through Dynamic Change of Communication Model
Authors: Victor Budau, Guy Bernard
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Being able to adapt themselves to changing environments represents an important requirement for the modern software systems. Distributed systems face a changing, evolving communication environment due to mobility, large scale deployment, new and unpredictable user behaviours. As the programming of such systems becomes more complex, new programming models have been used for creating applications. Communication between different system components is based on two main communication models: communication by messages and communication by remote method invocations. The choice of synchronous communication via remote method invocations or of message-based asynchronous communication still remains an early decision made at the time of the application design. In this article we propose an adaptive mechanism for dynamic and transparent switching of the communication model used between the components of a distributed system. This mechanism, aimed especially at large scale applications and mobile systems, offers the possibility to adapt the communication model to the execution context of an application and the changes in its communication environment.
On the synthesis of multivalued circuits using principally binary elements
Authors: J. L. Huertas, J. I. Acha, L. Macias
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The design of multivalued logic circuits using principally binary components have been object of attention for different authors 1-2. The approach has several advantages over other synthesis methods. The basic assumptions are the availability of some input operators which perform the conversion of multivalued variables to binary as well as of an out-put subsystem which performs the conversion of binary to multivalued. The output subsystem is a two level sum-of-products realization employing multivalued MAX and MIN gates. We are studying an alternative procedure for implementing multivalued switching functions by using principally binary components. Our approach uses an output element which is based on the modulus p sum for a p-valued algebra which takes values on the set {0,1,...,p&minus1}. Three basic methods have been developed which differ in the output block.
The FORTRAN project - a multifaceted approach to software-firmware high level language support
Authors: Gideon Frieder
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

A description of a novel approach for the support of high level languages is presented. This approach consists of different machines for different task structures, even if those tasks are written in the same high level language. At the same time, a high degree of similarity of the machines is maintained. Preliminary results and the outline of future work are briefly summarized.
Truth in advertising in present and future generation computing
Authors: Rob Kling
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The capabilities of advanced computing technologies are best understood by computer scientists and substantially less so by non-specialists. There is a strong bias toward oversimplifying the capabilities and limitations of new technologies when they are presented to a larger public: through presentations to policymakers, advertisements for specific products and through media exposure of enthusiasts or demoters of new technologies. Overall, the capabilities of new technologies seem often exaggerated, even when the artifacts are usable and useful. In the case of new technologies, reliance on market forces is problematic since the public does not have much information on which to wisely evaluate their possible choices. Does the computer science community have any role to play in helping assure that policymakers and the public receive relatively accurate representations about the character, values, problems, and costs of new classes of computing technologies?
Bidirectional token flow system
Authors: M. E. Ulug, G. M. White, W. J. Adams
Venue: Proceedings of the seventh symposium on Data communications (1981)

Over the last few years there has been an avalanche of technical literature on techniques for allowing nodes to access and share one of the most valuable resources of a computer communication network, i.e., the bandwidth of the communication media.1 This report describes the design of a new type of Local Area Computer Network called BID that uses a bidirectional token flow as a form of token passing.2 The design of BID not only allows it to process messages having various properties but also makes it possible to operate simultaneously in a packet and circuit-switching mode. This latter mode, using minipackets, enables BID to be used for those applications having real-time response requirements. In describing BID this report defines the basic concepts of the implicit token, token carrier, token generator, and token wait time. It also describes a new preemption technique which reduces the walk time normally associated with token and polling systems. A GPSS computer simulation was made of the BID system to determine the average delay times experienced by the various priority classes of messages. An analytical model using a single priority class of messages is presented, and the results of the computer simulation are compared with this. The simulation results also indicate the uniformity of the average delays experienced by the Bus Interface Units across the bus resulting from the use of bidirectional flow of tokens.
A short presentation of the main features of AEPL - an extensible programming language
Authors: J. Katzenelson, E. Milgrom
Venue: Proceedings of the international symposium on Extensible languages (1971)

AEPL is a programming system designed as a tool for the implementation of problem-oriented languages. It is based on a small number of simple but powerful concepts described briefly below. The AEPL system is not yet implemented at the present time; it has been used, however, to define - on paper - a language for the manipulation of graphs. The extensibility of the system stems from the ability to create new data types and from the ability to modify some of the language structures dynamically (syntax and associated semantic as well as some control structures).
Application of the GERTS II simulator in the industrial environment
Authors: Gary E. Whitehouse, Kenneth I. Klein
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

GERT was originally developed to aid in the analysis of stochastic networks. GERT can be used to graphically model and analyze complex systems. Recently a simulator model, GERTS II, has been developed to solve GERT Networks. The simulator language used in the development of this model was GASP IIA. This paper discusses the possible application of GERTS II to model and analyze (1) assembly line operations, (2) project management networks, (3) conveyor systems and (4) inventory systems. Finally, an actual application dealing with a job shop loading problem is presented.
Systems analyst training: Filling the gap and what to do next
Authors: Duane C. Abbey
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

The need for professionally trained and educated systems analysts in the field of data processing is rapidly becoming a paramount problem. There are few specialized programs at our colleges and universities to produce college graduates with the broad range of skills and abilities necessary for dynamically performing the functions of a systems analyst. Since present day college graduates require further training, in-house training programs at some of the larger installations have been developed to fill the gap. This paper describes one such curriculum for the education and training of systems analysts, and it then goes on to discuss the development of similar programs at the university level.
XS-1: An integrated interactive system and its kernel
Authors: G. Beretta, H. Burkhart, P. Fink, J. Nievergelt, J. Stelovsky, H. Sugaya, A. Ventura, J. Weydert
Venue: Proceedings of the 6th international conference on Software engineering (1982)

We present a case study of an eXperimental integrated interactive System, XS-1, being implemented on small computers. The primary goal of this project is to provide experimental support for design principles that have emerged from a critique of the behavior of today's interactive systems, and from our earlier implementations. These design principles apply at the user's level and at the system designer's level. The user must have a model of the system that allows him at all times to obtain information about his current data environment and his current command environment; he must be able to obtain such information by means of universal commands that are always active, regardless of the application program he is executing. These requirements at the user level have stringent implications at the system design level, such as: a common representation for data of all types, a file system that handles small and large sets of data in a uniform way, a front-end dialog processor shared by all application programs, and screen layout conventions.
Guidelines for a minimum program for colleges and universities offering bachelors degrees in information systems
Authors: John T. Gorgone, Norman E. Sondak, Benn Konsynski
Venue: ACM SIGCSE Bulletin (1980)

The tremendous demand for education in the use and application of computers and computer based systems in business, commerce and government has led to the establishment of Information Systems Departments and to the option of an Information Systems concentration in established Computer Science Departments. In fact, the Information Systems degree is now becoming one of the fastest growing and most popular in the area of computer education. This report is presented to the Computer Science and Information Systems education community as a preliminary proposal of ideas on which to base an accreditation standard. It was developed with the background that many Information Systems departments are incorporated in Schools and Colleges of Business, and an attempt was made to have the standard consistent with the American Association of Colleges and Schools of Business accreditation guidelines. The successful future of Information Systems depends on a firm foundation for graduating students; this work is directed towards offering a minimal or floor program for the Information Systems bachelors degree.
3D Galatea: Entry of three-dimensional moving points from multiple perspective views
Authors: Steven A. MacKay, Richard E. Sayre, Michael J. Potel
Venue: ACM SIGGRAPH Computer Graphics (1982)

We describe an interactive graphics system for the entry of three-dimensional moving points from multiple perspective views. This work represents a major extension of Galatea, our system for graphics-assisted 2D motion analysis. 3D Galatea permits reconstruction of 3D time-dependent positions from 2D entries in two or more perspective views. The system supports a general approach for calibrating perspective views. This method, based on work of Sutherland, uses a known 3D reference object to calibrate completely arbitrary perspective projections. A somewhat restricted class of perspective views may be calibrated without an explicit calibration object using another approach developed from photogrammety. In 2D Galatea, we have used an animated graphics overlay onto the source image to give the analyst feedback regarding current and previous data entries. This capability is extended in 3D Galatea by overlaying auxiliary lines, which are the backprojections of previous 2D entries from one view into other views. This concept amounts to a fourth interpretation of the well-known Roberts homogeneous matrix equation describing perspective projections of 3D space into a 2D image. The auxiliary line is useful in locating a point which is obscured in one of the images, or in determining the correspondence of projected points as seen in different views, which may be ambiguous or easily confused.