ppxscal/embedding_network huggingface dataset:
An Efficient Method to Improve the Quality of Watermarked Cover Image
Authors: Wen-Shyong Hsieh, Chuan-Fu Wu, Jen-Yi Huang, Jyh-Long Lin, Buh-Yun Sher
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, a general concept called n+k/n method is introduced. In n+k/n method, a special mapping function is defined to map an intermediate set with n+k bits into n bits information set. In the embedding process, the intermediate set is embedded into cover image rather than embedding the information set. If the distance between the features of coverimage and the bits of intermediate set is less than that between the features and information bits, the better cover image quality can be gained. According to the idea of n+k/n method, a special case called n+1/n method is proposed. In this method, the mapping function is an exclusive-or operation. When an information set is given, two sets which satisfy the mapping function can be got. The one which has smaller distance from feature bits is selected as intermediate set. In the paper, it is proved that the maximun distance between the intermediate set and feature set is less than the average distance between the information set and the feature set. The reduction rate of feature modification for n+1/n method will reach 25%, and the improving quality in embedded cover image is more than 2.5db..
Working Group Report on Building Secure Knowledge Systems
Authors: Barbara C. Davis, Bradley J. Wood
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: The Application Security Working Group focused on the issue of building secure knowledge systems. This report outlines opinions about the current state of building secure knowledge systems as well as the outstanding issues in the field.
Social and Computing Solutions for Voluntary Communities of Practice: Designing Community Space
Authors: Michael Muller, Linda Carotenuto, Michael Fontaine, Jessica Friedman, Helene Newberg, Matthew Simpson, Jason Slusher, Kenneth Stevenson
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

We describe CommunitySpace, a component of a project to support voluntary, electronic communities of practice. We detail some of our design decisions, emphasizing issues of flexibility, diversity, and democracy. These design decisions will have impact upon the user interface to CommunitySpace, but they have much more immediate impact upon the architecture, representation, and dynamics of usage of the system. Our work is in the requirements and design phase, and we are interested in the comments of our peers on our evolving ideas.
Data Mining and Personalization Technologies
Authors: Philip S. Yu
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

Data mining has become increasingly popular and is widely used in various application areas. In this paper, we examine new developments in data mining and its application to personalization in E-commerce. Personalization is what merchants and publishers want to do to tailor the Web site or advertisement and product promotion to a customer based on his past behavior and inference from other like-minded people. E-commerce offers the opportunity to deploy this type of one-to-one marketing instead of the traditional mass marketing. The technology challenges to support personalization will be discussed. These include the need to perform clustering and searching in very high dimensional data space with huge amount of data. We'll examine some of the new data mining technologies developed that can support personalization.
Accessing Heterogeneous Data Through Homogenization and Integration Mediators
Authors: Ling-Ling Yan, M. Tamer Özsu, Ling Liu
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

The AURORA mediator system employs a novel 2-tier, plug-and-play mediation model that is designed to facilitate access to a large number of heterogeneous data sources. The paper describes AURORA's mediation model and a suite of techniques used by a specific AURORA mediator, AURORA-RH. This suite includes a mediation methodology provided via an interactive mediator author's toolkit (MAT), a mediation enabling algebra, a query rewriting algorithm, and transformation rules that facilitate query optimization.
Automation of XML Documents Translators Generation
Authors: Fawsy Bendeck
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Large network environments, such as enterprise intranet and Internet, have moved the center stage in the field of software engineering. In this new environment the communication platform is no longer a problem, but the format in which information is exchanged (IIF) has become the new communication barrier. This paper presents a short description of the process of automatic generation of XML translators. This is the first step of the dynamic generation of XML translators, which we believe is the future of the inter-operation among systems (B2B) and among devices (like cellular phones and machines).
Towards an Evaluation Methodology for the Development of Research-Oriented Virtual Communities
Authors: Janet Ho, m. c. schraefel, Mark H. Chignell
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

This paper is part a case study of collaborative environment use and parts a proposition for a methodological approach for evaluating virtual environments based on the findings from that case study. We review the literature on evaluating collaborative environments and we report on a usability study carried out on a research oriented virtual community. The report includes a cluster analysis of the questionnaire results and the use of those results in profiling user attitudes. We propose that this type of differential cluster analysis should be used in the future to identify people who are generally better able to make discriminating judgments, and to identify people who are able to analyze the usability of different components of an environment rather than just the overall environment.
Commitment-Based Enhancement of E-Commerce Protocols
Authors: Pinar Yolum, Munindar P. Singh
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

Protocols represent the allowed interactions among communicating components. Protocols are essential in electronic commerce to constrain the behaviors of autonomous entities. Traditional representations of protocols include the actions, but not their content, which limits their applicability in settings where autonomous entities must flexibly interact to handle exceptions and exploit opportunities. We develop a commitment-based representation, which provides content to the protocols, enabling flexible execution. We show how an existing protocol can be systematically enhanced to yield a protocol that allows the given actions as well as other legal moves.
Towards Scalable Authentication in Health Services
Authors: Gail-Joon Ahn, Dongwan Shin
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Over the last two decades, many attempts have been made to computerize the management of patient records using advanced computing and networking facilities across healthcare providers such as hospitals, clinics, and clearing agencies. In addition to this transition from disparate and paper-based infrastructure to consolidated and digital medium-based one, we have been confronted with privacy and security requirements since the advent of the HealthInsurance Portability and Accountability Act (HIPPA). The problem we seek to address in thispaper is to provide authentication of individual identity in the context of accessing criticalinformation in web-based e-Health systems including secure transmission of data across the Internet. These problems have technical solutions that are well known, but the solutions in general are strongly biased toward a single individual interacting with a single application. In this paper, we propose a scalable token-based authentication architecture and demonstrate how we can implement this architecture using commercial-off-the-self technologies. Ourapproach focuses on vendor-neutral specifications. The proof-of-concept prototype has beenimplemented so that the pilot testing may be conducted at various sites.
English vs. Sealed Bid in Anonymous Electronic Auction Protocols
Authors: Daisuke Hirakiuchi, Kouichi Sakurai
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

We propose an anonymous sealed-bid auction protocol based on Cachin's two server sealed-bid auction scheme by applying the idea from Omote and Miyaji's English auction scheme. The technique of group signatures and the identity escrow play the central roles in our proposed scheme. We further consider the relevance and gap between the English and the sealed-bid anonymous auction protocols.
Engineering of e-Business Applications Infrastructure and Applications for the Mobile Internet
Authors: Fawsy Bendeck, Boris Kötting, Martin Schaaf, Frank Maurer, Matthew Valenti, Max Robert
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Introduction: In this paper, we report on the results of two workshops. We first discuss the workshop on "Engineering of e-Business applications". Then we focus on the workshop on "Infrastructure and Applications for the Mobile Internet".
Efficient Distributed Deadlock Detection and Resolution using Probes, Tokens, and Barriers
Authors: Young Man Kim, Ten-Hwang Lai, Neelam Soundarajan
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

PROBES and TOKENS are used in many deadlock detection and resolution algorithms. A deadlock is detected by propagating PROBES along dependency edges. When the initiator p_i of a probe receives its probe back, it knows of the existence of a deadlock. p_i then sends out a TOKEN to clean up those probes in the deadlock cycle which, if not removed, may later lead to phantom deadlock detections. Only after the token returns to p_i is the deadlock resolved by aborting a `victim' (usually p_i). As a result, all involved transactions remain waiting and all involved resources locked until the token returns to p_i, although the deadlock was already detected when the probe returned to p_i. This paper proposes the idea of BARRIERS to allow the deadlock to be resolved without waiting for the token to return to p_i, thereby reducing the average deadlock persistence time considerably.
History-Based Reintegration of Replicated Shared Workspaces
Authors: Michael Berger
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Replication of shared workspaces is often required for continuous work during decoupled, connectionless phases. Mainly in distributed cooperative teams decoupled phases are long and should be supported by an optimistic strategy which guarantees unlimited, concurrent work by allowing different modifications on each replica. This approach leads to inconsistent versions which must be transformed into one version during reintegration before coupled work.This paper describes the basic mechanisms and the realization of a generic MARC (Merge and Resolve Conflicts) component providing history based reintegration. The component uses operations on an object-oriented data model and defines conflicts in terms of operations as representation of inconsistencies. The conflict resolution is supported by a conflict detection, a template based presentation, an interactive decision selection, and the execution of correction operations. Furthermore, dependencies of conflicts and anomalies of conflicts with directed links are handled generically by an adaptation of decision options in special situations.
Working Group Report on Internet/Intranet Security
Authors: Barbara C. Davis, Tatu Ylönen
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: The Internet/Intranet Security Working Group's discussions focused on the various models for key recovery and/or key backup. Opinions were given on the types of fault tolerance (redundant paths to keys) that should be provided. The discussion invariably focused on the side-effect of key backup, which is the opening of the door to key escrow and law enforcement. Security within the Internet/intranet environment continues to be a rapid growth area. In the past year, many more security solutions have become available. The integration of security into an enterprise continues to be a balancing act between the costs of the security implementation and the value of the data that is being protected. What continues to be a goal is the development of an information infrastructure that incorporates and supports security functionality. Without this infrastructure, there can be no real secure communications outside of an enterprise.
A Secure XML/Java-Based Implementation of Auction Services for Complex Resource Allocation Problems
Authors: Wolfram Conen, Fredj Dridi, Eckhart Köppen
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

This paper describes a novel resource allocation service that can be used in cooperation of enterprises to comprehensively and efficiently coordinate resource-related goals and activities. It can also be used to establish ¿classic¿ markets for interdependent goods or services. The approach is based on bundled-goods auctions and allows achieving a high degree of analyzability, economic efficiency and usability. The resource allocation service is implemented in Java based on the exchange of XML messages. The utilized schemata are expressed using XML DTDs as a lowest common denominator. For development and implementation of the allocation service, utilizing (secure) agents seemed to be a natural choice regarding the fact that the cooperating partners are economically autonomous and thus want (1) to keep some of their data/preferences private, (2) want to deploy a secure platform for the exchange of information and the computation of allocation and prices, and should have the freedom to code their needs and strategies into their coordination agents as required. The impact of infrastructure security and application specific trust considerations are briefly discussed, and finally, the key features of the presented resource allocation service are summarized.
IPsec-WIT: The NIST IPsec Web-Based Interoperability Test System
Authors: Rob Glenn, Sheila Frankel, Doug Montgomery
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

NIST is an active participant in the Internet Engineering Task Force (IETF) efforts to develop Internet Protocol Security (IPsec) technology. Our ultimate goal is to expedite the rapid commercialization and ubiquitous deployment of IPsec protocols. As initial IETF IPsec specifications began to emerge, it became apparent that the availability of interoperability testing would be the critical barrier to the rapid evolution of early prototypes into commercial products. In this paper we describe the design and development of the NIST IPsec Web-based Interoperability Tester (IPsec-WIT). IPsec-WIT is an experimental test system aimed at exploiting WWW technology to provide remote interoperability testing services anytime and anywhere without requiring any distribution of test system software, or relocation of the systems under test. We conclude with a discussion of the potential future evolution of the system based on observations gained through putting our experimental system on-line and providing IPsec and Internet Key Exchange (IKE) testing services to the IETF research and development community for several months.
Management of Work in Progress in Relational Information Systems
Authors: Rafi Ahmed, Umeshwar Dayal
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

In many complex applications, there is a need to manage work-in-progress. Typically, this requires that each user have a private and non-volatile workspace, in which multiple pieces of work are finished and stored before it is appropriate for these data changes to be made globally accessible to other users. These requirements reflect current work practices in paper-based systems, which ensure security, persistence, privacy, and accountability for work-in-progress. This paper describes a technique for implementing work-in-progress that requires no extensions to existing relational database management systems. The semantics of private workspace and work-in-progress are implemented by augmenting the database schema and modifying query and update operations against this augmented schema.
Auto-Erecting Agents for a Collaborative Learning Environment
Authors: F. Wilhelm Bruns, Hermann Gathmann
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

A collaborative learning environment based on 3D media with interchangeable real and virtual components is introduced. This environment is sup-ported by a special knowledge space, which allows the accumulation of concrete haptic as well as abstract physical and logical knowledge. Firstly we present the concept of complex objects, having a real part and various virtual parts of different levels of abstraction.These complex objects allow a synchronous generation and manipulation of real systems and their virtual counterparts. The concept is then extended by a mechanism of auto-erection, enabling these objects to simulate their own potential environment. With this mechanism we are able to freely exchange real and virtual parts of a system in a distributed real learning space. This kind of learning environment is expected to support new forms of interaction, suitable for individual traditions, cultures, norms and conventions of learning styles and pre-knowledge.
An Efficient and Authenticated Group-Oriented Cryptoscheme Based on a Geometric Method in Internet Environments
Authors: Woei-Jiunn Tsaur, Shi-Jinn Horng, Shung-Shing Lee, Ruey-Chang Tsai
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Based on a geometric method, this paper presents an efficient and authenticated cryptoscheme for establishing secure group-oriented data communications in internet environments. We assume that the internet environments consist of many hosts, and each host has many users attached to it. The secure group-oriented communication scheme proposed in this paper incorporates the public-key distribution and the trigonometry concepts as the basic theory. Since this scheme does not need any trusted key distribution center to distribute the common secret session key between two parties and can reduce the computation time needed for securely sending messages to a group of receivers by using multiplication operations instead of modular exponentiation, it is quite suitable to be used in internet environments so that the key distribution is convenient, time-saving and reparable. Furthermore, an authentication protocol is also proposed. Such a protocol cannot only identify both the sender and the receiver of a group correctly, but can also make sure the transmitted message has reached its destination safely.
Protocol Synthesis from Time Petri Net Based Service Specification
Authors: Hirozumi Yamaguchi, Kozo Okano, Teruo Higashino, Kenichi Taniguchi
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Some methods for deriving protocol specifications from given service specifications with time constraints have been proposed. However, existing methods cannot treat the class of service specifications with both parallel synchronization and data values. They also assume that all clocks in the distributed system are synchronized. In this paper, we propose an algorithm to derive a correct protocol specification automatically from a given service specification described in an extended model of time Petri nets where the above restrictions are eliminated. Using our method, we will be free from considering the details of communication delays on the design of real-time distributed systems.
An Adaptive Maintenance of Hierarchical Structure in Ad Hoc Networks and Its Evaluation
Authors: Tomoyuki Ohta, Shinji Inoue, Yoshiaki Kakuda, Kenji Ishida, Kaori Maeda
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Hierarchical routing is effective for large ad hoc networks. However, it is difficult to maintain the hierarchical structure for routing due to node movement. This paper proposes an adaptive method for maintaining the hierarchical structure. The features of the proposed method are (1) the roles of nodes for the hierarchical structure are changed depending on the status of nodes in the restricted vicinity, and (2) the cluster size is adjusted so that the number of nodes in each cluster is bounded by two constants. The adaptability of the proposed method has been evaluated by theoretical considerations and simulation experiments. The results show that node roles and clusters efficiently converges to stable states because of the features. The proposed method therefore has high adaptability to node movement.
Distributing MOO-Based Shared Worlds
Authors: Michael Rowley
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Intermetrics has created a new MOO server which improves upon previous MOO servers by adding persistence and concurrency, and by providing a more efficient implementation of the language. Our next version of the server will make it possible to distribute MOO command execution over a large number of machines. In keeping with centralized MOO systems, the system will be exceptionally evolvable. It will allow changes to things such as object inheritance hierarchies, properties and code, and have the changes be visible to every user without them even having to reenter the MUD world. The system will also handle server machines entering and leaving the system at arbitrary times. This paper briefly describes our new MOO server, and then describes a number of the issues that are involved in creating a distributed MUD server. We describe techniques that have been used by other distributed MUDs and then the approaches that we are using for our own.
Event-Driven Coordination of Real-Time Components
Authors: Theophilos A. Limniotes, Costas Mourlas, George A. Papadopoulos
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The coordination paradigm has been used extensively as a mechanism for softwarecomposition and integration. However, relatively little work has been done for the cases where the software components involved have real-time requirements. The paper presents an extension to a state-of-the-art control- or event-driven coordination language with real-time capabilities. It then illustrates the expressiveness of the proposed extensions by means of modeling a distributed multimedia application. Finally, it discusses how these extensions can be supported by the underlying architecture.