ppxscal/embedding_network huggingface dataset:
An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees
Authors: Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The authors develop a parallel strategy to compute K-terminal reliability in 2-trees and partial 2-trees. They also solve the problem of finding the most vital edge with respect to K-terminal reliability in partial 2-trees. The algorithms take O(log n) time with C(m,n) processors on a CRCW PRAM, where C(m,n) is the number of processors required to find connected components of a graph with m edges and n vertices in logarithmic time.
A Tight Upper Bound on the Number of Candidate Patterns
Authors: Floris Geerts, Bart Goethals, Jan Van den Bussche
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In the context of mining for frequent patterns using the standard level wise algorithm, the following question arises: given the current level and the current set of frequentpatterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing a tight upper bound, derived from a combinatorial result from the sixties by Kruskal andKatona. Our result is useful to educe the number of databasescans.
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
Authors: San-Yuan Wang, Yu-Chee Tseng
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

The {\it one-to-all broadcast} is the most primary collective communication pattern in a multicomputer network. We consider this problem in a wormhole-routed torus which uses {\it all-port} and {\it dimension-ordered} routing model. We derive our routing algorithms based on the concept of "span of vector spaces" in linear algebra. For instance, in a 3-D torus, the nodes receiving the broadcast message will be "spanned" from the source node to a line of nodes, to a plane of nodes, and then to a cube of nodes. Our results require at most $2(k-1)$ steps more than the optimal number of steps for any square $k$-D torus. Existing results, as compared to ours, can only be applied to tori of very restricted dimensions or sizes, and either rely on an undesirable non-dimension-ordered routing or require more numbers of steps.
MPPs versus Clusters
Authors: Charles L. Seitz
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In coming years, if not already, the parallel-processing community can expect to hear regularly from MPP advocates and cluster advocates about why their approach is better. Either pitch is apt to be a hard sell: hard to sell to an informed audience or reader, and dull. The attempt to distinguish between MPPs and clusters is in some cases an empty subject. By the term "cluster," I mean a group of high-performance computers-" commodity" PCs, workstations, or SMPs-connected by a fast network, and employing software layers for low-latency message handling and a standard interface for multiple-process application programs. Indeed, today's multicomputers (distributed-memory MPPs) fit this definition of a cluster except for being packaged in a cabinet rather than distributed across a room or building. MPP bigots can be expected to present positive arguments of tight coupling and the virtues of nodes employing processor types not used in commodity computers. They may also present negative arguments of the limits imposed eventually by the speed-of-light delays in clusters. They will be right on all points, at least eventually. Cluster bigots can be expected to present different arguments involving the limited size of the MPP market in comparison with the PC market, and the resulting differences in investment, technology-insertion schedule, and performance per unit cost. They will also be right on all points, at least empirically, and will have persuasive benchmarks to prove these points. The obvious trouble with blind advocacy is that it distracts from the opportunities for the parallel-processing community to embrace both approaches, and thereby to extend the applicability of parallel processing. In certain application domains, such as military systems, it becoming commonplace for people to build systems composed of specialized, "embedded" MPPs clustered together with conventional computers. On the software side, a number of streamlined, message-handling, software layers, such as the University of California, Berkeley, Active Messages (AM) layer and the University of Illinois, Urbana-Champaign, Fast Messages (FM) layer, operate interchangeably on both clusters and MPPs. At the level of application programming and libraries, standard application-programming interfaces such as MPI are likewise portable between MPPs and clusters. There are many other needs and opportunities for research that will unify rather than divide MPPs and clusters. Let me join you in hoping that this is the last talk that you will have to endure on MPPs "versus" clusters. 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
Tokenization and Proper Noun Recognition for Information Retrieval
Authors: Francisco-Mario Barcala, Jesús Vilares Ferro, Miguel A. Alonso, Jorge Graña Gil, Manuel Vilares Ferro
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper we consider a set of natural language processing techniques that can be used to analyze large amounts of texts, focusing on the advanced tokenizer which accounts for a number of complex linguistic phenomena, as well as for pre-tagging tasks such as proper noun recognition. We also show the results of several experiments performed in order to study the impact of the strategy chosen for the recognition of proper nouns.
Spatial and Temporal Aware, Trajectory Mobility Profile Based Location Management for Mobile Computing
Authors: Jianting Zhang, Le Gruenwald
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper, we propose a new context-aware profile-based location management scheme. Besides temporal context that has been used in previous proposals, considers spatial context of mobility profiles as well as recent travel trajectories. We present conceptual framework for the cooperation between the Location Database Management System (LDMS) and the Mobile Host (MH) in keeping track of the mobility profiles for location management in mobile computing. Although extra overheads are put on both LDMS side and MH side, they are well justified in terms of reducing paging latency and paging traffic.
An Online Algorithm for Segmenting Time Series
Authors: Eamonn J. Keogh, Selina Chu, David Hart, Michael J. Pazzani
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In recent years, there has been an explosion of interest in mining time series databases. As with most computer science problems, representation of the data is the key to efficient and effective solutions. One of the most commonly used representations is piecewise linear approximation. This representation has been used by various researchers to support clustering, classification, indexing and association rule mining of t me series data. A variety of algorithms have been proposed to obtain this representation, with several algorithms having been independently rediscovered several times. In this paper, we undertake the first extensive review and empirical comparison of all proposed techniques. We show that allthese algorithms have fatal flaws from a data mining perspective. We introduce a novel algorithm that we empirically show to be super or to all others n the literature.
Digital Technologies of Learning and Simulation of Virtual Cities: Terrain Editor (MAPPA)
Authors: Marcelo Laserra, Magali Longhi, Margarete Axt
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This poster describes a terrain editor for the CIVITAS -Cidades Virtuais: Tecnologias deAprendizagem e Simulação environment [I], to be developed by UFRGS -Universidade Federal do Rio Grande do SuI, and used at third and fourth grades of Elementary Schools of Venancio Aires Town -RS -Brasil. MAPPA [2] has the goal of being a computational modeling tool, in terms of two and three dimensions, applied to natural terrains where will be included the rest of elements of virtual cities, in addition to the rules of the environment.
The Implementation of Low Latency Communication Primitives in the Snow Prototype
Authors: Kanad Ghose, Seth Melnick, Tom Gaska, Seth Goldberg, Arun K. Jayendran, Brian T. Stein
Venue: Proceedings of the international Conference on Parallel Processing (1997)

This paper describes the implementation of a low latency protected message passing facility and a low latency barrier synchronization mechanism for an experimental, tightly-coupled network of workstations called SNOW. SNOW uses multiprocessing SPARC 20s, running Solaris 2.4, as computing nodes, and uses semi-custom network interface cards (NICs) that connect these nodes in a 212 Mbits/sec. unidirectional ring. The NICs include field-programmable gate array logic devices that allow for experimentation with the nature and level of hardware support for tight coupling. The one way protected message passing latency on the SNOW prototype for a 64-byte message is about 9 msecs., comparable to latencies of low-end to medium range multiprocessors.
An Evaluation of Sampling-Based Size Estimation Methods for Selections in Database Systems
Authors: Yibei Ling, Wei Sun
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

The results of a performance study of the representative sampling-based size estimation methods in database management systems are reported in this paper. Major performance measurement includes estimation accuracy, the amount of sample taken, and the coverage. The impact of skewed data on the performance is also discussed. These results allow a better understanding and assessment of sampling estimation methods and determine the suitability of different methods under different situations.
Palant&iacute;r: Coordinating Distributed Workspaces
Authors: Anita Sarma, André van der Hoek
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Distributed software development suffers from limited collaboration capabilities, as developers are unable to easily coordinate their efforts across physical boundaries. Different fields, such as CSCW and groupware, have at-tempted to bridge this gap, but few of the approachesdeveloped so far have been incorporated in current software development environments. Configuration Management (CM) systems are vital to any software development process, support distributed development, and are in widespread use. Unfortunately, they have only limited support for distributed collaboration. In this paper we describe Palantír, a system that is aimed at bringing collaborative capabilities to distributed development. Palantír builds upon existing CM systems to introduce project awareness to the developer workspace. In particular,Palantír supports close collaboration among developers by visualizing concurrent changes and showing, in real time, the severity and impact of those changes on the developer's workspace.
A VLSI array architecture with dynamic frequency clocking
Authors: N. Ranganathan, Narayanan Vijaykrishnan, N. Bhavanishankar
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

In this paper, we describe the concept of dynamic frequency clocking and the design of a linear VLSI array processor, DFLAP, for use in image processing applications. Dynamic frequency clocking enables the chip to operate at different frequencies switching dynamically depending on the instruction being executed. Such a technique facilitates better management of throughput and power requirements in a VLSI system. The applicability of dynamic clocking in pipelined systems is also investigated. The effectiveness of the dynamic frequency architecture is illustrated by mapping several tasks for image processing applications.
Application of Parallel Processors to Real-Time Sensor Array Processing
Authors: David R. Martinez
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Historically, most radar sensor array processing has been implemented using dedicated and specialized processing systems. This approach was necessary because the algorithm computation requirements were several orders of magnitude higher than any commercial supercomputer could provide in an acceptable size, weight and power. Most recently, with the interest by the military to employ commercial-off-the-shelf (COTS) technology, and the rapid advances in computation throughput by COTS supercomputers, we are able to meet the present algorithm requirements with COTS massively parallel processors (MPPs). However, there are still many issues to be overcome to get the most out of a parallel processor for our application. Some of the important issues are the balance between high computation throughput and total exchange communication over the processor network, message passing or shared memory access with high communication throughput for small message sizes, and the scalability of these machines to more demanding algorithm and application requirements. In this paper we present the application requirements, review the important computational kernels, and conclude with our experiences in evaluating representative MPPs.
Tool Support for Development Using Patterns
Authors: Steve Neal, Peter F. Linington
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: There has been a growing interest in recent years in the use of abstract building blocks in system specification. Designs based on Patterns and Communities are two examples. However, these structures are then refined further during design and implementation, and it is often difficult to determine whether the eventual system implementation is a faithful reflection of the original properties of the pattern specified. This is particularly true of patterns used to describe an enterprise view of the system. This paper concentrates on the behavioural aspects of pattern specification, and investigates the way that observation of the system can be interpreted to check that properties of the pattern specification are preserved. It describes a diagnostic tool that checks the actual system behaviour against the pattern specification, and discusses the requirements this places on the form of the specification language and a number of the problems of interpretation that arise in applying such tools.
Authentication of Quantum Messages
Authors: Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states.We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubitmessage by encoding it into m + s qubits, where the error probability decreases exponentially in the security parameter s . The scheme requires a secret key of size 2m +O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs.It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically.This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.
Frequent Subgraph Discovery
Authors: Michihiro Kuramochi, George Karypis
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains. An alternate way of modeling the objects in these data sets is to use graphs. Within that model, the problem of finding frequent patterns becomes that of discovering subgraphs that occur frequently over the entire set of graphs. In this paper we present a computationally efficient algorithm for finding all frequent subgraphs in large graph databases. We evaluated the performance of the algorithm by experiments with synthetic datasets as well as a chemical compound dataset. The empirical results show that our algorithm scales linearly with the number of input transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though we have to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.
Efficient Determination of Dynamic Split Points in a Decision Tree
Authors: David Maxwell Chickering, Christopher Meek, Robert Rounthwaite
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We consider the problem of choosing split points forcontinuous predictor variables in a decision tree. Previousapproaches to this problem typically either (1) discretize the continuous predictor values prior to learning or (2) apply a dynamic method that considers all possible split points for each potential split. In this paper, we describe anumber of alternative approaches that generate a smallnumber of candidate split points dynamically with littleoverhead. We argue that these approaches are preferable to pre-discretization, and provide experimental evidence that they yield probabilistic decision trees with the same prediction accuracy as the traditional dynamic approach.Furthermore, because the time to grow a decision tree isproportional to the number of split points evaluated, our approach is significantly faster than the traditional dynamic approach.
A Simple and Scalable Fair Bandwidth Sharing Mechanism for Multicast Flows
Authors: Fethi Filali, Walid Dabbous
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Despite a decade of research and development, multicast has not yet been deployed on a global scale. Among the difficulties with the current infrastructure are inter-multicast fairness support, multicast congestion control, and multicast routing.In this paper, we focus on the inter-multicast fairness issue which addresses the way how the network resources are shared between competing multicast flows. We propose a simple and scalable single FIFO queue-based active queue management mechanism called MFQ (Multicast Fair Queuing) to achieve the desired inter-multicast fairness. MFQ interacts with an external multicast bandwidth allocation module which implements a pre-defined inter-multicastfairness function. To guarantee a fine-grained packet queuing/dropping, MFQ uses a novel bandwidth sharing notion, called Multicast Allocation Layer (MAL). Based on this notion, MFQ classifies multicast packets into layers and adjusts their weights in order to provide a bandwidth sharing being as close as possible to that given by the fluid model algorithm.Simulation results demonstrate that MFQ achieves the expected allocation for both responsive and non-responsive multicast flows. We validate our findings by analyzing the impact of network and groups dynamics on the expected bandwidth allocation and comparing it to that obtained by MFQ. Furthermore, we show that MFQ converges very fast to a stable state and easily adapts itself to the dynamic change of the flows weights.
A Practical Approach to Multi-Attribute Auctions
Authors: Birgit Burmeister, Tobias Ihde, Thomas Kittsteiner, Benny Moldovanu, Jörg Nikutta
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In most electronic auctions conducted over the Internet today price is still the only decision criteria for the best bid. This is true for all sorts of auctions in the electronic business areas consumer-to-consumer (c2c), business-to-consumer (b2c), and business-to-business (b2b). Especially for many situations in the b2b area there are other important attributes apart from price to be considered for decision making. Therefore the area of multi-attribute auctions gains more and more interest in the scientific community as well as from software vendors of electronic business products. But the approaches offered so far suffer from some limitations. Theoretical approaches are not applicable to (b2b) real world scenarios, commercial software does not cover all situations. To overcome these limitations we developed a practical approach to multi-attribute auctions, that will be presented in this paper.
Software as a Service: A Negotiation Perspective
Authors: Ahmed Elfatatry, Paul J. Layzell
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Software as a service (SAAS) is a long-term research project aimed at developing technologies and methods for the rapid production and evolution of software systems byproviding software as a service rather than as a product. Recently, there has been a growinginterest in bringing intelligent solutions to Internet based computing. Automated negotiation has been at the center of such interest. This paper is concerned with the implications of negotiating software services under the software as a service model.
Surfing an ODBMS (Maintaining WWW Documents with O2)
Authors: Frank Buddrus, Marco Bellavia
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper deals with the idea of an ODBMS working as an Internet server. The approach introduced offers fine grained storage and retrieval of WWW documents, providing sophisticated document maintenance, supporting referential integrity, document integration, integration with application objects, access control, and versioning. In contrast to comparable systems it acts transparently to the WWW users, i.e. without using proprietary query languages or protocols. While achieving the full benefits of a modern document repository it keeps the ease of the traditional file system it replaces.