ppxscal/embedding_network huggingface dataset:
Fault-Tolerant and Approximate Reasoning in Multi-Source Environments
Authors: Frédéric Koriche
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

When different knowledge based systems must cooperate to perform decision tasks that are beyond their individual capabilities, we are faced with the problem of combining knowledge in a multi-source environment. In particular; we are confronted with two main difficulties: the prospect of inconsistency which arises when different knowledge bases are merged together and the high computational complexity of reasoning with very large pools of combined information. In this paper we define aformalframework which handles both aspects of consistency and tractability, and which is useful to specify knowledge retrievers. This framework tolerates inconsistency and enables a knowledge retriever to infer non-degenerative conclusions when conflicting viewpoints are combined. Furthermore, approximate reasoning is incorporated in order to perform efficient query answering using combined knowledge. Finally, a stepwise procedure is includedfor improving approximate answers and allowing their convergence to the right answer
Towards the Standardization of Collaborative Learning Systems
Authors: Manuel Caeiro, Luis E. Anido-Rifón, Juan M. Santos, Judith S. Rodríguez
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Many institutions, both public and private, have been working towards the definition of a common set of standards in order to improve in technology-based learning environmentsinteroperability and reusability. The first results are already available, but they are mainly devoted to the provision of learner centered and teacher centered environments, with no consideration about communication or collaboration issues. Collaborative learning standardization has not received too much attention yet. Nevertheless, most learning theories highlight collaboration as a key concern, and most learning systems, mainly in Internet environments, include collaborative facilities. Our main objective is to contribute to the collaborative learning standardization process with a proposal for a service architecture to build distributed and interoperable collaborative learning facilities. This contribution is based on the definition of open software interfaces for each subsystem in the architecture.
U-P2P: A Peer-to-Peer System for Description and Discovery of Resource-Sharing Communities
Authors: Aloke Mukherjee, Babak Esfandiari, Neal Arthorne
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

A simple method is proposed for peer-to-peer description and discovery of resource-sharing communities as well as the resources themselves. An XML Schema document describes a shared resource. By applying transformations, specified in XSL, the schema is used to generate an application with the ability to publish and search for the defined object. Meta-data is indexed and searchable allowing complex objects to be discovered. We propose to solve the problem of discovery for resource-sharing communities by treating a community as a shared resource. An XML Schema description of resource-sharing communities is used to generate a P2P system for community discovery.
A Meta-Model for Distributed Software Development
Authors: Sigrid Goldmann, Jürgen Münch, Harald Holz
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Software development processes are highly creative, and subject to frequent changes - making it hard to plan and schedule these processes in advance. Also, distributed projects cannot be planned centrally, especially if the involved parties are individual companies with their own areas of responsibility (as is the case in virtual Software corporations). On the other hand, certain aspects of the overall plan and schedule (milestones & deadlines, project progress) need to be available to all concerned parties.In this paper, we present an approach to support distributed planning and scheduling, as well as the subsequent (also distributed) plan execution, in one system. The approach enables us to support interleaved planning and plan enactment, allowing the user to change the plan and schedule while the project is already under way. This facilitates the task of keeping the plan up to date, avoiding the complete invalidation of the plan as is often the case in conventional projects soon after enactment has started.
Service-Oriented Modelling for e-Business Applications Components
Authors: Giacomo Piccinelli, Mathias Sallé, Christian Zirpins
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

The emerging trends for e-business engineering revolve around specialisation and cooperation. Successful companies focus on their core competences, and rely on a network of business partners for the support services required to compose a comprehensive offer for their customers. Modularity is crucial for a flexible e-business infrastructure, but related requirements seldom reflect on the design and operational models of business information systems. Software components are widely used for the implementation of e-business applications, with proved benefits in terms of system development and maintenance. We propose a service-oriented componentisation of e-business systems as a way to close the gap with the business models they support. Blurring the distinction between external services and internal capabilities, we propose a homogeneous model for the definition of e-business applications components. After a brief discussion on the foundational aspects of the approach, we present the process-based technique we adopted for component modelling. We then present an infrastructure compliant with the model proposed that we built on top of an EJB (Enterprise Java Beans) platform.
An Agent Based Matchmaking System Using Knowledge Base
Authors: Leonard Barolli, Akio Koyama, Zixue Cheng, Norio Shiratori
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

With the spread of Internet, the number of users and hosts has been increased exponentially. Also, newly emerging services try to provide users with more enhanced Quality of Service (QoS). The increase of users and hosts and the enhancement of QoS have caused a radical increase of Internet traffic. As a result, it is very difficult for users to find required information and the information location. In this paper, we propose a matchmaking recruiting system over the Internet. Our system is based on agent technology. The agent carries out the matchmaking using a knowledge base the same as the human beings. By using the agent, the proposed system is able to get the best matching data and decreases the Internet load.
Workshop on Evaluating Collaborative Enterprises - Workshop Report
Authors: Amy J. Knutilla, Michelle Potts Steves, Robert H. Allen
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

The workshop, Evaluating Collaborative Enterprises, explored the issues surrounding the evaluation of collaborative systems including methods and tools for evaluating collaborative software as well as application-specific evaluation experiences. This paper describes the workshop's mission, summarizes the workshop papers and discussions, and concludes with future research needs.
Research Issues in Developing Networked Virtual Realities: Working Group Report on Distributed System Aspects of Sharing a Virtual Reality
Authors: Michael V. Capps, P. David Stotts
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: This is a report on the proceedings of the "Distributed System Aspects of Sharing a Virtual Reality" workshop at the 6/sup th/ WET-ICE Conference held June 18-20, 1997. The workshop's discussions focused on the research issues in the field of networked virtual reality, as well as the current methods used to address those issues. In those areas where the state of the art was felt to be lacking, we additionally report on the most promising technologies that the near future holds.
XExplainer: A Tool for Generating Descriptive Text from Database
Authors: Ji-Eun Roh, Sin-Jae Kang, Jong-Hyeok Lee
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

We focus on how to generate well-written texts to describe an object from a database, and propose several strategies that are needed in generation stages. To build reliable generation rules, we performed corpus analysis through annotating descriptive texts. This paper alsodescribes an implemented text generation system called XExplainer, which can dynamically produce a description of an object in Korean. XExplainer was applied to two domains ¿ a home shopping database and a business administration database ¿ to show that it can be applied to any domain as long as the information is provided in the required format. The Generated texts were evaluated by humans using several criteria, such as content completeness, structural coherence, expression conciseness, and text layout.
AQuES: An Agent-based Query Evaluation System
Authors: Michael Stillger, Johann K. Obermaier, Johann Christoph Freytag
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

Optimization for distributed and parallel database systems is an overly complex problem. This complexity arises due to the various kinds of parallelism and the coexistence of heterogeneous hardware modules. The query optimizers for those systems must exploit parallel algorithms for algebra operators, independent data parallelism and resource scheduling. In addition, unexpected deviations of the workload at runtime enforce new, dynamic execution strategies. This paper reports ongoing work in developing an agent-based query optimization and execution system to cope with this problem. It is based on the principles of distributed, symmetric processes which work in a cooperative, yet independent manner. This approach enables a dynamical adaptation to changes in the execution environment with local and simple actions. We present the architecture of the components and outline the principle of distributed query execution within this software system.
Dynamic-Agents for Dynamic Service Provisioning
Authors: Qiming Chen, Parvathi Chundi, Umeshwar Dayal, Meichun Hsu
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

We claim that a dynamic-agent infrastructure can provide a shift from static distributed computing to dynamic distributed computing, and we have developed such an infrastructure to realize such a shift. We shall show its impact to software engineering through a comparison with other distributed object-oriented systems such as CORBA and DCOM, and demonstrate its value in highly dynamic system integration and service provisioning.The infrastructure is Java-based, light-weight, and extensible. It differs from other agent platforms and client/server infrastructures in its support of dynamic behavior modification of agents. A dynamic-agent is not designed to have a fixed set of predefined functions but instead, to carry application-specific actions, which can be loaded and modified on the fly. This allows a dynamic-agent to adjust its capability for accommodating environment and requirement changes, and play different roles across multiple applications.The above features are supported by the light-weight, built-in management facilities of dynamic-agents, which can be commonly used by the "carried" application programs to communicate, manage resources and modify their problem-solving capabilities. Therefore, the proposed infrastructure allows application-specific multi-agent systems to be developed easily on top of it, provides "nuts and bolts" for run-time system integration, and supports dynamic service construction, modification and movement.A prototype has been developed at HP Labs and made available to several external research groups.
A Coordination Infrastructure for Agent-based Internet Applications
Authors: Enrico Denti, Andrea Omicini
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

Internet applications are often structured as collections of interactive, heterogeneous agents, which have to coordinate to pursue the application goals. These applications require design methodologies that are far from being well established, and new standard technologies, models, languages, technologies and tools specifically tailored to the agent metaphor and to agent-based systems. This article presents LuCe, a coordination infrastructure for the design and the development of agent-based distributed applications on the Internet, which integrates Java, logic-based languages, and tuple-based coordination models. We discuss the impact of this approach on the design both of the single agents and of Internet applications, and then suggest how it could be exploited in the design/development/test cycle.
Developing Social Virtual Worlds using NetEffect
Authors: Tapas K. Das, Gurminder Singh, Alex Mitchell, P. Senthil Kumar, Kevin McGee
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: This paper describes NetEffect, an infrastructure for developing, supporting, and managing large, media-rich, 3-D social virtual worlds for use by several thousand geographically-dispersed users using low-end computers (PCs) and modems. It has been modularized into six components, in the form of a toolkit, which simplifies the development of network-based virtual worlds. NetEffect partitions a whole virtual world into communities, allocates these communities among a set of servers, and migrates clients from one server to another as clients move through the communities. It devotes special attention to minimizing the network traffic, particularly the traffic that must go through servers. HistoryCity, a virtual world for children, has been developed on NetEffect, which is being beta-tested for deployment in Singapore.
SEMSOMM--A Scalable Multiple Encryption Scheme for One-To-Many Multicast
Authors: Nathalie Weiler
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Many traditional and new Internet multi-party applications require a scalable, secure group communication infrastructure. Some of these applications such as video conferencing involve many-to-many communication while others such as stock exchange systems engage in one-to-many data distribution. In this paper, we present a novel solution for the latter area. Our approach, which we call Semsomm, relies on two main ideas: First, we use intermediate nodes of the multicast distribution tree as untrusted relaying nodes in order to overcome the need to re-key the entire group upon each membership change. Second, the session key is periodically renewed and redistributed to legitimate group members, thus inhibiting any collusion attack. Semsomm scales to very large groups while preserving perfect forward secrecy of the multicasted data information because of its multiple encryption method. Furthermore, we show how our approach can be extended first to few-to-many and then to many-to-many scenarios with the appropriate network based infrastructural enhancements such as active networks.
Are 2*-trees interesting topologies for the interconnection of a network?
Authors: Mariana Kant
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper, we explore in detail some properties of 2*-trees. A 2*-tree is a connected graph with N nodes, diameter log/sub 2/N, and degree of nodes 10. We propose routing algorithms for the unicasting, the broadcasting and the gossiping on a 2*-tree network. The routing algorithms we present have their time and communication complexities lower than the corresponding complexities for the routing on H/sub n/, i.e., the hypercube of dimension n=log/sub 2/N. Consequently, we think that a 2*-tree is an interesting topology to be considered for a network of processors.
Architecting CORBA-Based Frameworks to Support Distributed and Interoperable Training Systems in Large Enterprises
Authors: Luis E. Anido-Rifón, Manuel Caeiro, Judith S. Rodríguez, Juan M. Santos
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Nowadays, Enterprise Software Systems are mainly distributed. Distribution promises better efficiency, scalability, and availability, specifically of large-scale systems. This is also true for the computer-based training systems used by Training Departments. This paper addresses interoperability and reusability issues that appear as a consequence of the heterogeneousnature of the resources used for training. We propose a CORBA-based framework to develop Distributed Object Computing systems to support enterprise training. This proposal is based on ongoing work by institutions like the US Department of Defense and the Aviation Industry in the learning technology standardization area. Our framework also identifies open software interfaces among distributed components and a systematic methodology to develop new systems from them. Therefore, architects are provided with a software product line to develop standards-driven interoperable distributed training systems.
Using SESAME to Implement Role-Based Access Control in Unix File Systems
Authors: Paul Ashley, Mark Vandenwauver
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Computer networks and assets have become a very valuable resource for modern companies. Securing these resources is thus vital for their survival. Enterprises nowadays want to have their organizational structure mirrored into their security policy. Role based access control (RBAC) has proven to be an essential tool in this process.Although Microsoft based systems have acquired a large part of the market, it seems that the old but very reliable Unix is getting a boost as well. Unfortunately, standard Unix does not implement RBAC. In this paper a solution to this problem is described that uses the novell SESAME security architecture. To this end we also introduce a new RBAC model.
An Improved a-Shapes Algorithm for Geometric Reconstruction
Authors: Bin Shyan Jong, Tsong Wu Lin, Wen Hao Yang, Kun Shyan Jong
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

It is popular for application to combine virtual reality and network multimedia technique. The 3D geometry models are used in such applications. It is difficult to build mathematical models by human. The reverse-engineering is a new method to build 3D models. Such a model is suitable for Internet transmission. It is still a bottleneck for using the Reverse-engineering to reconstruct relationship between vertices. The a-Shapes is an old method for it. In this study, we propose some methods to improve its efficiency. ompare our improved algorithm with original algorithm. Our method could generate compact model. The average storage space required by our method is about half of the one by original method. The advantage of our method is not only in the storage space but also in the reconstruction time.
Control of Multimedia Communication over Wireless Network
Authors: Kazuo Takahata, Norihiko Uchida, Yoshitaka Shibata
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, QOS Control of realtime multimedia communication system under heterogeneous environment by the wired and the wireless networks is proposed. In our suggested system, as channel coding, FEC (Forward Error Correction) method with Reed-Solomon coding is introduced to reduce the packet error rate on the wireless network. On the other hand, as source coding, transcoding methods including transformation of various video codings such as M-JPEG, MPEG and Quicktime, controls of Q-factor within a frame, frame rate and color depth is introduced to maintain the required QOS, particularly the end-to-end throughput. The increases of the required bandwidth by redundant packet addition with FEC can be suppressed by the transcoding functions while the packet error rate is reduced to the accepted value. In order to verify the functionality and the efficiency in our suggested system, numerical simulation was held. As the result, our suggested system by combination of transcoding and FEC could correct the packet error rate with an order of 109 while maintaining the frame rate and the amount of data transform at a constant.
Design and Implementation of a Distributed Workflow Enactment Service
Authors: Esin Gokkoca, Mehmet Altinel, Ibrahim Cingil, Nesime Tatbul, Pinar Koksal, Asuman Dogac
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

Workflows are activities involving the coordinated execution of multiple tasks performed by different processing entities, mostly in distributed heterogeneous environments, which are very common in enterprises of even moderate complexity. In current commercial workflow systems, the workflow scheduler is a single centralized component. A distributed workflow enactment service, on the other hand, should contain several schedulers on different nodes of a network, each executing a part of the process instances. Such an architecture would fit naturally into the distributed heterogeneous environments. Further advantages of a distributed enactment service are failure resiliency and increased performance, since a centralized scheduler is a potential bottleneck. In this paper, we present the design and implementation of a distributed workflow enactment service based on the work of M. Singh (1996). By starting with a block-structured workflow specification language, we avoid a very general set of dependencies and their related problems. In this way, it is possible to present a simple algorithm for the distributed scheduling of process instances. Further benefits of the approach are the ease of testing and debugging the system, and the execution efficiency through having a reduced number of messages.