ppxscal/embedding_network huggingface dataset:
PHILAN: A LAN Providing a Reliable Message Service for Distributed Processing
Authors: J. L. W. Kessels
Venue: IEEE Transactions on Software Engineering (1988)

A local area network (LAN) design based on a ring topology is presented which can support both packet-switched and circuit-switched traffic. The packet-switching service is reliable in that the LAN controllers deal with all protocol problems, i.e., medium arbitrations as well as flow and error control. The service can meet real-time constraints, since the performance is stable under high load conditions and the arbitration delays are bounded. Moreover, the processing speed of the LAN controller is independent of the transmission speed, and the speed requirements are such that they can be met by a microprocessor (no need for dedicated hardware to process the information on the fly). Before the design of PHILAN is presented, an analysis is given of the protocol problems that have to be dealt with when establishing a reliable packet-switching service on a LAN.
Unsupervised Segmentation of Textured Images by Edge Detection in Multidimensional Feature
Authors: A. Khotanzad, J.-Y. Chen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

An algorithm for unsupervised texture segmentation is developed that is based on detecting changes in textural characteristics of small local regions. Six features derived from two, two-dimensional, noncausal random field models are used to represent texture. These features contain information about gray-level-value variations in the eight principal directions. An algorithm for automatic selection of the size of the observation windows over which textural activity and change are measured has been developed. Effects of changes in individual features are considered simultaneously by constructing a one-dimensional measure of textural change from them. Edges in this measure correspond to the sought-after textural edges. Experiments results with images containing regions of natural texture show that the algorithm performs very well.
A parallel indexed algorithm for information retrieval
Authors: C. Stanfill, R. Thau, D. Waltz
Venue: ACM SIGIR Forum (1989)

In this paper we present a parallel document ranking algorithm suitable for use on databases of 1-1000 GB, resident on primary or secondary storage. The algorithm is based on inverted indexes, and has two advantages over a previously published parallel algorithm for retrieval based on signature files. First, it permits the employment of ranking strategies which cannot be easily implemented using signature files, specifically methods which depend on document-term weighting. Second, it permits the interactive searching of databases resident on secondary storage. The algorithm is evaluated via a mixture of analytic and simulation techniques, with a particular focus on how cost-effectiveness and efficiency change as the size of the database, number of processors, and cost of memory are altered. In particular, we find that if the ratio of the number of processors and/or disks to the size of the database is held constant, then the cost-effectiveness of the resulting system remains constant. Furthermore, for a given size of database, there is a number of processors which optimizes cost-effectiveness. Estimated response times are also presented. Using these methods, it appears that cost-effective interactive access to databases in the 100-1000 GB range can be achieved using current technology.
Computer graphics tools for the study of minimal surfaces
Authors: M. J. Callahan, D. Hoffman
Venue: Communications of the ACM (1988)

Recent research indicates machine computation and mathematical theory have proceeded hand in hand and have proved to be of great benefit to one another.
IC testing using optical beam induced currents generated by a laser scan microscope
Authors: E. Ziegler, H. P. Feuerbaum
Venue: Microelectronic Engineering (1988)

One of the applications of the Laser Scan Microscope is in the analysis of failures in complex integrated circuits using optical beam induced currents. This paper discusses the localization of soft errors, of weak points using the marginal test, of mechanical and electrical defects under the metallization of devices, and the localization of destroyed cells in memory chips.
Software process modeling: a behavioral approach
Authors: L. G. Williams
Venue: Proceedings of the 10th international conference on Software engineering (1988)

Recently, the software engineering community has focused its attention on the process of software creation and evolution as well as the products of that process. Much of this attention has concentrated on modeling the software process. Software process models are seen as important vehicles for understanding and reasoning about software creation and evolution activities. Software process models may also provide a basis for structuring automated software environments. Despite this attention and the advantages to be gained through the use of software process models, however, no wholly satisfactory model of the software process has yet emerged. This paper presents an approach to software process modeling which is based on behavioral descriptions of software development activities. The use of behavioral descriptions makes it possible to describe the software process at any desired level of abstraction and, therefore, assists in accommodating aspects of the process which are poorly understood. This approach also provides the ability to reason about the software process and is sufficiently rigorous to provide a basis for structuring automated software environments. An overview of the model is presented, followed by a formal definition. Examples are given to illustrate the application of the model to existing software processes and software methods. Finally, the implications of the model for automated software environments are discussed.
Linda in context
Authors: Nicholas Carriero, David Gelernter
Venue: Communications of the ACM (1989)

How can a system that differs sharply from all currently fashionable approaches score any kind of success? Here's how.
A Comparative Analysis of Regional Correlation, Dynamic Time Warping, and Skeletal Tree Matching for Signature Verification
Authors: M. Parizeau, R. Plamondon
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A report is presented on a comparative study of three different signal matching algorithms in the context of signature verification: regional correlation, dynamic time warping, and skeletal tree matching. The algorithm performances are compared in a single experimental protocol over the same database. Algorithm performance is analyzed in terms of verification error rates, execution time, and number and sensitivity of algorithm parameters. Three different script types (normal signatures, handwritten passwords, and initials) and three different signal representation spaces (position, velocity, and acceleration) are considered. Verification errors show that no algorithm consistently outperforms the others in all circumstances.
Stereo Ranging with Verging Cameras
Authors: E. Krotkov, K. Henriksen, R. Kories
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A method of computing absolute range from stereo disparities by using verging cameras is presented. The approach differs from others by concentrating, through both analysis and experiment, on the effects caused by convergence, rather than on the general camera calibration problem. To compute stereo disparities, linear image features are extracted and matched using a hypothesize-and-verify method. To compute range, the relationship between object distance, vergence angle, and disparity is derived. Experimental results show the precision of the range computation, excluding mistaken matches, to be approximately 5% for object distances up to three meters and a baseline distance of 13 cm. Including mistaken matches results in performance that is an order of magnitude worse, leading the authors to suggest methods to identify and model them.
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
Authors: Shojiro Sakata
Venue: Journal of Symbolic Computation (1988)

We present an algorithm for finding a minimal set of two-dimensional linear recurring relations capable of generating a prescribed finite two-dimensional array. This is a two-dimensional extension of the Berlekamp-Massey algorithm for synthesizing a shortest linear feedback shift-register capable of generating a given finite sequence. The complexity of computation for an array of size n is 0(n^2) under some reasonable assumptions. Furthermore, we make clear some relationship between our algorithm and Grobner bases of bivariate polynomial ideals, where polynomials correspond one-to-one to linear recurring relations.
Particle transport and image synthesis
Authors: James Arvo, David Kirk
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

The rendering equation is similar to the linear Boltzmann equation which has been widely studied in physics and nuclear engineering. Consequently, many of the powerful techniques which have been developed in these fields can be applied to problems in image synthesis. In this paper we adapt several statistical techniques commonly used in neutron transport to stochastic ray tracing and, more generally, to Monte Carlo solution of the rendering equation. First, we describe a technique known as Russian roulette which can be used to terminate the recursive tracing of rays without introducing statistical bias. We also examine the practice of creating ray trees in classical ray tracing in the light of a well-known technique in particle transport known as splitting. We show that neither ray trees nor paths as described in [10] constitute an optimal sampling plan in themselves and that a hybrid may be more efficient.
Distributed programs and subroutines for multiprocessors
Authors: E. P. DeBenedictis
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

There seems to be a consensus that multiprocessors are harder to program than conventional computers. To change this consensus, this paper develops distributed analogies to important and well known programming techniques found in conventional computers &mdash; namely modular programming and variable scoping. This paper shows that with these techniques, truly parallel versions of some languages are possible &mdash; such as Unix (TM) shell programming. High level parallel languages could also be constructed where the program planning activities would be the same as conventional languages, although lower-level methods would be different. Within the scope of the issues addressed, this can make multiprocessors as easy to program as conventional computers.
A generative approach to Universal Cross Assembler design
Authors: P. P. K. Chiu, S. T. K. Fu
Venue: ACM SIGPLAN Notices (1990)

A new approach to Universal Cross Assembler design is proposed. New assemblers can be generated easily from the assembly language syntax, instruction set, addressing modes, binary code pattern of the instructions, directives, and the output file format. There are no constraints on the syntax, addressing modes, and instruction code lengths. It achieves high generality, extendibility and portability by considering assemblers as high level language compilers, using high level language development tools, YACC and LEX on UNIX. Using this approach, two prototype assemblers, one for 8086 and one for 68000, have been implemented on both UNIX and MSDOS. Their performance and comparison with existing assemblers are discussed in the paper.
Tools for supporting cooperative work near and far: highlights from the CSCW conference
Authors: S. F. Ehrlich, T. Bikson, W. Mackay, J. C. Tang
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

The second conference on Computer Supported Cooperative Work has provided focus on use of computers for supporting workers that are at various levels of geographic dispersion. The participants in this panel reported case studies at that conference on group work (1) in face-to-face meetings, (2) in the same building, and (3) distributed across a number of sites. Each panelist therefore brings insight about the communication needs of their research subjects and both the value and limitations of particular technologies for supporting the communication that ties the members of the groups together as geographic distance varies.Each of the panelists will address the following two questions:What are the preferred types of communication (visual, written, spoken) for people working together at particular geographic distances?What are the benefits and shortcomings of available technologies (video, electronic-mail, telephone/voice mail) for supporting these types of communication?
An approach to synchronization for parallel computing
Authors: V. P. Krothapalli, P. Sadayappan
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

This paper proposes an approach to minimally constrained synchronization for the parallel execution of imperative programs in a shared-memory environment. Anti-dependencies and output-dependencies arising from array references within loops are completely removed, using run-time analysis if necessary. A parallel reference-pattern generation scheme based on one proposed in [13] is used in conjunction with dynamic allocation and binding of storage, to completely remove non-intrinsic data dependencies during execution.
Work at home for computer professionals: current attitudes and future prospects
Authors: Margrethe H. Olson
Venue: ACM Transactions on Information Systems (TOIS) (1989)

The subject of this paper is work performed in the home with computer and communications technology, also known as telecommuting. The article reports on two studies of work at home: a quasi-experimental field study of organizational telecommuting pilot programs, and an attitude survey comparing computer professionals who work at home to employees doing similar jobs in traditional office settings. The results of the field study demonstrated that working in the home had little impact on employee performance; however, supervisors were not comfortable with remote workers and preferred their employees to be on site. In the survey, work in the home was related to lower job satisfaction, lower organizational commitment, and higher role conflict. The survey also included computer professionals who worked at home in addition to the regular work day. The author suggests that performing additional unpaid work in the home after regular work hours may be an important trend that merits further investigation. The studies demonstrate that while computer and communications technology have the potential to relax constraints on information work in terms of space and time, in today's traditional work environments, corporate culture and management style limit acceptance of telecommuting as a substitute for office work.
An Approach to Experimental Evaluation of Real-Time Fault-Tolerant Distributed Computing Schemes
Authors: K. H. Kim
Venue: IEEE Transactions on Software Engineering (1989)

A test-based approach to the evaluation of fault-tolerant distributed-computing schemes is discussed. The approach is based on experimental incorporation of system structuring and design techniques into real-time distributed computing testbeds centered around tightly coupled microcomputer networks. The effectiveness of this approach has been experimentally confirmed. Primary advantages of the testbed-based approach include the relatively high accuracy of the data obtained on timing and logical complexity, as well as the relatively high degree of assurance that can be obtained on the practical effectiveness of the scheme evaluated. Various design issues encountered in the course of establishing the basic microcomputer network testbed facilities are discussed, along with their augmentation to support some experiments. The shortcomings of the testbeds that have been recognized are also discussed together with the desired extensions of the testbeds. Some of the desired extensions are beyond the state-of-the-art in microcomputer network implementation.
On analyzing events to estimate the possible speedup of parallel discrete event simulation
Authors: T. K. Som, B. A. Cota, R. G. Sargent
Venue: Proceedings of the 21st conference on Winter simulation (1989)

We describe in this paper a new event based approach for estimating the possible speed up in parallel discrete event simulation which is similar to Berry and Jefferson's method. This method calculates a critical path through a graph developed from a trace of a simulation and from constraints on the order of processing of event instances that ensure correctness of the simulation. Different ways of classifying event instances to determine required constraints are presented. A software system that uses this approach is described and examples are presented.
An EREW PRAM Algorithm for Image Component Labeling
Authors: R. Cypher, J. L. C. Sanz, L. Snyder
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

An important midlevel task for computer vision is addressed. The problem consists of labeling connected components in N/sup 1/2/*N/sup 2/2/ binary images. This task can be solved with parallel computers by using a simple and novel algorithm. The parallel computing model used is a synchronous fine-grained shared-memory model where only one processor can read from or write to the same memory location at a given time. This model is known as the exclusive-read exclusive-write parallel RAM (EREW PRAM). Using this model, the algorithm presented has O(log N) complexity. The algorithm can run on parallel machines other than the EREW PRAM. In particular, it offers an optimal image component labeling algorithm for mesh-connected computers.
Collapse of point vortex lattices
Authors: K. A. O'Neil
Venue: Physica D (1989)

CIM-OSA (Computer Integrated Manufacturing - Open Systems Architecture) is the result of a joint European initiative by nineteen industrial and academic organizations to define an architecture for a CIM system. This architecture permits CIM users and vendors to evolve toward well-defined structures for CIM systems. Moreover, this architecture permits an integrated decision support system implementing simulation. We define integration criteria for this decision support system, and an architecture in response to these criteria. One of the features of this architecture is the ability to emulate the CIM control logic to perform "what-if" and "try-for-fit" analyses. We define a potential problem with simulation when emulating CIM control logic.
An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies
Authors: H. G. Badr, S. Podar
Venue: IEEE Transactions on Computers (1989)

A probabilistic routing policy, the Z/sup 2/ (zigzag) routing policy, is presented within the class of nonadaptive, shortest-path routing policies for regular mesh-connected topologies such as n-dimensional toroids and hypercubes. The focus of the research is routing in networks of computers in a distributed computing environment, where constituent subcomputers are organized in a mesh-connected topology and communication among individual computers takes places by some form of message exchange. The authors prove the optimality of this policy with respect to two criteria: (1) maximizing the probability of reaching the destination from a given source without delays at intermediate nodes; and (2) minimizing the expected lifetime of a message.
An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks
Authors: Vikram C. Karmarkar, Jon G. Kuhl
Venue: IEEE Transactions on Computers (1989)

Multiple-bus local networks (MBLNs) provide an architecturally simple solution to serve high-reliability high-capacity local area networks applications. Access mechanisms for MBLNs possessing stability and favorable delay characteristics are developed. A technique is proposed that uses a single explicit token to achieve demand-assignment multiple access (DAMA) to arbitrate access on all buses in the system. The performance of this algorithm in pure DAMA form and its hybrid, carrier-sense multiple access with collision detection (CSMA-CD), version are discussed. The unique features of the hybrid algorithm are that no backoff policy is needed for colliding messages and the token-passing operation is never suspended, unlike some existing hybrid DAMA approaches.
Change oriented versioning in a software engineering database
Authors: A. Lie, R. Conradi, T. M. Didriksen, E.-A. Karlsson
Venue: ACM SIGSOFT Software Engineering Notes (1989)

We present the change oriented model of versioning, which focuses strongly on functional changes in a software product and therefore can be seen as an alternative to the traditional, &ldquo;version oriented&rdquo; models. The change oriented model is used as a basis for the versioning in the EPOS software engineering database, which features an integrated transaction and versioning mechanism.
Voyeur: graphical views of parallel programs
Authors: David Socha, Mary L. Bailey, David Notkin
Venue: ACM SIGPLAN Notices (1989)

Voyeur is a prototype system that facilitates the construction of application-specific, visual views of parallel programs. These views range from textual views showing the contents of variables to graphical maps of the state of the computational domain of the program. These views have been instrumental in quickly detecting bugs that would have been difficult to detect otherwise.
A comparison of the artistic aspects of various industrial robots
Authors: Margo K. Apostolos
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Robot choreography has been developed to explore the aesthetic implications of robotic movement. The application of choreographic techniques to robot motion has evolved as a result of the implementation of the new technology. New materials and techniques have made changes possible in artistic forms. The widespread use of robots may significantly influence artistic trends. While pioneering in the field of robot choreography, I found that robot movement may be functionally efficient but not always aesthetically pleasing. Thus, my work has focused on the artistic design of robot motion. A method of programming industrial robots to move in a graceful and fluid fashion has been developed as a result of my research. The majority of this aesthetic exploration has been with Unimation robots (PUMA 260 and PUMA 560), although I have choreograhed compositions for other robotic systems; namely, the Spine, U.S. Robot, and the Robotics Reasearch Corporation K-2107. This paper will present a comparison of these robots from the artistic aspect of the design and movement. The following will be discussed: the aesthetic design of the manipulator the programming techniques used in choreography the types of movement sequences specific to each robot system the control of robot motion the safety aspects of the robots related to concert performances