ppxscal/embedding_network huggingface dataset:
Parallel Maximum Matching Algorithms in Interval Graphs
Authors: Yoojin Chung, Kunsoo Park, Yookun Cho
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

We develop new parallel maximum matching algorithms in interval graphs by exploiting the characteristics of interval graphs. For general interval graphs, our algorithm requires O(\log^2 v+(n\log n)/v) time and O(nv^2+n^2) operations on the CREW PRAM, where n is the number of intervals and v\le n is a parameter. By choosing v=\sqrt{n}, we obtain an O(\sqrt{n} \log n)-time algorithm in O(n^2) operations. For v=n/\log n, we have an O(\log^2 n)-time algorithm with n^3/\log^4 n processors. The previously best known solution takes O(\log^2 n) time with n^3 processors. For proper interval graphs, our algorithm runs in O(\log n) time using n/\log n processors if input intervals are sorted and using n processors otherwise on the EREW PRAM. Our algorithms are much simpler than the previous ones.
Meta-Data Based Mediator Generation
Authors: Terence Critchlow, Madhavan Ganesh, Ron Musick
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Mediators are a critical component of any data warehouse; they transform data from source formats to the warehouse representation while resolving semantic and syntactic conflicts. The close relationship between mediators and databases requires a mediator to be updated whenever an associated schema is modified. Failure to quickly perform these updates significantly reduces the reliability of the warehouse because queries do not have access to the most current data. This may result in incorrect or misleading responses, and reduce user confidence in the warehouse. Unfortunately, this maintenance may be a significant undertaking if a warehouse integrates several dynamic data sources. This paper describes a meta-data framework, and associated software, designed to automate a significant portion of the mediator generation task and thereby reduce the effort involved in adapting to schema changes. By allowing the DBA to concentrate on identifying the modifications at a high level, instead of reprogramming the mediator, turnaround time is reduced and warehouse reliability is improved.
Configuration Detection as a Problem of Knowledge Discovery in Computer Networks
Authors: Yuko Murayama
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

Presents a type of knowledge discovery that is slightly different from data mining in database systems-configuration detection in computer networks. In computer networks, one needs to know which objects exist and where they are located. We call the acquisition of this knowledge "configuration detection". We are interested in hosts and routers on an internetwork within an organization. As internetworking has become popular, the growth in the number of network objects has been substantial and dynamic. In such an environment, the maintenance of knowledge of the current configuration of the network has become a practical problem. The scale problem has been solved either by facilitating dynamic learning or by dividing the management domain into subdomains of a manageable size. In either solution, we face the problems of inconsistency and invalidity. We suggest the use of a procedure for the authorisation of network addresses to solve some of the serious network-level threats using a security technique. Finally, we apply the solution to address resolution.
Distributed and Collaborative Design Activities at the National Institute of Standards and Technology
Authors: Ram D. Sriram
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The increasing complexity of engineering artifacts and the globalization of product development necessitates a distributed and collaborative environment for design and manufacture. The future manufacturing environment will consist of a network of engineering applications, where state of the art multi-media tools and techniques will enhance closer collaboration between geographically distributed applications or design agents, virtual reality tools will allow visualization and simulation in a synthetic environment, and information exchange standards will facilitate seamless interoperation of heterogeneous applications. In this paper, I will provide an overview of our research activities in collaborative design.
A Workgroup Model for Smart Pushing and Pulling
Authors: Gail E. Kaiser, Christopher Vaill, Stephen E. Dossick
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Our Workgroup Cache system operates as a virtual intranet, introducing a shared cache to members of the same workgroup. Users may be members of multiple workgroups at the same time. Criteria are associated with each workgroup to pull documents from an individual cache to the shared cache, or push from the shared cache to an individual cache. These criteria provide semantics of the workgroup' s tasks and interests to reduce latency for its members.
A Service-Based Architecture for In-Vehicle Telematics Systems
Authors: D. Reilly, A. Taleb-Bendiab
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The growing needs to access information in remote, mobile environments have sparked interests in so-called In-Vehicle Telematics Systems (IVTS) [1]. These relatively new systems have the potential to deliver computing facilitates to road vehicles, which may include in-vehicle infotainment, route-guidance and navigation and the provision of vital information resources used by fleet haulage companies and emergency services (police, fire and ambulance). This paper describes the EmergeITS 1 project, which is concerned with the use of IVTS for emergency fire service applications. In particular, the paper describes a distributed service-based architecture, based on the Jini middleware technology, which can be used to provide fault tolerant application services to remote in-vehicle computers and mobile devicessuch as Palm devices and WAP phones.
Directions for Web and E-Commerce Applications Security
Authors: Bhavani M. Thuraisingham, Chris Clifton, Amar Gupta, Elisa Bertino, Elena Ferrari
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

This paper provides directions for web and e-commerce applications security. In particular, access control policies, workflow security, XML security and federated database security issues pertaining to the web and e-commerce applications are discussed.
XML and Quality Objects
Authors: Partha Pal, James Megquier
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Adapting to desired and available QoS is key to the utility and dependability of distributed, internet-centric applications including those based upon XML. In this paper we explore the possibility of transitioning QuO, which is a technology based on distributed objects for building and deploying QoS aware adaptive distributed systems, into XML based distributed systems.
An Integrated Framework to Support Distributed CAD over the Internet
Authors: Amar Gupta, Sanjeev Vadhavkar, Feniosky Peña-Mora, Jason Yeung
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

This paper presents a framework to improve the ability to represent, capture, and reuse design rationale by using: computer-supported design rationale model (DRIMER) to capture design rationale; collaborative tools for handling team interactions over the Internet; and case-based reasoning mechanisms for organizing and analyzing design artifacts and rationale.
Minimization of Resource Consumption for Multidatabase Query Optimization
Authors: Chiang Lee, Chih-Horng Ke, J.-B. Chang, Yaw-Huei Chen
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Due to the autonomy of individual databases, a multidatabase system (MDBS) has no control over the task execution within each database system. This complicates the issue of query optimization in a MDBS. Past researchers tackled this problem mainly by regenerating the cost model of each participating database systems. However, a completely autonomous participating database system does not own the information (data) as well as the mechanism (software) for converting data of one database to another to resolve the data type conflict problems that can occur in any MDBS environment. In addition, unpredictable factors that can drastically deviate the accuracy of a regenerated cost model (in the past research) come into play at unknown time. This confines the processing of an intersite operation (such as a join over two relations of different databases) to the MDBS only. The participating database systems will not be able to share the workload of the MDBS under this circumstance. Hence, how to minimize the consumption of system resources of the MDBS is an urgent problem. In this paper, we propose three scheduling algorithms that are used in the MDBS to reduce the processing cost of a multidatabase query. A major difference between our strategies and the past methods is that ours do not require the knowledge of the cost models of the participating databases.
Analytical Performance Prediction of WWW Distributed Cache Management (DCM) Protocols
Authors: Sinisa Srbljic, Dalibor F. Vrsalovic, Ivan Skuliber
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, we introduce new analytical models for predicting the performance of World Wide Web (WWW) proxy caches that are distributed over multiple proxy machines under various management protocol assumptions. The purpose of these models is to determinewhich distributed cache management (DCM) protocols are to be used for large-scale distributed caches.The accuracy, and usefulness, of our models is assessed by comparing the performance predicted by the models with measurements from real system in operation. We run tests with different values of various parameters that define behavior of distributed cache, communication protocol, DCM protocol, and application.
A Flexible Architecture for Query Integration and Mapping
Authors: Sibel Adali, Corey Bufi
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

The aim of information integration is to build sophisticated information systems by making use of the available information sources to the fullest extent and by pushing costly operations to the sources as much as possible. This is especially true when translating queries across multiple multimedia information sources that support advanced and/or similarity based queries. In this paper, we propose a flexible architecture that allows users to specify a wide range of structured queries using generic and simple query constructs and connectives through a uniform query interface. These queries are translated into resource specific queries by processing rules that specify the properties of different query interfaces as well as the user preferences for evaluating queries. We show how different and multiple notions of query relaxation can be captured in this framework naturally.
Evaluation Factors for Multi-Stakeholder Broadband Visual Communication Projects
Authors: Marion A. Barfurth, Janice Singer, Bruno Emond, Norman G. Vinson, Martin Brooks, John Spence
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

This paper presents a summary of multi-faceted evaluation factors that we have identified through our research with Broadband Visual Communication (BVC) projects involving multiple stakeholders. The main benefit of these evaluation factors is that they provide a general evaluation framework for multiple stakeholder projects. The factors are social infrastructure,technical infrastructure, physical space, interaction style and content.
Empowering Mobile Healthcare Providers via a Patient Benefits Authorization Service
Authors: Vijayanand Bharadwaj, Ravi Raman, Y. V. Ramana Reddy, Sumitra Reddy
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Moving rapidly between patient examining rooms, physicians have to examine, diagnose and decide on a course of treatment appropriate for each patient. However, if the patient's health plan administrators subsequently deny coverage, the prescribed treatments would then have to be changed. There are a wide range of health insurance plans and varying cost curtailment procedures. Physicians are therefore ill-equipped to determine a course of treatment that addresses the patient's needs and complies with the payer's regulations. Benefits authorization applications on handheld devices using wireless communications can help mobile healthcare providers quickly determine patient medical benefits eligibility. Such facilities could improve the quality of care and physician patient communications, prevent denial of services by health plan administrators and consequential expenses to the patient. The authors originally developed a prototype desktop application as part of a secure telemedicine research project. They identify enhancements to this work to address interoperability issues and support the needs of mobile healthcare providers.
An Overview of IP Switching and Tag Switching
Authors: Xipeng Xiao, Lionel M. Ni, Vibhavasu Vuppala
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Both IP switching and Tag switching were recently proposed to improve the performance of conventional IP routers. They are all based on a multi-layer label-swapping mechanism, but their implementations are quite different. In this paper, we present an overview of both switching mechanisms, compare their key features, identify their constraints, and analyze the effect of these constraints on performance. Our study shows that both IP switching and Tag switching are better than the conventional IP routing, but neither of them is universally superior to the other.
Providing Secure Environments for Untrusted Network Applications
Authors: Qun Zhong
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Bugs in network application programs can be exploited to compromise the system on which the application is running. When running these applications in an unsafe environment such as the Internet, the security concerns raised are a significant barrier to electronic commerce. In addition, these application programs (such as Web servers, mailservers, etc.) are usually too big and complex to be bug-free; trying to build security directly into these applications has proven to be very difficult. This paper demonstrates that a compartmented-mode workstation is a suitable platform to provide a secure environment that can contain most existing network applications. We describe how to wrap these applications in order to reduce the potential for a security breach without the need to rewrite the application completely. By minimizing the effort of transferring unsafe application services so that they are reasonably secure, we are able to accelerate the process of electronic commerce.
Behavior and Performance of Message-Oriented Middleware Systems
Authors: Phong Tran, Paul Greenfield, Ian Gorton
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The middleware technology used as the foundation of Internet-enabled enterprise systems is becoming increasingly complex. In addition, the various technologies offer a number of standard architectures that can be used by designers as templates to build applications. However, there is little concrete understanding in the software industry on the strengths and weaknesses of competing technologies, and the different trade-offs that various component architectures impose. The SACT Group at CSIRO has qualitatively and quantitatively evaluated a number of commercially available Message-Oriented Middleware (MOM) systems.This paper focuses on the results obtained from the performance evaluation of the IBM's MQSeries V5.2. It presents an overview of the technology, and discusses the metric used in this study for performance measurement The test results related to the sustainableperformance of the system using various test configurations are described and their implications discussed.
A Flexible, Privacy-Preserving Authentication Framework for Ubiquitous Computing Environments
Authors: Jalal Al-Muhtadi, Anand Ranganathan, Roy H. Campbell, M. Dennis Mickunas
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The proliferation of smart gadgets, appliances, mobile devices, PDAs and sensors has enabled the construction of ubiquitous computing environments, transforming regular physical spaces into "Active Information Spaces" augmented with intelligence and enhanced with services. This new exciting computing paradigm promises to revolutionize the way we interact with computers, services, and the surrounding physical spaces, yielding higher productivity and more seamless interaction between users and computing services. However, the deployment of this computing paradigm in real-life is hindered by poor security, particularly, the lack of proper authentication and access control techniques and privacy preserving protocols.We propose an authentication framework that addresses this problem through the use of different wearable and embedded devices. These devices authenticate entities with varied levels of confidence, in a transparent, convenient, and private manner, allowing the framework to blend nicely into ubiquitous computing environments.
Toward a Peer-to-Peer Shared Virtual Reality
Authors: Joaquín Keller, Gwendal Simon
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper envisions a shared virtual reality system that could handle millions of users and objets. The SOLIPSIS system does not rely on servers and is based on a network of peers that collaborate to build up a common virtual world. Real-time interactions and virtual co-presence are enabled by the means of emissive and receptive fields that determine how avatar kinestesia and multimedia streams are established. We describe here the overall architecture and the main algorithms that make SOLIPSIS conceivable.
Toward Optimal Complete Exchange on Wormhole-Routed Tori
Authors: Yu-Chee Tseng, Sze-Yao Ni, Jang-Ping Sheu
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. In the literature, some algorithms are optimal in only one of startup and transmission costs, while some, although are asymptotically optimal in both costs, will incur much larger constants associated with the costs.Our algorithms use both asymptotically optimal startup and transmission time on tori of equal size along each dimension. The schemes are characterized by:(i) the use of gather-scatter tree to achieve optimality in startup time,(ii) the enforcement of shortest paths in routing messages to achieve optimality in transmission time,(iii) the application of network-partitioning techniques to reduce the constant associated with the transmission time, and(iv) the dimension-by-dimension and gather-scatter-tree approach to make possible applying the schemes to non-square, any-size tori.Numerical analysis and experiment both show significant improvement on total communication latency over existing results.
Intranet Security Framework based on Short-Lived Certificates
Authors: Yung-Kao Hsu, Stephen P. Seymour
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: This paper describes an intranet security framework based on public key cryptography. It uses short-lived certificates to avoid and eliminate costly and difficult key management issues in the typical X.509 authentication framework. Specifically, it loosens the tightly coupled relationship between the security components and the application. Operationally, the framework creates the tasks of entity registration and certification so that certificates can be efficiently and securely delivered to the client. The result is a scalable and cost-effective security solution for intranet applications.
What are Multi-Protocol Guessing Attacks and How to Prevent Them
Authors: Sreekanth Malladi, Jim Alves-Foss, Sreenivas Malladi
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

A guessing attack on a security protocol is an attack where an attacker guesses a poorly chosen secret (usually a low-entropy user password) and then seeks to verify that guess using other information. Past efforts to address guessing attacks in terms of design or analysis considered only protocols executed in isolation. However, security protocols are rarely executed in isolation and reality is always a case of mixed-protocols.In this paper, we introduce new types of attacks called multi-protocol guessing attacks, which can exist when protocols are mixed.We develop a systematic procedure to analyze protocols subject to guessing attacks and use this procedure to derive some syntactic conditions to be followed, in order for a protocol to be secure against multi-protocol guessing attacks. We then use the strand space framework to prove that a protocol will remain secure, given that these conditions are followed, by modeling the conditions within the framework. We illustrate these concepts using the Mellovin and Berritt protocol (EKE) as an example.
A Versatile Event-Based Communication Model for Generic Distributed Interactions
Authors: Frédéric Peschanski
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Event-based communication models provide interesting properties for distributed systems such as asyn hronism and type-based selection mechanisms.The Comet middleware we develop proposes such an event-based communication model as foundation.From this canonical model, we show how to build more conventional bidirectional and synchronous interactions with extended features such as impli it type-based multi ast or asynchronous perationalization. Furthermore,we demonstrate the use (and interest)of the lower-level asynchronous model to develop highly flexible distributed services.We illustrate this idea with a publish/subscribe protocol that can be dynamically reconfigured to match various requirements:type-based or content-based filtering semantics, peer-to-peer or mediator-based configurations.