ppxscal/embedding_network huggingface dataset:
Research and Implementation of Mobile Ad Hoc Network Emulation System
Authors: Weiguo Liu, Hantao Song
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Emulation is an efficient method in mobile Ad Hoc network research, which provides a good approach to accurately evaluate the MANET routing protocol large scale. In this paper, we describe the modeling and implementation of a new low cost MANET emulator called NE based on Ethernet environment. NE provides mobile multi-hop wireless emulation including incomplete connectivity, random frame loss, bandwidth limitation and communication delay. NE is suitable for middle scale MANET emulation where the number of nodes is about one hundred.
QEM: A Scheduling Method for Wireless Broadcast Data
Authors: Yon Dohn Chung, Myoung-Ho Kim
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

In mobile distributed systems the data on air can be accessed by a large number of clients. This paper describes the way clients access the wireless broadcast data in short latency. We define and analyze the problem of wireless data scheduling. And we propose a measure, named QueryDistance(QD), which represents the degree of coherence for the data set accessed by a query. We give a practically usable method named QEM which constructs the broadcast schedule by expanding each query's data set in greedy way. We also evaluate the performance of our method by experiments.
An Interactive Classification of Web Documents by Self-Organizing Maps and Search Engines
Authors: Kenji Hatano, Ryouichi Sano, Yiwei Duan, Katsumi Tanaka
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

In this paper, we propose an effective classification view mechanism for hypertext data such as web documents based on Kohonen's Self-Organizing Map (SOM) and search engines. Web documents collected by search engines are automatically classified by SOM and the obtained SOMs are incrementally modified according to the interaction between users and SOMs. At present, various search engines are designed to retrieve web documents. When we use search engines to retrieve web documents, we get a lot of answers as ever before, so we have a lot of labors to examine each web document. Therefore, in order to make up for search engines, we need a function to classify web document corresponding to the user's point of view and their purposes. Furthermore, we cannot retrieve pertinent web documents by conventional search engines when a specific topic is described by more than one web document. To solve these problems, we exploited a content-based clustering system for web documents. In this system, web documents are automatically clustered by their feature vectors produced from web documents or minimal subgraphs consisting of multiple web documents, and their overview maps are dynamically generated by SOM. Furthermore, we propose a method by which an obtained SOM is modified by user's interaction such as feedback operations. It is important to reflect the aim of classification and the purpose of retrieval to this system. In our research, we intend to solve these problems by providing a view mechanism in which the Basic Units for retrieval and clustering of Web Documents (BUWDs) are changeable by users and relevance feedback operations enable the generation of an overview map which reflects user needs.
FRAGTIQUE: An OO Distribution Design Methodology
Authors: Marinette Savonnet, Marie-Noëlle Terrasse, Kokou Yétongnon
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

We present an OO distribution design methodology based on a ponderated graph called Class Dependency Graph (CDG) which captures structural relationships and queries usage frequencies of an OO database.We characterize and select a set of methods for which parallel execution can be optimized. These methods determine the partitioning strategy and are used to partition the CDG into a set of partition trees representing a group of co-referenced classes which must be partitioned together.We define clustering strategy and flow measures which are used: 1) to evaluate the quality of the fragmentation process, 2) as a metric for the allocation pre-treatment which is based on a distance strings algorithm.
Establishing Rules and Conventions for the Infrastructure: The 'Tragedy of the Unmanaged Commons' as a Determinate Factor
Authors: Rob Reilly, Barry Kort
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

As computer networks become "the media through which more and more public discourse takes place, the ways in which that discourse is socially organized becomes more consequential." [Kollock and Smith 1994]. It would seem prudent to consider addressing the issues of social interaction and social behavior on the network based upon the concept of Hardin's "tragedy of the commons" [Hardin, 1968] in which he described a group of herders having open access to a common parcel of land--known as the Common (or town common)--on which they could let their cows graze. It is in each herder's interest to put as many cows as possible onto the common, even if the common is damaged as a result. The herder receives all the benefits from the additional cows and the entire group shares the damage to the common. Yet if all herders make this individually reasonable decision the commons is destroyed and all will suffer. Hardin's model when coupled with a foundational understanding of the structure, function, and purpose of any online electronic mechanism will prove to be a powerful model by which to establish rules and conventions for the infrastructure.
CoNus: Workspace-based Intuitive Collaboration in Virtual Enterprises
Authors: Michael Berger, Hubertus Hohl, A. Jarczyk, B. Otto, M. Schneider, Gerd Völksen
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

This paper presents the architecture and user interface of a generic framework supporting collaboration in virtual enterprises. It is intended to provide users with an intuitive interface methodology which is independent from the underlying CSCW components like application sharing, audio/video and file transfer. The user interface relies on a room metaphor with simple drag & drop or clicking actions for carrying out functions like conference initiation, invitation, file transfer or application sharing. The architecture provides a replicated data model to give users awareness of any modification in the virtual enterprise. The system supports synchronous, asynchronous, and autonomous collaboration. A field study shows the usefulness of the described CSCW framework.
Persistent Cache in Cooperative Search Engine
Authors: Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Cooperative Search Engine (CSE) is a distributed search engine, which can update indexes in very short time for the purpose of fresh information retrieval. In CSE, the retrieval performance is dependent on cache contents because communication delay occurs at retrieval time. In the other hand, however, cache is invalidated as soon as indexes are updated. Therefore, we need persistent cache that can hold valid data before and after updating. In this paper, we describe the principle and evaluations of persistent cache.
Reducing the Cost of the Critical Path in Secure Multicast for Dynamic Groups
Authors: Sandeep S. Kulkarni, Bezawada Bruhadeshwar
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is complete. This interruption is especially necessary if the rekeying is done because a user has left (or is removed). We split the rekeying cost into two parts: the cost of the critical path ¿ where each user receives the new group key, and the cost of the non-critical path ¿ where each user receives any other keys that it needs to obtain. We present two algorithms that show the trade off between the cost of the critical path and the cost of the non-critical path. We also compare our algorithms to previous algorithms and show that our algorithms reduce the cost of the critical path while keeping thetotal cost manageable.
Scalable Anonymous Connections in the Context of MIP and AAA
Authors: H. Hartenstein, K. Jonas, M. Liebsch, M. Stiemerling, R. Schmitz, D. Westhoff
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

IP-packets sent over the Internet may reveal detailed information about who communicates with whom. To conceal the identities of sender and receiver, present approaches involve particular network nodes that forward the communication traffic often using cryptographic techniques to en-/decrypt the in-/outgoing data. The current anonymity approaches suite applications that do not have time constraints supporting a limited number of subscribers. These approaches are not suited for a worldwide, possibly time critical scenario with a huge number of subscribers. Diverting all communication traffic over such network nodes would cause bottlenecks and traffic delays. For concealing the relationship of sender and receiver we propose an optional, reasonable anonymity service scalable for a large number of subscribers, possible communicating under time constraints. In addition, when integrating our approach in the context of Mobile IP, authentication, authorization and accounting we neither weaken the proposed trust model nor extend the number of involved entities.
Supporting Multi-Device Enabled Web Services: Challenges and Open Problems
Authors: Engin Kirda, Clemens Kerer, Mehdi Jazayeri, Christopher Kruegel
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Service providers face a number of challenges when providing services to users accessing the World Wide Web from hand-held devices. Among these challenges are the small display sizes, the low bandwidth, input limitations, and mobility of these devices. Web services need to be aware of these limitations in order to meet the exact needs of mobile clients. In this paper, we claim that new methodologies and development tools are needed in order to support the development and management of multi-device enabled Web services. We discuss challenges and open problems faced by Web developers in adapting services to support mobile access. We share experiences we gained in extending the annual Vienna International Festival Web site to provide WAP services.
A Study of Train Communication System for Future Railways Using Millimeter-wave Radio
Authors: Kohshi Abe, Tetsunori Hattori, Hisao Koizumi
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper presents a concept of multimedia railway information and communication system for train operation and passengers, which is intra-network system for railway information connected to public network. And this paper proposes a new train radio communication system between trains and ground facilities, which adopts subcarrier multiplexed (SCM) lightwave system in feeder links and 45GHz band millimeter wave radio communication system in radio links, for aiming high-speed and large-capacity communication such as multi-channel quasi-videos. Also, this paper describes performance estimation of this proposed system, obtained by computer simulation. Results of estimation show a high degree of feasibility in all cases.
A Distribution Format for Communication-Free Reshape in Distributed Memory Computers
Authors: Hyun-Gyoo Yook, Mi-Soon Koo, Myong-Soon Park, Tae-Guen Kim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Data parallel languages designed for distributed memory computing environments provide a single global address space to the programmer. The mapping from this global address space to the distributed local address space is performed by a compiler, which does this mapping based on the array distribution format. Thus, each array in a data parallel language program has its own distribution format. The Reshape function changes the array distribution format as well as the array shape. However, the changed distribution format cannot be represented by any distribution format supported in current languages. Because there is no suitable distribution format, it is necessary to change the reshaped distribution format to an existing distribution format, with heavy overhead due to the redistribution function. To eliminate the redistribution step in Reshape function, we have proposed a new distribution format, HIER-CYCLIC, which can represent the reshaped distribution format. We have also proposed a language syntax to use HIER-CYCLIC and a compiling mechanism. Finally, we performed an experiment on an IBM-SP2 machine using a shift function.**
An Architecture Supporting the Collection and Monitoring of Data Openly Contributed over the World Wide Web
Authors: David G. Stork
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Open data collection over the World Wide Web-in which any web user can contribute to large databases of "informal" data -presents several challenges that require novel approaches in human interface design, algorithmic machine learning and collaborative infrastructure. Foremost among these challenges is the need to ensure data integrity and quality, by automatically or semi-automatically identifying unreliable or hostile contributors and rejecting their contributed data. Other, traditional requirements include security, scalability, and the need to support collaboration between separate but related data collection projects. Further, for the open software/data model, the system must permit users to freely browse, navigate and download the contributed data. This paper presents a collaborative architecture for a set of such data collection projects that addresses these challenges and requirements. Key components of this architecture have been implemented and tested as part of the Open Mind Initiative.
Evaluation of Interference During Collaborative Document Development
Authors: Jeffrey D. Campbell
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

A problem with collaborative development of documents is that people can interfere with each other's work. If unresolved, this interference can result in an incorrect document. A evaluation scenario using the development of a database design is proposed as a good context for evaluation of collaborative systems for the development of both text and diagram documents. Several metrics and measures are described for quantifying the occurrence of interference. In particular, five survey questions were added to a standard usability instrument to address interference and protection.
Adaptive Applications for Mobile Heterogenous Devices
Authors: Paola Inverardi, G. Marinelli, Fabio Mancinelli
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

We address the problem of dealing with the heterogeneity of access devices. The problem we are facing is that of a, possibly mobile, user that wants to download and execute an application from a remote server. The user's hosting device can be of various kinds PCs, PDAs, cellular phones, communicators, etc. with specific hardware and software capabilities. The problem is then to be able to decide whether the user's current device characteristics arecompatible with the application requirements in order to prevent execution failures. In the negative case we would like to be able to identify the reasons that determined the uncompatibility and perform an adaptation of the application so that it can match the user's device capabilities.
Query Expansion for Intelligent Information Retrieval on Internet
Authors: Jae Hyun Lim, Young-Chan Kim, Hyonwoo Seung, Jun Hwang, Heung-Nam Kim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Most systems that manage distributed information on Internet have difficulties in retrieving relevant information for they are not able to include the exact semantics of retrieval queries that users request. In this paper, we propose an automatic query expansion method based on term distribution which naturally reflects semantics of retrieval terms in order to enhance the performance of information retrieval. The SVD technique in the LSI is utilized in the proposed method to measure the term distribution which appears similar to a query. Terms appearing most similar to the query in consideration of the distribution are appended to the query. Thereby, the query can hit documents without having common terms but with common concepts. An automatic term reduction technique is also proposed which does not choose to append all the terms in the same distribution area. The experimental results show our method maintains comparable retrieval effectiveness as the other LSI methods without having to append many unnecessary terms.
A simulation study of interoperative methods for congestion control over TCP/AT
Authors: Pil Joong Kim, Yeon Lee, Woon-Sik Kim, Kwang-Il Lee, Sang-Ha Kim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

ATM rate-based flow controls can effectively reduce cell losses and buffer requirement in ATM switches, and thus enhance overall performance in ATM networks. However, many simulation studies show that the performance of TCP can be reduced over ATM networks in some situation like network congestion. This comes from the absence of direct channel between TCP and ATM protocol stack. That is, the ATM layer in a host does not notify TCP of the congestion information from ATM networks through resource management (RM) cells. So, TCP may generate vast packets regardless of present network status. In this paper, we introduce the direct mechanism, interoperative method between TCP and ATM protocol stack and perform a simulation in order to justify our mechanism. The simulation results, by SIMNET from NIST, show that the TCP adopting mechanism has better performance over that only with ATM congestion control mechanism.
Towards Secure e-Services
Authors: Claudiu Duma, Almut Herzog, Nahid Shahmehri
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

The networked home with refrigerators and washing machines connected to the Internet and reachable through Web browsers will be reality soon. Following this development, the market for electronically deliverable services will evolve. Companies that want to provide electronic services cannot be expected to deal with cable, network and routing problems - they need to rely and build on a common, secure hard- and software infrastructure that allows services to reach the customers' homes. We call such an infrastructure an e-services system (e-SS). In this paper, we present the infrastructure of an example e-SS, highlight a number of specific security issues and show how they can be addressed in the early stages of the design of an e-SS.
Evaluation of a memory hierarchy for the MTS multithreaded processor
Authors: W. Lynn Gallagher, Chuan-Lin Wu
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Executing multiple threads simultaneously on superscalar processor can improve hardware resource utilization and instruction throughput. The Multi-Threaded Superscalar (MTS) processor efficiently achieves the concurrent execution of multiple instruction streams using a VLIW, multiple functional unit architecture. However, the limitations of the memory system may impede the potential performance of the MTS processor. An interactive, parameter-driven simulator of the MTS architecture was developed using SES/workbench. A set of numerical benchmarks was run on it with varying memory system configurations. Assuming a single instruction cache, a single data cache, and one instruction queue per thread, varied parameters included the size of the instruction queues, the number of ports to the instruction cache, main memory latency, and cache hit rates. Based on simulation results, optimal values were chosen for certain parameters. To reasonably utilize the MTS processor, the memory system must provide at least 64 instruction bytes per cycle, though the demands for data access are far less severe. For reasonable memory speeds, this requires a roughly IMB three-ported instruction cache capable of providing 128 bits per port per cycle, as well as an IMB single-ported 32-bit wide data cache. A more realistic multilevel cache hierarchy is proposed.
Client Location Tracking in Ubiquitous Information Service Network
Authors: Hung-Chin Jang, Yao-Nan Lien, Jyh-Shyan Huang
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

The objective of this paper is to present a feasible and efficient methodology that improves client mobility management under ubiquitous information service network. We base our system on the Open Integrated Service Network Architecture [3] and propose a hybrid infrastructure with facilities of both a centralized Network Management Center (NMC) and a distributed Home Base Node (HBN). We also have criteria for choosing a HBN with minimum cost by computing the expected registration cost and location tracking cost according to users characteristics and called frequencies.Running a simulation, results show that our methodology is able to save up to 40% of the cost comparing to that of IS-41 when the value of Call-Mobility Ratio (CMR) is in the range of (1, 100), which means either clients are called with high frequencies or are moving with low mobilities. As the value of CMR goes down to the range of (0.01, 1), which means either clients are called with low frequencies or are moving with high mobilities, we may save up to 50% cost.
XML and Objects-The Future for E-Forms on the Web
Authors: Anders Tornqvist, Chris Nelson, Mats Johnsson
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Many organizations are using the Web for electronic commerce or purely for the collection and dissemination of information based on forms and tables. For many of these organizations a bespoke Web design with specialized Java Script is what they want.However, for organizations not wishing to make this investment, a flexible system based on a standard XML DTD could fit the bill. Fully functional E-forms can be prepared and maintained for a fraction of the price of a bespoke Web design. Based on a combination of the knowledge of the real meaning of data and metadata, XML and the Web, and object oriented technology, there is a new way to develop e-forms and to integrate them with applications.