ppxscal/embedding_network huggingface dataset:
Integrating a Flexible Modeling Framework (FMF) with the Network Security Assessment Instrument to Reduce Software Security Risk
Authors: David P. Gilliam, John D. Powell
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

The network security assessment instrument is a comprehensive set of tools that can be used individually or collectively to ensure the security of network aware software applications and systems. Using the various tools collectively provide a distinct advantage for assuring the security of software and systems. Each tool's resulting output provides feedback into the other tools. Thus, more comprehensive assessment results are attained through the leverage each tool provides to the other when they are employed in concert.Previous portions of this work were presented at the IEEE Wet Ice 2000 and 2001 Workshops and are printed in those proceedings.This paper presents a portion of an overall research project on the generation of the network security assessment instrument to aid developers in assessing and assuring the security of software in the development and maintenance lifecycles. This portion, the FlexibleModeling Framework (FMF), focuses on modeling requirements and early lifecycle designs to discover vulnerabilities that result from interaction between system components that are either under development in a new system or proposed as additions to an existing system. There are early indications that this new approach, the Flexible Modeling Framework (FMF), has promise in the areas of network security as well as other critical areas such as system safety.Information about the overall research effort regarding network security is available at http://security.jpl.nasa.gov/rssr.
Supporting Manufacturing Process Analysis and Trouble Shooting with ACTS
Authors: Michelle Potts Steves, Wo Chang, Amy J. Knutilla
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

This paper presents a National Institute of Standards and Technology (NIST) prototype tool called ACTS (Annotation Collaboration Tool via SMIL - Synchronized Multimedia Integrated Language), which was designed to meet the user requirements of a distributed, collaborative team performing remote analysis of robotic welds. Based on open standards such as W3C (World Wide Web Consortium) SMIL, ACTS provides a framework of temporal and spatial synchronization for multimedia data streams. An annotation facility provides for asynchronous collaboration among colleagues. ACTS uses the NIST-developed S2M2 [2] Java applet-based SMIL player that implements and extends the SMIL 1.0 specification. Future work is also discussed.
Tapping Alert Protocol
Authors: Gookwhan Ahn, Kwangjo Kim, Hee Yong Youn
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

This paper proposes a new protocol called tapping alert protocol (TAP), which detects if any computer is eavesdropping on the network. When tapping is detected, it alerts the network users on the danger of tapping. In designing the protocol, a model for an attacker is developed who sniffs the network and breaks down the proposed protocol, and the requirements on the protocol in terms of efficiency and security are defined. We also describe how to detect if a network interface card on a remote computer is in the sniffing mode. The proposed protocol employs cryptographic schemes to guarantee authentication of the code monitoring tapping operation and integrity of the data being sent. Finally, the proposed protocol can protect authorized users from illegal eavesdropping on the network.
Extended Minimal Routing in 2-D Meshes with Faulty Blocks
Authors: Jie Wu, Zhen Jiang
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, several enhanced sufficient conditions are given for minimal routing in 2-dimensional (2-D) meshes with faulty nodes contained in a set of disjoint faulty blocks. It is based on an early work of Wu's minimal routing in 2-D meshes. Fault information is coded in a 4-tuple called extended safety level associated with each node to determine the feasibility of minimal routing. Specifically, we study the existence of minimal route at a given source nodebased on the associated extended safety level, limited distribution of faulty block information, and minimal routing. An analytical model for the number of rows and columns that receive faulty block information is also given. Extensions to Wang's minimal-connected-components (MCCs) fault model are also considered. Simulation results show substantial improvement in terms of higher percentage of minimal routing in 2-D meshes under both fault models.
A Flexible Architecture for Collaborative Browsing
Authors: Guillermo de Jesús Hoyos-Rivera, Roberta Lima-Gomes, Jean-Pierre Courtiat
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Collaborative Browsing is a new and promising research area whose purpose is to provide new collaboration schemes among users browsing the Web.To become an efficient collaboration tool, Collaborative Browsing should go far beyond a simple mechanism for coordinating the browsing of Web pages (like Web tours) and should include, in a integrated framework, awareness and communication facilities.A general functional architecture of a Collaborative Browsing system is presented in the paper. It relies on a rule-based system that permits to precisely express the browsing and communication strategies among users of a collaborative session. The proposed architecture is therefore general-purpose. By defining the policy rules specifying the behavior of a collaborative session, it may be easily adapted to specific applications in the e-Learning or e-Business domains.The general architecture of CoLab, a Java-based software environment implementing the proposed Collaborative Browsing system is introduced, and the features of its first operational version are presented in some details (CoLab 1.0).
Design and Evaluation of a Distributed Multimedia Synchronization Algorithm using Media Scalings and Variable Service Rates
Authors: Ihn-Han Bae, Sun-Jin Oh, Mukesh Singhal
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper presents a distributed multimedia synchronization algorithm that supports both intramedia and intermedia Synchronizations. The intramedia synchronization is achieved by media scaling techniques, and the intermedia synchronization is achieved by variable service rates. We compute the check period of media buffer and the scaling duration for intramedia synchronization, and compute the comparison period between master media's and slave media's relative time stamps for intermedia synchronization. We also evaluate our algorithm through simulations. Simulation results show that our algorithm performs well in both intramedia and intermedia synchronizations.
Establishing Affinity Relationships toward Agents: Effects of Sympathetic Agent Behaviors toward Human Responses
Authors: Yugo Takeuchi, Yasuhiro Katagiri
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

People tend to favor the opinions of those who previously made the same decisions as theirs. We conducted an experiment to investigate the effect of sharing opinions with interface agents on subsequent human behaviors. Three agents with distinctive appearances were used in the experiment. In the first stage, several questions are posed to a subject by the Presider agent, and the Agreeable agent shows explicit agreement to all of the answers by the subject, whereas the Neutral agent doesn't show any agreement. Then, in the second stage, both the Agreeable and Neutral agents state their own opinions to a question by the Presider agent, and the subject is required to choose between the two. All possible assignments (six patterns) of the roles of Presider, Agreeable and Neutral to the three agents were included in the experiment to exclude the possibility of decisions based on subjects liking a particular agent's appearance. The Agreeable agent was consistently in favor of the subject's decisions. We examined how the subject indicates sympathetic responses to the Agreeable agent after he/she interacts with agents. The results showed that people tend to behave favorably toward opinions of agents that previously agreed with their decisions. This suggests that Human-Computer interaction has the same social dynamics as Human-Human interaction.
Using NFS to Implement Role-Based Access Control
Authors: Mats Gustafsson, Benoit Deligny, Nahid Shahmehri
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Presents a design for a modified NFS (Network File System) server that, through simple additions, makes it possible to place an exported file system under role-based access control (RBAC). RBAC is an efficient way for managing access control information. However, most access control systems today do not support RBAC. As a solution to this problem, the modified NFS server we present in this paper makes it possible to introduce RBAC into existing environments in a transparent manner. We have implemented our design as an extension to the Linux User Space NFS Server running on a Linux 2.0 system. Our implementation demonstrates the feasibility of our main idea. However, tests show that performance of our server needs to be improved, something we believe can be achieved through code optimizations.
Adaptive Checkpointing for Time Warp Technique with a Limited Number of Checkpoints
Authors: Ryo Suzuki, Satoshi Fukumoto, Kazuhiko Iwasaki
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper discusses distributed checkpointing with "Time Warp techniques", a typical uncoordinated check-pointing technique that is often used in the parallel and distributed simulations. Relaxing the assumption of the previous model of Soliman et al., we show a discrete time model where the number of available checkpoints each process can hold is finite. In addition, we propose an adaptive distributed checkpointing technique, that gives an effective time arrangement of checkpoints for a recovery point distribution, and we give numerical examples.
The Role of XML in Generic and Distributed Multimedia Management
Authors: Gábor Szentiványi
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Multimedia document management is an emerging topic, since the quantity and diversity of documents to be managed at either enterprise or global scope is ever increasing. Current approaches are based on mark-up scripts. While mark-up scripts possess several advantages in the simplicity of representation and interchange of structured documents among loosely coupled systems, what they originally have been created for. They prove to have disadvantages when applying them as "silver bullet" for distributed data or object modeling, especially for generic multimedia management.In this paper we first describe the deficiencies arising from the notion mentioned above, then we present a generic approach to alleviate those deficiencies. After that, we describe the realization of the generic approach using a model and an architecture. Then, we show the integration of markup scripts into the concept presented here.
An XML-Based Dynamic Network Management System Using Web Technology
Authors: Kwoun Sup Youn, Choong Seon Hong
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

We propose an efficient mechanism that is used to manage network with XML. It is an XML-based Dynamic network management system using Web. We describe a paradigm for the retrieval and presentation of management data using XML. It facilitates runtime agent extension and allows the MIB to be easily browsed and seamlessly integrated with online documentation. XML also allows the interchange of data between management systems .In this paper, we propose an XML -based Dynamic network management architecture using Web. The proposed architecture is implemented using Java and its push technology for the management of IP network.
Maximising Concurrency and Scalability in a Consistent, Causal, Distributed Virtual Reality System Whilst Minimising the Effect of Network Delays
Authors: David J. Roberts, Paul M. Sharkey
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: The development of large scale virtual reality and simulation systems have been mostly driven by the DIS and HLA standards community. A number of issues are coming to light about the applicability of these standards, in their present state, to the support of general multi-user VR systems. This paper pinpoints four issues that must be readdressed before large scale virtual reality systems become accessible to a larger commercial and public domain: a reduction in the effects of network delays; scalable causal event delivery; update control; and scalable reliable communication. Each of these issues is tackled through a common theme of combining wall clock and causal time-related entity behaviour, knowledge of network delays and prediction of entity behaviour, that together overcome many of the effects of network delays.
C2AS: A System Supporting Distributed Web Applications Composed of Collaborating Agents
Authors: Anthony I. T. Rowstron, Sheng Feng Li, R. Stefanova
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

In this paper we describe the Cambridge Collaborative Agent System (C2AS). This is a prototype system designed to demonstrate the functionality and basic architecture of a framework for co-ordination between different components (or agents) of distributed `Web' applications. Co-ordination in C2AS is achieved through the use of tuple spaces, as used in Linda. However, the access primitives used in C2AS are not those used by Linda, but the {\sc Bonita} primitives, which provide asynchronous access to tuple spaces as opposed to synchronous access. Because C2AS is tuple space based it supports temporal and spatial separation of agents. The prototype system supports agents written in either Java (including applets) or C.
The TuCSoN Coordination Infrastructure for Virtual Enterprises
Authors: Alessandro Ricci, Andrea Omicini, Enrico Denti
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Virtual Enterprises (YE) and Workflow Management Systems (WFMS) require deployable and flexible infrastructures, promoting the integration of heterogenous resources and services, as well as the development of new YE's business processes in terms of workflow (WF) rules coordinating the activities of YE's component enterprises. In this paper; we argue that a suitable general-purpose coordination infrastructure may well fit the needs of YE management in a highly dynamic and unpredictable environment like the Internet, by providing engineers with the abstractions and run-time support to address heterogeneity of different sorts, and to represent WF rules as coordination laws. We discuss the requirements for YE infrastructures, and suggest why YE management and WFMS may be seen as coordination problems. Then, we introduce the TuCSoN coordination model and technology, and show, both in principle and in a simple case study, how such a coordination infrastructure can support the design and development of YE's WFMS.
Nokia Requirements and User Story for the Project MOTION
Authors: Katja Nykänen, Mikko Tarkiainen
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Nokia is a globally distributed company. It has many sites in Europe, Americas and Asia. This means that in many cases also the development teams are distributed. This paper explains the problems that exist among the distributed teams concerning the selected target case andintroduces the objectives and the requirements that Nokia had concerning the project MOTION. Also, the user story and the process for evaluating the implementation are discussed.
Abrose: An Adaptive Multi-Agent Tool for Electronic Commerce
Authors: Jo Link-Pezet, Pierre Glize, Marie Pierre Gleizes
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

The concept of Electronic Service Brokerage is based on the use of new information technologies to provide a service capable of facilitating and organizing the relationship between customers and offers providers. In this paper, a framework for Electronic Brokerage Service based on the emerging agent technology is presented. The first part of this article presents the requirements for electronic brokerage and the basic principles of the multi-agent used in Abrose. In the second part, we show the functionality of the Transaction Agents, which represent the users inside the broker domain of Abrose. In the last part, we evaluate the dynamic properties of the user profile and belief network managed by each Transaction Agent. This electronic brokerage service will be applied in three business domains (Tourism, Trading and Teleworking). It covers the following features: the collaborative agents for self-organizing multi-agent systems, the multi-agent system for knowledge representation of the market place domain, the dynamic knowledge for a domain knowledge evolution.
LifeMinder: A Wearable Healthcare Support System Using User's Context
Authors: Kazushige Ouchi, Takuji Suzuki, Miwako Doi
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper introduces a prototype of wearable health-care support system LifeMinder', which consists of a wristwatch-shaped wearable sensor module and a personal digital assistant (PDA). The wearable sensor module, equipped with sensors of accelerometer, pulse meter,thermometer, galvanic skin reflex (GSR) electrodes and Bluetooth module to communicate with the PDA, monitors the user's context: health conditions, movements and behaviors. The system uses this information to guide the user in daily self-care in real time. Diet care and exercise care are especially significant to prevent the "lifestyle-related disease". The authors developed algorithms to recognize the user's movement from wrist motion and to detect thebeginning of a meal from pulse rates and GSR values. The accuracy of both algorithms is about 90%.
Infinite Length Hash Chains and Their Applications
Authors: Kemal Bicakci, Nazife Baykal
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Hash Chains are used extensively in various cryptography applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called Infinite Length Hash Chains to improve the flexibility of this chaining idea by using public-key techniques. One of its distinguishing features is that communication and computation overhead of restarting of the system is avoided. For the owner of the chain it is possible to go in either way in the chain at any time without any restriction in the chain length, but others see no difference as the functionality it provides with respect to traditional hash chains. On the other hand the drawback here is the increased computation cost due to public-key operations. Part of our work would be considered as one additional step after traditional one-time passwords in the natural progression from fixed password schemes to challenge-response identification protocols.
Using Innovation Diffusion Theory to Guide Collaboration Technology Evaluation: Work in Progress
Authors: Diane H. Sonnenwald, Kelly Maglaughlin, Mary C. Whitton
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Cost effective development of collaboration technology requires evaluation methods that consider group practices and can be used early in a system's life-cycle. To address this challenge we developed a survey to evaluate collaboration technology based on innovation diffusion theory by E. Rogers. The theory proposes five attributes of innovations that influence technology adoption: relative advantage, compatibility, complexity, trialability and observability. Selecting items from existing surveys related to these attributes, we developed a prototype multi-scale survey to help evaluate whether using a system face-to-face or distributively influences study participants' attitudes towards system adoption. We have begun refining the survey instrument and report on this process, the proposed survey questions, and the reliability and validity of the survey instrument.
Progressive HTML for Proximate and Automatic Interactions
Authors: Arnaud Troël, Michel Banâtre, Frédéric Weis
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Development and projections in the field of PDAs and wireless communication architectures let us consider new applications which exploit short range and direct exchanges. In a close future we may imagine mobile users equipped with wireless PDAs dynamically and spontaneously exchanging rich information in an ad hoc manner. In such a context, a connection between two PDAs may be broken at any time because of the short communication range and the unconstrained mobility of the users. Thus, such spontaneous data exchanges become a real challenge. To perform spontaneous and relevant transmissions compatible with these volatile connections, we propose a method that progressively downloads information according to its importance. Then, we show an implementation of such a mechanism in a Web context by extending the actual browsers capabilities.
A Data Placement Strategy on MZR for VOD Servers
Authors: Jeong-Won Kim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

The numbers of concurrent users in VOD servers mainly depend on the disk placement strategies of video blocks. Especially, the storage server should make the most of MZR(multi-zone recording)disks* characteristics. The variable transfer rates and capacity in zones feature the MZR disk, so the outward zones have more transfer rate and capacity than inward zones. Also, Users* access pattern concentrates on the popular videos. So, If the popular video blocks are placed at the outward zones, the number of concurrent users can be increased. In this paper, we present the popularity-based variable way placement strategy for disk groups(PVW) based on the LP and the SHP. The PVW aims to effectively support popular streams of high access rates without additional storage capacity. The more popular video blocks are to be placed in all disk groups to utilize the total bandwidth of storage subsystem, and the less popular video blocks are to be placed in the small disk groups. By the simulation study, we found that more users could be supported by this strategy.