ppxscal/embedding_network huggingface dataset:
Low-level Interfaces for High-level Parallel I/O
Authors: Nils Nieuwejaar, David Kotz
Venue:  (1995)

As the I/O needs of parallel scientific applications increase, file systems for multiprocessors are being designed to provide applications with parallel access to multiple disks. Many parallel file systems present applications with a conventional Unix-like interface that allows the application to access multiple disks transparently. By tracing all the activity of a parallel file system in a production, scientific computing environment, we show that many applications exhibit highly regular, but non-consecutive I/O access patterns. Since the conventional interface does not provide an efficient method of describing these patterns, we present three extensions to the interface that support strided, nested-strided, and nested-batched I/O requests. We show how these extensions can be used to express common access patterns.
Beyond Objects: A Software Design Paradigm Based on Process Control
Authors: Mary Shaw
Venue:  (1994)

A standard demonstration problem in object-oriented programming is the design of an automobile cruise control. This design exercise demonstrates object-oriented techniques well, but it does not ask whether the object- oriented paradigm is the best one for the task. Here we examine the alternative view that cruise control is essentially a control problem. We present a new software organization paradigm motivated by process control loops. The control view leads us to an architecture that is dominated by analysis of a classical feedback loop rather than by the identification of discrete stateful components to treat as objects. The change in architectural model calls attention to important questions about the cruise control task that are not addressed in an object-oriented design.
Bisimilarity in term graph rewriting
Authors: Zena M. Ariola, Jan W Klop, Detlef Plump
Venue:  (1998)

We present a survey of confluence properties of (acyclic) term graph rewriting. Results and counterexamples are given for different kinds of term graph rewriting: besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and with both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establish sufficient conditions for-and counterexamples to-confluence, confluence modulo bisimilarity and the Church-Rosser property modulo bisimilarity. Moreover, we address rewriting modulo bisimilarity, that is, rewriting of bisimilarity classes of term graphs.
Towards a Feature-Based Interactive System for Intelligent Font Design
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The desire to computerise and accurately represent contours of characters has seen an increased emphasis as more and more applications endeavour to seek benefits from the digital form. The latter lends itself to be exploited by fast processors and the resulting output to be displayed not just on electronic devices such as computer monitors and laser printers, but also on numerically controlled machines. These in practice are used to generate desired outlines on paper, metal, plastic or wood by means of cutting and engraving.The process of computerising font outlines, however, embodies the common problems of domain change approximations and truncations. In the case under consideration, the capturing phase is best undertaken by means of mathematical splines, where a series of spline segments are connected together to form a computer model of the original. The digitisation phase of representing the modelled image on a finite resolution output device tends to be the more dominant concern. This is not just because of the transformation process (going from semi-continuous to discrete form), but also because the resulting image needs to embrace the distinct features of a font, has to be aesthetically acceptable, and requires to be in a form which is legible.This paper attempts to address some of the concerns encountered by modern typographers. It reports on a development of an interactive system to facilitate a feature-based design approach. This uses geometric constraints to express spatial relationships within, and between, font features. These provide much of the instructions required by a rasterizer to ensure a satisfactory outcome. In addition, to aid flexibility and reusability, a font feature is not required to be constrained completely at the outset. Instead, the system prompts the user to confirm relations as and when necessary. Workings of the system and its respective architecture is illustrated through its handling of the Times Roman half-serif.The paper also looks at the way the system glues two (or more) font features together. The discussion, throughout, is levelled at providing a practical understanding of the subject matter.
Designing CSS Web Pages, 1 edition
Authors: Christopher Schmitt, Eric A. Meyer
Venue:  (2002)

:Go beyond the mechanics of CSS to how to think in the language of web design, and avoid the common pitfalls. Full of examples and deconstruction's to aid in understanding CSS and its application. The ability to use of Cascading Style Sheets (CSS) is fast becoming a vital tool in the web professional's toolkit. But understanding how to use CSS is not intuitiveit requires a new way of thinking when it comes to building web pages. This book encourages web designers to look at the perceived limitations of the web as a new challenge to their design skillswithout relying on HTML for presentation of pages. The overall theme is to instruct readers to build pages by using relative design techniques: understanding the relationship within the dynamic space of the web rather than the fixed-design "old-school" notions that have been in use for so long. The web site will include all of the files needed for the exercises and additional information of interest to web professionals including, but not limited to, recommended readings (suggested books, web sites and online articles), full-length interviews and a listing of CSS tools.
Solved problems, unsolved problems and non-problems in concurrency
Authors: Leslie Lamport
Venue: ACM SIGOPS Operating Systems Review (1985)

This is an edited transcript of a talk given at last year's conference. To preserve the flavor of the talk and the questions, I have done very little editing---mostly eliminating superfluous words and phrases, correcting especially atrocious grammar, and making the obvious changes needed when replacing slides by figures. The tape recorder was not functioning for the first few minutes, so I had to recreate the beginning of the talk.
IEC 1508: Functional Safety: Safety-Related Systems
Authors: J. Brazendale
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The paper gives an overview of draft international standard IEC 1508: Functional Safety: Safety-Related Systems. The objective of this standard is to provide a basis for safely automating process plant machinery, medical devices and other industrial equipment. The standard is concerned with preventing two basic types of unsafe incident. Firstly, failures of control systems that have the potential to trigger other events which in turn could lead to danger eg. fire, release of toxic materials, repeat stroke of machine, etc. Secondly, covert failures in protection systems that make them unavailable when needed for a safety action e.g. an emergency shutdown system. The paper describes how the standard treats random hardware faults, common cause faults and systematic faults (eg. design errors) in both hardware and software. Examples of incidents involving control system failure are also described.
Suggestions for a non-monotonic feature logic
Authors: William C. Rounds, Guo Zhang
Venue:  (1995)

We use Scott''s domain theory and methods from Reiter''s default logic to suggest some ways of modelling default constraints in feature logic. We show how default feature rules, derived from default constraints, can be used to give ways to augment strict feature structures with default information.
Evaluation of Early Failure Screening Methods
Authors: Terry Barrette, Vishwas Bhide, Kaushik De, Mike Stover, Emery Sugasawara
Venue: Proceedings of the 1996 IEEE International Workshop on IDDQ Testing (IDDQ '96) (1996)

Early Failure Rate screening techniques using automatic test equipment provide a cost effective alternative to manufacturing Burn-In. In this investigation a gate array based test vehicle containing 140,000 used gates was fabricated using early versions of a 0.5 micron 3.3 volt technology. Effectiveness of techniques was evaluated using one fabrication lot containing predominantly gate oxide defects and another one containing predominantly via and particle defects. The screen became more effective as the stress voltage was increased from 4.7 V to 5.0 V. The high voltage stress accelerated time dependent breakdown of weak gate oxide (TDDB). A screen employing voltage acceleration with IDDQ pattern followed by IDDQ test was more effective than the one using functional test vectors. The IDDQ test extended the fault coverage of a functional vector set. Stressing with the IDDQ vector set offered better control over the stress duration and uniformity. It also allowed a generic stress time specification which was independent of the size or function of an individual ASIC design.
Alma-0: An imperative language that supports declarative programming
Authors: Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, Andrea Schaerf
Venue:  (1997)

We describe here an implemented small programming language, called Alma, that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm. These additions encourage declarative programming and make it a more attractive vehicle for problems that involve search. We illustrate the use of Alma by presenting solutions to a number of classical problems, including alpha-beta search, STRIPS planning, knapsack, and 8 queens. These solutions are substantially simpler than their counterparts written in the imperative or in the logic programming style and can be used for different purposes without any modification. We also discuss here the implementation of Alma and an operational, executable, semantics of a large subset of the language.
Stable Finite Elements for Problems with Wild Coefficients
Authors: Stephen A. Vavasis
Venue:  (1993)

We consider solving an elliptic boundary value problem in the case that the coefficients vary by many orders of magnitude over the domain. A linear finite element method is used. It is shown that the standard method for solving the resulting linear equations in finite-precision arithmetic can give an arbitrarily inaccurate answer because of ill-conditioning in the stiffness matrix. A new method for solving the linear equations is proposed. This method is based on a "mixed formulation" and gives a numerically accurate answer independent of the variation in the coefficients. The numerical error in the soution of the linear system for the new method is shown to depend on the aspect ratio of the triangulation.
A Constructive Theory of Recursive Functions
Authors: Robert L. Constable
Venue:  (1973)

NO SUPPLIED
Efficient Algorithms for Optimal Video Transmission
Authors: Dexter Kozen, Yaron Minsky, Brian Smith
Venue:  (1995)

This paper addresses the problem of sending an encoded video stream over a channel of limited bandwidth. When there is insufficient bandwidth available, some data must be dropped. For many video encodings, some data are more important than others, leading to a natural prioritization of the data. In this paper we give fast algorithms to determine a prioritization which optimizes the visual quality of the received data. By ``optimized visual quality,'''' we mean that the expected maximum interval of unplayable frames is minimized. Our results are obtained in a model of encoded video data that is applicable to many encoding technologies. The highlight of the model is an interesting relationship between the play order and dependence order of frames. The property allows fast determination of optimal send orders by dynamic programming and is satisfied by all MPEG sequences.
Experiences Developing and Maintaining Software in a Multi-Platform Environment
Authors: T. Troy Pearse, Paul W. Oman
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The computer market demands that companies develop families of software products that can be scaled to meet the functional and performance needs of the personal and business computer markets. To support a family of LaserJet printer products, Hewlett-Packard defined the multi-platform parallel development model for software development. This model allows HP to simultaneously develop a family of LaserJet printers that have different features and run on different processors, while shortening the development . In this paper we discuss our experiences using a technique called conditional compilation, within the multi-platform parallel development model, to create portable, scaleable software systems. We describe and share a new tool that was developed to help understand code containing conditional compilation. Examples of using the tool on industrial source code, and lessons learned while managing conditional compilation complexity, are provided.
Detecting interleaving
Authors: S. Rugaber, K. Stirewalt, L. M. Wills
Venue: Proceedings of the International Conference on Software Maintenance (1995)

The various goals and requirements of a system are realized in software as fragments of code that are typically "interleaved" in that they may be woven together in the same contiguous textual area of code. The fragments of code are often delocalized and overlap rather than being composed in a simple linear sequence. Interleaving severely complicates software comprehension and maintenance. To address this problem, we are developing analysis tools, based on the Software Refinery. This paper describes our experiences in detecting interleaving in a corpus of mathematical software written in Fortran from the Jet Propulsion Laboratory. In particular, it discusses how feasible it is to detect interleaving of various types and the ability of existing tools to assist these types of detection.
The fairness of DQDB networks with slot reuse
Authors: G. B. Brewster, M. K. Vernon
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The paper analyzes the fairness characteristics of two previously proposed slot reuse protocols for DQDB networks. In particular, the slot reuse protocol proposed for the IEEE 802.6e standard [Hassanein et al., 1994] results in unfair steady state bandwidth allocations for some overloaded DQDB networks and can cause unbounded access delays under some stable workloads. In contrast, a previously proposed simple counter protocol results in bandwidth allocations in overload that are shown to be at least weakly fair for all workloads and optimally fair for many important workloads. This simple protocol also guarantees bounded access delays for any stable workload. A new modified counter protocol is proposed that has superior fairness characteristics to either of the previous protocols.
Reconfigurable Context-Sensitive Middleware for ADS Applications in Mobile Ad Hoc Network Environments
Authors: Stephen S. Yau, Fariaz Karim
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The emergence of inexpensive and low-power wireless communication hardware and various handheld, wearable, and embedded computing technologies is making computing and communication devices more mobile and ubiquitous. Due to the mobility and high-density of network-enabled devices, short range mobile ad hoc networks (MANET) are instantaneously and autonomously formed to facilitate exchange of information. In MANET, interactions among the devices are driven by constantly changing contextual and environmental conditions, rather than by the applications resident on the devices. This trend makes Autonomous Decentralized Systems (ADS) a desirable architecture for facilitating ad hoc communication among mobile devices. In this paper, Reconfigurable Context-Sensitive Middleware (RCSM) is presented to facilitate ADS applications in MANET.
Agent Migration Issues in CORBA Platforms
Authors: Carlos Arias Mendez, Manuel de Jesus Mendes
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

This paper presents a discussion about what kind of problems can arise when a platform, that provides an agent transport service, is built using CORBA technology and current CORBA services. Initially, issues related to agent transport will be presented. Then, aspects of the CORBA Life Cycle Service, related to object mobility, will be described. Finally, we introduce our proposal to build an Agent Transport Service based on CORBA platform.
The Structure of SNOBOL4
Authors: Peter Wegner
Venue:  (1968)

The SNOBOL4 programming language was developed by Griswold, Poage and Polonski (1). It combines facilities available in problem oriented languages with string manipulation facilities, pattern matching facilities and facilities for compilation during execution. The present description attempts to accomplish three objectives. It is an introduction to SNOBOL4 for the programmer with previous programming experience in some programming language but not necessarily previous experience with SNOBOL3. It is intended also to provide dynamic insights into the mechanisms for statement execution, and to describe source language structures in terms of the information structures to which they give rise during execution. It is felt that dynaamic insights into the way in which source statements are executed help not only the system programmer but also the average user. This description is based on reference 1 and on two very worthwhile days of discussion with the authors of SNOBOL4 at Holmdel. The author is indebted also to John Kelly for fruitful discussion of aspects of SNOBOL4 and for proofreading the manuscript.
Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product
Authors: A. Cortesi, B. L Charlier, P. Van Hentenryck
Venue:  (1993)

Abstract interpretation is a systematic methodology to design static program analysis which has been studied extensively in the logic programming community. With the emergence of efficient generic abstract interpretation algorithms for logic programming, the main burden in building an analysis is the abstract domain which gives a safe approximation of the concrete domain of computation. However, accurate abstract domains for logic programming are often complex and complicated. The purpose of this paper is to propose conceptual and software support for the design of abstract domains. It contains two main contributions: a generic pattern domain and the notion of open product of domains. {\em The generic pattern domain} {\tt Pat($\Re$)} automatically upgrades a domain $\Re$ (e.g. {\tt Prop}), with structural information yielding a more accurate domain (e.g. {\tt Pat(Prop)\/}) while abstracting away structural information from the designer. The {\em open product} is a new way of combining abstract domains allowing each combined domain to benefit from information from the other components through the notions of queries and open operations. The open product is general-purpose and can be used for other programming paradigms as well. The two contributions are orthogonal and can be combined in various ways to obtain sophisticated domains while imposing minimal requirements on the designer. Both contributions are characterized theoretically and experimentally and were used to design very complex abstract domains such as {\tt OPAT(OProp$\otimes$OMode$\otimes$OPS)} which would be very difficult to design otherwise. On this last domain, designers need only contribute about 20\ (about 3,400 lines) of the complete system (about 17,700 lines).
Hand Tracking for Interactive Pattern-Based Augmented Reality
Authors: Shahzad Malik, Chris McDonald, Gerhard Roth
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Pattern-based augmented reality systems are considered the most promising approach for accurately registering virtual objects with real-time video feeds. The problem with existing solutions is the lack of robustness to partial occlusions of the pattern, which is important when attempting natural interactions with the virtual objects.This paper describes a fast and accurate vision-based pattern tracking system that allows for autocalibrated 3D augmentations of virtual objects onto known planar patterns. The tracking system is shown to be robust to changes in pattern scale, orientation, and most importantly partial occlusions. A method to detect a hand over top of the pattern is then described, along with a method to render the hand on top of the virtual objects.
Analytical Models for CSP Problems
Authors: Sergey A. Butenkov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

A large number of problems in Artificial Intelligence can be viewed as special cases of constraint-satisfaction problem. Some examples are machine vision, optimization, scheduling and etc. A number of different approaches have been developed for solving these problems.Most powerful of them is model-based nonprocedural approach for Generalized Computational Models. In this paper similar approaches are proposed for the geometrical problems and for the largest domain of problems, that can be interpreted as geometrical. The concept of Generalized Geometrical Models are proposed and used for the data analysis, optimal controletc.
Scheduling Algorithms for Efficient Gather Operations in Distributed Heterogeneous Systems
Authors: Jun-ichi Hatta, Susumu Shibusawa
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Advances in networks and the availability of low-cost PCs and workstations have resulted in PC/workstation clusters being used as a computer environment that replaces parallel computers. These clusters recently comprise different kinds of nodes and are connected over different kinds of networks, such as Ethernet and Myrinet. They are called distributed heterogeneous systems, and efficient collective communication operations for them have been studied. In this paper, we propose heuristic scheduling algorithms for efficient gather operations in distributed heterogeneous systems, and we present the results of simulations evaluating their performance. These results show that gather operations scheduled by these algorithms are more efficient than sequential gather operations in these systems. They also show that, the efficiency of gather operations scheduled by the algorithms depends on the ratio of the cost that depends on message size in point-to-point communication to the cost that does not depend on message size in point-to-point communication.