ppxscal/embedding_network huggingface dataset:
TEXAC/PICTOL: A Texture Analysis Computer and its special purpose language
Authors: Robert S. Ledley, Yeshwant G. Kulkarni, Chan M. Park, Menfai R. Shiu, Louis S. Rotolo
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Computer-assisted pattern recognition holds much promise for important applications in clinical medicine. In many instances successful automatic pattern recognition requires an analysis of the texture of a picture by a conventional digital computer, but this procedure involves a type of computing that is presently too time-consuming and expensive for practical application. In response to this situation, we have designed and developed an auxiliary computer called TEXAC (TEXture Analysis Computer). TEXAC can perform most whole picture operations at a rapid television rate of 1/30th of a second, and display the results continuously on color and black and white video monitors. Here we present the architecture of the TEXAC, both the hardware and software systems, and discuss potential biomedical applications and several interesting whole picture operations accomplished by the new computer.
On the automated generation of program test data (Abstract only)
Authors: C. V. Ramamoorthy, S. F. Ho, W. T. Chen
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Software validation through testing will continue to be a very important tool for ensuring correctness of large scale software systems. Automation of testing tools can greatly enhance their power and reduce testing cost. In this paper, techniques for automated test data generation are discussed. Given a program graph, a set of paths are identified to satisfy some given testing criteria. When a path or a program segment is specified, symbolic execution is used for generating input constraints which define a set of inputs for executing this path or segment. Problems encountered in symbolic execution are discussed. A new approach for resolving array reference ambiguities and a procedure for generating test inputs satisfying input constraints are proposed. Array references are recorded in a table during symbolic execution and ambiguities are resolved when test data are generated to evaluate the subscript expressions. The implementation of a test data generator for FORTRAN programs incorporating these techniques is also described.
DCT and wavelet based representations of arbitrarily shaped image segments
Authors: U. Y. Desai
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper describes two efficient algorithms for representing arbitrarily shaped objects. The first representation, called cosine filling, is a DCT-based approach for obtaining a compact description of objects, making it possible to achieve high compression. A wavelet-based approach is also proposed. This representation not only provides compact description, but also facilitates smooth extension, which can be useful in extrapolation and interpolation of objects.
Interaction with databases through procedural languages
Authors: L. Lichten, E. B. Fernández
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

After discussing requirements for an 'ideal' user interface for a database management system, two case studies are considered. One is a database for a graphics-oriented design application, and the second is a high security database system. Since the second case study's architecture incorporates many of the 'ideal' interface requirements, it is used as a paradigm for transforming the design of the other system so as to approach this idealized interface. The results of this recasting are then evaluated.
A data definition and mapping language for numerical data bases
Authors: Ola-Olu A. Daini, Peter Scheuermann
Venue: Proceedings of the ACM 1980 annual conference (1980)

Numerical data bases arise in many scientific applications to keep track of large sparse and dense matrices. Unlike the many matrix data storage techniques available for incore manipulation, very large matrices are currently limited to a few compact storage schemes on secondary devices, due to the complex underlying data management facilities. This paper proposes an approach for generalized numerical database management that would promote physical data independence by relieving users from the need for knowledge of the physical data organization on the secondary devices. Our approach is to describe each of the storage techniques for dense and sparse matrices by a physical schema, which encompasses the corresponding access path, the encoding to storage structures, and the file access method. A generalized facility for describing any kind of numerical database and its mapping to storage is provided via nonprocedural Stored-Data Description and Mapping Languages (SDDL and SDML). The languages are processed by a Generalized Syntax-Directed Translation Scheme (GSDTS) to automatically generate FORTRAN conversion programs for creating or translating numerical database from one compact storage scheme to another. The feasibility of the generalized approach with regard to our current implementation is also discussed.
BWQUE - Interactive program for computer performance evaluation
Authors: Ricardo F. Garzia
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

BWQUE is an interactive queueing modeling package for computer performance evaluation; similar packages are available on the market, but BWQUE have special features, e.g., more general channel configuration, class priorities to any device, etc. The program is written in APL and carries some FORTRAN subroutines. This combination has been selected to make a more efficient program. It is completely interactive and also allows the automatic execution of commands stored in TSO files. It allows the user to enter descriptions of several job classes which are independent of how busy the system is and calculates the queueing delays to get response times and throughputs for each class. The user can quickly see which classes and devices are causing the delays, make changes to simulate upgrading the system, heavier job loads, etc., and find out how these changes will effect performance.
Automatic programming and compilers I: STRETCH experiment in multiprogramming
Authors: E. S. McDonough
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

MULTIPROGRAMMING is a technique whereby several problem programs may be concurrently executed under control of a supervisory program. Trials run on the IBM STRETCH computer indicate that the gains from multiprogramming can be significant, ranging in these trials from 30 to 100 per cent. The type of multiprogramming that will be discussed is batch multiprogramming. It is assumed that an installation typically has a backlog of programs to be run, and that the objective is to dispose of the entire backlog in minimum time.
Communication requirements for a computing network for higher education
Authors: James C. Emery
Venue: Proceedings of the fifth symposium on Data communications (1977)

The Planning Council on Computing in Education and Research is developing a national network to facilitate the sharing of computing resources among colleges and universities in the United States. The low initial volume of traffic and the widespread dispersion of users and suppliers make it desirable to obtain communication services through a packet switching common carrier. Increases in volume and technological developments may eventually make it attractive to use dedicated leased circuits for certain high-volume portions of the traffic, but it is likely that primary reliance will continue to be placed on common carriers providing packet switching or dial-up services.
The sensitivity of queueing models simulation to time discretization
Authors: Hon-Shiang Lau, Ahmed Zaki
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The time continuum is often appoximated by discrete time units in the simulation and mathematical analysis of queueing systems, but little is known about the effects of this approximation on the final results. This study shows that the effects of time discreteness on some queueing behavior is surprisingly small, and useful implications of this finding are discussed.
Combining Classifiers Based on Minimization of a Bayes Error Rate
Authors: Hee-Joong Kang, Seong-Whan Lee
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In order to raise a class discrimination power by combining multiple classifiers, the upper bound of a Bayes error rate bounded by the conditional entropy of a class variable and decision variables should be minimized. Wang and Wong proposed a tree dependence approximation scheme of a high order probability distribution composed of those variables, based on minimizing the upper bound.In addition to that, this paper presents an extended approximation scheme dealing with higher order dependency. Multiple classifiers recognizing unconstrained handwritten numerals were combined by the proposed approximation scheme based on the minimization of the Bayes error rate, and the high recognition rates were obtained by them.
Optimal tree layout (Preliminary Version)
Authors: Michael J. Fischer, Michael S. Paterson
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We consider the problem of finding a minimal cost layout of a tree in Euclidian d-space. A tree is an acyclic undirected edge-weighted graph, and a layout is an assignment of a point in d-dimensional Euclidian space to each of the nodes of the tree. The &ldquo;length&rdquo; of an edge in the layout is the &ldquo;distance&rdquo; between its endpoints as measured by some norm. The cost of an edge is its length times its weight, and the cost of the whole layout is the sum of the costs of all the edges. We assume the positions of certain nodes are fixed in advance, and we wish to place the remaining nodes so as to minimize the cost of the layout.
Applications of a microprogrammed microprocessor
Authors: A. J. Nichols
Venue: Supplement to the conference record of the 7th annual workshop on Microprogramming (1974)

FOR MINIMUM SYSTEM COST, A MICROPROGRAMMED APPROACH IS OFTEN VERY ATTRACTIVE, THIS IS PARTICULARLY TRUE WHEN THE APPLICATION IS RESTRICTED TO MINIMUM MEMORY REQUIREMENTS, IN SUCH CASES IT BECOMES FEASIBLE TO COMBINE MICROPROCESSOR, CONTROL MEMORY, AND DATA STORAGE ON A SINGLE MOS/LSI CIRCUIT AND THUS ACHIEVE MINIMUM COST, THE MOST PREVALENT EXAMPLE OF SUCH SYSTEMS TODAY IS THE HAND-HELD CALCULATOR AND THE MICROPROGRAMMED LSI APPROACH PROVIDES THE IDEAL SOLUTION TO A DIFFICULT ENGINEERING TASK. THIS PRESENTATION WILL BRIEFLY SUMMARIZE THE ARCHITECTURE OF A SINGLE INTEGRATED CIRCUIT WHICH COMBINES A 6K BIT ROM, A 256 BIT RAM, CONTROL CIRCUITRY, AND I/O INTERFACES. THE CHIP EXECUTES 28 MICROINSTRUCTIONS WITH A TYPICAL EXECUTION TIME OF 15 MICROSECOND. THE DEVICE IS DESIGNED WITH EMPHASIS ON EFFICIENT REALIZATIONS OF VARIOUS CALCULATIONS. HOWEVER, IT CAN BE USED AS A SPECIALIZED CONTROLLER IN APPLICATIONS AS DIVERSE AS CREDIT VERIFICATION TERMINALS AND DIGITAL FM TUNERS.
Programming with idioms in APL
Authors: Alan J. Perlis, Spencer Rugaber
Venue: ACM SIGAPL APL Quote Quad (1979)

Idioms are programming language constructs characterized by frequency of occurrence, unity of purpose, ease of recognition, and composability of use. Due to APL's conciseness and functional orientation, the language contains a large vocabulary of idioms. This paper explores the phenomenon of idioms, discusses how they can be used in teaching programming and understanding programs, and includes numerous examples of their use in practical situations.
A Production Analysis Simulation System (PASS)
Authors: Donald F. Blumberg
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The Production Analysis Simulation System, PASS, is a computer-based simulation system designed to represent the key elements of electronics, electro-mechanical or mechanical assembly oriented manufacturing operations. PASS provides management with a precise mechanism: &ordm; To evaluate the efficiency and/or capacity of these operations &ordm; To generate estimates of the impact of a wide variety of strategic and tactical changes in the production system The PASS simulation produces a set of detailed measurements of each alternative manufacturing strategy and tactic. These measurements enable the manufacturing manager to assess the trade-offs between these alternatives. The following standard measurements are generated by PASS: &ordm; Finished goods and work-in-process inventory levels &ordm; Manpower utilization and costs &ordm; Stockout levels including - a record of the percentage of late deliveries for each assembly, subassembly, accessory, etc. - for all late orders, a distribution describing the number of days late. &ordm; A detailed record of the manufacturing and manpower planning process is also represented. In summary, PASS is a simulation system that provides answers to &ldquo;WHAT IF .... ?&rdquo; questions about alternative manufacturing operating strategies such as changes in product flow, cycle times, production to order versus production to inventory, etc. These answers are produced in the form of detailed, quantitative reports which provide top management with a precise dollars and cents, hours and minutes report of the impact of each alternative manufacturing strategy and tactic under evaluation.
Design application of a memory-coupled microprocessor network
Authors: P. W. Dandekar
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

In the present paper, design and applications of a memory coupled network of four 8080A microprocessors are discussed. The architecture fully exploits all the inherent capabilities of a network namely, flexibility, dynamic reconfiguration, redundancy for fault-tolerance, higher throughput due to parallelism and pipelining and most effective utilisation of expensive resources. A simple and novel hardware protocole completely eliminates the communications software and provides a fast access to shared resources to each processor in the network. The network is extremely versatile and finds application in vast number of completely divergent areas.
The workstation concept of GKS and the resulting conceptual differences to the GSPC core system
Authors: J. Encarnacao, G. Enderle, K. Kansy, G. Nees, E. G. Schlechtendahl, J. Weiss, P. Wißkirchen, W. Germany
Venue: ACM SIGGRAPH Computer Graphics (1980)

GKS has evolved from a long process of national /1,2,3,4/ and international /5,6/ discussion on standardization of graphical systems. One of the basic principles of the Graphical Kernel System GKS is the concept of workstations that are used to address a display terminal with several input devices. This is a basic conceptual difference to the GSPC core system /6/, which will be discussed in this paper. A workstation represents a collection of graphical devices that are operated in a coordinated fashion by an operator at a given site. The whole workstation is treated in GKS as one logical unit. GKS features two dimensional output to and input from single or multiple workstations. Besides basic line drawing primitives raster graphics primitives are supported. The coordinates are transformed in a two-stage transformation process where the first stage can be set for each primitive and the second can be set for each workstation. Furthermore the setting of a workstation specific pen and text table allows control of the appearance of all primitives on the corresponding workstation. A segment facility provides means for structuring a picture in subparts. Segments may be created and deleted, the segment attributes may be dynamically modified, and the segments may be transformed. They can be displayed simultaneously or alternatively on different workstations. A device independent segment storage serves for inserting segments into other segments.
On performance evaluation of multiprocessor systems for real-time simulation
Authors: C. K. Cho, E. K. Lin, C. L. Jen
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

Computer performance is an important factor in the success of simulation applications. In this study, the current trend of using multiprocessor configurations for large-scale military and industrial real-time simulation is recognized, and computer performance evaluation methods, performance degradation factors in multiprocessor real-time simulation environments, and performance evaluation models are discussed. Verification of three models with examples and the application of the models to selection of computer systems for real-time simulation are addressed.
Corporate modeling and planning politics at conrail
Authors: Roger H. Mehl
Venue: Proceedings of the 12th conference on Winter simulation (1980)

A careful analysis of the corporate planning process in a given company will generally provide valuable insight to any group charged with the responsibility of developing corporate planning models. The location of decision-making authority (herein referred to as the politics of corporate planning or corporate politics) is one of the most important factors to consider when developing a corporate planning model.
A combined force and cut algorithm for hierarchical VLSI layout
Authors: G. J. Wipfler, M. Wiesel, D. A. Mlynski
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper presents a new algorithm for the initial placement of hierarchical VLSI circuits. The components to be placed are orthogonal macrocells of variable shape and size. This algorithm combines the advantages of force directed placement and min-cut algorithm. It provides an initial placement which avoids overlapping between cells and includes an estimation of routting area. This algorithm is suitable for regular cell arrangements, too.
The use of abstract data types to simplify program modifications
Authors: Theodore A. Linden
Venue: ACM SIGMOD Record (1976)

If a program is structured using abstract data types as the basic unit of modularity, then that program is much easier to extend or modify. This thesis is illustrated by the staged development of a program to compute prime numbers based on the sieve of Eratosthenes. This paper includes an extensive introduction to the concept of abstract data types and can be used as a tutorial survey. It includes discussions on the use of abstract data types in connection with recent approaches to data abstractions, heirarchical structure, and program design. Abstract data types are an extension and modification of the traditional concept of data type. An abstract data type defines not only a data representation for objects of the type but also the set of operations that can be performed on objects of the type. Furthermore, the abstract data type can protect the data representation from direct access by other parts of the program.
Verification and optimization for LSI PCB layout
Authors: H. Nelson Brady, Robert J. Smith,  II
Venue: Proceedings of the 18th Design Automation Conference (1981)

Layout optimization involves interconnection wiring modifications, which improve aesthetic appearance, fabrication characteristics, routability, and reliability of routed boards/chips. Requirements and capabilities of a general purpose layout optimizer are presented, then organization and processing flow of the program are outlined. The functional decomposition and modular structure of this system are presented. Results achieved by using the verifier/optimizer on large printed circuit boards and gate arrays are given.
Content addressable memory processor
Authors: Niels Schumburg
Venue: Proceedings of the ACM annual conference (1973)

The design and capabilities of a unique content addressable memory processor (CAMP) system is described. It includes a PDP-11, a content addressable memory (CAM) unit (1024 words &times; 16 bits) with accompanying logic, and a controller which interfaces the two units. The associative properties were used to implement such functions as greater then, less then, maximum and minimum via special algorithms which were designed into the controller. To circumvent a dependency on CAM addresses, fields or tags can be used for data identification. They can also be logically manipulated so that the CAMP functions can be executed selectively by content. The UNIBUS of the PDP-11 enables expansion for mass storage devices which will be able to communicate directly with the CAMP. A system of diverse storage devices can thus be referenced quickly and efficiently through the associative and processing capabilities of the CAMP thus rendering the modified PDP-11 as a powerful associative processor.
Bayesian Graph Edit Distance
Authors: Richard Myers, Richard C. Wilson, Edwin R. Hancock
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes a novel framework for comparing and matching corrupted relational graphs. The normalized edit distance of Marzal and Vidal can used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate matches using MAP label updates. We compare this criterion with that recently reported by Wilson and Hancock.The use of edit distance offers an elegant alternative to the exhaustive compilation of label dictionaries. Moreover, the method is polynomial rather than exponential in its worst-case complexity. We support our approach with an experimental study on synthetic data, and illustrate its effectiveness on an uncalibrated stereo correspondence problem.
Enhancement of JPEG coded images by adaptive spatial filtering
Authors: A. Kundu
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The JPEG coder has proven to be extremely useful in coding image data. For low bit-rate image coding (0.75 bit or less per pixel), however, the block effect becomes very annoying. The edges also display 'wave-like' appearance. An enhancement algorithm is proposed to enhance the subjective quality of the reconstructed images. First, the pixels of the coded image are classified into three broad categories: (a) pixels belonging to quasi-constant regions where the pixel intensity values vary slowly, (b) pixels belonging to dominant-edge (DE) regions which are characterized by few sharp and dominant edges and (c) pixels belonging to textured regions which are characterized by many small edges and thin-line signals. An adaptive mixture of some well-known spatial filters which uses the pixel labeling information for its adaptation is used as the adaptive optimal spatial filter for image enhancement. Some experimental results are also provided to demonstrate the success of the proposed scheme.