ppxscal/embedding_network huggingface dataset:
Structured life-cycle assumptions
Authors: Thomas E. Bell
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

New programmers, some managers, and lots of users don't understand the advantages of a structured software life-cycle. However, only a single experience with coding while designing will convince any incipient software engineer that a controlled process is needed from the time of system concept though the last maintenance phase. Software Configuration Management has become almost a religion, and EDP auditors have even encountered a few systems that appear to have been specified, then designed, then implemented, then tested, and finally installed&mdash;all before maintenance and redefinition occurred. Perhaps the millennium has finally arrived, and software people will soon live in a controlled world with rational practices. If you are tempted to believe the foregoing prediction, read the latest issue of FORTUNE, the WALL STREET JOURNAL, or COMMERCE BUSINESS DAILY and note a few problems that may divert us from the path to Nirvana. Data Processing supports commercial, educational, industrial, and governmental activities that are frequently (and repeatedly) redirected. Under circumstances of a largely random environment with thorough business planning a rarity, a critical support activity can expect to be redirected frequently. New ideas will be sliced into partly-completely DP projects, and users &ldquo;analytical analyses&rdquo; will become DP systems as if by magic.
Towards entropy constrained lattice vector quantization
Authors: M. Antonini, P. Raffy, M. Barlaud
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

In most of the quantization applications, we need variable rate vector quantizers. In 1988, Chou, Lookabaugh and Gray designed vector quantizers having minimum distortion subject to an entropy constraint. For this purpose, they used a generalization of Lloyd algorithm to n dimensions, called the ECVQ algorithm. We propose to use lattices in order to design entropy constrained lattice vector quantizers (ECLVQ). Low resolution (nonasymptotical) distortion and rate approximation models are given and a generalization of the distortion formula to entropy constraint is formulated. These works generalize those of Gibson (see IEEE Trans. on Inform. Theory, vol.IT-39, no.3, p.786-804, 1993) on fixed rate quantizers, to any cubic lattice Z/sup n/ subject to entropy constraint.
Strong signature schemes
Authors: Shafi Goldwasser, Silvio Micali, Andy Yao
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

The notion of digital signature based on trapdoor functions has been introduced by Diffie and Hellman[3]. Rivest, Shamir and Adleman[8] gave the first number theoretic implementation of a signature scheme based on a trapdoor function. If f is a trapdoor function and m a message, f&minus;1(m) is the signature of m. The signature can be verified by computing f(f&minus;1(m)) &equil; m. This approach presents the following problems even when f is hard to invert: 1) there may be special message spaces (or subsets of them) that are easy to sign without knowing the trapdoor information 2) it is possible to forge the signature of random numbers; this violates the requirements of many protocols 3) given a polynomial number of signed messages, it may be possible to sign a new one without knowing the trapdoor information. We solve the above problems by exhibiting two signature schemes for which any strategy of an adversary, who has seen all previously signed messages, that has a moderate success in forging even a single additional signature, is transformable to a fast algorithm for factoring or inverting the RSA function. This provably holds for all message spaces with all possible Probability distributions. Thus, in particular, given the signature of m, forging the signature of m+1 or 2m or 2sm is as hard as factoring. The two signature schemes
CACI NETWORKS II.5@@@@ a computer and communications network simulator
Authors: William J. Garrison
Venue: Proceedings of the 16th conference on Winter simulation (1984)

NETWORK II.5 is a modelling tool that takes a user-specified computer system description and provides measures of hardware utilization, software execution and conflicts. It allows a user to quickly look at various computer system configurations and determine which one can best handle the required workload. It can model a wide variety of computer systems; from a single CPU system to a vast network of computers. It can model the portions of a design which are of special interest at a very fine level of detail while the rest of the system is modelled at a much higher level. It runs on most major computer systems and can be used after a short period of training.
Value conflicts in the deployment of computing applications
Authors: Rob Kling
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

Computing technologies importantly affect the social climate of the organizations into which they are introduced. Widespread computing developments are rarely socially neutral, since they absorb scarce resources, and re-allocate them by limiting access to the data, equipment, expertise, and other resources they utilize. This paper examines the value conflicts engendered by computing developments in two different institutional settings: electronic funds transfer systems and instructional computing in primary and secondary schools. The paper identifies five value positions which are central to debates about computerization in each of the two settings. The value positions identified differ somewhat in each area. In addition, the policies which advance more egalitarian values also differ in each setting. In the case of electronic funds transfer, policies aimed at correcting imbalances can be focused on services closely linked to computer-based technologies. In the case of schooling, difficulties of computerization are more far-reaching institutionally, and are bound up with national and regional policies of school funding. While specific values depend upon culture and upon the character of the particular institutional setting studied, these two cases can serve as instructive points of departure for examining the value conflicts which generally accompany different modes of computerization.
Keeping up with short course enrollment using database technology
Authors: John C. Trice
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Academic Computing Support at Clemson University teaches many short courses on computer related topics. In order to keep up with the enrollment in these courses, a database has been developed which will help in listing the students enrolled in each course, listing the courses that a particular instructor is teaching, and reminding the students of the date that a course is to meet. This paper will describe the database and the way that it affects the service that ACS gives to its users.
A Cost and Operational Effectiveness Analysis of the Army Utility Tactical Transport Aircraft System
Authors: Alfonso A. Diaz
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

This paper presents the methods of analysis used by the Training and Doctrine Command Systems Analysis Activity of the U.S. Army to perform a Cost and Operational Effectiveness Analysis (COEA) of the Utility Tactical Transport Aircraft System (UTTAS). First, it discusses the COEA objectives and describes the alternative aircraft systems examined in the study. Second, it gives an overview of the combat scenarios which form the basis for the evaluation. There follows a discussion of the study's analysis methodology. Finally, the paper presents UTTAS COEA results, tabulated as cost-effectiveness ratios which determine alternative preference order.
The HITAC5020 time sharing system
Authors: Shigeru Motobayashi, Takashi Masuda, Nobumasa Takahashi
Venue: Proceedings of the 1969 24th national conference (1969)

HITAC5020 time sharing system with a two-dimensional addressing feature was developed to accomplish the following: 1) to establish a design for a time sharing system with a two-dimensional addressing scheme, 2) to establish the structure of the required file system, 3) to explain the intrinsic nature of the man-machine interaction, 4) to expedite studies for productivity improvement of software. This type of time sharing system has great merit in comparison with conventional time sharing systems and will likely be the basis for many future large scale information processing systems. In this paper, we first describe the segmentation and paging mechanism; then we discuss some important parts of the supervisor which are characteristic of two-dimensional addressing, especially scheduling and swapping, dynamic linking, and how to process common segments.
SLAM tutorial
Authors: Claude Dennis Pegden, A. Alan B. Pritsker
Venue: Proceedings of the 12th conference on Winter simulation (1980)

SLAM is a simulation language that allows for alternative modeling approaches. It allows systems to be viewed from a process, event, or state variable perspective. These alternate modeling world views are combined in SLAM to provide a unified systems modeling framework (1,4). In SLAM, a discrete change system can be modeled within an event orientation, process orientation, or both. Continuous change systems can be modeled using either differential or difference equations. Combined discrete-continuous change systems can be modeled by combining the event and/or process orientation with the continuous orientation. In addition, SLAM incorporates a number of features which correspond to the activity scanning orientation.
On-line cursive script recognition using an island-driven search technique
Authors: Seung-Ho Lee, Hyunkyu Lee, J. H. Kim
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A new approach for on-line cursive script recognition that combines a letter spotting technique with an island-driven lattice search algorithm is presented. Initially, all plausible letter components within an input pattern are detected, using a letter spotting technique based on hidden Markov models. A word hypothesis lattice is generated as a result of the letter spotting. Then an island-driven search algorithm is performed to find the optimal path on the word hypothesis lattice, which corresponds to the most probable word among the dictionary words. The results of this experiment suggest that the proposed method works effectively in recognizing English cursive words. In a word recognition test, the average 85.4% word accuracy was obtained.
Design of special-purpose VLSI chips: Example and opinions
Authors: M. J. Foster, H. T. Kung
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

This paper identifies important steps in the design of a special purpose VLSI chip, and argues that the most crucial step is the design of the underlying algorithm. Because the algorithm determines the degree of parallelism and pipelining that is possible, it largely determines the performance of the chip. Furthermore, if the underlying algorithm has the right properties such as modularity and regularity, then the rest of the design should be routine and thus take little effort. These claims are supported by a concrete example&mdash;the design of an efficient pattern matching chip, which has been fabricated for testing.
A stock market simulation model for pricing asset value guarantees
Authors: Kenneth R. Frohlich
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

To compute the cost of an asset value guarantee for a variable annuity product, a stock market simulation model was used. The model was based on the assumption that the time series represented by a stock market index could be broken into alternating bull and bear half cycles, with each half cycle determined by a duration, a growth rate, a within cycle noise factor and a between cycle noise factor. Each of thousands of generated market cycles were used on a monthly basis by the model for purchase of stock, removal of asset charges, crediting dividends and other transactions.
Fuzzy four-valued logic for inconsistency and uncertainty
Authors: Mark E. Stickel
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

A logic with truth values represented by points in the unit square is developed. The logic is simultaneously a strict generalization of Belnap's four-valued logic for handling inconsistency and of Zadeh's fuzzy logic for handling uncertainty. The logic can be used for a question answering system or data base of fuzzy information in which inconsistent data may appear but should not result in everything being reported as true.
A model for the evaluation of large scale data retrieval systems
Authors: Kenneth F. Siler
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The model described in this paper provides a methodology for evaluating large scale data retrieval systems by measuring the retrieval work load associated with a set of user queries, a specified file organization, and a given data base.
Behavior modelling during software design
Authors: William E. Riddle, Jack C. Wileden, John H. Sayler, Alan R. Segal, Allan M. Stavely
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

A modelling scheme is presented which provides a medium for the rigorous, formal and abstract specification of large-scale software system components. The scheme allows the description of component behavior without revealing or requiring the description of a component's internal operation. Both collections of sequential processes and the data objects which they share may be described. The scheme is of particular value during the early stages of software system design, when the system's modules are being delineated and their interactions designed, and when rigorous, well-defined specification of undesigned components allows formal and informal arguments concerning the design's correctness to be formulated.
Simulating the impact of expanded delegation of dental procedures
Authors: J. B. Dilworth, W. J. Pelton, O. H. Embry, G. A. Overstreet
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper discusses a project underway at the University of Alabama in Birmingham Dental School. The study objective is to investigate the productivity of dental teams using therapists. Therapists, sometimes called technotherapists or expanded duty dental auxiliaries, are dental assistants who perform under the supervision of dentists some of the reversible procedures previously performed only by dentists. The study involved both an actual practice using varying numbers of therapists and a GPSS model which simulates practices with varying numbers of therapists. Some of the reasons are discussed for using the simulation model to confirm and expand the actual practice findings. The paper also presents the model and discusses some of its possible future applications. Productivity data from the actual practive are compared to data from simulations. Simulation data are presented which compares the services provided by a dental team using a therapist to the services provided under identical conditions when the therapist and her assistant are excluded from the team.
Tightly coupled operating systems on personal microcomputers
Authors: Rafiul Ahad, Georg Raeder
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

This paper examines a type of hardware/software architecture that is emerging as a result of present availability of microcomputer systems and their software. We point out how these systems can be merged in a tightly coupled configuration, and how we can obtain a strong synergistic effect by pooling the resources of each system. We also describe an existing example of a system that uses these ideas to join two popular microcomputer operating systems.
Control structures for performance graphics
Authors: T. A. DeFanti, D. J. Sandin, R. A. Ainsworth
Venue: ACM SIGGRAPH Computer Graphics (1976)

Responsive control structures allow graphics systems to be used as performance instruments. Control structures are a design element of a system&mdash;while they are manipulated by the user or performer, they exist primarily as a result of the system designer's software and hardware engineering. For example, the control structure of the telephone system allows ten sequential inputs to connect your phone to almost any other in the world. The power of this structure is independent of the specific user control device. Dials, push buttons, tones and clicks can all be used as inputs. While physical controls provide inputs, control structures determine what these inputs do.
Random test generation using concurrent logic simulation
Authors: Donald M. Schuler, Ernst G. Ulrich, Thomas E. Baker, Susan P. Bryant
Venue: Proceedings of the 12th Design Automation Conference (1975)

All approaches to automatic test generation consist of two complementary parts, namely, the generation of test vectors and verification to measure their adequacy. Path sensitizing is a well-known basic approach in which highly complex techniques used for vector generation represent the major effort in the generation/verification process. The second basic approach, random generation of vectors, is simpler but requires very efficient verification techniques if the program is to work well. Here we are concerned with the application of new verification methods to the random generation approach. Random test generation (RTG) procedures have been used previously (1,2,3) but they have not been well received by CAD practitioners compared to the newer non-random path sensitizing procedures. (4,5,6) Then why return to RTG? Based on our belief that the best test generation system should be a combination of RTG and path sensitizing techniques, it was decided to start with the easier method to implement. Equally important, however, was the development of new verification methods (7,9) which make a random approach seem much more attractive.
A CODASYL CAD data base system
Authors: Günther Zintl
Venue: Proceedings of the 18th Design Automation Conference (1981)

If in CAD systems a CODASYL data base system is used, one has to avoid some well known disadvantages. To achieve this, we defined for CAD needs in application programs a special high level data manipulation language (HLDML). With this concept the application programs get independent from the data base structure and they are able to work with a &ldquo;many records at a time&rdquo;- view. Other provisions reduced some overhead caused by the used data base system.
The seventh generation
Authors: Kerry Mark Joels
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The Fifth generation computer is fairly well defined. By extrapolation, we can make some statements about a sixth generation machine. But what of the seventh generation? This presentation explores one possible scenario for the seventh generation computer. General specifications, expandability factors, initial and operating costs, useful lifetime and special use-interactive characteristics will be defined. The seventh generation system design will have to be sensitive to design constraints in the 2010 timeframe, including: &bull; energy availability, &bull; operational lifetime requirements, &bull; materials processing breakthroughs, and &bull; user requirements.
Editing APL objects with CMS XEDIT
Authors: Norman Brenner
Venue: ACM SIGAPL APL Quote Quad (1984)

The VM/SP System Editor XEDIT is used to edit APL objects. Two approaches are possible: with an APL function, or with an exec written in REXX (the new VM/SP System Interpreter). The advantages of the latter are that nothing need be copied into the user's workspace, and that APL code can be executed from XEDIT, and XEDIT commands from APL. No new Auxiliary Processor is needed. The technique is in use at IBM Yorktown.
On the parallel evaluation of multivariate polynomials
Authors: Laurent Hyafil
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

We prove that any multivariate polynomial P of degree d that can be computed with C(P) multiplications-divisions can be computed in O(log d.log C(P)) parallel steps and O(log d) parallel multiplicative steps.
SPIDER - a Computer Aided Manufacturing Network
Authors: Michael E. Walsh
Venue: Proceedings of the 14th Design Automation Conference (1977)

The Western Electric SPIDER System is a Computer Aided Manufacturing (CAM) Network controlling and supporting manufacturing processes at multiple locations. The hierarchical network interfaces with current Computer Aided Design (CAD) Systems within Bell Telephone Laboratories and Western Electric to complete the CAD-CAM link for new electronic switching systems.(1,2) new electronic switching systems. The project acronym, SPIDER, stands for Shared Production Interactive Data bases for Error Reduction (Figure 1). This Computer Aided Manufacturing Net- work has been developed at the Northern Illinois Works of the Western Electric Company in Lisle, Illinois. This location is close to the Bell Telephone Laboratories Indian Hill Facility which has the design responsibility for switching systems. Northern Illinois Works was established to develop manufacturing facilities and methods for new technology switching products for the Bell System. As these new products pass through the development phase and demand increases the manufacture of the product line is transferred to traditional production plants. Currently, there are two other plants located in Dallas, Texas, and Oklahoma City, Oklahoma, which are part of the CAM Network (Figure 2). In addition to the manufacturing locations, two data centers are attached to the network. The Warrenville Data Center services the Western Electric Switching Equipment Division, and it is here where design information is initially received and processed by Western. It is the primary data source for SPIDER. The Kingsbridge Data Center supports time sharing applications for the corporation. Some of these programs require 24 hour availability. The link to the SPIDER Network is to provide system back-up for those applications.
Emulation of computer networks by microprogrammable microcomputers
Authors: David Cohen, Ming T. Liu
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The advent of low cost, sophisticated, microprogrammable, LSI microprocessors has renewed interest in multiple-computer systems. This paper suggests a method of implementing microprogrammable microcomputer systems as a sophisticated tool (emulators) for decreasing the economic risk involved in development of large computer networks. Two levels of emulation are proposed for different network configurations. At the first level each microprocessor emulates one of the large computers in the real network. At the second level of emulation, an additional microprocessor emulates the front-end processor associated with each large computer. The Intel 8080 microprocessors are selected for implementing the systems described.