ppxscal/embedding_network huggingface dataset:
An integrated simulation approach for design and analysis of timber harvesting sytems
Authors: S. U. Randhawa, E. D. Olsen
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The paper describes a simulation environment that involves both modeling and analysis capabilities. The system provides powerful model development capabilities that would allow the user to develop and modify representations of timber harvesting system. The user would specify the characteristics of the environment to be modeled, and the system, in conjunction with appropriate data bases, would configure the models or alternative scenarios that would accomplish the user's objectives. A network-based simulation model then simulates the models or scenarios resulting from the model specification phase. The focus of this research is to develop an Artificial Intelligence-Simulation environment; the modeler declares knowledge about the system; the computer then sets up the system to be simulated, executes the system, and analyzes the results.
Carry-Free Addition of Recoded Binary Signed-Digit Numbers
Authors: B. Parhami
Venue: IEEE Transactions on Computers (1988)

Signed-digital number representation systems have been defined for any radix r¿3 with digit values ranging over the set (- alpha ,...,-1,0,1,..., alpha ), where alpha is an arbitrary integer in the range r/2> alpha >r. Such number representation systems possess sufficient redundancy to allow for the annihilation of carry or borrow chains and hence result in fast, propagation-free addition and subtraction. The original definition of signed-digit arithmetic precludes the case of r=2 for which alpha cannot be selected in the proper range. Binary signed-digit numbers are known to allow limited-carry propagation with a somewhat more complex addition process. The author shows that a special 'recorded' representation of binary signed-digit numbers not only allows for carry-free addition and borrow-free subtraction but also offers other important advantages for the practical implementation of arithmetic functions. The recoding itself is totally parallel and can be performed in constant time, independent of operand lengths. It is also shown that binary signed-digit numbers compare favorably to other redundant schemes such as stored-carry and higher radix signed-digit representations.
The Mean Resequencing Delay for M/H/sub K// Infinity Systems
Authors: S. Chowdhury
Venue: IEEE Transactions on Software Engineering (1989)

The relationship between the mean resequencing delay and variations in packet transmission times is studied. Assuming a Poisson stream of packets, a K-stage hyperexponential transmission time distribution and an infinite number of equal capacity links connecting the source and destination nodes, the authors derive an expression for the mean resequencing delay. This result provides an upper bound on the mean resequencing delay for nodes connected by finitely many links. They observe that for the two-stage and three-stage hyperexponential distribution, the mean resequencing delay varies almost perfectly linearly with the squared coefficient of variation. An asymptotic bound analysis can explain this behavior.
An Experimental Investigation of Software Metrics and Their Relationship to Software Development Effort
Authors: Randy K. Lind, K. Vairavan
Venue: IEEE Transactions on Software Engineering (1989)

The results are reported of an experimental study of software metrics for a fairly large software system used in a real-time application. A number of issues are examined, including the mutual relationship between various software metrics and, more importantly, the relationship between metrics and the development effort. Some interesting connections are reported between metrics and the software development effort.
Computer networking for large computers in Universities
Authors: J. Matsukata
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

N-1 protocol was developed for construction of a computer network which connects universities in Japan. N-1 protocol has been adopted by Inter-University Computer Network and University Library Network. NACSIS has started the construction of Science Information Network which will provide an infrastructure for digital communication for universities in Japan. High speed digital lines has been leased from NTT for that purpose. A local area network was constructed at the Faculty of Engineering at the University of Tokyo. The network consists of an optical fiber backbone network and many IEEE802.3 10Mbps baseband networks connected to the backbone. Connection to large computers was one of the key issues in the planning of that network.
Organizational expectations: What the top expects of those in the middle
Authors: F. W. Connolly
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

As a manager in User Services there is a constant demand on your talents and time. Believe it or not, managers higher up in the organization know that you cannot do all of them. They may not tell you, but they know &mdash; they know because they're faced with the same dilemma. Several years ago there was a &ldquo;tongue-in-cheek&rdquo; book on management that proposed that a manager was similar to a monkey attempting to shinny up a flag pole. The higher up either goes, the more exposed there rear ends are. Your boss' future and success are dependent on all those who work for her/him. The conflicting demands of being a manager in computer services are a cause for stress and anxiety. If you can't do everything that is expected of you, what should you do? There are three simple rules that can make your job easier. The rules are: Thou shall not surprise thy boss Thou shalt not do anything your subordinates can do Thou shalt not subvert thy bosses' priorities
The theory and practice of first-class prompts
Authors: Mattias Felleisen
Venue: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1988)

An analysis of the &lgr;ugr;-C-calculus and its problematic relationship to operational equivalence leads to a new control facility: the prompt-application. With the introduction of prompt-applications, the control calculus becomes a traditional calculus all of whose equations imply operational equivalence. In addition, prompt-applications enhance the expressiveness and efficiency of the language. We illustrate the latter claim with examples from such distinct areas as systems programming and tree processing.
On the harmonic and monogenic decomposition of polynomials
Authors: F. Brackx, D. Constales, A. Ronveaux, H. Serras
Venue: Journal of Symbolic Computation (1989)

The decomposition of polynomials in terms of spherical harmonics is widely used in various branches of analysis. In this paper we describe a set of REDUCE procedures generating this decomposition and its more general, monogenic, counterpart in Clifford analysis. We then illustrate their use by inverting the Laplacian and the Dirac operator on both Euclidean and Minkowski spaces.
Computing the geodesic diameter of a 3-polytope
Authors: J. O'Rourke, C. Schevon
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

We present an &Ogr;(n14 log n) algorithm for computing the geodesic diameter of a 3-polytope of n vertices. The geodesic diameter is the greatest separation between two points on the surface, where distance is determined by the shortest (geodesic) path between two points. We assume a model of computation that permits finding roots of a one-variable polynomial of fixed degree in constant time. The key geometric result underlying the algorithm is that, although it may be that neither endpoint of the diameter is a vertex of the polytope, when this occurs, there must be at least five distinct equal-length paths between the diameter endpoints.
Views of software development environments
Authors: W. Stinson
Venue: ACM SIGSOFT Software Engineering Notes (1989)

This paper develops an abstract model of software development and then explores its implications for software development environments (SDEs). It explores the automation of engineering, i.e., what to automate, and the engineering of automation, i.e., how to automate. It explains the automation of engineering by deriving basic automation paradigms from the development model. It explains the engineering of automation in terms of principles which guide the architecture of an SDE.
Clustered multiattribute hash files
Authors: D. Rotem
Venue: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1989)

Access methods for multidimensional data have attracted much research interest in recent years. In general, the data structures proposed for this problem partition the database into a set of disk pages (buckets). Access to the buckets is provided by searching a directory of some type such as a tree directory or inverted index or by computation of a multiattribute hash function. Examples of the first approach are Multidimensional B-trees[Sch82], K-D-B trees[Rob81] (see also [Sam84] for a survey of these methods) whereas multiattribute hashing methods are described for example in [Rot74],[Aho79],[Riv76] and [Ram83]. In addition, there are also hybrid methods which combine hashing with a directory of some type [Ore84],[Nie84], [Fag79]. In all the work mentioned above, the performance is measured in terms of the number of disk accesses made to retrieve the answer without distinguishing whether these are sequential or random. We argue that performance measurements must consider this factor in order to be realistic, especially in the single user environment. Some evidence to support this claim is given in [Sal88, pg. 22] with the IBM 3380 disk drive as an example. For this type of disk, a comparison between accessing m blocks randomly and accessing a contiguous cluster of m blocks is made. The results show that for m = 10, the random access is slower by a factor of about 8 than the clustered one whereas for m = 100 it is slower by a factor of 25. Another motivation for this work are optical disks. In this case, there is a big advantage in clustering since the access mechanism on many of these drives is equipped with an adjustable mirror which allows slight deflections of the laser beam. This means that it may be possible to read a complete cluster from a sequence of adjacent tracks beneath the head with a single random seek [Chri88]. Our work is inspired by an interesting recent paper [Fal86] which proposes to organize the physical layout of a multiattribute hash file by encoding record signatures using gray code rather than simple binary code. In this way neighboring buckets contain records which differ on a single bit in their signatures. It is then proved that the records which form the answer to a partial match query will tend to be contained in a smaller number of clusters as compared with the binary arrangement. It is also shown that this idea is applicable to many other multiattribute hashing schemes with a small amount of overhead. In addition, it can improve access time to directories of grid type files, extendible hashing and file methods which employ the z-ordering [Ore84].
a common programming structure for Bryant-Chandy-Misra, time-warp, and sequential simulators
Authors: M. Abrams
Venue: Proceedings of the 21st conference on Winter simulation (1989)

CPS expresses event-driven, parallel simulation programs. Rather than being a programming language, CPS is a structure imposed on an existing language, C++. CPS programs contain sufficient information to be implemented as Bryant-Chandy-Misra, time-warp, or sequential simulations. CPS is independent of any problem domain. We describe the main concepts of CPS, illustrating them using the problem of logic circuit simulation. We identify what information a parallel simulation must contain that is not required for sequential simulation.
LIMITS-a system for UNIX resource administration
Authors: A. Bettison, F. Adcock, P. Chubb, A. Gollan, C. Maltby
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The UNIX operating system, despite its emergence as a standard for supercomputer systems, lacks effective support for multiuser resource administration. The design and implementation of a decentralised resource administration system uniformly realisable across the wide variety of UNIX dialects presents a number of problems. Among these problems are potential violations of the UNIX design philosophy, preservation of the user process environment and adherence to industry standards. A research project to design and develop a UNIX resource administration system built upon the &ldquo;Fair Share&rdquo; scheduler, Share, has been undertaken at Softway with the support of the Australian Government. This project has yielded a resource administration and control system called Limits and further research is being undertaken on its extension to networks supporting shared resources.
Performance Properties of Vertically Partitioned Object-Oriented Systems
Authors: Stephen P. Hufnagel, James C. Browne
Venue: IEEE Transactions on Software Engineering (1989)

A vertically partitioned structure for the design and implementation of object-oriented systems is proposed, and their performance is demonstrated. It is shown that the application-independent portion of the execution overheads in object-oriented systems can be less than the application-independent overheads in conventionally organized systems built on layered structures. Vertical partitioning implements objects through extended type managers. Two key design concepts result in performance improvement: object semantics can be used in the state management functions of an object type and atomicity is maintained at the type manager boundaries providing efficient recovery points. The performance evaluation is based on a case study of a simple but nontrivial distributed real-time system application.
The implementation of a coherent memory abstraction on a NUMA multiprocessor: experiences with platinum
Authors: A. Cox, R. Fowler
Venue: ACM SIGOPS Operating Systems Review (1989)

PLATINUM is an operating system kernel with a novel memory management system for Non-Uniform Memory Access (NUMA) multiprocessor architectures. This memory management system implements a coherent memory abstraction. Coherent memory is uniformly accessible from all processors in the system. When used by applications coded with appropriate programming styles it appears to be nearly as fast as local physical memory and it reduces memory contention. Coherent memory makes programming NUMA multiprocessors easier for the user while attaining a level of performance comparable with hand-tuned programs. This paper describes the design and implementation of the PLATINUM memory management system, emphasizing the coherent memory. We measure the cost of basic operations implementing the coherent memory. We also measure the performance of a set of application programs running on PLATINUM. Finally, we comment on the interaction between architecture and the coherent memory system. PLATINUM currently runs on the BBN Butterfly Plus Multiprocessor.
Laboratory for emulation and study of integrated and coordinated media communication
Authors: L. F. Ludwig, D. F. Dunn
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

In future telecommunications networks, understanding the issues of user-network control, Customer Premise Equipment (CPE) technologies, services and user applications is as important as the classical network problems of channel structure, switching, and transmission. This paper discusses a Bell Communications Research facility, the Integrated Media Architecture Laboratory (IMAL), designed to flexibly emulate a wide range of current and future network and CPE environments with a focus on multiple media communications. IMAL combines off-the-shelf technologies to create an easily clonable emulation environment for studying, planning, demonstrating, and checking the feasibility of integrated media communications. The IMAL project has assembled workstations which feature speech-synthesis/sampled-audio/telephony capabilities, local 1 MIP computation capacity, and a high-resolution color display integrating text/graphics/image/video under an expanded X Window display management system. (X Windows is an emerging windowing standard to provide high performance device-independent graphics.) The workstations may be augmented as needed by local image digitizers, video cameras, and color image printers producing paper and viewgraph hardcopies. Also, the workstations are interconnected with switches permitting access to one another as well as shared databases, temporary storage, intelligence, and information processing/conversion resources. Communications services are implemented under a distributed, real-time service primitive control scheme. This multiple-media service primitives scheme employs a threaded/dataflow-type architecture to support user-defined, network-defined, and vendor-defined services while including a wealth of flexible features for the study of network architecture, protocol, network management, and billing functions.
Protocol verification using reachability analysis: the state space explosion problem and relief strategies
Authors: F. J. Lin, P. M. Chu, M. T. Liu
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

Reachability analysis has proved to be one of the most effective methods in verifying correctness of communication protocols based on the state transition model. Consequently, many protocol verification tools have been built based on the method of reachability analysis. Nevertheless, it is also well known that state space explosion is the most severe limitation to the applicability of this method. Although researchers in the field have proposed various strategies to relieve this intricate problem when building the tools, a survey and evaluation of these strategies has not been done in the literature. In searching for an appropriate approach to tackling such a problem for a grammar-based validation tool, we have collected and evaluated these relief strategies, and have decided to develop our own from yet another but more systematic approach. The results of our research are now reported in this paper. Essentially, the paper is to serve two purposes: first, to give a survey and evaluation of existing relief strategies; second, to propose a new strategy, called PROVAT (PROtocol VAlidation Testing), which is inspired by the heuristic search techniques in Artificial Intelligence. Preliminary results of incorporating the PROVAT strategy into our validation tool are reviewed in the paper. These results show the empirical evidence of the effectiveness of the PROVAT strategy.
An application development platform
Authors: Morten Kromberg, Martin Gfeller
Venue: ACM SIGAPL APL Quote Quad (1990)

While APL was a highly productive system for personal computing and application development when it was introduced, it is lacking nowadays in the areas of programming-in-the-large and user interface construction. The design and implementation of a new Application Development Platform (ADP) is described. The ADP frees the programmer from user interface concerns, and frees the application from device specific code. The ADP ensures consistent user interfaces based on state-of-the-art window techniques. Together with the underlying APL language, a software repository (Logos) and a data handling facility (ViewPoint&reg;) the ADP is part of a full application environment. The paper describes the underlying principles of our ADP. We also present a small worked out example comparing a traditional toolbox with the ADP.
High-level debugging in parasight
Authors: Ziya Aral, Ilya Gertner
Venue: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging (1988)

Debugging parallel programs with time critical dependencies is difficult due to subtle race conditions that may cause deadlock, starvation, and other errors. These errors can be detected by multiple instrumentation points triggered by logical assertions. Although some advanced debuggers provide a programmer with the ability to define complex logical assertions, they are inadequate for debugging parallel programs due to the high overhead of monitoring these assertions. This paper describes the facilities for high-level debugging in Parasight&trade; a parallel programming environment. In Parasight, high-level debugging facilities are implemented as separate programs that are linked dynamically to a target program. The target program is controlled by attaching these debugging programs to light-weight instrumentation points that are dynamically inserted and deleted. Different facilities of arbitrary complexity may be created to support high-level debugging. Parasight has been implemented on Multimax&trade; a shared-memory multiprocessor. It has been used for debugging and profiling &ldquo;C&rdquo; programs.
The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection
Authors: Y.-C. Cheng, S.-Y. Lu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

For a given set of n tuples, the binary consistency checking scheme generates a subset wherein no two elements intersect. The application of this scheme is illustrated by two problems in seismic horizon detection; seismic skeletonization and loop tying. After a brief introduction to seismic interpretation, these two examples are used to demonstrate how to cast an application problem into the formulism of the scheme. A comparison of this scheme to the dynamic programming approach to string matching due to S.Y. Lu (1982) is included.