ppxscal/embedding_network huggingface dataset:
Rigid and Articulated Motion Seen with an Uncalibrated Stereo Rig
Authors: Andreas Ruf, Radu Horaud
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper establishes a link between uncalibrated stereo vision and the motion of rigid and articulated bodies. The variation in the projective reconstruction of a dynamic scene over time allows an uncalibrated stereo rig to be used as a faithful motion capturing device.We introduce an original theoretical framework - projective kinematics - which allows rigid and articulated motion to be represented within the transformation group of projective space. Corresponding projective velocities are defined in the tangent space. Most importantly, these projective motions inherit the Lie-group structure of the displacement group.These theoretical results lead immediately to non-metric formulations of visual serving, tracking, motion capturing and motion synthesis systems, that no longer require the metric geometry of a stereo camera or of the articulated body to be known. We report on such a non-metric formulation of a visual serving system and present simulated experimental results.
Production Rule Verification for Quasi-Delay-Insensitive Circuits
Authors: James N. Cook
Venue:  (1993)

No abstract available. 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
Aspects of protocol conformance in inter-agent dialogue
Authors: Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We identify different levels of conformance to a protocol (weak, exhaustive, and robust conformance) and show how conformance may be either checked a priori or enforced at runtime for a specific class of logic-based agents.
On Testability of Multiple Precharged Domino Logic
Authors: Th. Haniotakis, Y. Tsiatouhas, D. Nikolos, C. Efstathiou
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Domino circuits are increasingly popular because they offer a significant performance boost over static ones. An inherent problem with domino CMOS gates is that under specific input conditions the charge redistribution between parasitic capacitances at internal nodes of the circuit can destroy the noise margin and cause glitches at the output of a domino gate.Among the dominant solutions proposed, in the open literature, to overcome this problem is the technique of internal nodes multiple precharging. However the added precharge transistors are not testable for stuck-open and stuck-on faults. Undetectable stuck-open faults on these transistors cause reduction of the noise margins of the gate. Then the operation of the circuit in the field is sensitive to environmental factors, such as noise. In this paper we propose a new internal nodes multiple precharging scheme that leads to testable designs for stuck-open and stuck-on faults.
Connection admission control for hard real-time communication in ATM networks
Authors: Qin Zheng, T. Yokatani, T. Ichihashi, Y. Nemoto
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Connection Admission Control (CAC) as needed in ATM networks to provide Quality of Service (QoS) guarantees real-time connections. In this paper, we present a CAC scheme based on (1) a bit-stream traffic model to describe traffic generation patterns of CBR/VBR connections and traffic distortions within a network, and (2) worst-case queueing analysis to obtain hard cell queueing delay bounds. The proposed CAC scheme can be used for the establishment of hard real-time connections in ATM networks with conventional static priority FIFO queueing switches. The effectiveness of the scheme is illustrated by applying it to an ATM-based Real-Time Plant Control Network (RTPCN) currently under development by the Mitsubishi Electric Corporation. The CAC scheme presented in the paper can also be extended to set up soft real-time connections in ATM networks.
Primary Component Asynchronous Group Membership as an Instance of a Generic Agreement Framework
Authors: Fabiola Greve, Michel Hurfin, Michel Raynal, Frederic Tronel
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Group-based computing is becoming more and more popular when one has to design a middleware able to support reliable distributed applications. This paradigm is made of two basic services, namely, a group membership service and a group communication service. More generally, a group is a set of processes cooperating to carry out a common task (e.g., copies of a replicated server, participants in a transaction or users in a CSCW-based application). Due to the desire of new processes to join the group, to the desire of a group member to leave it, or to process crashes, the composition of a group can evolve dynamically. The set of processes that currently implements the group is called the current view of the group. This paper addresses the specification and the implementation of a primary component group membership service. "Primary component" means that the specification imposes to have a single view at any time. The paper first proposes a specification for the problem. Then it presents a protocol that implements that specification in asynchronous distributed systems equipped with failure detectors. This primary component group membership protocol is obtained as an appropriate instantiation of a general agreement framework.
The Ensemble System
Authors: Mark Hayden
Venue:  (1998)

Ensemble is a group communication system that demonstrably achieves a wide range of goals. It is a general-purpose communication system intended for constructing reliable distributed applications; it is a flexible framework for carrying out research in group ware protocols; it is a large-scale, system-style implementation built in a state-of-the-art programming language\rc{lines of ML?}; and it is also a mathematical object designed to be amenable to formal analysis and manipulation. Thus, Ensemble straddles a number of disciplines of computer science ranging from systems architectures to formal methods. The principal advances described in this thesis are the creation of the Ensemble system and the demonstration that it exhibits the properties just mentioned. The thesis begins by presenting the Ensemble architecture, as well as background in group communication. We describe the various components of the architecture, give examples of their interactions, and compare this architecture with that of other layered communication systems. The Ensemble protocols make heavy use of layered micro-protocols. We describe optimization techniques that greatly reduce the performance overheads introduced by layering and show how the architecture facilitates these optimizations. In addition we show how to formalize these optimizations in type theory and implement them using the Nuprl theorem prover. Ensemble is implemented in a dialect of the ML programming language. We describe how the use of ML impacted the system, and present a wide range of comparisons between Ensemble and a similar system implemented in C.
C++ Builder Developer's Guide, 2 edition
Authors: Bob Swart, Mark Cashman, Paula Gustavson
Venue:  (2002)

:C++Builder 6 Developer's Guide is revised for the latest version of C++Builder, the biggest update to C++Builder in years.C++Builder is an ANSI C++ IDE.The Version 6 adds BizSnap, a tool to build Web Services using XML/SOAP, .NET, and BizTalk from Microsoft, and SunONE from Sun Microsystems.Other new components include WebSnap for Web application development, DataSnap for database development, and CLX, which allows cross-platform development for Unix and Linux.The new NetCLX Internet components allow development of cross-platform applications with Apache, Microsoft IIS, and Netscape Web Server applications.C++Builder 6 Developer's Guide continues as the definite guide for Borland's C++Builder, providing a clear and concise reference for C++ Developers.
Multi-class relevance feedback content-based image retrieval
Authors: Jing Peng
Venue: Computer Vision and Image Understanding (2003)

Relevance feedback methods for content-based image retrieval have shown promise in a variety of image database applications. These techniques assume two-class relevance feedback: relevant and irrelevant classes. While simple computationally, two-class relevance feedback often becomes inadequate in providing sufficient information to help rapidly improve retrieval performance. In this paper we propose a multi-class form of relevance feedback retrieval to try to exploit multi-class information. For a given query, we use a χ2 analysis to determine the local relevance of each feature dimension with multi-class relevance feedback. This information is then used to customize the retrieval metric to rank images. By exploiting multiclass information, our method is able to create flexible metrics that better capture user perceived similarity. In a number of image data sets, the method achieves a higher level of precision with fewer iterations, demonstrating the potential for substantial improvements over two-class relevance feedback retrieval.
Improving and still passing the ALife test: component-normalised activity statistics classify evolution in geb as unbounded
Authors: Alastair Channon
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Bedau's (1998a) classification system for long-term evolutionary dynamics provides a test for open-ended evolution. Making this ALife test more rigorous, and passing it, are two of the most important open problems in the field. Previously (Channon 2001) I presented the result that 'Geb', a system designed to verify and extend theories behind the generation of evolutionary emergent systems (Channon & Damper 2000), has passed this test. However I also criticised the test, most significantly with regard to its normalisation method for artificial systems. This paper details a modified normalisation method, based on component activity normalisation, that overcomes these criticisms. It then presents the results of the revised test when applied to Geb, which indicate that this system does indeed exhibit open-ended evolution.
A comparative study for the mechanical behaviour of the materials having different moduli in tension and compression
Authors: S. K. Afaq, M. Karama, S. Mistou
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The aim of this paper is to analyse the mechanical behaviour of materials having different properties in tension and compression, using different laminated plate models, previously presented by Kirchhoff-Love, Reissner-Mindlin, and Touratier. The accuracy of these theories is then compared to the results obtained by Papazoglou and Tsouvalis which are based on the Reddy Theory of higher order shear deformation .The study was carried out on square simply supported, multilayered, non-symmetrical, specially orthtropic laminates under uniformally distributed sinsoinadale load. Finally theses results are compared to finite element analysis.
Online courses step by step
Authors: Paul-Th. Kandzia
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Virtual University is a buzzword. However, in spite of manifold activities e-learning, that is the usage of multimedia and network technology to benefit or profit the students, will not inevitably be adopted in the university. On the contrary, these technologies have to be strongly pushed and the characteristics and specific culture of traditional universities have to be taken into account. Various methods and techniques have proven to be best practice, which can succeed in a traditional university and open up a way for the alma mater to find its place in cyberspace, too.
Registration with a Zoom Lens Camera for Augmented Reality Applications
Authors: Gilles Simon, Marie-Odile Berger
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

We focus in this paper on the problem of adding computer-generated objects in video sequences that have been shot with a zoom lens camera. While numerous papers have been devoted to registration with fixed focal length, little attention has been brought to zoom lens cameras. In this paper, we propose an efficient two-stage algorithm for handling zoom changing which are are likely to happen in a video sequence. We first attempt to partition the video into camera motions and zoom variations. Then, classical registration methods are used on the image frames labeled "camera motion" while keeping the internal parameters constant, whereas the zoom parameters are only updated for the frames labeled "zoom variations". Results are presented demonstrating registration on various sequences. Augmented video sequences are also shown.
Parallel Adaptive Unstructured Computation
Authors: Jose G Castanos
Venue:  (2000)

Adaptive computation offers the potential to provide large storage and computational savings on problems with dissimilar scales by focusing the available computational resources on the regions where the solution changes rapidly. Many static problems have regions of high physical activity embedded in large domains in which the solution is smooth. In transient problems, the regions of interest can appear or vanish, and modify their size, shape or location, as occurs in the study of turbulence in fluid flows. In all cases, it is necessary to ``adapt'''' the mesh to follow the physical anomalies so that regions of high gradients are not under-resolved while maintaining a coarser mesh everywhere else. Unfortunately, adaptivity significantly increases the complexity of algorithms and software. In this talk we describe the problems that arise when adaptive schemes are used in a parallel computing environment. We address the difficulties of designing parallel adaptation methods by introducing a new parallel mesh refinement algorithm based on Rivara''s bisection algorithm, for triangular and tetrahedral meshes. We have shown that this algorithm generates the same refined meshes in the serial and parallel cases. Because adaptive methods produce imbalances in the work assigned to processors they provide an excellent context for the study of dynamic load balancing schemes on distributed memory parallel computers. We present a new parallel graph partitioning algorithm that has its roots in multilevel algorithms. Compared with other partitioning heuristics, our method greatly reduces the movement of data between processors as a result of small changes in the mesh, by amounts close to those predicted by analysis. We have also designed a data migration procedure to rebalance the work between processors. To evaluate and test these ideas we have developed and implemented a parallel adaptive system, called PARED, for the solution of PDEs by the finite element method. PARED is an object system that executes in distributed memory machines such as the IBM RS6000/SP and networks of workstations. PARED supports the creation of dynamic distributed data structures. Our system also provides a communications library built on top of MPI that allows for an efficient exchange of objects between processors.
Security Complete, 2 edition
Venue:  (2002)

:This second edition of Security Complete is a one-of-a-kind book -- valuable both for its broad content and its low price. The book contains the essentials you need to know about securing your environment -- from evaluating how much security you really need to auditing an existing network system. This book also takes you into various operating systems, including Windows 2000, Windows XP, Linux, and NetWare, showing you the tips and tricks to securing each one. Get up to speed on encryption, firewalls, and the industry's top security certifications, and soon you'll be able to ensure the security of your home and business networks. Security Complete introduces you to the work of some of Sybex's finest authors, so you'll know where to go to learn even more about protecting your valuable assets. 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
An Improved Topology Discovery Algorithm for Networks with Wormhole Routing and Directed Links
Authors: Ying-Yi Huang, Mart L. Molle
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing. An algorithm of this type was developed for the ATOMIC high speed local area network to avoid the need for manually updating routing tables. Similar needs may arise in wireless networks where channels may be unidirectional because of limited transmission power, multipath, and similar effects. Like the ATOMIC topology discovery algorithm, our algorithm accumulates a map of the network at a distinguished node called the Address Consultant. However, our algorithm is much faster. In addition, our algorithm is more general, because it can correctly resolve topologies that contain multiply connected nodes. We implemented both algorithms in a concurrent simulation environment, and tested them on a variety of topologies.
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains
Authors: Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

The Minimum Spanning Tree (MST) problem with an added constraint that no node in the spanning tree has the degree more than a specified integer d, is known as the Degree-Constrained MST (d-MST) problem. Since computing the d-MST is NP-hard for every d in the range 2
Error control for messaging applications in a wireless environment
Authors: A. J. McAuley
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The paper investigates error control mechanisms for mobile messaging applications, such as e-mail, fax, and credit card verification. Although existing protocols provide efficient error control over conventional networks, wireless networks present significant new challenges. The radio link introduces noise and multipath interference causing long periods of increased error rate, while host motion requires changing communication paths that can cause packet delay, misordering, duplication, and loss. Furthermore, scarce radio resources make bandwidth efficiency desirable. Using measurements from a field-deployed PCS system in Boulder Colorado, the authors identify two types of reception area. They highlight the benefits of powerful error control mechanisms in the fringe reception areas, especially selective acknowledgments and combining data from multiple transmissions.
Quality Aspects of Software Product Supply and Support using the Internet
Authors: Aj Walker, B Braude
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This paper explores the quality aspects of using the Internet to supply and support software products. The Software Engineering Applications Laboratory (SEAL) at the University of the Witwatersrand is in the process of developing various software products to be distributed commercially in the near future. The SEAL has chosen to use the Internet to supply and support these products. A system has been developed for this task and has been named the Internet System for the Supply and Support of Software (IS 4 ). SEAL is committed to developing and supplying software within a quality management system.Consequently an investigation was undertaken into the quality characteristics and requirements based on the ISO 9001 standard for quality assurance and the ISO/IEC JTC1/SC7 software engineering standards. The investigation focused on quality requirements for processes related to supplying and supporting software as well as on the quality characteristics of the IS 4 and the process of developing the IS 4 . These quality concerns have been incorporated into the SEAL's quality management system, the design and development of the IS 4 and the development process for SEAL products.
A Competence-Based Scheduling Method for Web Computing
Authors: Chungnan Lee, MinHong Horng, Chuanwen Chiang, JiingKae Wu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, we propose a heuristic-scheduling algorithm, called Competence Based Method (CBM), to dynamically distribute workload for task allocation problem in a Web/Java-based computing environment. CBM is designed to meet four properties of Web computing: heterogeneity, scalability, centralization, and non-dedication host. CBM can be applied to both independent links scheduling problems. Compared with the competing algorithms, the experimental results show that the proposed CBM performs faster in parallel time and is close to the optimal one.
How good are genetic algorithms at finding large cliques: an experimental
Authors: Robert Carter, Kihong Park
Venue:  (1993)

Abstract This paper investigates the power of genetic algorithms at solving the MAX-CLIQUE problem. We measure the performance of a standard genetic algorithm on an elementary set of problem instances consisting of embedded cliques in random graphs. We indicate the need for improvement, and introduce a new genetic algorithm, the {\em multi-phase annealed GA}, which exhibits superior performance on the same problem set. As we scale up the problem size and test on ``hard'''' benchmark instances, we notice a degraded performance in the algorithm caused by premature convergence to local minima. To alleviate this problem, a sequence of modifications are implemented ranging from changes in input representation to systematic local search. The most recent version, called {\em union GA}, incorporates the features of union cross-over, greedy replacement, and diversity enhancement. It shows a marked speed-up in the number of iterations required to find a given solution, as well as some improvement in the clique size found. We discuss issues related to the SIMD implementation of the genetic algorithms on a Thinking Machines CM-5, which was necessitated by the intrinsically high time complexity ($O(n^3)$) of the serial algorithm for computing one iteration. Our preliminary conclusions are: (1) a genetic algorithm needs to be heavily customized to work ``well'''' for the clique problem; (2) a GA is computationally very expensive, and its use is only recommended if it is known to find larger cliques than other algorithms; (3) although our customization effort is bringing forth continued improvements, there is no clear evidence, at this time, that a GA will have better success in circumventing local minima.
Task Partitioning Utilizing Available Time on Multiprocessor Systems for a Given Schedule
Authors: Oscar R. López-Bonilla
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

The Partition of a task at compile time on a Multiprocessor System for a Given Schedule is considered. The optimal distribution of the partition is found. The homogeneous and the heterogeneous cases are considered. An algorithm is shown that perform the partitioning while ensuring utilization of resources efficiently. Tests are developed to predict the profitability of the partition.