ppxscal/embedding_network huggingface dataset:
Automated instrumentation and monitoring of data movement in parallel programs
Authors: Sekhar R. Sarukkai, Jerry Yan, Melisa Schmidt
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Writing efficient parallel programs is complicated by the need to select the right data-structure alignments and distributions, which determine the nature and volume of inter-processor communications. A large number of performance tools for parallel programs have been developed recently to expose the nature of these inter-processor communications. However, none of the tools support performance views or provide statistics in terms of inter-processor data-structure interactions. In this paper we discuss the use of compiler front end tools for automatically tracking data-structure movements in message passing programs, and low-overhead monitoring and postprocessing of such codes. In addition, our approach is compiler/pre-processor and platform independent. We demonstrate that robust instrumentation and low, overhead monitoring of inter-processor data-structure movements is possible, with the use of a number of NAS benchmarks run on the i860 hypercube. We also show that the data so collected con be efficiently used by post processing tools that expose performance bottlenecks using graphical displays and performance statistics.
Implementation of an Enterprise-Level Groupware System Based on J2EE Platform and WebDAV Protocol
Authors: Changtao Qu, Thomas Engel, Christoph Meinel
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

According to our definition, the enterprise-level groupware system (EGS) is the Web-based groupware that focuses specifically on addressing some crucial cooperation requirements put forward by Business-to-Business and Business-to Consumer electronic commerce. In this paper, we propose a new approach for constructing EGSs, in which a latest IETF specification: WebDAV is adopted in order to fully unlease the Web's potential in supporting cooperation activities, and at the same time, an enterprise-level platform: J2EE is adopted in order to ensure some enterprise-level features of the system, e.g., scalability, availability, extensibility and security. We then introduce a prototype EGS implementation called "Cooperative Workbench", which is developed in our institute. This prototype has partly proven the advantages of this new approach and its promising application prospects in the future EGSs.
A Randomized Sorting Algorithm on the BSP model
Authors: Alexandros V. Gerbessiotis, Constantinos J. Siniolakis
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

We present a new randomized sorting algorithm on the Bulk-Synchronous Parallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimality. Tighter probabilistic bounds are also established. It uses sample sorting and utilizes recently introduced search algorithms for a class of data structures on the BSP model. Moreover, our methods are within a 1 + o(1) multiplicative factor of the respective sequential methods in terms of speedup for a wide range of the BSP parameters.
A Distributed Query Processing Strategy Using Placement Dependency
Authors: Chengwen Liu, Hao Chen, Warren Krueger
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

We present an algorithm to make use of placement dependency information to process distributed queries. Our algorithm first partitions the referenced relations of a given query into a number of non-exclusive subsets such that the fragmented relations within a subset have placement dependency and the join operation(s) associated with the relations in the subset can be locally processed without data transfer. Each subset is associated with a set of sites and can be used to generate an execution plan for the given query by keeping the fragmented relations in the subset fragmented at the sites where they are situated while replicating the other referenced relations at each of the processing sites. Among the alternatives, our algorithm picks the plan that gives the minimum response time. Our experimental results show that our algorithm improves response time significantly.
Global Information from Local Observation
Authors: Itai Benjamini, László Lovász
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We observe a certain random process on a graph "locally", i.e., in the neighborhood of a node, and would like to derive information about "global" properties of the graph. For example, what can we know about a graph based on observing the returns of a random walk to a given node?Our main result concerns a graph embedded in an orientable surface with genus g, and a process, consisting of random excitations of edges and random balancing around nodes and faces. It is shown how to obtain the genus of the surface in polynomial time from local observations of the process restricted to a connected subgraph whose size is (essentially)O(g2).
Mobile Agents in Adaptive Learning Systems
Authors: Hong Hong, Kinshuk
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This paper focuses on the efforts of providing adaptivity in learning systems with primary focus on mobile users. With unreliable and infrequent connections to the Internet, low bandwidth, and high latency problems, we propose that an effective solution can be reached by employing mobile agents technology in conjunction with two-fold student modelling mechanism.
CONTEXT: A Technique for Image Retrieval Integrating CONtour and TEXTure Information
Authors: Andrea Casasnova, Matteo Fraschini, Sergio Vitulano
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Many intrinsically 2-dimensional visual signals can be effectively encoded in a 1-D form. Thissimpler representation is well-suited to both pattern recognition and image retrieval tasks. This poster deals with contour and texture, combined together in order to obtain an effective technique for content based image indexing. The data used for experimentally assessing CONTEXT were contours and textures from various application domains. The experiments reveal a high discriminating power which in turn yields a high perceived quality of the retrieval results.
Hand Printed Chinese Character Recognition via Machine Learning
Authors: Adnan Amin, Seung-Gwon Kim, Claude Sammut
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Recognition of Chinese characters has been an area of great interest for many years, and a large number of research papers and reports have been published in this area. There are several major problems with Chinese character recognition: Chinese characters are distinct and ideographic, the character size is very large and many structurally similar characters exist in the character set. Thus, classification criteria are difficult to generate. This paper presents a new technique for the recognition of hand-printed Chinese characters using machine learning C4.5. Conventional methods have relied on hand-constructed dictionaries which are tedious to construct and difficult to make tolerant to variation in writing style. The paper also discusses Chinese character recognition using dominant point feature extraction and C4.5. The system was tested with 900 characters (each character has 40 samples) and the rate of recognition obtained was 84%.
Head Motion Tracking using Facial Image Analysis Applied to 3D-Environment Navigation
Authors: Cristiane B. F. Marques, Lamarque V. Souza, Luiz C. G. Andrade, Mario F. M. Campos
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

This paper describes a head motion tracking method based on an image processing and spatial information extraction algorithm that is capable of obtaining the key elements of the user's face and, afterwards, characterizing its movements.
Synthesizing Distributed Constrained Events from Transactional Workflow
Authors: Munindar P. Singh
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Workflows are the semantically appropriate composite activities in heterogeneous computing environments. Such environments typically comprise a great diversity of locally autonomous databases, applications, and interfaces. Much good research has focused on the semantics of workflows, and how to capture them in different extended transaction models. Here we address the complementary issues pertaining to how workflows may be declaratively specified, and how distributed constraints may be derived from those specifications to enable local control, thus obviating a centralized scheduler. Previous approaches to this problem were limited and often lacked a formal semantics.
QoS Extension to BGP
Authors: Li Xiao, King-Shan Lui, Jun Wang, Klara Nahrsted
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

To enable the end-to-end Quality of Service (QoS) guarantees in the Internet, based on the Border Gateway Protocol (BGP), inter-domain QoS advertising and routing are important. However, little research has been done in this area so far. Two major challenges, scalability and heterogeneity, make the QoS extension to BGP difficult. Two existing approaches, the Link Capacity Routing (LCR) and the Available Bandwidth Routing (ABR), address QoS advertising and routing in BGP with respect to bandwidth metric. But neither of them can solve the two challenges well.In this paper, BGP is extended to advertise bandwidth information. But, instead of using link capacities or instantaneous available bandwidth values, a novel QoS metric, Available Bandwidth Index (ABI), is defined and used to perform bandwidth advertising and routing. The two major contributions of ABI are: (1) ABI dynamically abstracts available bandwidth into a probability interval, therefore, it is very flexible to represent heterogenous and dynamic bandwidth values; (2) By capturing the statistical property of the detailed available bandwidth distribution, ABI is so efficient that it can highly decrease the message overhead in routing,thereby making the QoS advertising and routing very scalable. Our extensive simulations confirm both contributions of the ABI extension to BGP very well.
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
Authors: David A. Bader, Joseph JáJá
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

A common statistical problem is that of finding the median element in a set of data. This paper presents a fast and portable parallel algorithm for finding the median given a set of elements distributed across a parallel machine. In fact, our algorithm solves the general selection problem that requires the determination of the element of rank i, for an arbitrarily given integer i. Practical algorithms needed by our selection algorithm for the dynamic redistribution of data are also discussed. Our general framework is a distributed memory programming model enhanced by a set of communication primitives. We use efficient techniques for distributing, coalescing, and load balancing data as well as efficient combinations of task and data parallelism. 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 illustrate the scalability and efficiency of our algorithms across different platforms and improve upon all the related experimental results known to the authors.
Complementary Classifier Design Using Difference Principal Components
Authors: Takahiko Kawatani, Hiroyuki Shimizu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In classifier combination, the degree of recognition accuracy improvement depends not only on how to combine classifiers, but also on how much classifiers complement each other. In order to improve accuracy, therefore, it is an important issue how to design complementary classifiers with respect to each other. We propose a method to design a classifier complementary to an existent one, which satisfies the requirements: (a)it can recognize patterns misrecognized by the existent classifier with high accuracy, and (b)the number of patterns which are correctly recognized by the existent classifier but turn out to be misrecognized after combination can be minimized. In the proposed method, features are obtained by projection of original features onto axes such that the scatter of projection of patterns of a given class is small and that the squared mean of projection of patterns misrecognized in the given class is large. As the discriminant function, Fisher's linear discriminant function is applied using not only linear terms but also quadratic terms. Through experiments using handwritten numeral data included in the NIST database, it has been confirmed that the requirements mentioned above are satisfied. The misrecognition rate reduce to 56% for training data and to 84% for test data.
Parallel algorithms for database operations and a database operation for parallel algorithms
Authors: Rajeev Raman, Uzi Vishkin
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper establishes some significant links between two areas: (i) relational parallel database systems; and (ii) the design and analysis of parallel algorithms. The paper begins with a fundamental but very simple observation: implementing a JOIN operation in the context of relational parallel database systems is at least as expensive as implementing an arbitrary PRAM computation. Thus, the efficiency with which a given parallel computer can support a parallel relational database where JOINs are fairly frequent is strongly related to the efficiency with which that computer can support the PRAM as one of its programmer's models. The main technical contribution is an efficient parallel algorithm for the JOIN operation on a model where, in order to use the available bandwidth effectively, communication has to be performed in large blocks.
On the Nature and Inadequacies of Transport Timing Delay Constructs in VHDL Descriptions
Authors: Peter Walker, Sumit Ghosh
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

The design of VHDL transport delay uses an implicit assumption that bus with multiple taps, only one tap is a driver and the signal reaches the other taps delayed only by the time necessary for the electro-magnetic propagation. Perturbation due to reflection at the intermediate taps, is ignored and this results in incorrect timing behavior. This paper proposes extensions to VHDL grammar and defines new semantics in the language to accurately capture and model the transport timing behavior of buses with multiple, distinct taps.
Simplifying PKI Usage through a Client-Server Architecture and Dynamic Propagation of Certificate Paths and Repository Addresses
Authors: Brian Hunter
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

PKI deployment and use has not met its expectations. One reason that PKIX has not been fully accepted is due to the complexity of the system. Any application wishing to use PKI must implement complicated logic for certificate parsing, certificate path building and policy management. Certificate path building, in particular, is further complicated by the non-standardized method of certificate discovery and retrieval. Thus, many applications do not utilize or cannot utilize public key technology. We propose a new PKI Server which offers access to PKI services and only requires a simple Client API and a small Client library that enables even resource-limited clients to be supported. This can greatly reduce application development time and complexity and allow PKI usage to propagate into more applications. Furthermore, we introduce the concept of a PKI Server-to-Server Protocol which allows knowledge of certificate repositories and certificate paths to be shared among different PKI Servers. This technique will simplify the task of certificate retrieval and path building for individual PKI Servers.
Signature Management in Workflow Systems
Authors: Karl R. P. H. Leung, Lucas Chi Kwong Hui
Venue: 23rd International Computer Software and Applications Conference (1999)

Signatures have been widely used in paper-based workflow systems for different purposes. Currently there are many studies on computerizing workflow systems. There are also studies on implementing signatures in electronic media. But the diversified purposes of a signature in workflow makes a straight-forward implementation of digital signature schemes inadequate to satisfy the needs of an electronic workflow system. There are few studies on the implication on the purposes of signatures in workflow systems after the change in the media of operation. In this paper, we report our studies on the purposes of signature and our implementing of these purposes in the Liaison workflow system.
A floating point radix 2 shared division/square root chip
Authors: Hosahalli R. Srinivas, Keshab K. Parhi
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper presents the architecture and implementation of a full-custom 1.2 micron CMOS VLSI chip that executes a shared division/square root algorithm operating on mantissas (23-b in length) of single precision IEEE 754 std. floating point numbers. The division and square root algorithms used in this implementation are the radix 2 signed digit based digit-by-digit schemes. These two algorithms perform quotient/root digit selection using two most-significant digits of the partial remainder and are hence faster than other similar previously proposed radix 2 shared division/square root schemes. This chip runs at a clock rate of about 66 MHz at 5.0 V (from simulations) and requires 29 cycles per divide/square root operation from the time the operands are provided at its pin inputs.
Large Scale Simulation of Particulate Flows
Authors: Ahmed H. Sameh, Vivek Sarin
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Simulations of particles in fluid flows are of great interest to numerous industries using sedimentation, fluidization, lubricated transport, and hydraulic fracturing of hydrocarbon reservoirs. Simulating incompressible viscoelastic flows with millions of rigid particles is computationally a very challenging problem. In addition to using sophisticated modeling techniques and numerical algorithms, one must develop a scalable parallel formulation of the simulation. This task is further complicated by the dynamic nature of the system resulting from unrestricted motion of the particles.In this paper, we present an efficient algorithm for simulating particulate flows and discuss its parallel implementation. At each time step, a number of linear systems are solved using preconditioned iterative methods in which the matrix-vector product does not require explicit computation and storage of the matrix. The preconditioners developed for these systems are optimal so that convergence is assured in a fixed number of iterations. Moreover, these preconditioners do not require matrix inversion, and can be applied efficiently in parallel using their matrix-free forms. As a result, the algorithm is highly parallel and scalable, and achieves good speed improvement on the SGI Origin 2000.
Automated Support for Software Process Reuse: Requirements and Early Experiences with the APSEE Model
Authors: Rodrigo Quites Reis, Carla Alessandra Lima Reis, Daltro José Nunes
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: This paper discusses the need to provide better support for software processes reuse in PSEEs (Process-centered Software Engineering Environments). This discussion is influenced by the recent work on Process Reuse field presented by literature and the experience of authors in the definition of a meta-model for process modeling, enaction and simulation in an integrated environment (APSEE). This model proposes templates and policies as basic constructs to store generic and reusable knowledge about process models, which are integrated with a search engine based on similarity measurement. The basic set of data types used in the definition of the meta-model is presented. The paper concludes by presenting the proposed functionality to retrieve and adapt reusable process descriptions to a specific context.
Oblivious Routing Algorithms on the Mesh of Buses
Authors: Kazuo Iwama, Eiji Miyano
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

An optimal \lceil 1.5N^{1/2} \rceil lower bound is shown for oblivious routing on the mesh of buses, a two-dimensional parallel model consisting of N^{1/2}\times N^{1/2} processors, N^{1/2} row and N^{1/2} column buses but no local connections between neighbouring processors. Many lower bound proofs for routing on mesh-structured models use a single instance (adversary) which includes difficult packet-movement. This approach does not work in our case; our proof is the first which exploits the fact that the routing algorithm has to cope with many different instances. Note that the two-dimensional mesh of buses includes 2N^{1/2} buses and each processor can access two different buses. Apparently the three-dimensional model provides more communication facilities, namely, including 3N^{2/3} buses and each processor can access three different buses. Surprisingly, however, the oblivious routing on the three-dimensional mesh of buses needs more time, i.e., \Omega(N^{2/3}) steps, which is another important result of this paper.
VIP-FS: a VIrtual, Parallel File System for high performance parallel and distributed computing
Authors: Michael Harry, Juan Miguel del Rosario, Alok N. Choudhary
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

In the past couple of years, significant progress has been made in the development of message-passing libraries for parallel and distributed computing, and in the area of high-speed networking. These advances in computing technology have also led to a tremendous increase in the amount of data being manipulated and produced by scientific and commercial application programs. Despite their popularity, message-passing libraries only provide part of the support necessary for most high performance distributed computing applications-support for high speed parallel I/O is still lacking. In this paper, we provide an overview of the conceptual design of a parallel and distributed I/O file system, the Virtual Parallel File System (VIP-FS), and describe its implementation. VIP-FS makes use of message-passing libraries to provide a parallel and distributed file system which can execute over multiprocessor machines or heterogeneous network environments.