ppxscal/embedding_network huggingface dataset:
Hardware sorter and its application to data base machine
Authors: Yasunori Dohi, Akira Suzuki, Noriyuki Matsui
Venue: ACM SIGARCH Computer Architecture News (1982)

The main contribution of this paper is the design of a hardware sorter. This sorter is configured as a balanced, fixed binary tree of node units; the configuration of the sorter is independent of the length of data to be sorted. Each node unit can be realized on a single LSI chip. The logic of the hardware sorter design is heavily influenced by a specific, compressed, representation of sorted data. Using this hardware sorter and a few auxiliary functions based on the sorted property, we demonstrate the design of a relational data base machine.
On the relative merits of two major methodologies for simulation model construction
Authors: Charles M. Shub
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Given a model of a discrete change system there are two major methodologies for developing a simulation program of the model. They are (A) describing the flow of typical units of traffic through the model, and (B) describing what occurs at those instants of time when the state of the system changes. This paper compares, without entering into the controversy of which language is best for modeling, the relative advantages and disadvantages of the two methodologies. The comparison is made at the modeling or source language level of detail and does not specifically adjudicate the relative merits of language package internals such as dynamic storage implementation, the notion of an events chain, be it current or future, or the notion of a timing routine except as necessary for comparisons. The paper is concerned with the relative advantages of the two methodologies in handling such problems as simultaneous occurrences, synchronization of traffic units, communication between traffic units, complex decision algorithms involving waiting line manipulation, the general notion of &ldquo;style&rdquo; in the code produced, the ease of gathering meaningful statistics, the level of knowledge required of the system internal structure, and the refinement of level of detail.
Computer science approval/accreditation (Panel Discussion)
Authors: Terry J. Frederick, William J. MacLeod, David R. Kniefel, Gordon E. Stokes
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

A formal proposal for the establishment of an approval mechanism is being developed for presentation to the ACM Executive Committee in February, 1982. Some preliminary components of this proposal are: &mdash;A year long study during which materials will be developed, trial visits conducted, and approval parameters identified; &mdash;A volunteer based structure within ACM which will grow to the final body responsible for approving programs; &mdash;Initial funding to be sought from outside agencies to initiate the approval mechanism which will eventually be self-supporting. These and related items will be discussed by the panel.
A data fusion approach to tumor delineation
Authors: R. Wasserman, R. Acharya, C. Sibata, K. H. Shin
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

An improved methodology is presented for the localization of tumors for radiation therapy treatment planning applications. The proposed approach focuses on the integration of MRI, CT, and PET imaging data towards the generation of a mathematically optimal tumor boundary. Fuzzy edges derived from CT and MRI are fused to form an integrated edge map which is employed in conjunction with a region based analysis of the PET scan to guide the evolution of a tumor segmenting model. The presented algorithm yields tumor contours which may be employed directly in the radiation therapy treatment planning process.
Using examples to describe categories
Authors: Susan T. Dumais, Thomas K. Landauer
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

The successful use of menu-based information retrieval systems depends critically on users understanding the category names and partitions used by system designers. Some of the problems in this endeavor are psychological and have to do with naming large and ill-defined categories so that users can understand their contents, and effectively partitioning large sets of objects. Systems of interest (like home information systems) often consist of new and frequently changing content in large and varied domains, and are particularly prone to these problems. We explored several ways in which one might name categories in one such domain (Yellow Page category headings) - category names, category names plus examples, and examples alone. We found that three examples alone were essentially as good a way to name these categories as either an expertly chosen name or a name plus examples. Examples provide a promising possibility both as a means of flexibly naming menu categories and as a methodological tool to study certain categorization problems.
Some cryptographic principles of authentication in electronic funds transfer systems
Authors: C. H. Meyer, S. M. Matyas
Venue: Proceedings of the seventh symposium on Data communications (1981)

One essential requirement of an Electronic Funds Transfer (EFT) system is that institutions must be able to join together in a common EFT network such that a member of one institution can initiate transactions at entry points in the domain of another institution. The use of such a network is defined as interchange. Cryptographic implementations are developed for such a network in such a way as to keep personal verification and message authentication processes at different institutions completely separate. This is accomplished through the combined use of user-remembered personal identification numbers (PINs), secret system keys, and intelligent secure (bank) cards on which are recorded secret personal cryptographic keys.
Speed-ups by changing the order in which sets are enumerated (Preliminary Version)
Authors: Paul R. Young
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

In a suitably general context, the following analogue of the Blum Speed-up Theorem is proven: There are some infinite sets which are so difficult to enumerate that, given any order for enumerating the set, there is some other order, and some one method of enumerating the set in this second order which is much faster than any method of enumerating the set in the first ordering. It may be possible to interpret this result as a statement about the relative merits of &ldquo;hardware&rdquo; vs. &ldquo;programming&rdquo; speed-ups. The proof itself is one of the first nontrivial applications of priority methods to questions of computational complexity. As such, it perhaps represents an advance in bringing the results and techniques of contemporary &ldquo;pure&rdquo; recursion theory to bear on questions of computational complexity. In this paper we shall prove, in a suitably general context, the following analogue of the Blum Speed-up Theorem, [B1]: There are some infinite sets which are so difficult to enumerate that, given any order for enumerating the set, there is some other order, and some one method of enumerating the set in this second order which is much faster than any method of enumerating the set in the first ordering.
Bounds on scheduling with limited resources
Authors: M. R. Garey, R. L. Grehem
Venue: ACM SIGOPS Operating Systems Review (1973)

A number of authors (of. [12],[6], [7],[3],[11],[4],[5],[9]) have recently been concerned with scheduling problems associated with a certain model of an abstract multiprocessing system (to be described in the next section) and, in particular, with bounds on the worst-case behavior of this system as a function of the way in which the inputs are allowed to vary. In this paper, we introduce an additional element of realism into the model by postulating the existence of a set of &ldquo;resources&rdquo; with the property that at no time may the system use more than some predetermined amount of each resource. With this extra constraint taken into consideration, we derive a number of bounds on the behavior of this augmented system. It will be seen that this investigation leads to several interesting results in graph theory and analysis.
Advanced topics in SLAM
Authors: A. Alan B. Pritsker
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

In 1979, the state-of-the-art in simulation languages was extended with the introduction of SLAM,TM the first language that provided three different modeling viewpoints in a single integrated framework. As experience with the use of SLAM increased, the need for enhanced capabilities within SLAM became apparent. For this reason, Pritsker Associates, Inc. has refined and expanded SLAM capabilities to produce SLAM IITM.
The user of simulation languages&mdash;the forgotten man
Authors: Julian Reitman
Venue: Proceedings of the 1967 22nd national conference (1967)

The purpose of higher order simulation language is to simplify the user's task by shifting to the computer some of the programming, especially the routine elements. The computer becomes a tool and, hopefully, a helpful assistant. First, let us review the conditions and environment of the user and then consider the implications of these elements on simulation languages.
A draft description of the group theory language Cayley
Authors: John J. Cannon
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper we outline a language belonging to the domain-specific class of algebraic programming languages. The problem domain we are concerned with is that of the theory of discrete groups and related structures. In 1971, Ne&uuml;buser in Aachen and Cannon in Sydney, commenced the development of a general purpose group theory system called GROUP, the great majority of which is coded in ANSI Standard FORTRAN. For a discussion of the group theory algorithms planned for the system see Cannon [1]. Two driver languages are planned, Galois, a language with explicit type declarations intended for batch processing, and Cayley, a language where types are determined at run time and hence suitable both for batch processing and interactive computing. An interpreter for Cayley has been implemented at Sydney for the CDC6000 and CYBER series machines. The interpreter is coded in ANSI Standard FORTRAN and experience indicates that the entire system (some 50,000 lines of FORTRAN at present) can be implemented on a new machine with less than 2 months programming effort.
STEM: A simulation model of space shuttle ground operations
Authors: James R. Wilson, David K. Vaughan, Edward Naylor, Robert G. Voss
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

To assess the feasibility of proposed launch schedules for operational flights of the Space Shuttle, a simulation model has been developed for Shuttle turnaround flow processing operations. Taking into account queueing delays due to the limited capacity of ground processing facilities, the model estimates flight starting dates which are required to meet a given launch schedule with a specified level of confidence. The results of an extensive sensitivity analysis based on the model indicate that the currently projected flight schedules are too optimistic and that the long-range ground turnaround time for an orbiter will substantially exceed the current goal of 28 days.
Ultrasound speckle reduction by directional median filtering
Authors: R. N. Czerwinski, D. L. Jones, W. D. , . Jr. O'Brien
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper presents a novel adaptation of the median filter to the problem of boundary-preserving speckle reduction in ultrasonic imaging. The technique involves applying a bank of oriented one-dimensional median filters to the image, and retaining at each point the largest value among all the filter bank outputs. The result is an operator which suppresses speckle noise while retaining the structure of the image, particularly the thin bright streaks, which tend to occur along boundaries between tissue layers. The technique is compared to a block median filter and an algorithm discussed by Loupas et al. (1989), and is shown to be far superior to the median filter, and noticeably better than the Loupas filter at enhancing thin lines.
A simulation of price effects on crude oil production from stripper wells in Texas
Authors: Robert R. Hill
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

A brief discussion of the stripper well industry and the economic and regulatory environments in which it operates are given. Certain very simple models of the stripper well industry are estimated and critically analyzed. A set of data requirements are identified that are considered necessary to adequately model the stripper well industry. A program is outlined to obtain the necessary information and to construct a simulation model of the industry.
A study of program locality and lifetime functions
Authors: Peter J. Denning, Kevin C. Kahn
Venue: ACM SIGOPS Operating Systems Review (1975)

A program model can be regarded as decomposible into two main parts. The macromodel captures the phase-transition behavior by specifying locality sets and their associated reference intervals (phases). The micromodel captures the reference patterns within phases. A semi-Markov model can be used at the macro level, while one of the simple early models (such as the random-reference or LRU stack) can be used at the micro level. This paper shows that, even in simplest form, this type of model is capable of reproducing known properties of empirical lifetime functions. A micromodel, alone without a macromodel, is incapable of doing so.
An extendable approach to computer-aided software requirements engineering
Authors: Thomas E. Bell, David C. Bixler, Margaret E. Dyer
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The development of system requirements has been recognized as one of the major problems in the process of developing data processing system software. We have developed a computer-aided system for maintaining and analyzing such requirements. This system includes the Requirements Statement Language (RSL), a flow-oriented language for the expression of software requirements, and the Requirements Engineering and Validation System (REVS), a software package which includes a translator for RSL, a data base for maintaining the description of system requirements, and a collection of tools to analyze the information in the data base. The system emphasizes a balance between the use of the creativity of human thought processes and the rigor and thoroughness of computer analysis. To maintain this balance, two key design principles&mdash;extensibility and disciplined thinking&mdash;were followed throughout the system. Both the language and the software are easily user-extended, but adequate locks are placed on extensions, and limitations are imposed on use, so that discipline is augmented rather than decreased.
A reliable object-oriented data repository for a distributed computer system
Authors: Liba Svobodova
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

The repository described in this paper is a component of a distributed data storage system for a network of many autonomous machines that might run diverse applications. The repository is a server machine that provides very large, very reliable long-term storage for both private and shared data objects. The repository can handle both very small and very large data objects, and it supports atomic update of groups of objects that might be distributed over several repositories. Each object is represented as a history of its states; in the actual implementation, an object is a list of immutable versions. The core of the repository is stable append-only storage called Version Storage (VS). VS contains the histories of all data objects in the repository as well as all information needed for crash recovery. To maintain the current versions of objects online, a copying scheme was adopted that resembles techniques of real-time garbage collection. VS can be implemented with optical disks.
SIGOPS (Paper Session)
Authors: Udo W. Pooch, David M. Burris, Patrice Burgevin, Jaques Leroudier, Errol H. Pollnow, H. F. Tibbals
Venue: Proceedings of the 1976 annual conference (1976)

This session treats the application of mathematical tools to the analysis of computer system behavior. Topics include the validation of some commonly used models of program behavior, a framework for simulation of congestion problems, an analysis of the dynamic clustering of page references, and a design for a data communications handler based on a queuing model.
APL editor features for productivity and quality
Authors: Timothy P. Holls
Venue: ACM SIGAPL APL Quote Quad (1984)

This paper describes features for a full screen APL program-and-data editor which provide capability above and beyond basic text editing functions. These features result from the integration of numerous separate utility operations into the editor. The combined processes enable the APL programmer to be more productive while at the same time generate a higher quality result. One such implementation, EDITFS, modelled on SPF, is the basis of this description.
Graphics standards status report (Panel Session)
Authors: P. tenHagen Janet Chin P. Bono J. Encarnacao, J. Michener
Venue: ACM SIGGRAPH Computer Graphics (1980)

Two status reports will be presented. The first report describes the activities of Working Group 2 (Computer Graphics) of the International Standards Organization Subcommittee on Programming Languages (ISO TC97/SC5/WG2). Actions taken in recent WG2 meetings in October, 1979, and June, 1980, will be covered. Significant proposals being examined by WG2 include GKS, a German-designed 2D graphics package derived from the SIGGRAPH GSPC Core System proposals, and Videotex, a Canadian-designed protocol text communication that includes geometrically coded picture images. The second status report describes the recent activities of the American National Standards Institute (ANSI) Technical Committee X3H3, Computer Graphics. This includes the committee status, international activities, key technical issues, and future plans.
Continuation-based multiprocessing
Authors: Mitchell Wand
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Any multiprocessing facility must include three features: elementary exclusion, data protection, and process saving. While elementary exclusion must rest on some hardware facility (e.g. a test-and-set instruction), the other two requirements are fulfilled by features already present in applicative languages. Data protection may be obtained through the use of procedures (closures or funargs),and process saving may be obtained through the use of the CATCH operator. The use of CATCH, in particular, allows an elegant treatment of process saving. We demonstrate these techniques by writing the kernel and some modules for a multiprocessing system. The kernel is very small. Many functions which one would normally expect to find inside the kernel are completely decentralized. We consider the implementation of other schedulers, interrupts, and the implications of these ideas for language design.
The illumination-invariant recognition of color texture
Authors: G. Healey, Lizhi Wang
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We represent texture in a color image using spatial correlation functions defined within and between sensor bands. This representation has been shown to be useful for surface recognition, but the structure of spatial correlation functions depends on the spectral properties of the scene illumination. Using a linear model for surface spectral reflectance with the same number of parameters as the number of classes of photoreceptors, we show that illumination changes correspond to linear transformations of a surface correlation matrix. From this relationship, we derive a distance function for comparing sets of spatial correlation functions that can be used for illumination-invariant recognition. This distance function can be computed efficiently from estimated correlation functions. We demonstrate using a large body of experiments that this distance function can be used for accurate surface recognition in the presence of large changes in illumination spectral distribution.
Relaxation labeling using Lagrange-Hopfield method
Authors: S. Z. Li
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Relaxation labeling (RL) is a class of parallel iterative numerical procedures which use contextual constraints to reduce ambiguities in image analysis. A novel RL algorithm is proposed. RL is posed as a constrained optimization problem and the solution is found by using the Lagrangian multiplier method and a technique used in the graded Hopfield neural network. In terms of the optimized objective value, the algorithm performs almost as well as simulated annealing, as shown by the experimental results. Also, the resulting algorithm is fully distributive and is suitable for analog implementation.
Path specification and path coherence
Authors: Kim L. Shelley, Donald P. Greenberg
Venue: ACM SIGGRAPH Computer Graphics (1982)

This paper presents an interactive method for specifying a path in space and time through a three-dimensional environment. A sequence is generated by showing the series of views along the path. The sequence is previewed on a vector scope, and after it is interactively refined, each frame is rendered on a raster device. The path is represented by a B-spline to provide smooth, continuous motion. The timing along the path is also defined by a B-spline so that changes in velocity are smooth. The use of &ldquo;path coherence&rdquo; is introduced. The utilization of the available data from the a priori temporal and spatial path definition holds great promise for frame to frame coherence. The path coherence can be used to reduce the number of polygons which need to be considered in a viewed environment. This reduction makes the previewing of complex environments appear less cluttered. Furthermore, the computational expense of the culling and sorting operations in the visible line/surface determination is reduced. One sample usage of this is a tree-structured partitioned environment where the priority ordering of the environment must be changed only when the path crosses a partition boundary.
A near optimal data structure for a type of range query problem
Authors: Michael L. Fredman
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Let G denote the set of elements of a commutative group whose addition operations is denoted by +, let N be a positive integer, and let A(1) ,..., A(N) denote an array with values in G. We will be concerned with designing data structures for representing the array A, which facilitate efficient implementation of the following two on-line tasks: (1) Update(j,x); replace A(j) by A(j) +x. (j and x are inputs, 1&le;j&le;N and x&egr;G) (2) Retrieve(j); returns the value of A(1) +...+ A(j). (j is an input, 1&le;j&le;N) As a motivating example, let G be the group of integers with + denoting the usual addition operation. Imagine a standardized examination given to large numbers of individuals over an indefinite period of time. Assume that each examinee will attain an integer score in the interval [1,N]. If an individual gets j points, this fact is recorded by executing Update(j,1). so that A(j) represents the number of individuals to date having scored j points. In order to compute the percentile currently associated with a particular score k, we need the cumulative sum provided by executing Retrieve(k).