ppxscal/embedding_network huggingface dataset:
Detecting Salient Motion by Accumulating Directionally-Consistent Flow
Authors: L. Wixson, M. Hansen
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Motion detection can play an important role in many vision tasks. Yet image motion can arise from "uninteresting" events as well as interesting ones. In this paper, salient motion is defined as motion that is likely to result from a typical surveillance target (e.g., a person or vehicle traveling with a sense of direction through a scene) as opposed to other distracting motions (e.g., the scintillation of specularities on water, the oscillation of vegetation in the wind).We propose an algorithm for detecting this salient motion that is based on intermediate-stage vision integration of optical flow. Empirical results are presented that illustrate the applicability of the proposed methods to real-world video. Unlike many motion detection schemes, no knowledge about expected object size or shape is necessary for rejecting the distracting motion.
Low Power Testing of VLSI Circuits: Problems and Solutions
Authors: Patrick Girard
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Power and energy consumption of digital systems may increase significantly during testing. This extra power consumption due to test application may give rise to severe hazards to the circuit reliability. Moreover, it may be responsible for cost, performance verification as well as technology related problems and can dramatically shorten the battery life when on-line testing is considered. In this paper, we present a survey of the low power testing techniques that can be used to test VLSI systems. In the first part, the paper explains the problems induced by the increased power consumed during functional testing of a circuit, in either external testing or built-in self-test (BIST). Next, we survey state-of-the-art techniques that exist to reduce this power/energy consumption during test mode and allow non-destructive testing of the device under test.
A Case Study in Partial Specification: Consistency and Refinement for Object-Z
Authors: Chris Taylor, John Derrick, Eerke Boiten
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

The `viewpoint' approach, in which a system is described by several partial specifications, has been proposed as a way of making complex computing systems more understandable. The ISO's Open Distributing Processing (ODP) framework is architecture for open distributed systems, involving five named viewpoints. This paper compares two partial specifications of a lending library - from the ODP's Enterprise and Information Viewpoints - and discusses the relation between them. Both specifications are written in Object-Z, an object-oriented variant of Z. Examining how such partial specifications might be unified raises broader issues of refinement and mutual consistency of partial specifications in Object-Z.
Many architecture-based software reliability modelsComparison of Architecture-Based Software Reliability Models
Authors: Kateriana Goýeva-Popstojanova, Aditya Mathur P., Kishor Trivedi S.
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Many architecture-based software reliability models have been proposed in the past without any attempt to establish a relationship among them. The aim of this paper is to fill this gap. First, the unifying structural properties of the models are exhibited and the theoretical relationship is established. Then, the estimates provided by the models are compared using an empirical case study. The program chosen for the case study consists of almost 10,000 lines of C code divided into several components. The faulty version of the program was obtained by reinserting the faults discovered during integration testing and operational usage andthe correct version was use as an oracle. A set of test cases was generated randomly accordingly to the known operational profile. The results show that 1) all models give reasonably accurate estimations compared to the actual reliability and 2) faults present in the components influence both components reliabilities and the way components interact.
Coordination of a parallel proposition solver
Authors: C. T.H. Everaars, Bert Lisser
Venue:  (1998)

In this paper we describe an experiment in which {\sc Manifold} is used to coordinate the interprocess communication in a parallelized proposition solver. {\sc Manifold} is very well suited for applications involving dynamic process creation and dynamically changing (ir)regular communication patterns among sets of independent concurrent cooperating processes. The idea in this case study is simple. The proposition solver consists of a fixed numbers of separate processing units which communicate with each other such that the output of one serves as the input for the other. Because one of the processing units performs a computation intensive job, we introduce a master/worker protocol to divide its computations. We show that this protocol implemented in {\sc Manifold} adds another hierarchic layer to the application but leaves the previous layers intact. This modularity of {\sc Manifold} offers the possibility to introduce concurrency step by step. We also verify the implementation of the proposition solver using a simple family of assertions and give some performance results.
Simulation of work teams using a multi-agent system
Authors: Juan Martínez-Miranda, Arantza Aldea, René Bañares-Alcántara
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

When a complex project starts in industry the selection of team(s) is one of the first steps that must be done. The correct selection of people to integrate a team within a complex engineering project is not a trivial task. Team configuration is a type of business decision-making typically done by a manager based on his/her past experience and with the available information about the behaviour and interaction between the potential team members. In this work we propose a Multi-Agent System that provides information about the possible overall behaviour of a work team and present the first results obtained.
Non-Ideal Battery Properties and Low Power Operation in Wearable Computing
Authors: Thomas L. Martin, Daniel P. Siewiorek
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

This paper describes non-ideal properties of batteries and how these properties may impact power-performance trade-offs in wearable computing. The first part of the paper details the characteristics of an ideal battery and how these characteristics are used in sizing batteries and estimating discharge times. Typical non-ideal characteristics and the regions of operation where they occur are described. The paper then covers results from a first-principles, variable-load battery model, showing likely areas for exploiting battery behavior in mobile computing. The major result is that when battery behavior is non-ideal, lowering the average power or the energy per operation may not increase the amount of computation that can be completed in a battery life.
Network Computing Technology and Information Society toward 21st Century
Authors: Shoichi Noguchi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The process of development of network computing towards the 21st century is explained. In order to make clear the key technologies required for the development of network computing, a six-layer model represents the logical model of the system and the key technologies corresponding to each layer are introduced. For the future development of the information society, the importance and the technologies, concerning thin computers and the new platform constructed by the unification of the Internet and broadcasting are also discussed. Finally, the future trends of EC (Electronic Commerce) are envisioned.
de Morgan Bisemilattice of Fuzzy Truth Value
Authors: Hiroaki Kikuchi, Noboru Takagi
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A fuzzy (linguistic)truth value is a truth value speci?ed by a fuzzy set over a closed interval [0; 1] Logical operations, de?ned according to the extension principle, do not satisfy all identities to be lattice because there are subnormal truth values and non-convex truth values that violate the absorption laws. In 2000, Brzozowski proposed de Morgan bisemilattice, which is generalized algebra of de Morgan lattice in order for applications in multi-valued simulations of digital circuits. This paper studies algebraic structure of fuzzy truth values from a view point of Brozozowski's de Morgan bisemilattice. The main results include a necessary and suf?cient condition of subset of fuzzy truth values to be de Morgan bisemilattice.
Generic Singularities of Robot Manipulators
Authors: Dinesh K. Pai, M. C. Leu
Venue:  (1988)

The singularities of the differential kinematic map, i.e., of the manipulator Jacobian, are considered. We first examine the notion of a ``generic'''' kinematic map, whose singularities form smooth manifolds of prescribed dimension in the joint space of the manipulator. For 3-joint robots, an equivalent condition for genericity using determinants is derived. The condition lends itself to symbolic computation and is sufficient for the study of decoupled manipulators, i.e., manipulators which can be separated into a 3-joint translating part and a 3-joint orienting part. The results are illustrated by analyzing the singularities of two classes of 3-joint positioning robots.
NetLibra: An Advanced Digital Library System Based on CORBA
Authors: Tetsuo Hidaka, Takahiro Abe, Tomohiro Kokogawa
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper proposes an advanced digital library architecture called Networking Library, and describes a prototype system "NetLibra", which can integrate several digital libraries using distributed object technologies and networks. NetLibra provides a common distributed platform based on networking and contents distribution middleware. The prototype system includes copyright management services.
ISIS: A System for Fault-Tolerant Distributed Computing
Authors: Kenneth P. Birman
Venue:  (1986)

The ISIS system transforms abstract type specifications into fault-tolerant distributed implementations, while insulating users from the mechanisms whereby fault-tolerance is achieved. This paper discusses the transformations that are used within ISIS, methods for achieving improved performance by concurrently updating replicated data, and user-level issues that arise when ISIS is employed to solve a fault-tolerant distributed problem. We describe a small set of communication primitives upon which the system is based. These achieve high levels of concurrency while respecting ordering requirements imposed by the caller. Finally, the performance of a prototype is reported for a variety of system loads and configurations. In particular, we demonstrate that performance of a replicated object in ISIS can equal or exceed that of a nonreplicated object.
A Unified Framework for the Software Engineering Process System Standards and Models
Authors: Yingxu Wang, Alec Dorling, Hakan Wickberg, Graham King
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

To organise and implement software engineering by software process systems are a new approach in the software industry. This paper develops an integrated framework for software engineering process systems, and unifies a variety of theories in process system modelling, implementation and assessment. Fundamental architectures and requirements for software engineering process system modelling and analysis are investigated systematically.The unified process framework provides an over-arching software engineering process system and a set of formal descriptions. With the unified framework, theoretical and structural foundations can be laid for modelling and analysis of software engineering process systems. Based on the unified framework, current process models and methodologies can be integrated, unexpected gaps and omissions of them can be identified, and new process systems can be built-up with a well investigated foundation.
OS Experimentation and a User Community Coexist Under the DUnX Kernel
Authors: P R LaRowe, S C Ellis
Venue:  (1991)

\indent The class of NUMA (nonuniform memory access time) shared memory architectures is becoming increasingly important with the desire for larger scale multiprocessors. In such machines, the placement and movement of code and data are crucial to performance. The operating system can play a role in managing placement through the policies and mechanisms of the virtual memory subsystem. An implementation approach to investigating dynamic page placement policies raises the logistical problem of how to share a system between OS experimentation and an established user community. We address this issue in the design of an operating system kernel, called DUnX, for the BBN GP1000 multiprocessor. Important DUnX design goals (functional equivalence, minimal system rebooting, and minimal interference by OS experimentation) are outlined. The ways in which DUnX meets those goals (by being fully compatible with BBN''s Mach-1000 and nX operating systems, by providing user-level run-time control over memory management policy selection, by supporting a wide range of memory management policy options, and by controlling policy on a cluster-by-cluster basis) are described. Finally, we discuss our experiences using DUnX.
Design Recovery of a Two Level System
Authors: Thomas Dean, Yuling Chen
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Many applications have one or more important modules that are written in a language other than conventional procedural or object oriented languages. These languages are often translated into some tabular or byte code representation which is executed by an interpreter. The interpreter is sometimes written in the same language as the rest of the application. Examples of such languages are yacc and Tcl. This paper investigates a technique for linking entities in the interpreted languages to their implementation in the interpreter. The technique is illustrated using the design recovery of a compiler that uses S/SL, a grammar language similar to yacc. We present a model extracted from the compiler that links entities in S/SL to the underlying implementation language and some example maintenance queries that might be posed for the system. Extracting the model requires recognizing idiomatic code in the interpreter. We then discuss how the technique might be extended to similar systems such as those implemented in Tcl.
A Negotiating Agents Model for the Provision of Flexible Telephony Services
Authors: M. Rizzo, I. A. Utting
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Current telephone systems suffer from a service interface bottleneck problem, wherein network resources are under-utilised and customer requirements are often not met, in spite of these resources' ability to satisfy such requirements. This bottleneck is primarily due to a coarse-grain service interface, coupled with the inability to support arbitrary terminal types, and the inability to inter-operate with other systems.This paper outlines a new model for telephony services, based on the concept of negotiating agents. In this model, functionality is not made available to users in the form of services, as has been the case traditionally. Instead, users specify policies that describe how they wish their calls to be handled. These policies are used to guide agents appointed to act on behalf of users. The paper also describes a prototype that was built to demonstrate the capabilities of the model.
Recognition of Human Action Using Moment-Based Features
Authors: Romer Rosales
Venue:  (1998)

Abstract The performance of different classification approaches is evaluated using a view-based approach for motion representation. The view-based approach uses computer vision and image processing techniques to register and process the video sequence. Two motion representations called Motion Energy Images and Motion History Image are then constructed. These representations collapse the temporal component in a way that no explicit temporal analysis or sequence matching is needed. Statistical descriptions are then computed using moment-based features and dimensionality reduction techniques. For these tests, we used 7 Hu moments, which are invariant to scale and translation. Principal Components Analysis is used to reduce the dimensionality of this representation. The system is trained using different subjects performing a set of examples of every action to be recognized. Given these samples, K-nearest neighbor, Gaussian, and Gaussian mixture classifiers are used to recognize new actions. Experiments are conducted using instances of eight human actions (i.e., eight classes) performed by seven different subjects. Comparisons in the performance among these classifiers under different conditions are analyzed and reported. Our main goals are to test this dimensionality-reduced representation of actions, and more importantly to use this representation to compare the advantages of different classification approaches in this recognition task.
Automatic abstraction management in information visualization systems
Authors: M. Campo, R. Orosco, A. Teyseyre
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The construction of information visualization systems is a difficult task. However, there is little research into the provision of software architectures for visualization systems to reduce this difficulty. Particularly, systems that provide a reusable support for the automatic management of the different levels of abstraction in which complex data can be observed cannot be found in current visualization systems. Telescope, an object-oriented architecture for visualization systems is presented. Its main goal is to provide a customizable infrastructure to develop visualization systems allowing the automatic management of the different levels of abstraction in which the visualized information can be observed. Telescope is based on the concept of abstractor objects which provides the generic behavior to support visualizations with semantic zoom capabilities controlled externally through abstraction scales. CityVis, a visualization system for city data, developed using the Telescope architecture, is also described.
Architecture evaluation of an agent-based music gathering application
Authors: A.J. N. van Breemen, L.M. G. Feijs
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The software architecture determines for a critical part the success of an industrial application. In this context success should be understood in terms of so called `ilities', such as interoperability, integrability and responsiveness. Now that agent research is most actual we notice that industry is still cautious about adopting the results obtained in this research area. Introducing agents in a software architecture adds unpredictability, simply because agents are new and thus there is little industrial experience. In order to gain agent experience in an important domain for Philips, we have built a prototype of an agent-based industrial software application. The application concerns a proactive music gathering application that is embedded in an Internet-aware personalized MP3 player. In this paper we discuss the application's software architecture and evaluate its success in terms of several traditional software engineering 'ilities'.
Better group behaviors in complex environments using global roadmaps
Authors: O. Burchan Bayazit, Jyh-Ming Lien, Nancy M. Amato
Venue: Proceedings of the eighth international conference on Artificial life (2002)

While many methods to simulate flocking behaviors have been proposed, these techniques usually only provide simplistic navigation and planning capabilities because each flock member's behavior depends only on its local environment. In this work, we investigate how the addition of global information in the form of a roadmap of the environment enables more sophisticated flocking behaviors and supports global navigation and planning. In this paper, we propose new techniques for four distinct group behaviors: homing, goal searching, traversing narrow areas and shepherding. Extending ideas from cognitive modeling, we embed behavior rules in individual flock members and in the roadmap. These embedded behaviors enable the creatures to modify their actions based on their current location and state. For example, the flock might move as an unordered group in open regions and in a follow-the-leader fashion through narrow passages. These behaviors exploit global knowledge of the environment and utilize information gathered by all flock members which is communicated by allowing individual flock members to dynamically update the shared roadmap to reflect (un)desirable routes or regions. We present experimental results showing how the judicious use of simple roadmaps of the environment enables complex behaviors to be obtained at minimal cost. Animations can be viewed at http://parasol.tamu.edu.
Automatic Mapping of Task and Data Parallel Programs for Efficient Execution on Multicomputers
Authors: Jaspal Subhlok
Venue:  (1993)

For a wide variety of applications, both task and data parallelism must be exploited to achieve the best possible performance on a multicomputer. Recent research has underlined the importance of exploiting task and data parallelism in a single compiler framework, and such a compiler can map a single source program in many different ways onto a parallel machine. There are several complex tradeoffs between task and data parallelism, depending on the characteristics of the program to be executed and the performance parameters of the target parallel machine. This makes it very difficult for a programmer to select a good mapping for a task and data parallel program. In this paper we isolate and examine specific characteristics of executing programs that determine the performance for different mappings on a parallel machine, and present an automatic system to obtain good mappings. The process consists of two steps: First, an instrumented input program is executed a fixed number of times with different mappings, to build an execution model of the program. Next, the model is analyzed to obtain a good final mapping of the program onto the processors of the parallel machine. The current implementation is static, feedback driven, although the approach can be extended to a dynamic system. We demonstrate the system with an example program that is a model for many applications in the domains of signal processing and image processing.
Presuppositions and information updating
Authors: D. J Eijck
Venue:  (1995)

Presupposition failures are errors occurring during the left-right processing of a computer program or natural language text. A general method for analysing such errors with dynamic logic is presented, based on the idea that sequential processing changes context dynamically and that this process of context change can be made the object of analysis in dynamic modal logic.