ppxscal/embedding_network huggingface dataset:
A Distributed Software Project Management Tool
Authors: Raymond Surjaputra, Piyush Maheshwari
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The DSPMtool is a distributed client/server software project management information system that consists of the tools and techniques used to gather, analyze, integrate, and disseminate the outputs of various software project management processes. The DSPMtool borrows a few ideas from an emerging group of client/server technology called 'Groupware', which is essentially a collection of technologies that brings people in different parts of the organization, or even from remote sites across the globe, to work together by collecting and sharing information. Multimedia document management is an example of groupware technology that plays an important role in the design of the DSPMtool. Other groupware technologies such as workflow, e-mail, conferencing, and scheduling invoke a great number of ideas and possibilities for ways of conducting and managing a software project, and some of these have found its way into the DSPMtool.
New architectures and I/O scheduling methods for scalable storage products
Authors: Dejan Raskovic, Veljko M. Milutinovic
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

The paper presents solutions for an element of the cluster that will be primarily used as a scalable storage product for a collection of mainframes. Existing storage solutions either employ server attached disks: where the problem is the number of I/O slots, or are specially designed products where the problem is the lack of standards. The essence of both proposed solutions is the introduction of the file usage locality concept, together with methods and techniques to exploit it. The first solution is based on the standard SMP architecture, while the second one employs the DSM architecture as the basic building block of a cluster product.
Reliability, Scalability and Robustness Issues in IRI*
Authors: Ehab S. Al-Shaer, Alaa Youssef, Hussein M. Abdel-Wahab, Kurt Maly, C. Michael Overstreet
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Over the past two years, we have used the IRI (Interactive Remote Instruction) system to teach several live interactive classes with students in different cities. While this system is a prototype - we are using it to better understand both system performance requirements and what tools can be effective for remote instruction and how to use them - we have used it repeatedly to teach regularly scheduled for-credit university classes. This repeated use has resulted in significant improvements in IRI's functionality, but its evaluative use in real classrooms situations has required that we address significant scalability, reliability, and robustness issues. We discuss features of IRI's software architecture and basic functionality motivated by these scalability and reliability issues.
Enabling Inter-Company Team Collaboration
Authors: Ludwin Fuchs, Steven E. Poltrock, Werner Geyer, Tom Frauenhofer, Shahrokh Daijavad, Heather A. Richter
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Collaboration across different companies at different geographical locations has become a business necessity. We are building a system called TeamSpace that integrates different types of collaboration technologies into an environment that supports inter-company teams. Enabling inter-company collaboration is still a challenge because security infrastructures are in place to prevent the flow of information. This paper reports our experiences in using existing technologies to enable the inter-company collaboration of our own project team. We describe our initial approaches to the problem and explain why they failed. Based on the lessons learned, we built a TeamSpace prototype using an architecture that allowed us to collaborate across existing security infrastructures.
Enterprise Security Applications of Partition Rule Based Access Control (PRBAC)
Authors: Marta Teresa Acevedo, David Fillingham, John Lucas Nicolettos
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: As commercial enterprises increase their dependency on electronically managed information and compete in global markets, the misuse or loss of enterprise information can cause significant damage to the economic well-being of an enterprise as well as the nation. This paper draws parallels between military and business enterprise access control needs and examines partition rule-based access control (PRBAC) as a potential technology solution to the needs of both communities. PRBAC is an access control technology that allows a user to have access to information as a function of the sensitivity of the information and individual authorizations, based on a user-defined security policy. A user gains access to information as a result of an access control decision which compares sensitivities conveyed in data security labels to authorizations conveyed in user public-key certificates.
Mining Exception Instances to Facilitate Workflow Exception Handling
Authors: San-Yih Hwang, Sun-Fa Ho, Jian Tang
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

The importance of exception handling within the context of workflow management has been widely recognized. While some exceptions are expected at design time and thus can be incorporated into the workflow design via some flexible mechanism, others are totally unexpected. Previous work in handling unexpected workflow exceptions focuses on the run-time support to, for example, allow the rollback of some already completed activities, validate the correctness of dynamic workflow change, and deploy a solution to handle exceptions. Authorized persons are responsible for deriving solutions to handle exceptions. In this paper we propose a novel approach to facilitating users in proposing solutions for resolving a given exception. Specifically, our approach scans through the previous records in handling exceptions, looking for those that are close to the current exception. The ways in which those exceptions were handled serve as useful information in determining how to handle the current one. Several algorithms are proposed and evaluated through both theoretical analysis and synthetic data set.
Design and implementation of PVM-based portable distributed shared memory system on the workstation cluster environment
Authors: Hiroyuki Sato, Takeshi Nanri, Masaaki Shimasaki
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Cluster of workstations or personal computers connected with high speed network has become one of major architectures of distributed memory parallel computers. However, software on the cluster environment is still not improved in performance. In particular, there has not been proposed a standard distributed shared memory mechanism on the cluster environment. The distributed shared memory can be a solution of programming style on distributed memory parallel system including clusters because we know from experiences that shared memory model makes programming easy. It must be implemented with care for the performance problem because we cannot assume any hardware support for shared memory system in the cluster environment. Another, but serious problem is the portability. In this paper, we discuss the design and implementation of portable distributed shared memory system. Our shared memory system is based on PVM in consideration of portability. Our contribution in this paper is the design and implementation of portable shared memory system on the cluster environment using faithful implementation of active messages fully in software, together with an enhancement of PVM to support active messages.
A formal versioning approach for distributed objectbase
Authors: Panos A. Patsouris
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

We initially provide, in summary, a formal object-oriented model for objectbases considering (i) simple objects (classes and their instances), (ii) 2-objects (2-classes and their 2-instances) where each 2-object encapsulates a two-level-hierarchy of objects, and (iii) complex objects defined inductively from the 2-objects through a composition operation. The inheritance concept is replaced by that of a "link" between two objects. Based on the above model, we introduce and develop a formal versioning approach by defining the concepts of "core data" and "core behaviour" that together are expressed through the term "compatibility" among objects. We extend the "versioning" notion to encompass not only the instances but also the classes, and 2-classes of our formal object-oriented model and include the different "views" (modelled as objects) of an entity within the same versioning framework. We further refer to the appropriate versioning structures. We then develop a distribution strategy encompassing 2-objects and complex objects, as well as their versions, and stress the advantages (both at the design and distribution level) of this approach through an example.
From Protocol Specifications to Flaws and Attack Scenarios: An Automatic and Formal Algorithm
Authors: Mourad Debbabi, Mohamed Mejri, Nadia Tawbi, I. Yahmadi
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Presents a new approach to the verification of authentication protocols. This approach is formal, fully automatic and does not necessitate any specification of any protocol property or invariant. It takes the protocol specification as the parameter and generates the set of flaws, if any, as well as the corresponding attack scenarios. This approach involves three steps. First, protocol roles are extracted from the protocol specification. Second, the intruder's abilities to perform communication and computation are generated from the protocol specification. In addition to the classical, known intruder computational abilities, such as encryption and decryption, we also consider those computations that result from different instrumentations of the protocol. The intruder's abilities are modeled as a deductive system. Third, the extracted roles as well as the deductive system are combined to perform the verification. The latter consists in checking whether the intruder can answer all the challenges uttered by a particular role. If that is the case, an attack scenario is automatically constructed. To exemplify the usefulness and efficiency of our approach, we illustrate it on the Woo and Lam (1994) authentication protocol.
Efficient Massive Sharing of Content among Peers
Authors: Peter Triantafillou, Chryssani Xiruhaki, Manolis Koubarakis
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request response times. This is a formidable challenge, given the requirement to respect the autonomy of peers, their heterogeneity in terms of processing and storage capacities, their different content contributions, the huge system scale, and the dynamic system environment. Our approach exploits the semantic categorization of published documents and constructs clusters of peers. We provide a formal formulation for the problem of load balancing in our setting and prove that it is NP-complete. We also present a greedy polynomial time algorithm that achieves nearly optimal load balancing as shown by our experimental results.
A multimedia programming toolkit/environment
Authors: Raja Harinath, Wonjun Lee, Shwetal S. Parikh, Difu Su, Sunil Wadhwa, Duminda Wijesekera, Jaideep Srivastava, Deepak R. Kenchammana-Hosekote
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper provides details and implementation experiences of a multimedia programming language and associated toolkits. The language, a data-flow paradigm for multimedia streams, consists of blocks of code that can be connected through their data ports. Continuous media flows through these ports into and out of blocks. The blocks are responsible for the processing of continuous media data. Examples of such processing include capturing, displaying, storing, retrieving and analyzing their contents. The blocks also have parameter ports that specify other pertinent parameters, such as location, and display characteristics such as geometry, etc. The connection topology of blocks is specified using a graphical editor called the Program Development Tool (PDT) and the geometric parameters are specified by using another graphical editor called the User Interface Development Tool (UIDT). Experience with modeling multimedia presentations in our environment and the enhancements provided by the two graphical editors are discussed in detail.
Aspect Oriented Programming Using Actors
Authors: Angelo Furfaro, Libero Nigro, Francesco Pupo
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper summarizes an actor-based middleware in Java for the development of time-dependent distributed systems. The approach centres on the separation of concerns.Functional, synchronization, control and configuration aspects of an application can separately be dealt with in a design so as to favour the fulfilment of the application requirements. Actors are encapsulation units of data and behaviour and are modelled as finite state machines. They enable ubiquitous computing. Actors have location transparent names and can migrate, possibly autonomously, from node to node of an heterogeneous computinginfrastructure like Internet, for accomplishing their computational task. Actors are based on an explicit messaging system. Crosscutting concerns in group of actors can be programmed in special actors (synchronizers) which transparently filter message exchanges and superimpose to them timing and synchronization constraints which directly affect message scheduling. The paper describes the implementation of a real-time multimedia QoS synchronizer.
Dynamic Support for Distributed Auto-Adaptive Applications
Authors: Ana Lúcia de Moura, Cristina D. Ururahy, Renato Cerqueira, Noemi de La Rocque Rodriguez
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This work presents an infrastructure that simplifies the development of distributed applications that can adapt automatically to nonfunctional properties of their components and of their execution environment. This infrastructure, based on the programming language Lua and on CORBA, allows applications to select dynamically the components that best suit their requirements, to verify whether the system is satisfying these requirements, and to react, when appropriate, to variations in the nonfunctional properties of the services in use. We use CORBA's Trading Service to support dynamic component selection. An extensible mon-itoringfacility supports monitoring of dynamically defined requirements. We use the Lua language to specify adaptation strategies, and a smart proxy mechanism to apply these strategies.
A Novel Joint Rate Control Scheme for the Coding of Multiple Real Time Video Programs
Authors: Z. G. Li, C. Zhu, F. Pan, G. Feng, X. Yang, S. Wu, Nam Ling
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The objective of joint rate control is to achieve a better and more uniform picture quality by exploiting the complexity of each program. In this paper, a novel joint rate control scheme is presented for real time coding of multiple video programs. In our scheme, the total available channel bandwidth is firstly assigned to each program in proportion to its information content. A novel control scheme, which is adaptive to the variation of distributed bandwidth, is thenpresented in our design to determine quantization parameters and the number of skipping frames for each program. As a result, the proposed scheme can be considered as a "look current" scheme, which outperforms many existing ones in terms of coding complexity and video quality.
The Design and Evaluation of Policy-Controllable Buffer Cache
Authors: Chul-Jin Ahn, Seong-Uk Choi, Myong-Soon Park, Jin-Young Choi
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Traditional software using BBA(Black Box Abstraction) paradigm may show performance degradations under unpredicted situations. OI(Open Implementation) is proposed to solve the problem of BBA. While conserving the advantages of the BBA, the OI provides clients with interfaces to control the strategy of the black box, and thus makes the black box to be flexible and reusable in various situations and requests.In this paper we attempt to solve the problem of the buffer cache in the operating systems using the OI. We propose a buffer cache design which can support multiple buffer replacement policy. The buffer replacement policy can be controlled by client using provided meta-interface. We modify the kernel of Linux to get performance data. According to our experimental results on Linux, the performance is improved up to 36 %. We conclude that the OI can be an alternative to BBA.
Feature Reduction for Neural Network Based Text Categorization
Authors: Savio L. Y. Lam, Dik Lun Lee
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

In a text categorization model using an artificial neural network as the text classifier, scalability is poor if the neural network is trained using the raw feature space since textural data has a very high-dimension feature space.We proposed and compared four dimensionality reduction techniques to reduce the feature space into an input space of much lower dimension for the neural network classifier. To test the effectiveness of the proposed model, experiments were conducted using a subset of the Reuters-22173 test collection for text categorization.The results showed that the proposed model was able to achieve high categorization effectiveness as measured by precision and recall. Among the four dimensionality reduction techniques proposed, Principal Component Analysis was found to be the most effective in reducing the dimensionality of the feature space.
Working Group Report on Collaborative Agents in Distributed Web Applications
Authors: Robert Tolksdorf, Ted Goddard, Muralidharan Srinivasan, Stefan Fünfrocken, Michael Schroeder
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: The attendees of the workshop "Collaborative Agents in Distributed Web Applications" (CADWA for short) tried to assess the adequacy of current agent technology integrated with the Web in meeting the requirements of collaborative applications. This paper sketches the different approaches presented in the workshop and summarizes the consolidated results of the discussions.
Control of parallel task granularity by throttling decomposition
Authors: Suntae Hwang
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper introduces a new mechanism which performs lazy task creation in a novel way for the exposure of large grain parallelism. In lazy task creation, all new-born tasks are provisionally inlined and parallelism is extracted from the inlined information later on demand. Large grain parallelism is achieved by executing the inlined tasks in the current thread unless a new task is demanded. However, the new scheme leaves a self-divisible task called seed instead inlining the task and let further task demands be satisfied by sprouting new tasks from the seed rather than retrospectively reversing the inlining decision of the task.In the scheme, decomposition itself is throttled rather than just the extraction of a task. The scheme makes the serial section clearly separated from the parallel section in an evaluation tree, and this allows the serial section to adopt a sequential algorithm. The performance improvement is significant in divide-and-conquer applications by adoption of sequential algorithms. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance Analysis of a Parallel Distributive Join Algorithm on the Intel Paragon
Authors: Soon Myoung Chung, Arindam Chatterjee
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper, we analyze the performance of the parallel Distributive Join algorithm that we proposed. We implemented the algorithm on an Intel Paragon machine and analyzed the effect of the number of processors and the join selectivity on the performance of the algorithm. We also compared the performance of the Distributed Join (DJ) algorithm with that of the Hybrid-Hash (HH) join algorithm. Our results show that the DJ performs comparably with the HH over the entire range of number of processors used and different join selectivities. A big advantage of the parallel DJ algorithm over the HH join algorithm is that it can easily support non-equijoin operations. The results can also be used to estimate the performance of file I/O intensive applications to be implemented on the Intel Paragon machine.
A Survey of Transport Layer Protocols Suited for Real-Time Data Delivery over Diffserv-Capable Networks
Authors: Yoko Noda, Tatsuhiko Sakai, Hiroshi Shigeno, Kenichi Okada, Yutaka Matsushita
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

As the Internet evolves toward the global multi-service network of the future, a key consideration is support for services with guaranteed quality of service (QoS). The current Internet has a number of barriers to QoS support for real-time data delivery such as the lack of control architectures. The proposed differentiated services (Diffserv) framework is seen as the key technology to achieve this. This paper examines standard transport layer protocols, i.e. UDP and TCP, suited for real-time data delivery over Diffserv-capable networks where bandwidth guarantees are provided. We designed a streaming video application that buffers a portion of data on the receiver before starting the playback and operates in a streaming mode. Streaming media applications currently used in the Internet use UDP because of the general belief that TCP's reliable delivery mechanisms such as congestion control and retransmission are unsuitable for time-sensitive delivery. However, TCP showed the better simulation results than UDP when packets are lost over Diffserv networks. In our simulation, TCP can adapt its sending rate to the guaranteed bandwidth and the buffer on the receiver allows TCP to retransmit lost packets before the playback. As for TCP, the employment of SACK option that can recover lost packets efficiently contributes to the better performance.
Multimedia Communication Environment for Children, Handicapped, and Elderly People
Authors: Tetsuya Hirotomi, Nikolay N. Mirenkov
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

We have developed a multimedia communication environment for children, handicapped and elderly people. This environment, named "F-Communication system," is based on self-explanatory components and multiple interfaces. It allows users to manipulate the components and send multimedia messages only by operations with mouse clicks. In this paper, self-explanatory components for the communication and an overview of two interfaces of the system are presented.