ppxscal/embedding_network huggingface dataset:
Protecting Intellectual Property in Digital Multimedia Networks
Authors: Ahmet M. Eskicioglu
Venue: Computer (2003)

Computer and communications network improvements offer intellectual-property owners new ways to reproduce, distribute, and market their IP. One problem with digital distribution and storage technologies, however, is the formidable threat of piracy. Thus, understanding the opportunities provided by the ever-expanding information infrastructure and its impact on digital IP is essential.Proponents and opponents of protecting IP with technical measures have presented strong arguments. Hopefully, these discussions will lead to a general consensus regarding protection technologies and a common interpretation of consumers' rights in the digital age.
Distributed Shared Data Space Architecture for Real-Time Systems
Authors: Edwin de Jong
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Designing distributed real-time systems is an intricate and not very well-structured task. Besides complex functional capabilities, these systems often require high standards on real-time performance, reliability, and availability. Though architectures like CORBA hide the distributed infrastructure of the underlying platform from the application software, supporting real-time performance and fault-tolerant services remains a complex design problem.This paper presents an architecture for distributed real-time systems in which fault-tolerance is supported by transparent replication of mission-critical components. The architecture is based on a shared data space through which components interact. The architecture is supported by middleware that provides a distributed implementation of the shared data space. The implementation is based on a light weight asynchronous communication protocol that is able to deliver real-time performance.
A New Network Layer Protocol with Routing Address and Tables Auto-Configuration Mechanism
Authors: Hirohisa Mori, Ken Sakamura
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

In this study, we have proposed a network layer protocol denoted ACRP(Auto-Configurated Routing Protocol) equipped with a function that automatically configures routing addresses and routing tables for a large-scale network system made up of multiple connected physical networks. The goals of the work presented in this paper are to enable adding and deleting physical networks during practical use and designing the protocol in such a way that the auto-configuration is finished within a few minutes. By simulating ACRP, we have succeeded in determining the algorithm structures for routing tables, protocol, that satisfies these requirements in a network with approximately 400,000 nodes. This work will contribute to the improvement of expandability and maintainability of control LANs for intelligent buildings, etc.
Simulation study of a run-time bandwidth assignment technique for delay sensitive traffic in high-speed network
Authors: I. Ryoo, H. Aida, T. Saito
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

This paper proposes a run-time monitor and bandwidth assignment scheme for delay-sensitive traffic in ATM (asynchronous transfer mode) network. The traffic monitor function is thought to be indispensable to support the QoS (quality of services) of the accepted calls and carry out the network resource management efficiently at the same time. The proposed scheme monitors user data cells by its counter which is driven by system clocks and makes a report on the monitor results to the upper plane such as control plane or network management plane. This feature makes it possible to do the run-time bandwidth assignment and can moderately reduce the size of cell buffers which is inevitable to observe input cell rates in existing traffic controls. Furthermore, any processing delays resulting from usage parameter controls can also be eliminated. The proposed scheme is conformed to efficiently manage the calls and reliably improve the overall system performances without a drop in QoS by computer simulations
Stochastic Petri Net Analysis of a Replicated File System
Authors: B J Dugan, Gianfranco Ciardo
Venue:  (1987)

We present a stochastic Petri net model of a replicated file system in a distributed environment where replicated files reside on different hosts and a voting algorithm is used to maintain consistency. Witnesses, which simply record the status of the file but contain no data, may be used in addition to or in place of files to reduce overhead. We present a model sufficiently detailed to include file status (current or out-of-date) as well as failure and repair of hosts where copies or witnesses reside. The number of copies and witnesses is not fixed, but is a parameter of the model. Two different majority protocols are examined, one where a majority of all copies and witnesses is necessary to form a quorum, the other where only a majority of the copies and witnesses on operational hosts is needed. The latter, known as adaptive voting, is shown to increase file availability in most cases. We also investigate the process of selection of copies and witnesses to participate in an update when more than the majority is available and show the inherent performance/reliability tradeoffs.
A Response to Cheriton and Skeen''s Criticism of Causal and Totally Ordered Communication
Authors: Kenneth P. Birman
Venue:  (1993)

No abstract supplied.
The Semantics of Proactive Communication Acts among Team-Based Agents
Authors: John Yen, Xiaocong Fan
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Psychological studies about human teamwork have shown that members of an effective team can often anticipate needs of other teammates, and choose to assist teammates through appropriate ways. However, the fulfillment of help behaviors among teammates is subject to team members' understanding of the underpinning communicative acts performed by individual agents. By extending the mental state analysis of performatives initiated by Cohenand Levesque [2], we focus this paper on analyzing a missing class of performatives-proactive performatives, which are prevalently used by individual agents to exchange information among teammates.
An Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
Authors: Boros E., Elbassioni K., Gurvich V., Khachiyan L.
Venue:  (2000)

We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub- hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previously known to be solvable in polynomial incremental time. We also give a similar parallel algorithm for the dualization problem on the product of arbitrary lattices which have a bounded number of immediate predecessors for each element.
Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds
Authors: Franco P. Preparata, Jeffrey S Vitter, Mariette Yvinec
Venue:  (1989)

We present a new hidden-line-elimination technique for displaying the perspective view of a scene of three-dimensional isothetic parallelepipeds (3D-rectangles). We assume that the 3D-rectangles are totally ordered based upon the dominance relation of occlusion. The perspective view is generated incrementally, starting with the closest 3D-rectangle and proceeding away from the viewpoint. Our algorithm is scene-sensitive and uses $O((n + d) \log n log log n)$ time, where $n$ is the number of 3D-rectangles and $d$ is the number of edges of the display. This improves over the heretofore best known technique. The primary data structure is an efficient alternative to dynamic fractional cascading for use with augmented segment and range trees when the universe is fixed beforehand. It supports queries in $O((\log n + k) log log n)$ time, where $k$ is the size of the output, and insertions and deletions in $O(\log n log log n)$ time, all in the worst case.
Lexicalisation Patterns: Semantic Components and Split Intransitivity.
Authors: Antonietta Alonge
Venue:  (1995)

The goal of this paper is to claim the possibility to state a connection among patterns of lexicalisation of semantic components in verb roots and split intransitivity, so that only semantic information will be coded at the level of the lexical entry.
Buffer insertion/self-token (BIST) protocol for multimedia LANs
Authors: K. Tanno, A. Koyama, T. Taketa, S. Noguchi
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

This paper describes a new multimedia LAN protocol, referred to as the buffer insertion/self-token (BIST) protocol, combining buffer insertion and the multiple-self-token ring protocols. The basic buffer insertion ring has the maximum spatial reuse on a ring by allowing stations to transmit packets concurrently. However, it is well known that the buffer insertion method suffers from the possibility of starvation. BIST prevents starvation and maintain fairness by assigning each station individual tokens, called self-tokens. Then a station is allowed to send packets only if it holds its own tokens, that is, each packet transmitted by the station is attached a self-token belonging to the station. That is why packet flow on a ring is regulated, and fairness is adjustable. Asynchronous and synchronous transmissions are supported by using two kinds of self-token, one is for asynchronous transmission and the other is for synchronous transmission. The effectiveness of the proposed protocol is demonstrated via simulation
Aspects of Internal Program Documentation " An Elucidative Perspective
Authors: Thomas Vestdam, Kurt N"rmark
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

It is difficult and challenging to comprehend the internal aspects of a program. The internal aspects are seen as contrasts to end user aspects and interface aspects. Internal program documentation is relevant for almost any kind of software. The internal program documentation represents the original as well as the accumulated understanding of the program, which is very difficult to extract from the source program and its modifications over time. Elucidative Programming is a documentation technique that originally is inspired by Literate Programming. As an important difference between the two, Elucidative Programming does not call for any reorganization of the source programs, as required by Literate Programming tools. Elucidative Programming provides for mutual navigation in between program source files and sections of the documentation. The navigation takes place in an Internet browser applying a two-framed layout. In this paper we investigate the applicabilityof Elucidative Programming in a number of areas related to internal program documentation. It is concluded that Elucidative Programming can solve a number of concrete problems in the areas of program tutorials, frameworks, and program reviews. In addition we see positive impacts of Elucidative Programming in the area of programming education.
Automatic generation of interactive overview diagrams for the navigation of large graphs
Authors: M. S Marshall, Ivan Herman, Guy Melancon
Venue:  (2000)

: A clustered graph can be used to build an abstract view of its non-clustered counterpart and reduce visual complexity. The classic approach to interaction with a clustered graph is limited in scalability and efficacy, underlining the need for an overview diagram. We present a technique for the automatic generation of an overview diagram based on hierarchical clustering and discuss its application to graphs. Hierarchical clustering induces a tree structure that is useful as a map to navigate the original data set. Because the resulting overview diagram is itself a graph, it can be manipulated by the same tools that are available for graphs.
Developing the Methods of Reliability Estimation for Structurally Complex Systems of Multistate Elements
Authors: V. A. Mel'nikov
Venue: Automation and Remote Control (2003)

For systems of multistate elements, the problem of developing Boolean reliability models was considered on the basis of multivalued logic, cortege algebra, algebra of groups of incompatible events, and classical logic-and-probabilistic method. Development of Boolean reliability models based on the multivalued logic was shown to be unadvisable. Numerical examples demonstrating applicability of the logic-and-probabilistic methods and their new capabilities were presented. Prospects of formulating a set of different problems that are tackled by the same logic-and-probabilistic methods with the aim of developing methods for calculation of the operational effectiveness of various levels of operability were emphasized. The possibility of constructing models for continual calculations on the basis of logic-and-probabilistic methods was demonstrated.
Cataloging Software Packages for Automatic Document Processing
Authors: Gerard Salton
Venue:  (1976)

Considerable advances have been made in the last few years in the development of hardware structures useful for the implementation of real-time document processing systems and on-line information retrieval. At the same time, relatively little is known about the software packages most appropriate for the new technology. Following certain proposals for the creation of national and international registries of software packages, a sample catalog of software routines is developed for use in modern automatic documentation systems. 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
Enhancing screen teleconferencing with streaming SIMD extensions
Authors: John G. Allen, Jesse S. Jin
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

It is often necessary to reduce storage and bandwidth requirements when recording or broadcasting a sequence of actions on a computer screen.These applications most commonly fall into the category of thin client architectures, screen teleconferencing and the recording of demonstration sequences. This paper explores the use of MMXTM and Streaming SIMD Extension (SSE) instructions [11,12] to improve the performance of a hybrid Lempel-Ziv [15] encoding algorithm with temporally seeded history buffer and predictive quarter-static range entropy encoder [9, 14].We introduce lossless compression via the packed MMXTM comparison instructions as well as a "lossy" technique that makes use of SSE extensions to facilitate partial pattern matching [12].
A Train Control System for Low-Density Lines Based on Intelligent Autonomous Decentralized System (IADS)
Authors: Tang Tao, Baigen Cai
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

In this paper, the features of Qinghai-Tibet Railway and its requirement to signaling system are introduced. To meet the system requirements, a train control system which is based on satellite location and Intelligent Autonomous Decentralized Systems (IADS) technologies is discussed and planned to apply to the low-density lines such as Qinghai-Tibet line. The configuration of the system and some key technologies adopted in the system are also presented. Based on IADS, the system not only has autonomous controllability, flexibility of construction and on-line expandability, but also some intelligence.
Editing Digital Video: The Complete Creative and Technical Guide, 1 edition
Authors: Robert M. Goodman, Patrick McGrath
Venue:  (2002)

:* Demystifies video editing for all styles: narrative, documentary, and music* How to use any available toolfrom the simplest home editing software to complex professional systems to expertly edit their material* CD-ROM contains a digital video editing toolkit
Experimental evaluation of a program visualisation tool for use in computer science education
Authors: Kathryn Kasmarik, Joe Thurbon
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

This paper presents an experimental evaluation of a program visualisation tool. Computer science students in an introductory object oriented programming course in Java were asked to respond to a series of questions regarding concepts common to the writing and debugging of code at a novice level. Statistical analysis of data collected from this experiment revealed that a diagrammatic representation can significantly improve the novice understanding of program code.
Contention Free Embedding of Complete Binary Trees into 3D Meshes in Half and Full-Duplexed Network Models
Authors: Sang-Kyu Lee, Ju-Young Lee
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

We consider the problem of dimension-ordered embedding of complete binary trees into 3-dimensional meshes without link contention. In this paper, the embedding problems are studied under two different network models: half-duplexed networks and full-duplexed networks.Gibbons and Paterson showed that a complete binary tree Tp could be disjointedly embedded into a full-duplexed 2-dimensional mesh of optimum size without dimension-ordered routing. Using the dimension-ordered routing, the authors showed that Tp could be embedded into a 3-dimensional mesh of optimum size with link congestion two.This paper presents the dimension-ordered embedding algorithms of the complete binary trees into the wormhole routed 3-dimensional meshes without link contention achieving expansion of no larger than 1.125 of optimum in half-duplexed network model and optimum in full-duplexed network model.
Submicron Systems Architecture Project:Semiannual Technical Report
Authors: Charles L. Seitz
Venue:  (1987)

No abstract available.
SCOM: A Security and Privacy Layer for Horus
Authors: David A. Cooper
Venue:  (1996)

A large number of distributed applications will soon be implemented for which the inclusion of some form of security will be important. While the programmers who design these applications may have expertise in the application area, they most likely will not be experts in the areas of distributed computing or security. In both of these areas, a firm knowledge of the subject is necessary in order to avoid subtle, hard to detect flaws in design. The Horus system was created to enable the design and implementation of distributed applications. The ultimate goal of this work is to allow for the implementation of efficient distributed applications while hiding many of the problems associated with the design of such applications from the applications programmer. In this paper, we describe work we have done to facilitate the implementation of secure distributed applications on top of the Horus system.
Enterprise JavaBeans, 4 edition
Authors: Richard Monson-Haefel, A. K. Weissinger
Venue:  (2003)

:Enterprise JavaBeans was recently voted "Best Java Book" by the editors and readers of Java Developer's Journal. Readers of JavaPro named it the "Best Java Book for Experts." And Amazon.com included it in the Top Computer Books for 2000. Now the best only gets better! In the new 3rd edition, Enterprise JavaBeans has been completely revised and updated with a thorough introduction to the new 2.0 version of the EJB specification. Significantly different from the earlier version, the 2.0 specification introduces three dramatic improvements: A completely new version of container-managed persistence; local interfaces; and a totally new kind of bean called the "message driven bean." The new version of container-managed persistence (CMP) beans in 2.0 is more portable and robust than in the older 1.1 version. Most significant is the introduction of the relationship fields, which allow entity beans to declare relationships with each other as natural references. In order to make this huge leap in component relationships possible, EJB 2.0 had to redesign how entity beans are defined and interact. Our new 3rd edition examines this critical CMP model in detail. Local interfaces are thoroughly discussed as well. Local interfaces allow beans that are co-located to interact without the overhead of remote method calls. This improves the performance of beans considerably and complements the CMP relationship fields. Message driven beans are a new kind of enterprise bean based on asynchronous messaging and the Java Message service (JMS). Instead of responding to Java RMI calls, message driven beans process JMS messages sent by messaging clients.An entire chapter is devoted to message-driven beans and how to use them effectively. In addition, the 3rd edition contains an architecture overview, information on resource management and primary services, design strategies, and XML deployment descriptors.
A robust two step approach for fingerprint identification
Authors: Xuejun Tan, Bir Bhanu
Venue: Pattern Recognition Letters (2003)

Due to the complex distortions involved in two impressions of the same finger, fingerprint identification is still a challenging problem. In this paper, we propose a two step fingerprint identification approach based on the triplets of minutiae. The features that we use to find the potential corresponding triangles include angles, triangle orientation, triangle direction, maximum side, minutiae density and ridge counts. In the first step, based on the number of corresponding triangles between the query fingerprint and the model database constructed offline, hypotheses are generated. In the second step, called verification, false corresponding triangles are eliminated by applying constraints to the transformation between two potential corresponding triangles. The experimental results on National Institute of Standards and Technology special fingerprint database 4, NIST-4, show that the proposed approach provides a reduction by a factor of 10 for the number of the hypotheses that need to be considered if linear search is used and can achieve a good performance even when a large portion of fingerprints in the database are of poor quality.
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Authors: Sriram Ramabhadran, Joseph Pasquale
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Fair queuing is a well-studied problem in modern computer networks. However, there remains a gap between scheduling algorithms that have provably good performance, and those that are feasible and practical to implement in high speed routers. In this paper, we propose a novel packet scheduler called Stratified Round Robin, which has low complexity, and is amenable to a simple hardware implementation. Stratified Robin Robin exhibits good fairness and delay properties that are demonstrated through both analytical results and simulations. In particular, it provides a single packet delay bound that is independent of the number of flows. This property is unique to Stratified Round Robin among all other schedulers of comparable complexity.
Developing Web Services with Java APIs for XML Using WSDP
Authors: Jay Foster, Natalie Wear, Mike Porter, Mick Porter, Jerry Foster
Venue:  (2002)

:Since Web Services are interdependent, developers must be well versed in all areas to capture their true power and flexibility. Developing Web Services with Java APIs for XML (JAX Pack) offers these developers exhaustive coverage of Sun's JAX Pack, a significant product release that will enable the development of Web services using Java. Written for experienced Java developers with a solid understanding of XML, the book features five parts covering each component of JAX Pack: JAXP, JAXR, JAXM, JAXB, and JAX-RPC.