ppxscal/embedding_network huggingface dataset:
An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers
Authors: Chengzhong Xu, Burkhard Monien, Reinhard Lüling, Francis C. M. Lau
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on its local information and manages work load migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms, the dimension exchange and the diffusion methods and their variants in terms of their performances in both one-port and all-port communication architectures. It turns out that the dimension exchange method outperforms the diffusion method in the one-port communication model, and that the strength of the diffusion method is in asynchronous implementations in the all-port communication model. The underlying communication networks considered assume the most popular topologies, the mesh and the torus and their special cases: the hypercube and the k-ary n-cube.
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
Authors: Patrick P. C. Lee, John C. S. Lui, David K. Y. Yau
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from traditional secure group communication. They are (1) distributed nature in which there is no centralized key server, (2) collaborative nature in which the group key is contributory; i.e., each group member will collaboratively contribute its part to the global group key, and (3) dynamic nature in which existing members can leave the group while new members may join. Instead of performing individual rekey operations, i.e., recomputing the group key after every join or leave request, we consider an interval-based approach of rekeying. In particular, we consider three distributed algorithms for updating the group key: (1) the Rebuild algorithm, (2) the Batch algorithm, and (3) the Queue-batch algorithm. Performance of these distributed algorithms under different settings, such as different join and leave probabilities, is analyzed. We show that these three distributed algorithms significantly outperform the individual rekey algorithm, and that the Queue-batch algorithm performs the best among the three distributed algorithms. Moreover, the Queue-batch algorithm has the intrinsic property of balancing the computation/communication workload such that the dynamic peer group can quickly begin secure group communication. This provides a fundamental understanding about establishinga collaborative group key for a distributed dynamic peer group.
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
Authors: David A. Bader, Joseph JáJá, David Harwood, Larry S. Davis
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents efficient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter (SNF), and an image segmentation technique which makes use of the SNF and a variant of the conventional connected components algorithm which we call delta-Connected Components. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. The image segmentation algorithm makes use of an efficient connected components algorithm based on a novel approach for parallel merging. The algorithms have been coded in Split-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific CS-2, Intel Paragon, and workstation clusters. Our experimental results are consistent with the theoretical analysis (and provide the best known execution times for segmentation, even when compared with machine-specific implementations.) Our test data include difficult images from the Landsat Thematic Mapper (TM) satellite data.
Parallel Biological Sequence Comparison Using Prefix Computations
Authors: Srinivas Aluru, Natsuhiko Futamura, Kishan Mehrotra
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and affine gap penalty functions, full-sequence and subsequence matching, and space-saving algorithms. The best known sequential algorithms solve these problems in $O(mn)$ time and $O(m+n)$ space, where $m$ and $n$ are the lengths of the two sequences. All the algorithms presented in this paper are time optimal with respect to the best known sequential algorithms and can use $O\left(\frac{n}{\log n}\right)$ processors where $n$ is the length of the larger sequence. While optimal parallel algorithms for many of these problems are known, we use a simple framework and demonstrate how these problems can be solved systematically using repeated parallel prefix operations. We also present a space-saving algorithm that uses $O\left(m+\frac{n}{p}\right)$ space and runs in optimal time where $p$ is the number of the processors used.
Broadcasting on the star and pancake interconnection networks
Authors: Ke Qui
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Broadcasting is an important data communication operation in a parallel computer. In this paper, we first give a short survey on various broadcasting schemes on the star and pancake interconnection networks. We then present a broadcasting algorithm on the star and pancake networks, which can broadcast m messages of fixed length on an n-star or n-pancake in time O(n log n+m), improving the previous best result O(m log n log n). Our result is optimal in view of the /spl Omega/(n log n+m) lower bound for the problem. Moreover our algorithm works for both the star and pancake networks, while the previous O(m log n+n log n) algorithm is only for the star.
Quality Models Reuse: Experimentation on Field
Authors: Alessandro Bianchi, Danilo Caivano, Giuseppe Visaggio
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

A transferable quality model must be general. This implies that only the high level characteristics can be transferred into different settings and that the refinement of the characteristics into metrics must be operated according to the context peculiarities. In spite of the amount of quality models and approaches to quality models definition presented in literature, there aren't experiences reported showing the same quality model reused in different environments. This statement needs further investigation. The aim of this work is to present anexperience on field that involves two industrial projects in which the same quality model was used. The study confirms the need to modify the quality model, not only in the metrics but also in the measurement processes and in the interpretation of the resulting measures as side effects.
Compression of Quincunx Subbands
Authors: José Alexandre Nalon, João Baptista T. Yabu-uti
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Quincunx downsampling splits the spectrum of an image in two diamond-shaped subbands. This allows the information to which the human eye is most sensitive to be preserved, and also requiring less bits in a lossy compression. In this paper, we develop an algorithm that performs successive quincunx subband decompositions, thus allowing multi-level decompositions and efficient coding. Theory of lattices is briefly reviewed, and simulations using a simple subband coder were carried out. Results obtained are compared to the rectangular separable subband decomposition, showing that, without exploring redundancies due to quincunx simmetries, both strategies deliver simmillar results.
Low-Latency Message Passing on Workstation Clusters using SCRAMNet
Authors: Vijay Moorthy, Matthew G. Jacunski, Manoj Pillai, Peter P. Ware, Dhabaleswar K. Panda, Thomas W. Page,  Jr., P. Sadayappan, V. Nagarajan, Johns Daniel
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Clusters of workstations have emerged as a popular platform for parallel and distributed computing. Commodity high speed networks which are used to connect workstation clusters provide high bandwidth, but also have high latency. SCRAMNet is an extremely low latency replicated non-coherent shared memory network, so far used only for real-time applications. This paper reports our early experiences with using SCRAMNet for cluster computing. We have implemented a user-level zero-copy message passing protocol for SCRAMNet called the BillBoard Protocol (BBP). The one way latency for sending a 4-byte message between two nodes using the BBP is measured to be as low as 7.8 µs. Since SCRAMNet supports hardware level replication of messages, it is possible to implement multicast with almost the same latency as point-to-point communication. Using the BBP, the latency for broadcasting short messages to 4 nodes is measured to be 10.1 µs and the latency for a 4-node barrier is measured to be 37 µs. We have also built an MPI library on top of the BBP which makes use of multicast support from the BBP. Our results demonstrate the potential of SCRAMNet as a high performance interconnect for building scalable workstation clusters supporting message passing.
Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space
Authors: Yijie Han, Mikkel Thorup
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We present a randomized algorithm sorting n integers in 0(n\sqrt {\log \log n}) expected time and linear space. This improves the previous O(n log log n) bound by Anderson et al. from STOC'95. As an immediate consequence, if the integers are bounded by U, we can sort them in 0(n\sqrt {\log \log U}) expected time. This is the first improvement over the O(n log log U) bound obtained with van Emde Boas' data structure from FOCS'75.At the heart of our construction, is a technical deterministic lemma of independent interest; namely, that we split n integers into subsets of size at most \sqrt nin linear time and space. This also implies improved bounds for deterministic string sorting and integer sorting without multiplication.
Specification of Constraints in Business Flow
Authors: Shunsuke Yura, Toshihiro Motoda, Shuichiro Yamamoto
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

The paper proposes an approach which generates alternative flows and cancel flows necessary in exceptional conditions automatically with transactional constraint rules in business flow. In our approach, modification of a business flow is easier than current workflow systems because modification of the transactional constraint rule is not necessary unless constraints among the services change. The paper shows the effectiveness of our approach with a travel reservation example.
WOL: A Language for Database Transformations and Constraints
Authors: Susan B. Davidson, Anthony Kosky
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The need to transform data between heterogeneous databases arises from a number of critical tasks in data management. These tasks are complicated by schema evolution in the underlying databases and by the presence of non-standard database constraints. We describe a declarative language called WOL (Well-founded Object Logic) for specifying such transformations, and its implementation in a system called Morphase (an "enzyme" for morphing data). WOL is designed to allow transformations between the complex data structures which arise in object-oriented databases as well as in complex relational databases, and to allow for reasoning about the interactions between database transformations and constraints.
Process-Centered Model Engineering
Authors: Erwan Breton, Jean Bézivin
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: A new information system landscape is emerging that will be more model-centered than object-oriented, characterized by many models of low granularity and high abstraction. These models may describe various aspects of a system such as products, structural organization and processes. This latter category may be refined into manufacturing, software and business processes for example. Each of these sub-domains share common concerns such the definition of work items, performers, inputs and outputs, etc. However, as they may be represented using separate meta-models, there is therefore a risk of facing an uncontrollable number of meta-models that all redefine similar modeling constructs. It would be a wise initiative to put all these contributions together and to study what may be common and what should stay specific. In this paper we underline some similarities between process meta-models and we sketch out how they could be organized.
tmPVM - Task Migratable PVM
Authors: C. P. Tan, Weng-Fai Wong, Chung-Kwong Yuen
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this paper we introduce an implementation of PVM that exploits the homogeneity of a MPP network with user-level task migration. The target machine is the Fujitsu AP3000. It is basically a network of Sun workstations connected by a high-speed network. Furthermore, we explore the possibility of allowing the PVM host configuration to expand dynamically so as to include idle nodes into the virtual machine. The result is tmPVM, which allows the virtual machine to re-distribute workload dynamically with low overhead.
Delivering Collaborative Programme Management
Authors: Marek Suchocki
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper describes an Extranet system implemented for a major UK bank to permit the management of many thousand annual branch upgrade' projects by the bank's property services division. The system has been developed to provide intuitive use by a user community of Project Managers, design consultants and contractors. The system differs from traditional hosted Extranet services in that it has been developed specifically to address thecomplex issues of rapid programme management. It provides long term confidence to the bank by guaranteeing their ownership of the system and data. The system also retains the look and feel of bank systems to give clear brand identity. Users securely access the system and navigate within it by identifying a project, viewing programme information and accessing datafolders. 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
Search and Ranking Algorithms for Locating Resources on the World Wide Web
Authors: Budi Yuwono, Dik Lun Lee
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Applying information retrieval techniques to the World Wide Web (WWW) environment is a challenge, mostly because of its hypertext/hypermedia nature and the richness of the meta-information it provides. We present four keyword-based search and ranking algorithms for locating relevant WWW pages with respect to user queries. The first algorithm, Boolean Spreading Activation, extends the notion of word occurrence in the Boolean retrieval model by propagating the occurrence of a query word in a page to other pages linked to it. The second algorithm, Most-cited, uses the number of citing hyperlinks between potentially relevant WWW pages to increase the relevance scores of the referenced pages over the referencing pages. The third algorithm, TFxIDF vector space model, is based on word distribution statistics. The last algorithm, Vector Spreading Activation, combines TFxIDF with the spreading activation model. We conducted an experiment to evaluate the retrieval effectiveness of these algorithms. From the results of the experiment, we draw conclusions regarding the nature of the WWW environment with respect to document ranking strategies.
Tulip: A Portable Run-Time System for Object-Parallel Systems
Authors: Peter H. Beckman, Dennis Gannon
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper describes Tulip, a parallel run-time system used by the pC++ parallel programming language. Tulip has been implemented on a variety of scalable, MPP computers including the IBM SP2, Intel Paragon, HP/Convex SPP, Meiko CS2, SGI Power Challenge, and Cray T3D. Tulip differs from other data-parallel RTS implementations; it is designed to support the operations from object-parallel programming that require remote member function execution and load and store operations on remote objects. It is designed to provide the thinnest possible layer atop the vendor-supplied machine interface. That thin veneer can then be used by other run-time layers to build machine-independent class libraries, compiler back ends, and more sophisticated run-time support. Some preliminary performance measurements for the IBM SP2, SGI Power Challenge, and Cray T3D are given.
Handwritten Numeral Recognition Using MFNN Based Multiexpert Combination Strategy
Authors: Xiaofan Lin, Xiaoqing Ding, Youshou Wu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper a novel unconstrained numeral recognition system using MFNN based multiexpert combination strategy is proposed. Compared with many traditional methods, the proposed approach takes advantage of every method*s confidence value as well as its output label. So it can improve the system*s performance significantly with as few as two experts. Another novel feature of the system is that the multiexpert combination problem is converted to a new classification problem and then MFNNs are used to handle the combination adaptively. The proposed system have achieved promising result on the NIST database. When rejection rate is zero, its recognition rate is 98.24% and the error rate can be reduced to 0.24% with a rejection rate of 5.72%.
System Design for Digital Media Asset Management
Authors: Pamela D. Fisher
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Client-server computing is only now able to deliver genuine gains to broadcasters, publishers, creative agencies and production facilities. These new users are entering the distributed computing domain just as media object technologies and commercial broadband services emerge from infancy. This paper discusses the complex process of decision-making and system design for digital media asset management. The Cinebase Digital Media Management System is described and used to illustrate critical points. The digital media server architecture must accommodate extremely large datasets, scaleable content retrieval and rapid network query response. Cinebase installations are currently in place containing 100s of Terabytes of media content, and 100s of local and remote users. Cinebase has recently been ported to ObjectStore by Object Design Inc. (ODI). The presentation discusses how, in combination, the Cinebase application and ODI extensions can be used to deliver a complete object management environment for production-quality content. Examples of the new workflows, and the technical issues complex networks raise for database architecture, are also discussed.
Software Agents: Quality, Complexity and Uncertainty Issues
Authors: Behrouz Homayoun Far
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

In software engineering community there is an increasing effort of design and development of multiagent systems (MAS). Among several issues emerging from this initiative, complexity, quality and uncertainty issues have not yet received much attention. The main factors affecting quality of MAS are complexity and knowledgeability. Complexity of MAS can be defined in terms of structural and algorithmic complexity in either objective or subjective way. Knowledgeability of MAS can be defined in terms of problem solving and cognitive capabilities and the ability to cope with interactions, such as cooperation, coordination and competition. Inthis paper we define and address the quality and complexity issues of MAS and define metrics to measure the quality and complexity. The metrics are used for devising a candidate set of agents for MAS design. Furthermore, we address the knowledgeability of MAS and devise models and techniques to cope with uncertainty in competitive situations.
A BSP Approach to the Scheduling of Tightly-Nested Loops
Authors: Radu Calinescu
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper addresses the scheduling of uniform-dependence loop nests within the framework of the bulk-synchronous parallel (BSP) model. Two broad classes of tightly-nested loops are identified in the paper and scheduled according to the BSP discipline, and the resulting schedules are analysed in terms of the BSP cost model.
IAuth: An authentication system for Internet applications
Authors: Suan-Suan Chew, Kok-Leong Ng, Chye-Lin Chee
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

With the advent of the Internet, an era of distributed computing is rapidly taking hold. The potential offered by distributed computing increases opportunities for security breaches. This emphasizes the importance of security practices, such as authentication. We have designed a system, IAuth, which provides secure distribution of cryptographic keys while establishing authenticity between a user and a Web-based application. The strength of IAuth in the context of the Internet is that there is no need for a user to possess a cryptographic key if the application requires data encryption or digital signing. Once verified authentic, the user can securely obtain his cryptographic key from the Web application server for data encryption or digital signing.
Architectural Defects of the Secure Shell
Authors: Takamichi Saito, Toshiyuki Kito, Kentaro Umesawa, Fumio Mizoguchi
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Although some flaws have been found out in the SSH, the Secure Shell, there is not os much discussion about its architecture or design safety. Therefore, in this paper, considering the SSh's architecture, e.g. the key exchange protocol, the user authentication protocols and its total design of the SSH, we not only discuss the SSH's architectural safety but show some critical flaws for SSH users. For establishing the SSH connection, before the user authentication, the SSH sever and client are exchanging a session key, which can make secure communication. Then, over the secret channel encrypted by the session key, the SSH server are authenticating a user in the SSH client using with a user's password or public key. However, owing to the defects in the SSH protocols and its design, a user can be deprived of its password in the authentication protocol. Moreover, we will show that those who use its public key for authentication are exposed to the menace same as password-oriented users are.