ppxscal/embedding_network huggingface dataset:
An Adaptive Protocol for Implementing Causally Consistent Distributed Services
Authors: Michel Raynal, Gerard Thia-Kime, Mustaque Ahamad
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Distributed services that are accessed by widely distributed clients are becoming common place. Such services cannot be provided at the needed level of performance and availability (1) without replicating the service at multiple nodes, and (2) without allowing a ``relatively'' weak level of consistency among replicated copies of the state of a service. This paper explores causally consistent distributed services when multiple related services are replicated to meet performance and availability requirements. This consistency criterion is particularly well suited for some distributed services (e.g., cooperative document sharing), and it is attractive because of the efficient implementations that are allowed by it.
Synthesis of Asynchronous VLSI Circuits
Authors: Alain J. Martin
Venue:  (1991)

No abstract available.
Structuring the Visual Content of Digital Libraries Using CBIR Systems
Venue: Proceedings of the International Conference on Information Visualisation (2000)

In this article, we describe the benefits of CBIR - content-based image retrieval - systems for retrieval and organization of visual content in databases of digital libraries. Unlike text-based retrieval systems which work with manually annotated keywords as metadata, CBIR systems use automatically extracted numerical representations of perceptual features like color, texture or shape. This technique enables users of digital libraries to retrieve visual content without the help of textual metadata, which in some cases may be either not existent or not sufficient for a special purpose. It is our approach to support maintainers of digital libraries in organizing large image volumes using CBIR systems. Finding clusters of similar content or providing clusters with suitable keywords are new application contexts of CBIR. We propose a method for structuring visual content and evaluate retrieval results of CBIR systems with regard to their applicability to this method.
Active Voodoo Dolls: A Vision Based Input Device for Non-rigid Control
Authors: John Isidoro, Stan Sclaroff
Venue:  (1998)

Abstract A vision based technique for non-rigid control is presented that can be used for animation and video game applications. The user grasps a soft, squishable object in front of a camera that can be moved and deformed in order to specify motion. Active Blobs, a non-rigid tracking technique is used to recover the position, rotation and non-rigid deformations of the object. The resulting transformations can be applied to a texture mapped mesh, thus allowing the user to control it interactively. Our use of texture mapping hardware allows us to make the system responsive enough for interactive animation and video game character control.
General-Purpose Processor Huffman Encoding Extension
Authors: Stephan Wong, Sorin Cotofana, Stamatis Vassiliadis
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper proposes an extension to general-purpose architectures to improve the performance of multimedia operations. More specifically, we consider the multimedia JPEG/MPEG standards and investigate the possibility to accelerate the Huffman encoding operation, which is a known performance limiting function, found in these standards. Our investigation suggests that it is possible to decrease the total number of execution cycles by 9% to 12% when the proposed unit is implemented as an extension to existing general-purpose hardware. This new extension is intended to be an integral part of a Multimedia Functional Unit (MFU) that performs specific multimedia operations in a time efficient manner.
Energy-Efficient Real-Time Scheduling in IEEE 802.11 Wireless LANs
Authors: Lynn Y. Zhang, Ye Ge, Jennifer Hou
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Energy constraint has become an important factor in thedesign of MAC protocols. This paper addresses the issueof providing deterministic timing guarantees in the wirelessLAN while minimizing energy consumption of the wirelessnodes. We present a centralized energy efficient algorithm,Scheduled Contention Free Burst (S-CFB), which is builtupon the recently proposed Hybrid Coordination Function(HCF) in the IEEE 802.11 standard. Two mechanisms areproposed: 1) bundling message transmissions into multiplecontention free bursts in order to reduce control overhead;2) allowing wireless nodes to sleep by avoiding preemptionwhenever possible. Our performance study shows that S-CFBmeets the timing requirement for real-time messages,allows wireless nodes to switch to idle state for a longerperiod of time, and reduces the number of control framesrequired to maintain contention free transmission.
Program Simplification as a Means of Approximating Undecidable Propositions
Authors: Mark Harman, Chris Fox, Robert Hierons, David Binkley, Sebastian Danicic
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

We describe an approach which mixes testing, slicing, transformation and formal verification to investigate speculative hypotheses concerning a program, formulated during program comprehension activity.Our philosophy is that such hypotheses (which are typically undecidable) can, in some sense, be `answered' by a partly automated system which returns neither `true' nor `false', but a program (the `test program') which computes the answer.The motivation for this philosophy is the way in which, as we demonstrate, static analysis and manipulation technology can be applied to ensure that the resulting test program is significantly simpler than the original program, thereby simplifying the process of investigating the original hypothesis.
Deterministic and Randomized Bounded Truth-table Reductions ofP, NL, and L to Sparse Sets
Authors: Dieter van Melkebeek
Venue:  (1996)

We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P = L. In case of reductions computable in NC1, the collapse goes down to P = NC1. We parameterize this result and obtain a generic theorem allowing to vary the sparseness condition, the space bound and the number of queries of the truth-table reduction. Another instantiation yields that there is no quasipolynomially dense hard set for P under polylog-space computable truth-table reductions using polylogarithmically many queries unless P is in polylog-space. We also apply the proof technique to NL and L. We establish that there is no sparse hard set for NL under logspace computable bounded truth-table reductions unless NL = L, and that there is no sparse hard set for L under NC1-computable bounded truth-table reductions unless L = NC1. We show that all these results carry over to the randomized setting: If we allow two-sided error randomized reductions with confidence at least inversely polynomial, we obtain collapses to the corresponding randomized classes in the multiple access model. In addition, we prove that there is no sparse hard set for NP under two-sided error randomized polynomial-time bounded truth-table reductions with confidence at least inversely polynomial unless NP = RP.
Assessment of network protocols and software tools for distributed computing
Authors: Ka-Cheong Leung, M. Hamdi
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The performance of distributed supercomputing computing environments are mainly dependent on three factors: distributed programming tools, computing nodes, and LANs employed. In this paper, we analyze the performance of all these factors experimentally and analytically. The distributed programming tools that we employed are PVM and Express. The computing nodes that we employed are SUN and HP workstations, and the LANs that we considered are an Ethernet and FDDI networks. Extensive timing experiments, including one-to-one communications, exchange operations, and broadcast operations, have been performed and analyzed. Moreover, analytic models have been developed to analyze the behavior of the network protocols employed by the LAN-based platforms as well as to estimate the communication overhead for the computing software tools.
Arithmetic-Oriented Multiple-Valued Logic-in-Memory VLSI Based on Current-Mode Logic
Authors: Shunichi Kaeriyama, Takahiro Hanyu, Michitaka Kameyama
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A new logic-in-memory architecture, in which storage elements are distributed over a current-mode logic-circuit plane by the use of floating-gate MOS transistors, is proposed to realize a compact arithmetic VLSI system. Since not only a storage function but also a voltage-mode linear summation and a voltage-to-current conversion are merged into a single floating-gate MOS transistor, the logic-in-memory VLSI becomes very compact with a high-performance cap ability. As an example, it is demonstrated that the effective chip area of the proposed four-valued current-mode full adder is reduced to 5% under the same switching speed in comparison with the corresponding binary CMOS implementation.
New goodness-of-fit tests for the error distribution of autoregressive time-series models
Authors: C. J. Swanepoel, W. O. Doku
Venue: Computational Statistics Data Analysis (2003)

New goodness-of-fit tests, based on bootstrap estimated expectations of probability integral transformed order statistics, are derived for the error distribution of autoregressive time-series models. The resulting test statistics are location and scale invariant, and are sensitive to discrepancies at the tails of the hypothesised distribution. It is shown how critical points for all sample sizes and significance levels can be obtained by using the parametric bootstrap. A simulation study shows that one of the new proposed tests is more powerful than the established Shapiro-Wilk test and the well-known score test (also known as the Lagrange multiplier test), for a wide range of alternative distributions and sample sizes.
Independent General Principles for Constructing Responsive Software Systems
Authors: U C Smith
Venue:  (1984)

Three general principles are presented that can be applied in early software life cycle stages for the definition of software requirements and designs with acceptable performance. They are genuine high-level considerations for meeting responsiveness goals without sacrificing understandability and maintainability, and without increasing development time and cost. The principles are derived from the interrelationships of two performance modes.: a queueing network based computer system model and an execution graph software model. The performance effect of each of the principles is quantified using the models. Examples are given that illustrate how they can be applied to software systems.
Spatial data management for virtual product development
Authors: Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Matthias Renz, Thomas Seidl
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

In the automotive and aerospace industry, millions of technical documents are generated during the development of complex engineering products. Particularly, the universal application of Computer Aided Design (CAD) from the very first design to the final documentation created the need for transactional, concurrent, reliable, and secure data management. The huge underlying CAD databases, occupying terabytes of distributed secondary and tertiary storage, are typically stored and referenced in Engineering Data Management systems (EDM) and organized by means of hierarchical product structures. Although most CAD files represent spatial objects or contain spatially related data, existing EDM systems do not efficiently support the evaluation of spatial predicates. In this paper, we introduce spatial database technology into the file-based world of CAD. As we integrate 3D spatial data management into standard object-relational database systems, the required support for data independence, transactions, recovery, and interoperability can be achieved. Geometric primitives, transformations, and operations on three-dimensional engineering data will be presented which are vital contributions to spatial data management for CAD databases, Furthermore, we will present an effective and efficient approach to spatially index CAD data by using the concepts of object-relational database systems and the techniques of relational access methods. The presented techniques are assembled to a complete system architecture for the Database Integration of Virtual Engineering (DIVE). By using relational storage structure, the DIVE system provides three-dimensional spatial data management within a commercial database system. The spatial data management and the query processor is fully embedded into the Oracle8i server and has been evaluated in an industrial environment. Spatial queries on large databases are performed at interactive response times.
A New Hybrid Approach to Video Organization for Content-Based Indexing
Authors: Madirakshi Das, Shih-Ping Liou
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Video organization is a key step in the content-based indexing of video archives. The objective of video organization is to capture the semantic structure of a video in a form which is meaningful to the user. We present a hybrid approach to video organization which automatically processes video, creating a video table of contents (VTOC), while providing easy-to-use interfaces for verification, correction and augmentation of the automatically extracted video structure. Algorithms are developed to solve the sub-problems of shot detection, shot grouping and VTOC generation without making very restrictive assumptions about the structure or content of the video. We use a nonstationary time series model of difference metrics for shot boundary detection, color and edge similarities for shot grouping and observations about the structure of a wide class of videos for the generation of the VTOC. The use of automatic processing in conjunction with input from the user allows us to produce meaningful video organization efficiently.
Minimum--Support RTP Solutions
Authors: Stephen C. Billups, Janine M. Kennedy
Venue:  (2001)

Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem--that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian.
Composability for Software Components: An Approach Based on the Whole-Part Theory
Authors: Franck Barbier
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Software components differ from ordinary softwareparts in the sense that they own compositionpotentialities, commonly named composability orcompositionality.The lack of influence on Component-Based Software Engineering (CBSE),of reputable andrecognized theories,somehow precludes for havingcomprehensive views and contributions on whatcomposability really is.This paper is grounded on theWhole-Part theory, broadly used in other domains asontology,knowledge engineering,and more recently,object modeling.However, the use of this theory in CBSEremains low.We on purpose formalize a special kind ofcomposability for components operating on the samedeployment node.The foundation of our approach isencapsulation of sub-components by components,emergent and resultant properties for components withregard to their sub-components and finally, state andlifetime dependencies.We lay down a general-purposeframework for designing components that truly possesscomposition potentialities, based on the fact thatrelationships between components and sub-componentsare highly coercive.
Immersive Hierarchical Visualization and Steering for Spectral/hp Element Methods
Authors: Jonathan Reiter, R. M. Kirby, Joseph J. LaViola,  Jr.
Venue:  (2001)

We present the first steps in our hierarchical visualization and steering research targeted at large time-dependent spectral/hp element methods. This research is built around several observations concerning the structure of spectral/hp data which lead to the development of several hierarchical visualization techniques. These techniques provide an attractive vehicle for building a complete end-to-end hierarchical visualization and steering system. This paper discusses our techniques in conjunction with the Pilot system, a first implementation of these ideas in the form of an immersive hierarchical visualization and steering system for spectral/hp element simulations. Pilot allows the user to control the level of extracted and visualized detail on a local basis throughout the simulation''s domain and provides the user with an immersive computational steering interface to interact directly with the simulation. This combination of techniques allows us to use Pilot to visualize the results of large concurrently-running spectral/hp element CFD simulations.
Programming Language Semantics in Foundational Type Theory
Authors: Karl Crary
Venue:  (1998)

There are compelling benefits to using foundational type theory as a framework for programming language semantics. I give a semantics of an expressive programming calculus in the foundational type theory of Nuprl. Previous type-theoretic semantics have used less expressive type theories, or have sacrificed important programming constructs such as recursion and modules. The primary mechanisms of this semantics for the core calculus are partial types, for typing recursion, set types, for encoding power and singleton kinds, which are used for subtyping and module programming, and very dependent function types, for encoding signatures. I then extend the semantics to modules using phase-splitting.
On the Complexity of Resolution Procedures for Theorem Proving
Authors: Zvi Galil
Venue:  (1974)

We study several procedures for theorem proving based on the resolution principle. We consider (1) Davis Putnam procedure; (2) regular resolution; (3) unrestricted resolution; (4) resolution with extension; and (5) several versions of bounded resolution. The powers of these procedures are compared. Exponential lower bounds are proved for the run-time of some of them.
Algebraic framework for linear and morphological scale-spaces
Authors: Henk J.A.M. Heijmans, R. Boomgaard
Venue:  (2000)

This paper proposes a general algebraic construction technique for image scale-spaces. The basic idea is to first downscale the image by some factor using an invertible scaling, then apply an image operator (linear or morphological) at a unit scale, and finally resize the image to its original scale. It is then required that the resulting one-parameter family of image operators satisfies the semigroup property. Such an approach encompasses linear as well as nonlinear (morphological) operators. Furthermore, there exists some freedom as to which semigroup operation on the scale- (or time-) axis is being chosen. Particular attention is given to additive and supremal semigroups. A large part of the paper is devoted to morphological scale-spaces, in particular to scale-spaces associated with an erosion or an opening. In these cases, classical tools from convex analysis, such as the (Young-Fenchel) conjugate, play an important role.
Circuit Complexity before the Dawn of the New Millennium
Authors: Eric Allender
Venue:  (1997)

The 1980''s saw rapid and exciting development of techniques for proving lower bounds in circuit complexity. This pace has slowed recently, and there has even been work indicating that quite different proof techniques must be employed to advance beyond the current frontier of circuit lower bounds. Although this has engendered pessimism in some quarters, there have in fact been many positive developments in the past few years showing that significant progress is possible on many fronts. This paper is a (necessarily incomplete) survey of the state of circuit complexity as we await the dawn of the new millennium. 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 Expert Recommendation System using Concept-based Relevance Discernment
Authors: Takashi Yukawa, Kaname Kasahara, Toshiro Kita, Tsuneaki Kato
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

An expert recommendation system using concept-based relevance discernment is proposed. This system processes the description of a technical topic as input and then finds engineers who have a high level of expertise in that area. The technique employed is an extended vector space model that locates both technical topics and engineers in the same multi-dimensional space, and then calculates their relevance. This system can also retrieve engineers or documents that are related to a field matching a given engineer's technical interests. Such a system can be expected to play the role of a person's professional network, and be a valuable tool for knowledge management among several organizations.
Theory versus Practice in Real-Time Computing with the Java(tm) Platform
Authors: William Foote
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The discipline of Computer Science has always featured a large gap between theory and practice. For example, both the object-oriented paradigm and garbage collection techniques go back to at least the 1960's, [1] [2] but they have only seen widespread commercial acceptance this decade. The Java(tm) programming language has been an important factor leading to the commercial popularization of these techniques.The field of real-time computing has suffered from a particularly acute disconnect between theory and practice. Java(tm) technology can be applied to the building of real-time systems through a set of standard extensions to the Java(tm) platform. A set of extensions that bring the core benefits of the platform to real-time will advance the commercial state of the art. It will help to narrow the gap between theory and practice.This paper explores different aspects of computer systems theory as applied to real-time systems. It analyzes if they are ready to be reduced to practice and standardized.
Robust Speech Recognition Using Neural Networks and Hidden Markov Models
Authors: Lin Cong, Saf Asghar, Bin Cong
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper proposes a robust, speaker-independent isolated word speech recognition (IWSR) system (SMQ/HMM_SVQ/HMM)/MLP which combines Dual Split Matrix Quantization (SMQ) and Split Vector Quantization (SVQ) pair combined with both the strength of HMM in modeling stochastic sequences and the non-linear classification capability of MLP neural networks (NN). The system efficiently utilizes processing resources and improves speech recognition performance by using neural networks as the classifier of the system. Computer simulation clearly indicates superiority over conventional VQ/HMM and MQ/HMM systems with 98% and 95.8% recognition accuracy at 20 dB and 5 dB SNR levels, respectively in a car noise environment, based on the database TIDIGIT.