ppxscal/embedding_network huggingface dataset:
A Fuzzy Object Query Language (FOQL) for Image Databases
Authors: Surya Nepal, M. V. Ramakrishna, James A. Thom
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

Content based retrieval systems have been developed for querying image data in which the users can pose queries based on visual properties such as color and texture. These systems, which have advanced the state of the art in image database systems, remarkably lack formal query languages. The traditional query languages are unable to capture the inherent fuzzy nature of the image data and content based querying. The fuzzy object query language (FOQL) presented in this paper addresses the need to support fuzzy values and fuzzy collections required for image databases. It can be used for defining schemas and high level concepts, and for querying image databases.It captures the inherent fuzzy nature of content based retrieval by keeping the query results fuzzy as against other query languages. The users can interactively refine their queries and high level concept definitions using recursive and named query definition constructs in FOQL. Being an extension of ODMG-OQL, FOQL can be easily mapped to ODMG-compliant visual query languages.
Web Infrastructures and Coordination Architectures for Collaborative Applications - Shared Artifacts, a Shared Language, or Shared Spaces
Authors: Giacomo Cabri, Gabriele Kotsis
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

The attendees of the workshop "Web Infrastructures and Coordination Architectures for Collaborative Applications" tried to develop a joint opinion how the Web and its infrastructure should develop to become a productive environment for collaborative applications. This paper sketches the different approaches presented in the workshop and summarizes the consolidated results of the discussions.
Incremental Analysis and Verification of Authentication Protocols
Authors: Takamichi Saito, Wu Wen, Fumio Mizoguchi
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

This paper describes a verification system designed to assist the incremental analysis and verification of authentication protocols. The verification system consists of a logic prover, which is based on the BAN logic, and extensions that can be used to prove incrementally developed protocols. We have used this system to obtain standard proofs for most well-known authentication protocols. An example of an incrementally developed protocol, the necessary extension to the verification system, and the verification results are described to illustrate its effectiveness in helping to simplify the proof procedures and to deepen our understanding of the protocol.
A Transmission Service with Three-Queue Management for a Distributed Remote Monitoring Environment
Authors: Jui-Fa Chen, Wei-Chuan Lin, Chi-Ming Chung, Zhi Yu Jian, Wen-Chen Hu
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

High-speed fixed network is not suitable to be applied to the distributed remote monitoring environment because its lack of mobility. Therefore, the wireless communication is another choice of transmission. This paper proposes a transmission service to classify the transmitted data into three kinds of transmission events. Three priority queues are used to receive the corresponding events and transmit these data according to their priority. By this mechanism, some of the data, that are out of date and not to influence the monitoring environment, could be discarded. In this way, the cost to transmit data for monitoring is reduced. This paper also proposes mechanisms to handle the data ordering and encoding problems. To verify the advantage of this transmission service, an implemented prototype is proposed based on the GSM short message system. The proposed prototype also compared the time and data lose rate with the unique queue, three queues mechanisms. The results show that the average wait time of the transmitted data packet and the transmission cost are reduced.
An Architecture for an Anonymity Network
Authors: Marc Rennhard, Bernhard Plattner, Sandro Rafaeli, Laurent Mathy, David Hutchison
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

It is difficult to design a system that provides anonymity for delay-sensitive services such as Web browsing. Existing systems are either not resistant against sophisticated attacks or they achieve their level of anonymity at the cost of a high bandwidth overhead. In addition, these systems do not meet all of our requirements. In this paper, we present the architecture of our prototype implementation of an anonymity network. Our system is trustworthy, fair, stable, modular, and bases on the well studied and accepted secure sockets layer protocol. With this system, we want to derive quantitative results about the tradeoff between anonymity and performance penalty. We will then extend our anonymity network such that it provides high resistance against various attacks while minimizing its band-width overhead.
Dynamic Online Collaborative Information Sharing in Semantic Multicast
Authors: Eddie C. Shek, Son K. Dao, Asha Vellaikal, Wensheng Zhou
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Semantic multicast defines a large-scale shared interaction infrastructure which provides a seamless environment for collecting, indexing, and disseminating the information produced in collaborative sessions to the correct users at the right amount of detail using IP multicast as the underlying data communication mechanism. A semantic multicast graph is discovered and constructed to organize user requests into a hierarchy of group requests that represents an increasingly specialized range and quality of semantic topics as one goes down the hierarchy. It establishes a logical flow of collaboration stream between interest groups. A semantic multicast graph is mapped onto a hierarchy of cooperating network content agents that gather information streams and incrementally enrich, archival, and filter the streams for the semantic coverage of specific interest groups in the graph. Through this mechanism, the semantic multicast framework amortizes processing on information streams by automatically moving common operations on information streams needed to satisfy multiple user requests to content agents providing the services.
Poster on A Distributed RAID VOD System
Authors: Shunichiro Nakamura, Harumi Minemura, Tomohisa Yamaguchi, Hiroshi Shimizu, Takashi Watanabe, Tadanori Mizuno
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

Summary form only given. We present an implementation of a VOD (video on demand) system that addresses the problem of increasing video stream supply capabilities. To obtain fundamental video stream transfer characteristics on Ethernet, we first performed an experiment in which it became clear that bottlenecks of the CPU of a video server were the most serious. To solve this problem we implemented a distributed RAID4 (Redundant Arrays of Inexpensive Disks) method video server. Distributed RAID means extending the RAID method usually applied to disks to the servers, so as to achieve improvements in performance and reliability. The great advantage of this architecture is that the linear performance improvement can be achieved by adding inexpensive servers of a diffusion model.
Integration of Statecharts
Authors: Heinz Frank, Johann Eder
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

View integration is an effective technique for developing large conceptual database models. The universe of discourse is described from the viewpoint of different user groups or parts of the system resulting in a set of external models. In a second step these models have to be integrated into a common conceptual database schema.In this work we present a new methodology for integrating views based upon an object oriented data model, where we concentrate on the integration of the behaviour of objects, which is not supported by existing view integration methods.
Establishing a Secure Multicast Group for Remote Software Delivery
Authors: Lin Han, Nahid Shahmehri
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The development of IP multicast provides an efficient way for data distribution. Applying this technique to delivering software remotely can save a lot of money. Thus, there is a high demand for such a new service that uses multicast to distribute software securely and reliably. Usually, two phases exist in software delivery, group establishment and data transfer. In this paper, we focus on the multicast group establishment phase. We introduce an agent-based group management system. This system is responsible for authentication and authorization to establish a secure group which demands that only authorized recipients should join the transmission group. The paper presents an overview of the system and describes an interface to end-users.
Real-Time Transaction Management in Mobile Computing Systems
Authors: Ersan Kayan, Özgür Ulusoy
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

In order to respond to real-time data access requirements of the underlying applications, mobile computing systems need to be supported by real-time DBMSs. In this paper, we discuss critical issues related to real-time transaction management in mobile computing systems. We identify some open research problems and suggest directions for future work on possible solution methods.We also present a mobile database system model that takes into account the timing requirements of applications supported by mobile computing systems. We provide a transaction execution model with two alternative execution strategies for mobile transactions and evaluate the performance of the system considering various mobile system characteristics.
Detection of Summative Global Predicates
Authors: Loon-Been Chen, I-Chen Wu
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In distributed programs, we usually keep some global predicates from being satisfied to make it easy to run the programs correctly. A common type of global predicates are: the total number of certain tokens in the whole distributed system is always the same or in specific ranges. In this paper, we call this {\em summative predicates}, classified into the following four:(1) at some global state of the system, N \neq K,(2) N K (or N \geq K), and(4) N = K,where N is the total number of tokens and K is a constant.This paper investigates the methods of detecting various summative global predicates. The first class of summative predicates are trivial to detect by simply checking each message. For the second class of summative predicates, Groselj \cite{BG93} and Garg \cite{CMC95} solved the problem by reducing the problem to a maximum network flow problem. In this paper, we propose an elegant technique, called normalization, to allow the second and third classes of summative predicates to be solved by also reducing the problem to a maximum network flow problem. For the fourth class of summative predicates, we prove that it is an NP-complete problem.
A Practitioners Guide for Assessing Collaboration Systems
Authors: Tamra J. Hall, Kristina B. Buckley
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

This paper provides guidelines for assessing the effectiveness of collaboration systems in an operational environment. Specific guidelines are provided for the collection of metrics in terms of what types of data to collect, why each type of metric is important, and how and when to collect metrics. While this document focuses on assessing collaboration systems as applied to the Intelligence Community, the measurement concepts presented can be applied to the assessment of a wide range of systems.
Step-by-Step System Construction Technique with Assurance Technology -Evaluation Measure for Step-by-Step System Construction-
Authors: Kazuo Kera, Keisuke Bekki, Kinji Mori
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Recently the system needs of growing systems including heterogeneous functions and operations are increased. Assurance system that achieves high reliability and high availability is very important for such systems. In order to realize high assurance system, we researched the step-by-step construction technique with assurance technology. In this paper we mainly discuss the evaluated measure for step-by-step construction. The functional reliability and the online functional availability are the best measure in order to decide the order of the step-by-step system construction. According to the measure, the functional group construction is the best solution.
Boundaries, Awareness and Interaction in Collaborative Virtual Environments
Authors: Chris Greenhalgh, Steve Benford
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

This paper is concerned with how collaborative virtual environments can be structured in order to enable greater scalability and yet maintain a richness of communication. Based on a survey of current work in this area a number of important issues and design criteria are drawn out. In this context a recent extension to the spatial model of interaction called third party objects is described which can be used to develop a variety of spatial structures which have different effects on mutual awareness and communication. These structures include nested regions and zones, dynamic data districts and potentially mobile crowds of participants. The paper also discusses how these structures can be exploited by an underlying network architecture based on a dynamically evolving hierarchy of multicast groups and describes the MASSIVE-2 system which implements it.
Instruction Folding in Java Processor
Authors: Lee-Ren Ton, Lung-Chung Chang, Min-Fu Kao, Han-Min Tseng, Shi-Sheng Shang, Ruey-Liang Ma, Dze-Chaung Wang, Chung-Ping Chung
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Traditionally, the performance of a stack machine was limited by the true data dependency. A performance enhancement mechanism - Stack Operations Folding - was used in Sun Microelectronics picoJava design [1][2] and it can reduce up to 60% of all stack operations. In this paper, we use the Java bytecode language as the target machine language, and study its instruction folding on a proposed machine model.Three folding strategies: 2-foldable, 3-foldable and 4-foldable, were simulated and evaluated. Statistical data show that our third folding strategy eliminates 73% of all stack operations, and each strategy has an overall program speedup of 1.19, 1.25 and 1.26, respectively, as compared to a traditional stack machine. Moreover, a Java machine model suitable for instruction folding, together with its pipeline stages, are presented. It seems to have the best cost/performance effectiveness of a Java stack machine if six bytes decoder width and the second folding strategy -- the three-foldable strategy -- are adopted.
Personal Web Space
Authors: Yangjun Chen, Tony Liu, Paul G. Sorenson
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Abstract This paper describes the functional requirement and architecture of a software system called Personal Web Space (PWS). A PWS is a system to manage the information from the Web, for either leisure or work related use. Similar to bookmarks, a PWS stores a set of URL addresses but, in addition, it caches on a proxy server pages of high interest. PWS is developed through a evolutionary process that is outlined in the paper. First, a method is prescribed to rank a page (or an URL address) based on the degree of importance to a person as determined by search engine responses and user input. Second, the information stored in a PWS must be refreshed periodically to keep up with the new state of information available on network; therefore a technique is proposed for determining and monitoring freshness. Thirdly, a PWS evolves through enlargement to include more information domains, or refinement to concentrate on smaller sub-domains. The paper describes how enlargement and refinement operations are mapped on to the stored PWS data dictionary. Finally, keyword queries can be issued against a PWS to get interesting information quickly. In this sense, a PWS uses a combination of information caching, information retrieval and bookmarks technique to enhance significantly user performance on the Web.
Towards an Agent-Based Infrastructure for Distributed Virtual Organizations
Authors: Michael Berger, Bernhard Bauer, Michael Watzke
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Agent technology has the potential to play a key role in building and supporting virtual enterprises. To host and enable agents an open infrastructure is needed. Beside standards, such an infrastructure should be generic and deployment independent to deal with the heterogeneity of the computing and information technology, e.g. by supporting devices like mobile phones, PDAs, and personal computers as well as different kinds of mobile and fixed networks. In this paper we give an overview over the agent platform LEAP, developed for small end user devices. We show the main issues in downsizing it to PDAs/mobile phones and applying agent technology in the area of virtual team support.
A New Query Processing Technique for XML Based on Signature
Authors: Sangwon Park, Hyoung-Joo Kim
Venue: Proceedings of the 7th International Conference on Database Systems for Advanced Applications (2001)

Abstract: XML is represented as a tree and the query as a regular path expression. The query is evaluated by traversing each node of the tree. Several indexes are proposed for regular path expressions. In some cases these indexes may not cover all possible paths because of storage requirements. In this paper, we propose a signature-based query optimization technique to minimize the number of nodes retrieved from the database when the indexes cannot be used. The signature is a hint attached to each node, and is used to prune unnecessary sub-trees as early as possible when traversing nodes. For this goal, we propose a signature-based DOM (s-DOM) as a storage model and a signature-based query executor (s-NFA). Our experimental results show that the signature method outperforms the original.
Implementation of ECC/ECDSA Cryptography Algorithms Based on Java Card
Authors: Jin-Hee Han, Young-Jin Kim, Sung-Ik Jun, Kyo-Il Chung, Chang-Ho Seo
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper describes implementations and test results of Elliptic Curve Cryptography (ECC) and Elliptic Curve Digital Signature Algorithm (ECDSA) algorithms based on Java card. 163-Bit ECC guarantees as secure as 1024-Bit Rivest-Shamir-Adleman (RSA) public key algorithm, which has been frequently used until now. According to our test results, 163- bit ECC processing time is about five times fast compared with 1024-bit RSA and amount of resource usages of ECC is smaller than RSA. Therefore, ECC is more appropriate for use on secure devices such as smart cards and wireless devices with constrained computational power consumption and memory resources.
An Internet Auction Method using Decentralized Selection Servers
Authors: Junichi Funasaka, Kenji Ishida, Kitsutaro Amano, Yukiyoshi Jutori
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Internet auctions have got attention with the sensational diffusion of the Internet, because we are able to trade various goods for a desirable price. Many Internet auctions adopt the English auction. The English auction is the mechanism to settle a successful bidder. Conventional Internet auction systems are using one logical server called an auction server that is constructed with one or several servers. So, if simultaneous bids occur, the load of the auction server increases. Besides, when congestion at circumference of the auction server occurs, the response time will increase. We propose a new Internet auction method using decentralized selection servers which will reduce superfluous information derived from bidders. The proposed method tends to hold down the increase of the response time by lightening the processing load at an auction server and cutting down congestion around the auction server. In order to evaluate the proposed method concisely, we assume a typical auction service and a network. We evaluate the proposed and the conventional methods by simulation experiments using a network simulator OPNET Modeler. Consequently, it is shown that the proposed method is more scalable and can be deployed with smaller cost.
Multiprocessor Scheduling Algorithm Utilizing Linear Clustering of Directed Acyclic Graphs
Authors: Choung Shik Park, Sang-Bang Choi
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

The multiprocessor scheduling is the method to allocate modules(or tasks) with precedence relationship onto the processors in such a way that the parallel time (completion time of a program in multiprocessor system) is minimized. In this paper, we propose a scheduling heuristic which is based on linear clustering scheme and uses only local information of a DAG(Directed Acyclic Graph). Proposed algorithm gives an optimal scheduling result for a coarse grain DAG with only fork or join nodes and a greatly reduced parallel time for general DAGs. Simulation results showed that proposed algorithm has better scheduling result and less algorithm execution time than any of compared algorithms.
Control Software for Home Automation, Design Aspects and Position Paper
Authors: David J. Greaves
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The home is an eternal, heterogeneous, distributed computing environment which must be secure and reliable. Computers and embedded processors in the home are all different shapes and sizes and ages. Hence the home poses one of the most challenging environments for cooperative programming. We envisage that control software is introduced into the home by four different methods varying from embedded ROM code to applets generated from a combination of natural language and gesture with wands. But we argue that, in the long term, all of it must be represented in a common, formally-verifiable language and conform to acommon scripting convention. The AutoHan project at the University of Cambridge Computer Laboratory is the umbrella under which we are trying to grow these ideas [3].