ppxscal/embedding_network huggingface dataset:
TCP Selective Acknowledgments and UBR Drop Policies to Improve ATM-UBR Performance over Terrestrial and Satellite Networks
Authors: Rohit Goyal, Raj Jain, Shivkumar Kalyanaraman, Sonia Fahmy, Bobby Vandalore, Sastri Kota
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We study the performance of Selective Acknowledgments with TCP over the ATM-UBR service category. We examine various UBR drop policies, TCP mechanisms and network configurations to recommend optimal parameters for TCP over UBR. We discuss various TCP congestion control mechanisms compare their performance for LAN and WAN networks. We describe the effect of satellite delays on TCP performance over UBR and present simulation results for LAN, WAN and satellite networks. SACK TCP improves the performance of TCP over UBR, especially for large delay networks. Intelligent drop policies at the switches are an important factor for good performance in local area networks.
Automatic 2-D Gel Registration Using Distance Minimization of Image Morphing
Authors: Bruno Josso, Egor Zindy, Hatice Aldemir
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The necessity of applying image processing techniques to gel electrophoresis images is starting to appear. In particular, registering two gels for comparison purposes has emerged from the increasing popularity of gel databases distributed across the Internet. Current registration techniques are however cumbersome in the sense that they require user intervention for placing landmarks on both gels in order to define a mapping function. Current techniques also cannot account for distortions, which are common to 2-D gels and non-reproducible by nature.Thus, the only method of choice is to make a side-by-side comparison of the gels. In this paper, we propose an automatic registration method especially designed with electrophoresis gels in mind to give an optimal registration while still allowing human input. We think that an automated registration of 2-D gels, because of its non-intrusive nature, will lead to a wider acceptance of image vision technology in electrophoresis gel software. Potentially, other types of biomedical images could benefit from the technique.
IDEA: Integrated Design Environment for Assessment of ATM Networks.
Authors: R. Fricks, S. Hunter, S. Garg, K. Trivedi
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

With the increased attention ATM is receiving to meet the needs of a wide variety of applications, tools are needed to help a network designer focus on the design at hand, rather than to spend time exhaustively learning the tools themselves. This is the concept behind IDEA. This paper introduces ``modeling engines'' chosen to be integrated into IDEA and presents a user interface for networking design. The first objective for IDEA is to demonstrate its usefulness for dependability modeling. Later objectives include incorporating performance and performability modeling.
Concurrency Admission Control Management in ACCORD
Authors: Sue Nagy, Azer Bestavros
Venue:  (1997)

Abstract We propose and evaluate admission control mechanisms for ACCORD, an Admission Control and Capacity Overload management Real-time Database framework---an architecture and a transaction model---for hard deadline RTDB systems. The system architecture consists of admission control and scheduling components which provide early notification of failure to submitted transactions that are deemed not valuable or incapable of completing on time. In this paper, we focus on our Concurrency Admission Control Manager (CACM), which ensures that admitted transactions do not overburden the system by requiring a level of concurrency that is not sustainable. The transaction model consists of two components: a primary taskand a compensating task. The execution requirements of the primary task are notknown a priori, whereas those of the compensating task are known a priori. Upon the submission of a transaction, the Admission Control Mechanismsare employed to decide whether to admitor rejectthat transaction. Once admitted, a transaction is guaranteed to finishexecuting before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its compensating task is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. In that respect, we describe a number of concurrency admission control strategies and contrast (through simulations) their relative performance.
Integration of Semistructured Data with Partial and Inconsistent Information
Authors: Mengchi Liu, Tao Guan, Tok Wang Ling
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Data integration of several sources has gained considerable attentions with the recent popularity of the Web. In the real world, some information may be missing (i.e., partial) and some may be inconsistent from several sources. How to obtain information as complete as possible and detect inconsistency from these sources is thus an interesting question. Most existing work uses a simple graph-based or tree-based semistructured data model to represent heterogeneous data coming from various sites, which fail to account for the existence of partial and inconsistent information. In this paper, we redefine the notion of semistructured objects to reflect the existence of partial and inconsistent information and study how to integrate such objects spread in various sources and check consistency in the meantime. We propose a new operator integration for this purpose and discuss its semantic properties.
Use of New Information Technologies in LAN's Designing
Authors: L. G. Komartsova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Intelligence Decision Support Systems (IDSS) creation problems during the local area networks (LAN's) design are investigated in the work. On the basis of the comparative analysis of the traditional and new information technologies possibilities the IDSS structureallowing to solve posed tasks is proposed. 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 ATM Adaptation Layer for Reliable Transfers
Authors: Gunnar Karlsson
Venue:  (1996)

There has been much attention given to ATM Adaptation Layers (AAL) over the ten-year history of ATM standardization. Yet none of the existing standards include a retransmission protocol to ensure reliability of the transfers. In this paper we propose an AAL for doing selective retransmissions of individual segments that have been lost or corrupted in the transfer. Since the amount of retransmitted data equals the amount lost, there is little risk of aggravating congestion and the reliability is provided as economically as possible, which is a virtue for low-capacity radio links. The protocol relies on the orderly delivery of ATM virtual circuits so that data octets can be identified uniquely by their location in the data stream.
An Empirical Study of Task Support in 3D Information Visualizations
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

There is still little knowledge about what factors are important for the usability of a 3D user interface. We have performed a comparative study of three 3D information visualizations as a step towards a better understanding of this. The study involved 25 volunteer subjects, performing three different tasks with the Information Landscape, Cam Tree, and Information Cube. The results of the study indicate that the subjects were significantly faster with the Information Landscape when compared with both other visualizations. The Cam Tree was significantly faster than the Information Cube. Our observations during the study indicate that local and global overview are extremely important factors. We also observed that custom navigation is crucial in 3D user interfaces. Finally, the study raises the question: "For what types of tasks is a 3D user interface best suited?"
Internet-Marks: The Secure Seal for WWW Site Authentication
Authors: S. Honjo, S. Susaki, H. Yoshiura, H. Aoshima, S. Tezuka, R. Sasak, T. Saito, H. Toyoshima
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper describes a seal that is secure enough that both the seal and the Web page contents are protected from forgery. It also enables the copying of the Web contents to an unauthorized site to be detected. This paper explains the Internet-Marks and compares their security and speed with those of conventional seal methods.
Formal specification of dynamic constraints with the B method
Authors: H. Habrias, B. Griech
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

Deals with the formal specification of dynamic constraints. First of all, we introduce two dynamic constraints which we formally characterise using the B formal specification method. These two dynamic constraints, namely the faithfulness and existence dependency of a binary relationship, are defined using the three mathematical bases of B, viz. predicate logic, set theory and substitution theory. Moreover, we provide for each constraint what is called a proof obligation against which the system's operation specifications must be checked in order to determine whether or not they obey the constraint. This study has raised a general methodology for supporting the specification of a particular type of dynamic constraints in B. The outline of this methodology is presented. We finally show that the constraints we proposed have real-life applications and especially for formally defining the concept of composition in UML (Unified Modeling Language) as an example.
A 3D Interface for the Administration of Component-Bases, Distributed Systems
Authors: Oliver Stiemerling, Michael Hallenberger, Armin B. Cremers
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The success of an enterprise depends on its ability to effectively adapt to changing external requirements. This is particularly true in the rapidly evolving world of eCommerce-which raises the challenge of building software systems that are flexible enough to support such a dynamic business environment. At ISADS '99 we presented the EVOLvE runtime- and tailoring environment as a platform for extensively adaptable autonomous and decentralized systems. The platform provides a high degree of flexibility by maintaining the (possibly rather fine-grained) component-structure of such systems. One can--during runtime and in a decentralized fashion--add, exchange, or rewire an application's components to meet changing external requirements. While the EVOLVE platform provides the mechanisms to perform these changes, there remains the problem of providing an administration interface to these mechanisms. Like many autonomous and decentralized systems, EVOLVE applications can have great complexity and structural detail. The interface has to present these details in an appropriate and scalable form, permitting the administrator to quickly grasp the overall distribution structure, but also the functional details and fine-grained components. In this paper we argue that 3D visualization and manipulation techniques provide a good basis for the design of administration interfaces for complex, decentralized systems. We support our argument by presenting a 3D interface for the EVOLVE platform and discuss the more general design concepts it embodies. We believe that these concepts are relevant and applicable to other autonomous and decentralized systems.
Recognition of Courtesy Amounts on Bank Checks Based on a Segmentation Approach
Authors: L. Q. Zhang, C. Y. Suen
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

A segmentation based courtesy amount recognition (CAR) system is presented in this paper. A two-stage segmentation module has been proposed, namely the global segmentation stage and the local segmentation stage. At the global segmentation stage, a courtesy amount is coarsely segmented into sub-images according to the spatial relationships of the connected components. These sub-images are then verified by the recognition module and the rejected sub-images are sequentially split using contour analysis at the local segmentation stage. Two neural network classifiers are combined into a recognition module. The isolated digit classifierdivides the input patterns into ten numeral classes ('0'-'9'), while the holistic double zeros classifier recognizes the cursive and touching double zeros. Experimental results show that the system reads 66.5% bank checks correctly at 0% misreading rate.
Black-Box Understanding of COTS Components
Authors: Bogdan Korel
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

Developers have to identify properties of COTS components to properly integrate them with a system under development, but COTS components are typically "black boxes" because their source code is not available. In this paper we present an approach that can be used in black-box understanding of COTS components. The major objective is to reduce the effort required to reveal component properties by partially automating interface probing. A developer provides a full, or partial, description of a component property together with a search scope where assertions are used to describe component properties. Based on this information, a search engine automatically searches for component inputs on which the component property is revealed using a combination of existing automated test generation methods for black-box testing and for white-box testing. Our initial experience has shown that this approach may be a cost-effective way of revealing properties of components.
An Adaptive Nonlinear Least-Squares Algorithm
Authors: John E. Dennis,  Jr., David M. Gay, Roy E. Welsch
Venue:  (1977)

NL2SOL is a modular program for solving nonlinear least-squares problems that incorporate a number of novel features. It maintains a secant approximation S to the second-order part of the least-squares Hessian and adaptively decides when to use this approximation. S is "sized" before updating, something which is similar to Oren-Luenberger scaling. The step choice algorithm is based on minimizing a local quadratic model of the sum of squares function constrained to an elliptical trust region centered at the current approximate minimizer. This is accomplished using ideas discussed by More'', together with a special module for assessing the quality of the step thus computed. These and other ideas behind NL2SOL are discussed and its evolution and current implemetation are also described briefly.
Szemeredi''s Regularity Lemma and its applications in graph theory
Authors: Janos Komlos, Miklos Simonovits
Venue:  (1995)

Szemer\''edi''s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps in proving theorems for arbitrary graphs whenever the corresponding result is easy for random graphs. Recently quite a few new results were obtained by using the Regularity Lemma, and also some new variants and generalizations appeared. In this survey we describe some typical applications and some generalizations.
I-Centric Services Based on Super Distributed Objects
Authors: Stephan Steglich, Raju N. Vaidya, Olga Gimpeliovskaja, Stefan Arbanowski, R. Popescu-Zeletin, Shigetoshi Sameshima, Katsumi Kawano
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The vision of pervasive computing and communication will shape the individual life in the future. Following this vision, the goal of I-centric Services based on Super Distributed Objects' is to provide seamless computing environment on the basis of users' individual communication spaces. It controls and manages large numbers of autonomous and decentralized objects (Super Distributed Objects), in individual living or working spaces providing services that can adapt to users' individual requirements (I-centric Services). This paper introduces the I-centric Communications approach and identifies the requirements and design of Super Distributed Objects as the paradigm for future pervasive and autonomous systems. Results of this project have been adopted by the World Wireless Research Forum (WWRF) and Object Management Group (OMG).
Supporting Distributed Applications on Advanced Communication Networks
Authors: Alexander Schill, Tino Hutschenreuther
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Distributed applications are of growing importance in many application fields such as office automation, manufacturing, telematics or information services. This paper outlines support facilities for such applications based on distributed platforms. It then discusses further requirements resulting from the use of advanced network technologies. Architectural support for such environments is presented, and experiences with specific software support solutions are discussed. As an application example, workflow processing in distributed environments is used in order to illustrate the approaches. The paper concludes with an outlook to future work.
Multi-Granularity Locking for Nested Transaction Systems: Proof Using a Possibilities Mapping
Authors: Kyu L Lee, Alan Fekete
Venue:  (1993)

The choice of granularity for locking items in a database involves performance tradeoffs. In order to provide a choice between different locking granularities within a single system, the two-phase locking algorithm needs to be modified to include intention locks. This paper extends the well-known multi-granularity locking algorithm of Gray et al. to deal with nested transactions, and verifies the correctness of the extended algorithm, using a possibilities mapping to abstract commutativity-based locking.
Synchronizing Resources
Authors: Gregory R. Andrews
Venue:  (1978)

A new proposal for synchronization and communication in parallel programs is presented. The proposal, called synchronization resources, combines and extends aspects of procedures, coroutines, monitors, communicating sequential processes, and distributed processes. It provides a single notation for parallel programming with or without shared variables and is suited for either shared or distributed memory architectures. The essential new concepts are operations, input statements, multiple processes and resources. The proposal is illustrated by solving a variety of parallel programming problems. Key Words and Phrases: parallel programming, processes, synchronization, process communication, monitors, distributed processing, programming languages, operating systems, data bases. CR Categories: 4.20, 4.22, 4.32, 4.35
Scenario-Based Service Composition Method in the Open Service Environment
Authors: Kazuhiro Kiwata, Atsushi Nakano, Shunsuke Yura, Tomotaka Uchihashi, Atsushi Kanai
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Since most services on the Internet are mutually independent, users have trouble accessing several services to achieve a single purpose. For example, if a user wants to travel to Paris and Berlin, he/she has to access several hotel reservation services and airline reservation services. Solving this problem requires service composition technology, which constructs a composite service called a one-stop service by combining several independent services. Essential for service composition are one-stop service provisioning and collaboration technologies. One-stop service provisioning technology identifies services on the net that satisfy a user's needs and combines those independent services into a single service, and collaboration technology controls the one-stop service flow. In this paper, we propose a scenario-based service composition method to achieve one-stop services on the Internet using distributed object-oriented technology and workflow technology.
Nonlinear Control of Engineering Systems
Authors: Warren E. Dixon, Aman Behal, Darren M. Dawson, Siddharth P. Nagarkatti
Venue:  (2002)

:Nonlinear Control of Engineering Systems is a research monograph on Lyapunov-based control design and analysis techinques for nonlinear systems. The basic idea is to illustrate how recent Lyapunov-based techniques can be utilized to develop control designs for nonlinear systems including: mechanical systems, electrical systems, robotic systems, aerospace systems, and underactuated systems. The introduction presents: (i) motivation for the Lyapunov-based design and analysis techniques, (ii) an overview of the book, (iii) some simple examples as an aid to the less experienced reader. The book presents a complete and detailed theoretical treatment of the stated control objective, and contains a detailed description of the experimental testbed and the results obtained by implementing the developed control algorithms. The experimental results will serve to complement the theoretical content of the book by: (i) demonstrating the feasibility of implementing "complex" nonlinear control algorithms with current computational hardware, (ii) guiding the reader towards adapting these techniques to his/her own needs or for further research, and (iii) bridging the gap between theoretical design and analysis and real-time implementation.
Simple Collusion-Secure Fingerprinting Schemes for Images
Authors: Josep Domingo-Ferrer, Jordi Herrera-Joancomartí
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper describes a robust watermarking algorithm and a collusion-secure fingerprinting scheme based on it. Watermarking robustness is obtained by using the JPEG algorithm to decide mark location and magnitude; the proposed algorithm supports multiple marking. The properties of dual binary Hamming codes are exploited to obtain a fingerprinting scheme secure against collusion of two buyers. The fingerprinting construction proposed here is simpler than previous collusion-secure proposals.
Recognizing emotion from dance movement: comparison of spectator recognition and automated techniques
Authors: Antonio Camurri, Ingrid Lagerlöf, Gualtiero Volpe
Venue: International Journal of Human-Computer Studies (2003)

This paper illustrates our recent work on analysis and classification of expressive gesture in human full-body movement and in particular in dance performances. An experiment is presented which is the result of a joint work carried out at the DIST-InfoMus Lab, University of Genova, Italy, and at the Department of Psychology of the University of Uppsala, Sweden, in the framework of the EU-IST project MEGA (Multisensory Expressive Gesture Applications, www.megaproject.org). The experiment aims at (i) individuating which motion cues are mostly involved in conveying the dancer's expressive intentions to the audience during a dance performance, (ii) measuring and analyzing them in order to classify dance gestures in term of basic emotions, (iii) testing a collection of developed models and algorithms for analysis of such expressive content by comparing their performances with spectators' ratings of the same dance fragments. The paper discusses the experiment in detail with reference to related conceptual issues, developed techniques, and obtained results.