ppxscal/embedding_network huggingface dataset:
Modeling an experimental computer communication network
Authors: J. F. Hayes
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

This paper reports the results of a performance study of an experimental computer communication network. The network is currently being designed and built in order to test concepts and techniques that may find future application. The network consists of synchronous digital transmission lines connected in loops to a Central Switch. User traffic enters the system through multiplexers connected to the synchronous lines. The Central Switch has the two-fold function of routing and controlling traffic. Two multiplexing techniques were examined, Demand Multiplexing (DM) and Synchronous Time Division Multiplexing (STDM). In both techniques user messages are blocked into fixed size packets, prior to multiplexing on the line. The synchronous line can carry these packets at a minimum rate of 4000 packet slots per second. In STDM each terminal is assigned a packet slot which recurs periodically. In contrast, for DM, packets are multiplexed on the line asynchronously into unoccupied packet slots. Alternative implementations of the DM technique were studied, one where each terminal transmits and receives at a maximum rate of 4000 packets per second and another where the maximum rate is 2000 packets per second. As part of its message handling function the Central Switch buffers messages in transit. This allows User Terminals to transmit and receive messages with a degree of independence from one another. However the terminal strategy affects the amount of storage required in the Central Switch. In order to prevent the loss of information when there is insufficient buffering there is a mechanism to inhibit traffic from User Terminals when the Central Switch's buffer is near overflow. Due to this control of traffic, there is a relationship between the amount of data that flows through the Switch and the amount of buffering in the Switch. Simulation results showed that there was little difference in delay performance between the two implementations of DM. However an analysis comparing DM and STDM showed a great difference in performance for all but the very heaviest line loadings. This difference increases as the number of terminals sharing the T1 line increases. Our study concentrated on two aspects of buffering in the Central Switch. We examined the relationship between throughput and the amount of storage available in the switch. The results of a simulation study showed that throughput can be quite high for all but minimal storage in the switch. Moreover, a strategy that dedicates buffers does quite well compared to common buffering. The second aspect of the study concentrated upon the User Terminal's strategy. Since each terminal acts independently, there may be strategies that make particularly high demands upon storage capacity in the Central Switch. An analysis showed that at the loadings where the system would be expected to operate, the user strategy in transmitting and receiving messages has little effect.
Selection of Reference Signatures for Automatic Signature Verification
Authors: V. Di Lecce, A. Guerriero, G. Dimauro, S. Impedovo, G. Pirlo, A. Salzo, L. Sarcinella
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper presents an effective procedure to select the reference specimens for a signature verification system. Specifically, from the analysis of local stability in hand-written signatures, a suitable measure is proposed to determine the capability of different sets of signatures in supporting effective verification. The measure uses a correlation-based criterium which detects and recovers non-linear time distortions in different specimens. In the experimental test, the selected set of signatures has been used for reference in a system for dynamic signature verification based on a multi-expert verification strategy. The experimental results points out the capability of the new technique in selecting effective reference signatures.
Simulation of error detection in computer programs
Authors: Norman F. Schneidewind, Thomas F. Green
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

The relationship between computer program complexity and error detection capability is investigated by representing a program as a directed graph and simulating the detection and correction of errors. Variables of interest are test coverage, number of inputs, residual errors, execution time, correction time and node-arc-loop relationships. One application is in software design where the information provided by the model would be used to select program structures which are easy to test. A second application is in software testing where test strategies and allocation of test effort would be based on error detection and complexity considerations.
The new focus on health systems management
Authors: Robert A. Greenes
Venue: Proceedings of the ACM annual conference (1973)

The period has long since passed when it was considered reasonable to expect the diverse information handling requirements of a medical institution to be managed in a cost-effective manner by a &ldquo;total hospital information system&rdquo;. Instead, the computing power and economy of sale of minicomputers, the successful application of dedicated systems to a number of hospital information management functions, and the oversize investment and uncertain benefit of large scale systems efforts in the past have together caused many hospitals to make various commitments to information systems functional in particular areas in which the need has been felt to be strongest. It now appears unlikely that any single system will issue forth which has the combined capabilities of the best financial system, clinical laboratory information system, pharmacy inventory control system, and medical record management system currently available, to cite a few examples of functional areas which have met with relatively successful application.
The grok project data structures and process communication
Authors: Peter Jensen
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

An overview of the structured data types proposed for the grok language is given. The proposal represents a uniform approach to arrays, records and procedures by regarding them as specialized occurences of the same underlying structure. Structures are partitioned into three classes according to the number of references pointing to the structure at the same time, and we show how this may be utilised in synchronization of parallel processes. The well known producer-consumer example illustrates this.
Designing Efficient Distributed Neural Classifiers: Application to Handwritten Digit Recognition
Authors: Arnaud Ribert, Yves Lecourtier, Abdel Ennaji
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This article describes an automatic method for building of distributed neural classifiers for pattern recognition. The methodology is based upon the detection of reliable regions in the representation space, i.e. clusters exclusively composed of patterns from the same class. This detection is performed using a hierarchical clustering method associated with the supervised information provided by a professor.The proposed methodology consists of associating each of these regions with a Multi-Layer Perceptron (MLP) which has to recognize elements inside its region, while rejecting all others. Experimental results for a real problem (handwritten digit recognition) reveal an interesting generalization behavior of the distributed classifier in comparison to the k-nearest neighbor algorithm as well as a single MLP.
Optimal bipartite folding of PLA
Authors: J. R. Egan, C. L. Liu
Venue: Proceedings of the 19th Design Automation Conference (1982)

The notion of a bipartite folding of a PLA is introduced. An efficient branch and bound algorithm is presented which finds an optimal bipartite folding of a PLA. The experimental results give additional justification to this folding technique.
Speed and accuracy in digital network simulation based on structural modeling
Authors: Ernst Ulrich, Dennis Hebert
Venue: Proceedings of the 19th Design Automation Conference (1982)

Speed and accuracy are fundamental simulation requirements. Simulation is not worthwhile without adequate accuracy, and massive simulations and fault simulations are impossible without adequate speed. Accuracy requirements for simulation are a sufficient repertoire of nodal states, quantitative timing, and, most importantly, adequate structural detail. A variety of techniques have provided speed for simulation, but additional speed is needed.
A micro-based project management system (abstract only)
Authors: William R. Dahms
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

A comparison is made of systems the author has designed for a main frame and a microcomputer. The limitations and advantages of microcomputers for data base management are discussed. Example applications are presented. Advantages of the set theoretic approach are discussed. Applications most suitable for the relational model are described, and contrasted on both the large and small system.The systems discussed include a commercial system Condor Series 20 DBMS which runs on CP/M, on Z-80 microcomputers and MICRO, a system which runs on MTS on large virtual memory main frame computers. CP/M is the operating system of Digital Research. MTS is the operating system at the University of Michigan.
A virtual evaluation tool for a system having a virtualizeable processor
Authors: M. J. Bennett
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

An approach often taken to the problem of understanding the behavior of a computer system has been to build a simulation model. Although models are excellent from the point of view that they allow unlimited inspection of behavior without introducing additional perturbation, they encounter increasing practical constraints as the amount of detail involved is increased. Most simulation studies of operating system behavior have consequently tended to be carried out at a gross simulation level where the constraints are as much those of ensuring correctness as of execution time or available memory space. Those models that have been built containing high levels of detail, tend to be software emulators rather than models which retain behavioral characteristics at higher conceptual levels.
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
Authors: Erich Kaltofen
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Given an arbitrary but fixed integer r -&-ge; 3. We show that testing r-variate polynomials with integer coefficients for irreducibility is m-reducible in polynomial time of the total degree and the largest coefficient length to testing bivariate polynomials for irreducibility. Factoring r-variate polynomials into irreducibles is polynomial time Turing-reducible to completely factoring bivariate polynomials.
Overview of the ARCADE system
Authors: A. Brandwajn, J. A. Hernandez, R. Joly, Ph. Kruchten
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

ARCADE is a research project in computer architecture. We first discuss its motivations and goals, wich are primarily the design of a dynamically adaptive system, and the use of performance evaluation methods as a design tool. The resulting system is intended to serve as a support for education in computer architecture and operating systems. Then, we present the overall structure of the system, and finally, we consider in more detail hardware tools that will be provided for the dynamic adaptation to varying load conditions.
Jobstream simulation using a channel multiprogramming feature
Authors: S. E. McAulay
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

A rotational position-sensing feature designed for direct-access devices reduces the time a hardware channel is busy searching for disk records. This is accomplished by electronically dividing the track of a disk into equally spaced timing sectors, using new hardware commands to access desired sectors. When an I/O record located some distance away in rotation is requested, the channel disconnects to allow concurrent servicing of requests from other devices. Through a combination of hardware and software, multiprogramming at a channel/disk level is achieved, thus improving channel performance. In this study, overall effectiveness of the feature was evaluated in a multiprogramming environment. Simulation at high and low levels simultaneously required a unique approach in the models. Hardware models were based on close tolerances and exacting operations, while software jobstream models were more generalized. The objective was to simulate a typical jobstream in a typical multiprogramming environment on specific hardware.
Bandwidth constrained NP-Complete problems
Authors: Burkhard Monien, Ivan Hal Sudborough
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

Bandwidth restrictions are considered on several NP-Complete problems, including the following problems: (1) 3-Satisfiability, (2) Independent Set and Vertex Cover, (3) Simple Max Cut (4) Partition into Triangles, (5) 3-Dimensional Matching, (6) Exact Cover by 3 Sets, (7) Dominating Set, (8) Graph Grundy Numbering (for graphs of finite degree), (9) 3-Colorability, (10) Directed and Undirected Hamiltonian Circuit, (11) Bandwidth Minimization, and (12) Feedback Vertex Set and Feedback Arc Set. It is shown that each of the problems (1)-(12) when restricted to graphs (formulas, triples, or sets) of bandwidth bounded by a function f is log space hard for the complexity class NTISP (poly,f(n)). (NTISP(poly,f(n)) denotes the family of problems solvable nondeterministically in polynomial time and simultaneous f(n) space, e.g., NTISP(poly,poly) &equil; NP and NTISP(poly, log n) &equil; NSPACE(log n).). In fact, (1)-(9) are log space complete for NTISP(poly,f(n)) when the bandwidth is bounded by the function f. This means, for example, that (1)-(9) provide several new examples of problems complete for NSPACE(log n), and hence solvable in polynomial time deterministically, when restricted to bandwidth log2n. In general, for a function f, if any of the problems (1)-(12), when restricted to bandwidth f(n), could be solved deterministically in polynomial time, then NTISP(poly, f(n)) @@@@ P. (This does not seem particularly likely even when f(n) &equil; log2n.) This indicates that several NP-Complete problems become easier with diminishing bandwidth. However, they remain intractable unless the bandwidth is restricted to c-log2n, for some c>0.
Simscript II.5 - new directions
Authors: E. C. Russell
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

There are at least three levels of abstraction to a simulation programming language. SIMSCRIPT II.5 is making significant progress on all three levels of abstraction. First, at the conceptual level, the long-established &ldquo;world-view&rdquo;&mdash;consisting of entities, attributes, sets and discrete events&mdash;has been extended to include processes and resources. Second, and still at the conceptual level, there are many systems which are more readily viewed as continuous systems or, in the more general case, as combined discrete/continuous systems. The constructs required to add this capability to SIMSCRIPT II.5 have been implemented as a user-level extension. At the model implementation level, in addition to the new statements which support processes and resources, considerable attention has been given to the structure of programs. Finally, at the execution/debugging level, much effort has been put into giving the user the tools and information he needs to develop and verify the correctness of large simulation models. As the various simulation programming languages continue to evolve, it appears that they are coming closer together at the conceptualization level.
Teaching procedural literacy (Presentation Abstract)
Authors: B. A. Sheil
Venue: Proceedings of the ACM 1980 annual conference (1980)

The naive way to teach a skill is to teach the surface characteristics of its expert performance. The cost of this naivete, however, is that one eventually runs afoul of both the genetic dependencies between sub-skills and the need to capture (and teach) the relationships between the various expert behaviors. Sooner or later, a transition to a more &ldquo;deep structured&rdquo; approach must be made. Programming instruction is currently making such a transition. Traditional methods of instruction in terms of surface characteristics of the programming task, such as specific computers and programming languages, are gradually yielding to less media dependent treatment of programming as a problem of structured design (Floyd, 1979). However, while these more abstract design issues are essential concerns of the professional systems engineer, the orientation of basic programming instruction around them is simply moving our focus from one aspect of expert performance to another. This would be tenable were our concern primarily the training of computer professionals but, while we have been developing our understanding of programming, the spread of computing has changed the motivation for programming instruction. What was once professional education has become an important component of literacy.
Metasystem: A hierarchically structured graphic tool
Authors: Nitta P. Dooner, Janice R. Lourie, Pat Velderman, Ann C. Gubiotti, Allan Kaufman
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper describes a first system1 for generating programmed systems for computer aided fabric design. Two aspects of the system are explored. First the design strategy which led to the construction of a mechanism to provide for a variety of design tools is explained. The hierarchical structure of the system as well as the nature of its modules are detailed. Second the facilities available in the system are presented. The designing systems produced by this higher level system incorporate features of our previous systems such as display and modification of the design on a graphic unit. In addition three new functions are available in the system. The first is a tool which allows the artist to introduce his design concepts directly into the system in a manner that is most natural to him. The second new facility provides the point paper designer with a means of tracing a design into the system on an electronic tablet and simultaneously viewing it gridded, according to a specified gauge, on the screen. The third function assists the point paper designer develop his design into repeat by reinspecting the elements of his gridded design whether it was traced or optically scanned. As a result of this reinspection, areas of the design are now identified and may be enlarged, reduced, moved or erased from the design.
Lighting controls for synthetic images
Authors: David R. Warn
Venue: Proceedings of the 10th annual conference on Computer graphics and interactive techniques (1983)

The traditional point source light used for synthetic image generation provides no adjustments other than position, and this severely limits the effects that can be achieved. It can be difficult to highlight particular features of an object. This paper describes new lighting controls and techniques which can be used to optimize the lighting for synthetic images. These controls are based in part on observations of the lights used in the studio of a professional photographer. Controls include a light direction to aim a light at a particular area of an object, light concentration to simulate spotlights or floodlights, and flaps or cones to restrict the path of a light. Another control relates to the color of the light source and its effect on the perceived color of specular highlights. An object color can be blended with a color for the highlights to simulate different materials, paints, or lighting conditions. This can be accomplished dynamically while the image is displayed, using the video lookup table to approximate the specular color shift
A Simple and Efficient Connected Components Labeling Algorithm
Authors: Luigi di Stefano, Andrea Bulgarelli
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We describe a two-scan algorithm for labeling connected components in binary images in raster format. Unlike the classical two-scan approach, our algorithm processes equivalences during the first scan by merging equivalence classes as soon as a new equivalence is found. We show that this significantly improves the efficiency of the labeling process with respect to the classical approach. The data-structure used to support the handling of equivalences is a 1D-array. This renders the more frequent operation of finding class identifiers very fast, while the less-frequent class-merging operation has a relatively high computational cost. Nonetheless, it is possible to reduce significantly the merging cost by two slight modifications to algorithm's basic structure. The ideas of merging equivalence classes is present also in Samet's general labeling algorithm. However, when considering the case of binary images in raster format this algorithm is much more complex than the one we describe in this paper.
Degrees of translatability and canonical forms in program schemas: Part I
Authors: Ashok K. Chandra
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

We define a measure of the generality of the control structure of a program schema. This imposes a partial ordering on program schemas, and leads to a concept of the &ldquo;difficulty&rdquo; of a programming problem. In this sense there exists a &ldquo;hardest&rdquo; flowchart program, recursive program etc. Some earlier proofs can also be simplified and/or clarified by this approach.
How interface design determines Who has difficulty learning to use a text editor
Authors: Louis M. Gomez, Dennis E. Egan, Evangeline A. Wheeler, Dhiraj K. Sharma, Aleta M. Gruchacz
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

In previous studies two background characteristics of computer novices were consistently correlated with their success in learning to use a line-based computer text editor. Older people and those who scored low on a standard test of Spatial Memory had more difficulty than younger people and those with higher Spatial Memory test scores. In the present study, we observed computer novices as they learned to use a screen-based editor, which presumably reduced spatial memory load. Contrary to expectations, performance using a screen-based editor was again strongly correlated with Spatial Memory test scores. However, the correlation between performance and subjects' age was significantly reduced. Overall, subjects were able to perform the same text editing exercises almost twice as fast using the screen editor compared to subjects in previous experiments using the line editor. These results are discussed in terms of the different cognitive demands placed on users by line and screen text editors.