ppxscal/embedding_network huggingface dataset:
A prototype engineering tester for microcode and hardware debugging
Authors: Will Sherwood
Venue: Proceedings of the 17th annual workshop on Microprogramming (1984)

A custom test system was developed to assist in the integration of the microcode and components of a VLSI VAX Microcomputer prototype system. Microcode debugging ease (on the hardware) and leverage is gained by hierarchical accumulation of access and execution operations for the prototype. VAX-11 750-computer-based software and custom UNIBUS-interconnect-based tester hardware comprise this Engineering Tester (fondly called ET). Interactively entered high-level commands to ET software communicate with the tester hardware and the prototype through UNIBUS control and data registers. This paper presents a summary of the methodology and CAD verification tools used in designing the VLSI VAX system. the software and hardware architecture of ET. a look at the implementation and at the leverage gained by building ET based on existing software and hardware tools, and finally, a review of ET applications during the debug phase.
Computer-aided design and practice in city college school of architecture
Authors: Gordon A. Gebert
Venue: Proceedings of the 14th Design Automation Conference (1977)

Computer-related learning experiences at the City College School of Architecture have been developed over the past four years based on a four-level scheme of progressively greater knowledge and ability to apply computers to design problems. All students in the School gain a rudimentary understanding of computer use through occassional lectures and demonstrations. A small group may elect a computer-aided design course in the fourth year while approximately twenty may elect a graduate elective sequence in advanced topics in the fifth year. Resources available include a full range of hardware and numerous software packages and programs.
Synchronization Algorithm for SCTP Network
Authors: H. Elsayed, A. Abd El Al, T. Saadawi, M. Lee
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Synchronization is an important problem in communication networks especially for real timeapplications. Synchronization can be done in different layers of the ISO model. In this paper, a synchronization algorithm is introduced and applied on Stream Control Transmission Protocol (SCTP), which is layer four protocol. However, the current SCTP standard, RFC 2960, doesn't specify synchronization mechanism. The Algorithm is applied on periodic traffic and showssynchronization improvement. We examine the Transfer Delay (TD) and the Interarrival Time (IT) as network performance measure. Different levels of the algorithm are introduced to compromise between performance improvement and implementation complexity. The highestperformance algorithm is called "maximum delay algorithm". It recovers the IT to its original value however it requires larger buffer especially in case of very high jitter. On the other hand, another algorithm, referred to as "average delay algorithm", solves the buffer problem.
A role of a user in the development and maintenance of an information system: Empirical and theoretical findings
Authors: Pertti Järvinen
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

This paper comprises two parts. The first describes results from the empirical follow-up study. This study concerns the change-over and early use periods of new application software. After one year's experience in usage of a computer system we organize a programming course for users. Our findings encourage to give users more responsibility in systemeering. Most clerks passed the program comprehension test and some of them constructed small simple programs. The second part comprises a consideration of various systemeering models. Much attention is paid to participation of users in different systemeering tasks. Also a short post-analysis is made concerning the role of the user. Various degrees of participation are identified.
Indexing and indexed replacement in APL
Authors: Roland H. Pesch
Venue: Proceedings of the international conference on APL (1981)

Indexing and indexed replacement have an exceptional syntax. Enclosed arrays make this syntax unnecessary. An operator with an ambivalent derived function is proposed as the solution. The monadic case performs selection; the dyadic case, replacement.
Modeling of two distributed schemes for data synchronization in a computer network
Authors: Chin-Hwa Lee, R. S. Shastri
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

In the network environment with distributed multiple-copied files a lockout mechanism is required to guarantee the data synchronization. File access requests from geographically distributed computer node have to be coordinated to maintain consistency of multiple-copied files. Network-wide semaphore scheme and hopping permit scheme are proposed in this paper to protect file access critical session among concurrent users on the networks. Simulation results using GPSS have shown slightly better average-response-time for the network-wide semaphore scheme. There is also result which shows the superior control traffic overhead of the hopping permit scheme. The most important of all from the results is the dependencies of the above two performance criteria on the computer network size.
PRONTO: Quick PLA product reduction
Authors: Jorge F. Martinez-Carballido, V. Michael Powers
Venue: Proceedings of the 20th Design Automation Conference (1983)

A PLA is a regular, modular combinational function implementation popular in VLSI design. Among methods which reduce the cost of implementing a given PLA specification, reducing the number of product terms is particularly fruitful. Optimum product term reduction for practical-sized problems is prohibitively complex. Previous suboptimal, heuristic product term reducers have been iterative or indirect. PRONTO is a direct, one-pass method for heuristically reducing the number of product terms required to specify a PLA. Results of using PRONTO on a small set of examples show solutions up to 21% better than previously reported, using a procedure of modest complexity.
Combining text and image information in content-based retrieval
Authors: R. K. Srihari
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This research explores the interaction of textual and photographic information in an integrated text/image database environment. By understanding the caption accompanying a picture, we are able to extract information useful in (i) retrieving the picture and (ii) directing an image interpretation system to identify relevant objects (in this case, faces) in the picture. The latter constitutes a powerful technique for automatically indexing images. In cases where images are not accompanied by text, it is far easier to manually add a line of descriptive text than to manually truth the images. A multi-stage system, PICTION, which uses captions to identify human faces in an accompanying photograph has been developed. We discuss the use of PICTION's output in content-based retrieval of images to satisfy focus of attention in queries.
Structure and semi-fluid motion analysis of stereoscopic satellite images for cloud tracking
Authors: K. Palaniappan, C. Kambhamettu, A. F. Hasler, D. B. Goldgof
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Time-varying multispectral observations of clouds from meteorological satellites are used to estimate cloud-top heights (structure) and cloud winds (semi-fluid motion). Stereo image pairs over several time steps were acquired by two geostationary satellites with synchronized scanning instruments. Cloud-top height estimation from these image pairs is performed using an improved automatic stereo analysis algorithm on a massively parallel Maspar computer with 16 K processors. A new category of motion behavior known as semi-fluid motion is described for modeling cloud motions and an automatic algorithm for extracting semi-fluid motion is developed to track cloud winds. The time sequential dense estimates of cloud-top height depth maps in conjunction with intensity data are used to estimate local semi-fluid motion parameters for cloud tracking. Both stereo disparities and motion correspondences are estimated to sub-pixel accuracy. The Interactive Image SpreadSheet (IISS) is a new versatile visualization tool that was enhanced to analyze and visualize the results of the stereo analysis and semi-fluid motion estimation algorithms. Experimental results using time-varying data of the visible channel from two satellites in geosynchronous orbit is presented for the Hurricane Frederic.
TSEM, a flexible scenario based small forces model
Authors: Bruce D. Link, Henry D. Shapiro
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

An accurate computer model of a small force engagement is useful in evaluating the combat effectiveness of armed escorts for sensitive shipments, security guard forces and military patrols. The Transportation Safeguards Effectiveness Model (TSEM), primarily intended for, but not limited to, the study of ambushes of armed convoys, provides the user with considerably greater flexibility in directing the actions of the combatants than previous models. A user oriented script language is presented, which allows the performance of actions to be made contingent on the occurrence of significant events during the battle, providing the means for describing a wide variety of realistic scenarios. In addition, careful attention is being paid to the research results and experimental data supporting the human factors submodels. A new, more accurate casualty assessment model, the use of which can change battle times by as much as an order of magnitude, is discussed.
Garnet: A Middleware Architecture for Distributing Data Streams Originating in Wireless Sensor Networks
Authors: Lyndell St. Ville, Peter Dickman
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We present an architectural framework, Garnet, which provides a data stream centric abstraction to encourage the manipulation and exploitation of data generated in sensor networks. By providing middleware services to allow mutually-unaware applications to manipulate sensor behaviour, a scalable, extensible platform is provided.We focus on sensor networks with transmit and receive capabilities as this combination poses greater challenges for managing and distributing sensed data. Our approach allows simple and sophisticated sensors to coexist, and allows data consumers to be mutually unaware of each other. This also promotes the use of middleware services to mediate among consumers with potentially con.icting demands for shared data.Garnet has been implemented in Java, and we report on our progress to date and outline some likely scenarios where the use of our distributed architecture and accompanying middleware support enhances the task of sharing data in sensor network environments.
The scan line approach to design rules checking: Computational experiences
Authors: P. T. Chapman, K. Clark,  Jr.
Venue: Proceedings of the 21st Design Automation Conference (1984)

Advances in integrated circuit technology in the last several years have led to designs with ever-increasing complexity and density. Consequently, designers have been faced with performing design-rule-checking on designs with shape outlines that have been doubling in number every year or two. In response, we have recently incorporated efficient algorithms into our design checking strategy. This paper reports on the computational results of these efforts.
Heuristics for designing enjoyable user interfaces: Lessons from computer games
Authors: Thomas W. Malone
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

In this paper, I will discuss two questions: (1) Why are computer games so captivating? and (2) How can the features that make computer games captivating be used to make other user interfaces interesting and enjoyable to use? After briefly summarizing several studies of what makes computer games fun, I will discuss some guidelines for designing enjoyable user interfaces. Even though I will focus primarily on what makes systems enjoyable, I will suggest how some of the same features that make systems enjoyable can also make them easier to learn and to use.
Recent progress in understanding minimax search
Authors: D. F. Beal
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Lookahead search has been known for a long time to be effective in tackling problems which can be cast in minimax form (mainly game playing, but others include maintaining unstable balance against gravity, and business decisions). Recent results have shown that the benefit of lookahead depends on the structure inherent in the problem, and even that there exist some minimax problems for which lookahead search is DIS-advantageous. This paper reviews those results and then discusses algorithms which can be interpreted as recognising the structure of local areas of the search in order to control search expansion. Such algorithms can be orders of magnitude more cost-effective than search using alpha-beta alone.
Performance measurement of data communications systems with emphasis on Open System Interconnections (OSI)
Authors: Arpad Gallo, Richard P. Wilder
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This paper discusses the problems arising from the need for measuring data communication performance parameters. It derives the statistical information needs from the needs of known network models and from the performance parameter standards defined in the Federal Government and ANSI Standards on Data Communication Performance. It reviews existing monitoring devices and outlines their capabilities and shortcomings in regard to collecting data communication performance statistics. In conclusion, the paper outlines the functionalities of a modular set of performance monitoring tools, which could satisfy most of the monitoring needs of a data communication system. Although the parameters of modeling and the Performance Standards address the problems of data communication subsystems in general, this paper emphasizes the problems of distributed network systems with layered architectures. The reader should be familiar with the basics of the architecture of Open System Interconnection as the distributed network architecture is named in the draft of the international standard.1
Bundling (cable signal assignment)
Authors: J. L. Kenney
Venue: Proceedings of the 4th Design Automation Conference (1967)

This paper deals with the little publicized problem of cable signal assignment, or as I refer to it, &ldquo;bundling.&rdquo; That is, the &ldquo;bundling&rdquo; together of signals that have the common property that they travel between the same two general areas. (Boards in the terminology of this paper.) Thus, these signals can be grouped together into a cable and their connections to the general areas are called cable connectors. Before continuing with the &ldquo;bundling&rdquo; problem, it is best to define some terms that will be used in the remainder of this paper. They are not original definitions nor are they necessarily the universal definitions. They are only terms which the author has chosen to use.
Improved security in APL applications packages
Authors: Thomas H. Puckett
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes an experimental augmentation of APL/360 which substantially improves the privacy and security of APL applications packages. It is based upon the concept of &ldquo;qualifying&rdquo; a name: the user may specify that the name of any variable, function, or group is to be implicity qualified by the user's sign-on number. In effect, the name becomes the private property of the user. Any referent of the name is considered a &ldquo;protected&rdquo; object, since access by other users is possible only through functions created by the user who qualified the name.
The application of APL to control more efficient processes
Authors: A. P. Reeves
Venue: Proceedings of the international conference on APL: part 1 (1979)

In many instances where a large amount of data is to be manipulated, an APL interpreter is much less efficient than a compiled program. Also there are some tasks which are difficult to achieve with a conventional APL system such as the control of special-purpose peripherals. A system is described in which an APL interpreter is used interactively to control a low-level processor. The advantage of this symbiosis is that the user has available the high-level interactive APL with which to develop programs plus the higher execution speed or extended capabilities of the low-level processor. The general problem of linking an APL interpreter with other processors is discussed and several levels of communication are considered. At the highest level, expressions in an APL-like syntax are passed between two processors. This system was developed for the PDP-11 computer running the UNIX operating system. Arbitrary structures of interconnected processors may be created by this scheme which is simpler to implement than shared variables.
Cryptographic protocols
Authors: Richard A. DeMillo, Nancy A. Lynch, Michael J. Merritt
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

A cryptographic transformation is a mapping f from a set of cleartext messages, M, to a set of ciphertext messages. Since for m e M, f(m) should hide the contents of m from an enemy, f-1 should, in a certain technical sense, be difficult to infer from f(m) and public knowledge about f. A cryptosystem is a model of computation and communication which permits the manipulation of messages by cryptographic transformations.
A latent-expression exception-handling system
Authors: John C. Gilmore Thomas H. Puckett
Venue: ACM SIGAPL APL Quote Quad (1979)

This paper describes an Exception-Handling Facility implemented in the APL*PLUS* System which uses latent expressions similar to @@@@LX as the primary mechanism. Separate expressions are used to deal with errors which occur within the execution of APL statements, and with use of the break key on a terminal during statement execution. This allows application packages to deal directly and automatically with many situations which previously required intervention on the part of the user of the package. The facility also includes a means of providing information on the nature of the exception, and providing protection against security breaches for certain cases in which the exception handlers cannot perform their normal functions.
A study of procedure descriptions by non-programmers (abstract only)
Authors: Lawrence Miller
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Providing mechanisms for inexperienced users of computer systems to program the computer to repetitively perform tasks that the user normally does in his or her daily job is one of the most challenging tasks for designers of highly interactive computer systems oriented to naive users. This report presents early results of a study conducted to ascertain the written analogues of the programming structures iteration, conditional and variables. The study required users already familiar with office procedures to practice a routine forms fill-in and data verification task over a period of one week. At the end of that time, they were required to write a set of procedures as if they were instructing a new person in the performance of the job. These written protocols (in conjunction with verbal protocols taken during the learning phase) were analyzed in terms of the above-mentioned structures.It was found that a variety of structures are used by naive users, but more importantly, all users made serious errors of both omission and commission. In particular, events of low probability were not described at all. In certain cases the written instructions did not correspond with the way in which users actually performed the tasks.The implications for office systems designers, amongst others, are explored.
3-D shape recovery of hybrid reflectance surface using indirect diffuse illumination
Authors: Tae-Eun Kim, Jong-Soo Choi
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

To recover 3-D shapes, a new algorithm which is based on the hybrid reflectance model and the indirect diffuse illumination method is presented. The photometric stereo method (PSM) is modified with the indirect diffuse illumination method (IDIM). We derive the surface reflectance function for a disk-type light source and make the 3-D reference table generated by applying the derived surface reflectance function to the hemisphere. The slant and tilt angle at each point of the intensity images which are the inputs for the algorithm is determined from the 3-D reference table. Finally, the 3-D shape of objects is recovered from the needle map.
An optimization problem on the selection of secondary keys
Authors: Vincent Y. Lum, Huei Ling
Venue: Proceedings of the 1971 26th annual conference (1971)

The use of index files for accessing records, on the basis of secondary key values is a common feature of existing information systems. This method, judiciously applied, provides major improvements in response time, is easy to implement and costs relatively little. Moreover, the concepts of secondary indexes are simple, yet powerful and flexible because they provide the power to handle all kinds of queries easily with little loss of efficiency. It is, however, important to carefully select the key fields to be indexed because excessive indexing can result in major performance degradation. This paper presents a quantitative tradeoff analysis for index selection. The problem is formulated mathematically as an optimization problem using an index indicator function which becomes positive when the implementation of an index file is desirable and negative otherwise. The variables of this function are derived from the factors that influences the performance of the system. These factors include file and query statistics, frequency and speed of retrieval, and m maintenance for all the relevant files. Two examples illustrating the principle of application in tradeoff analysis are given.
APL Data Management Systems (APLDMS)
Authors: Salomon Ohayon, Pierre A. Lavallee
Venue: Proceedings of the sixth international conference on APL (1974)

In April 1971, the Data Base Task Group (DBTG), a group of the Conference on Data Systems Language (CODASYL) specified in a report [I], a Data Definition Language (DDL) to enhance the data structure capabilities of programming languages. In addition, the DBTG proposal defined a Data Manipulation Language (DML) to access or process the data defined by the DDL. COBOL was chosen as the first language to be enhanced. This paper describes the implementation of APLDMS [4], an APL enhanced in the DBTG sense. First we review the DBTG Data Management Systems concept and its interface mechanism to compiled languages such as COBOL and FORTRAN. Then this interface mechanism is extended to interpretive systems such as APL, enlarging the DBTG Data Management Systems environment. Finally we describe a subset of the APL data manipulation language (APL DML) as a set of APL functions capable to access or process the data defined by a DDL.