ppxscal/embedding_network huggingface dataset:
Situated Documentaries: Embedding Multimedia Presentations in the Real World
Authors: Tobias Höllerer, Steven Feiner, John Pavlik
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We describe an experimental wearable augmented reality system that enables users to experience hypermedia presentations that are integrated with the actual outdoor locations to which they are relevant. Our mobile prototype uses a tracked see-through head-worn display to overlay 3D graphics, imagery, and sound on top of the real world, and presents additional, coordinated material on a hand-held pen computer. We have used these facilities to create several situated documentaries that tell the stories of events that took place on our campus. We describe the software and hardware that underlie our prototype system and explain the user interface that we have developed for it.
Performance evaluation of Clos networks under bursty traffic
Authors: Da-Chiang Chang
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

In this paper, we develop an analytical model to estimate the performance of Clos networks with output buffers under bursty input traffic. The analytical model is solved at two levels. The first level submodel estimates the buffer length distribution. The second level submodel estimates the cell loss probability at the output buffer for all each given the buffer length distributions obtained from the first level submodel.
Reliability of Systems of Independently Developable End-User Assessable Logical (IDEAL) Programs
Authors: Farokh Bastani, I.-Ling Yen, Kim Sung, John Linn, Kashi Rao
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Computers are being used to automate critical services, including manufacturing systems, transportation, etc. For these critical applications, it is necessary to be able not only to achieve high quality but also to rigorously demonstrate that high quality has in fact been achieved.One approach that is used to facilitate prevention as well as detection of software faults is to decompose the requirements specification into more manageable portions.However, this does not necessarily enable the demonstration of high quality.This paper discusses a method of decomposing software into aspects that allows the system reliability to be inferred from the aspect reliabilities.Each aspect is independently developable, i.e., it can be designed and implemented independently of the other aspects in the system.In addition, each aspect is end-user assessable, i.e., it can be tested orverified by the end-user independently of any other aspect.We identify five classes of IDEAL (Independently Developable End-user Assessable Logical) aspects and, for each class, we present the conditions that must be satisfied in order to compute the system reliability from the aspect reliabilities.
Ontologies for Knowledge Representation in a Computer-Based Patient Record
Authors: Elisabeth Bayegan, Øystein Nytrø, Anders Grimsmo
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In contrast to existing patient-record systems, which merely offer static applications for storage and presentation, a helpful patient-record system is a problem-oriented, knowledge-based system, which provides clinicians with situation-dependent information. We propose a practical approach to extend the current data model with (1) means to recognize and interpret situations, (2) knowledge of how clinicians work and what information they need, and (3) means to rank information according to its relevance in a given care situation. Following the methodology of second-generation knowledge-based systems, that use ontologies to define fundamental concepts, their properties, and interrelationships within a particular domain, we present an ontology that supports three prerequisite features for a future helpful patient-record system: a family-care workflow process, a problem-oriented patient record, and means to identify relevant information to the care process and medical problems.
An experimental study of insider attacks for OSPF routing protocol
Authors: B. Vetter, F. Wang, S. F. Wu
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

It is critical to protect the network infrastructure (e.g., network routing and management protocols) against security intrusions, yet dealing with insider attacks are probably one of the most challenging research problems in network security. We study the security threats, especially internal/insider threats, for the standardized routing protocol OSPF. In OSPF, a group of routers collaborate, exchange routing information, and forward packets for each other. If one (and maybe more than one) router is evil or compromised, how can this router damage the whole network? In this paper, we analyze OSPF and identify its strengths and weakness under various insider attacks. Furthermore, to confirm our analysis, we have implemented and experimented one attack, the max sequence number attack, on our OSPF routing testbed. Our attack is very successful against two independently developed router products as it will block routing updates for 60 minutes by simply injecting one bad OSPF protocol data unit.
The Performance Analysis of a Quantum Brayton Refrigeration Cycle with an Ideal Bose Gas
Authors: Bihong Lin, Jincan Chen
Venue: Open Systems Information Dynamics (2003)

A Brayton refrigeration cycle using an ideal Bose gas as the working substance is simply referred to as a quantum Brayton refrigeration cycle, which consists of two constant-pressure and two adiabatic processes. The influence of quantum degeneracy on the performance of the cycle is investigated, based on the correction equation of state of an ideal Bose gas. The general expressions of the coefficient of performance, refrigeration load and work input of the cycle are calculated. The lowest temperature of the working substance and the minimum pressure ratio of the two constant-pressure processes for a quantum Brayton refrigeration cycle are determined. The variations of the relative refrigeration load with the temperature of the cooled space and the pressure of the low constant-pressure process are discussed for three special cases. Some curves related to the important performance parameters are given. The results obtained here are compared with those of a classical Brayton refrigeration cycle using an ideal gas as the working substance. Some significant conclusions are obtained.
Movement Problems for 2-Dimensional Linkages
Authors: John E. Hopcroft, Deborah A. Joseph, Sue H. Whitesides
Venue:  (1982)

NO SUPPLIED
A Direct Active Set Algorithm for Large Sparse Quadratic Programs with Simple Bounds
Authors: Thomas F. Coleman, Laurie Hulbert
Venue:  (1988)

We show how a direct active set method for solving definite and indefinite quadratic programs with simple bounds can be efficiently implemented for large sparse problems. All of the necessary factorizations can be carried out in a static data structure that is set up before the numeric computation begins. The space required for these factorizations is no larger than that required for a single sparse Cholesky factorization of a matrix with the same sparsity structure as the Hessian of the quadratic. We propose several improvements to this basic algorithm: a new way to find a search direction in the indefinite case that allows us to free more than one variable at a time and a new heuristic method for finding a starting point. These ideas are motivated by the two-norm trust region problem. Additionally, we also show how projection techniques can be used to add several constraints to the active set at each iteration. Our experimental results show that an algorithm with these improvements runs much faster than the basic algorithm for positive definite problems and finds local minima with lower function values for indefinite problems.
User Recovery and Reversal in Interactive Systems
Authors: James E. Archer,  Jr., Richard W. Conway, Fred B. Schneider
Venue:  (1981)

Interactive systems, such as editors and program development environments, should be explicitly support recovery facilities that permit a user to reverse the effects of past actions and to restore an object to a prior state. A model for interactive systems is presented that allows recovery to be defined precisely and user and system responsibilities to be delineated. Various implementation techniques for supporting recovery are described. Application of a general recovery facility to support reverse execution is discussed. A program development system (called COPE) with extensive recovery facilities, including reverse execution, is described. Keywords: recovery, reverse execution, undo, checkpoint, editor, programming environments.
A Mathematical Toolbox for the Software Architec
Authors: J. L. Fiadeiro, T. Maibaum
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

It is suggested that Category Theory provides the right level of mathematical abstraction to address languages for describing software architectures. Contrarily to most other formalisations of SA concepts, Category Theory does not promote any particular formalism for component and connector description but provides instead the very semantics of the concepts that are related to the gross modularisation of complex systems like "interconnection", "configuration", "instantiation" and "composition". Two examples, a category of programs for a parallel program design language and a category of temporal logic specifications, together with comparisons with other work, namely by Allen and Garlan, and Moriconi and Qian, are adduced to justify this claim.
Writing Programs that Construct Proofs
Authors: Robert L. Constable, Todd B. Knoblock, Joseph L. Bates
Venue:  (1984)

When we learn mathematics, we learn more than definitions and theorems. We learn techniques of proof. In this paper, we describe a particular way to express these techniques and incorporate them into formal theories and into computer systems used to build such theories. We illustrate the methods as they were applied in the $\lambda$-PRL system, essentially using the ML programming language from Edinburgh LCF [23] as the formalised metalanguage. We report our experience with such an approach emphasizing the ideas that go beyond the LCF work, such as transformation tactics, refinement tactics, and special purpose reasoners. We also show how the validity of tactics can be guaranteed. The introduction places the work in historical context and the conclusion briefly describes plans to carry the methods further. The majority of the paper presents the $\lambda$-PRL approach in detail.
Using a "Process Warehouse" Concept A Practical Method for Successful Technology Transfer
Authors: Tetsuto Nishiyama
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The issue of software development productivity with new technology has increasingly become an important topic within our corporation. However, with the increase in size and complexity of software, and the continuous demand for developers to deliver software within tight schedules, developers cannot readily afford to take the extra time needed to learn and incorporate new technologies into their development process.This paper introduces the concept of a "Process Warehouse" whose aim is to aid in the efficient introduction and transfer of a particular target technology into a software organization. A framework for the Process Warehouse and suggested methods for preparing technical information for the Process Warehouse are described.This concept has been used successfully to introduce Object-Oriented Technology (OOT) into projects and will be used as a base to create a similar Process Warehouse that concentrates on embedded real-time OOT issues in the near future.
Results of the IEEE Survey of Software Engineering Standards Users
Authors: S. Land
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This survey was initiated by the Software Engineering Standards Subcommittee (SESC) at a steering committee meeting held in conjunction with the Forum on Software Engineering Standards Issues. Individuals responsible for project process definition and documentation, for corporate process definition and documentation, and for compliance assessments bring different interpretations to the same software engineering standard. These users of software standards employ the standards in different ways. The Software Engineering Standards Users Survey is an attempt by SESC to take a market snapshot of software standards implementation and report the results to those responsible for IEEE standards creation and maintenance. This paper is a report of the survey results.
Energy Efficient Signaling in Deep Submicron CMOS Technology
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

In this paper we propose an efficient technique for energy savings in DSM technology. The core of this method is based on low-voltage signaling over long on-chip interconnect with repeaters insertion to tolerate DSM noise and to achieve an acceptable delay. We elaborate a heuristic algorithm, called VIJIM, for repeaters insertion. VIJIM algorithm has been implemented to design a robust inverter chain for on-chip signaling using 0:25µm, 2.5V,6metal layers CMOS process. An average of 70% of energy-saving has been achieved by reducing the supply voltage from 2.5V down to 1.5V. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A minimal stabilisation procedure for mixed finite element methods.
Authors: Franco Brezzi, Michel Fortin
Venue:  (2000)

Stabilisation methods are often used to circumvent the difficulties associated with the stability of mixed finite element methods. Stabilisation however also means an excessive amount of dissipation or the loss of nice conservation properties. It would thus be desirable to reduce these disadvantages to a minimum. We present a general framework, not restricted to mixed methods, that permits to introduce a minimal stabilising term and hence a minimal perturbation with respect to the original problem. To do so, we rely on the fact that some part of the problem is stable and should not be modified. Sections 2 and 3 present the method in an abstract framework. Section 4 and 5 present two classes of stabilisations for the inf-sup condition in mixed problems. We present many examples, most arising from the discretisation of flow problems. Section 6 presents examples in which the stabilising terms is introduced to cure coercivity problems.
Process selection in a hierarchical operating system
Authors: R. C. Varney
Venue: ACM SIGOPS Operating Systems Review (1972)

This paper presents a new model for use in scheduling processes for the sharing of a processor. The model may be used in various modes of operation, including multiprogramming, real time and time sharing. Because the model is applicable for various modes of operation and because it is significantly useful only within a well-defined system hierarchy, the context for discussion is Hansen's system for the RC 4000.3, 4, 5Only the preliminary work has been reported in this paper, but the author believes that the model is worth investigating further, and, therefore, research into its effects and properties will continue.
Hybrid Automata with Finite Mutual Simulations
Authors: Thomas A. Henzinger, Peter W. Kopke
Venue:  (1995)

Many decidability results for hybrid automata rely upon the finite region bisimulation of timed automata [AD94]. Rectangular automata do not have finite bisimulations [Hen95], yet have many decidable verification problems [PV94,HKPV95]. We prove that every two-dimensional rectangular automaton A with positive-slope variables has a finite mutual simulation relation, which is the intersection of the region bisimulations defined by the extremal slopes of the variables of A. While the mutual simulation is infinite for two-dimensional automata with one variable taking both positive and negative slopes, it forms a regular tesselation of the plane, and therefore can be encoded by one counter. As a corollary, we obtain the decidability of model checking linear temporal logic on these automata.
GMNF-DVMRP: A Modified Version of Distance Vector Multicast Routing Protocol
Authors: Y.-C. Lai, Y.-D. Lin, W.-C. Yu, Y.-T. Lin
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

In this paper, we make a survey of Distance Vector Multicast Routing Protocol (DVMRP) and find that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called "Group Membership Near First-DVMRP" (GMNF-DVMRP), to decrease the NC of the multicast tree formed by DVMRP. A simulation is implemented to compare our modified version and the original DVMRP. We find that our method save about 5-7 percent of NC of the multicast tree formed by DVMRP.
A New Class of Fuzzy Modifiers
Authors: Martine de Cock, Etienne E. Kerre
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, we introduce a new class of fuzzy modifiers based on fuzzy relations. We apply them in the framework of linguistic variables, which plays a key role in fuzzy control. More precisely, we will use the new class of fuzzy modifiers for the representation of weakening, intensifying and ordering {based linguistic modifiers. Furthermore, we will also show how these fuzzy modifiers can be applied in image processing.
Algebraic Modelling of an Ad Hoc Network for Mobile Computing
Authors: P. A. Patsouris
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

We develop an algebraic model of an ad hocnetwork [9] for mobile computing.The ad hocnetwork's structure and functionality is based (inour approach) on a pathset algebra.A pathset isthe set of all paths in the network having specificsource(s) and destination(s).The pathsets' setrefers to a multi-digraph that constitutes thephysical infrastructure of an ad hoc network.Theapplications, actions, and/or services (referredfurther under the general term services) areorganized as multi-agent systems.The formal model of every multi-agent system is based on amodal algebra.An additional function (or specialoperation) couples the two algebras specifyingthus the interface of their interoperability.Thisoperation is analogous to the scalar multiplicationof a vector space on a field. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Music Editor
Authors: Ed Grosz
Venue:  (1986)

This disk contains a simple music editor that creates resources that can be used directly by the Macintosh Sound Driver. The MFS formatted disk contains both the runnable program and the Lisa Object Pascal/MacApp Sources.
Applying Moore's Technology Adoption Life Cycle Model to Quality of EDA Software
Authors: Giora Ben-Yaacov, Edward P. Stone
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper describes a methodology for allocating priority levels and resources to quality activities during the development of EDA software projects. Geoffrey Moore's technology adoption life cycle model is used to provide a baseline understanding of what the market and the target users require at any point in time during the product life cycle. Applying this model, EDA software development teams can make choices and prioritize quality objectives which are based on the customer segment that they are targeting at any point in time during the product life cycle.
The Geometry of Projective Blending Surfaces
Authors: Christoph M. Hoffmann, John E. Hopcroft
Venue:  (1986)

Blending surfaces smoothly join two or more primary surfaces that otherwise would intersect in edges. We outline the potential method for deriving blending surfaces, and explain why the method needs to be considered in projective parameter space, concentrating on the case of blending quadrics. Let $W$ be the quadratic polynomial substituted for the homogenizing variable of parameter space. We show that a blending surface derived in projective parameter space is the projective image of a different blending surface derived in affine parameter space, provided that $W = U^{2}$ for some linear $U$. All blending surfaces may therefore be classified on basis of the projective classification of $W$.
Coping with Uncertainty in Map-Learning
Authors: Kenneth Basye, Thomas Dean, Scott J Vitter
Venue:  (1995)

In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refer to such a representation as a {\em map}, and the process of constructing a map from a set of measurements as {\em map learning}. In this paper, we develop a framework for describing map-learning problems in which the measurements taken by the robot are subject to known errors. We investigate approaches to learning maps under such conditions based on Valiant''s {\em probably approximately correct} learning model. We focus on the problem of coping with accumulated error in combining local measurements to make global inferences. In one approach, the effects of accumulated error are eliminated by the use of local sensing methods that never mislead but occasionally fail to produce an answer. In another approach, the effects of accumulated error are reduced to acceptable levels by repeated exploration of the area to be learned. We also suggest some insights into why certain existing techniques for map learning perform as well as they do. The learning problems explored in this paper are quite different from most of the classification and boolean-function learning problems appearing in the literature. The methods described, while specific to map learning, suggest directions to take in tackling other learning problems.
A Standard Protocol for an Autonomous, Decentralized Building Automation System
Authors: Shigeru Tazaki
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The paper summarizes a specification for a standard protocol for multi-vender building automation systems. Based on the ANSI/ASHRAE Standard 135-1995, the specification extends the functionality of the BACnet protocol in order to realize an autonomous, decentralized BAS(Building Automation System). By following this specification, a building automation constructor could construct a multi-vender-type BAS with more eficincy than using a conventional BAS, and with a significant savings. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Level-set Approach Inverse Problems Involving Obstacles
Authors: Fadil Santosa
Venue:  (1995)

An approach for solving inverse problems involving obstacles is proposed. The approach uses a level-set method which has been shown to be effective in treating problems involving moving boundaries. We develop two computational methods based on this idea. One method results in a nonlinear time-dependent partial differential equation for the level-set function whose evolution minimizes the residual in the data fit. The second method is an optimization that generates a sequence of level-set functions that reduces the residual. The methods are illustrated in two applications: a deconvolution problem, and a diffraction screen reconstruction problem.