ppxscal/embedding_network huggingface dataset:
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions
Authors: Adrian Vetta
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We consider the following class of problems. The value of an outcome to a society is measured via a submodular utility function (submodularity has a natural economic interpretation: decreasing marginal utility). Decisions, however are controlled by non-cooperative agents who seek to maximise their own private utility. We present, under some basic assumptions, guarantees on the social performance of Nash equilibria. For submodular utility functions, any Nash equilibrium gives an expected social utility within a factor 2 of optimal, subject to a function-dependent additive term. For non-decreasing, submodular utility functions, any Nash equilibrium gives an expected social utility within a factor 1 + \deltaof optimal, where 0 \leqslant \delta\leqslant 1 is a number based upon the discrete curvature of the function. A condition under which all sets of social and private utility functions induce pure strategy Nash equilibria is presented. The case in which agents, themselves, make use of approximation algorithms in decision making is discussed and performance guarantees given. Finally we present some specific problems that fall into our framework. These include the competitive versions of the facility location problem and k-median problem, a maximisation version of the traffic routing problem studied by Roughgarden and Tardos [9], and multiple-item auctions.
Online Non-stop Software Update Using Replicated Execution Blocks
Authors: Kuo-Feng Ssu, Hewijin Christine Jiau
Venue: 24th International Computer Software and Applications Conference (2000)

Software update is an inevitable process in the lifetime of a computer system. Numerous update mechanisms have been applied to software products. However, only little attention is devoted to online non-stop software update. Traditional update utilities typically require programs to stop execution during modifications and thus decrease the availability of systems. For e-commerce (electronic commerce) companies, improving system availability implies increasing opportunities for more business profit. Therefore, minimizing system maintenance time due to the necessary software update becomes a critical issue. This paper describes an approach to the non-stop software update. The approach composes a program using two replicated execution blocks. By switching the execution blocks, the program can be modified without terminating its service. The paper also discusses the system environments that are required to support the approach.
Clustering Validity Assessment: Finding the Optimal Partitioning of a Data Set
Authors: Maria Halkidi, Michalis Vazirgiannis
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Clustering s a mostly unsupervised procedure and the majority of the clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set. As a consequence, in most applications the resulting clustering scheme requires some sort ofevaluation as regards its validity. In this paper we present a clustering validity procedure,which evaluates the results of clustering algorithms on data sets. We define a validity index, S_Dbw, based on well-defined clustering criteria enabling the selection of the optimal input parameters' values for a clustering algorithm that result in the best partitioning of a data set.We evaluate the reliability of our index both theoretically and experimentally, considering three representative clustering algorithms ran on synthetic and real data sets. Also, we carried out an evaluation study to compare S_Dbw performance with other known validity indices.Our approach performed favorably in all cases, even in those that other indices failed to indicate the correct partitions in a data set.
External Adjustment of Runtime Parameters in Time Warp Synchronized Parallel Simulators
Authors: Radharamanan Radhakrishnan, Lantz Moore, Philip A. Wilsey
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Several optimizations to the Time Warp synchronization protocol for parallel discrete event simulation have been proposed and studied. Many of these optimizations have included some form of dynamic adjustment (or control) of the operating parameters of the simulation (e.g., checkpoint interval, cancellation strategy). Traditionally dynamic parameter adjustment has been performed at the simulation object level; each simulation object collects measures of its operating behaviors (e.g., rollback frequency, rollback length, etc) and uses them to adjust its operating parameters. The performance data collection functions and parameter adjustment are overhead costs that are incurred in the expectation of higher throughput. This paper presents a method of eliminating some of these overheads through the use of an external object to adjust the control parameters. That is, instead of inserting code for adjusting simulation parameters in the simulation object, an external control object is defined to periodically analyze each simulation object's performance data and revise that object's operating parameters. An implementation of an external control object in the WARPED Time Warp simulation kernel has been completed. The simulation parameters updated by the implemented control system are: checkpoint interval, and cancellation strategy (lazy or aggressive). A comparative analysis of three test cases shows that the external control mechanism provides speedups between 5%-17% over the best performing embedded dynamic adjustment algorithms.
A Rough Set Based Self-Adaptive Web Search Engine
Authors: Xu Baowen, Weifeng Zhang, Hongji Yang, William C. Chu
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected by them. Since the selections of the search results cannot affect the future ones, they may not cover most people's interests. In this paper, feedback information produced by the users' accessing lists will be represented by the rough set and can influence the search results. And thus the search engines can provide self-adaptability.
A 13.3ns double-precision floating-point ALU and multiplier
Authors: H. Yamada, T. Hotta, T. Nishiyama, F. Murabayashi, T. Yamauchi, H. Sawamoto
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

One-bit pre-shifting before alignment shift, normalization with anticipated leading '1' bit and pre-rounding techniques have been developed for a floating-point arithmetic logic unit (ALU). In addition, carry select addition and pre-rounding techniques have been developed for a floating-point multiplier. A noise tolerant precharge (NTP) circuit was designed and applied to the ALU and multiplier. These techniques reduced the delay time of the critical path by 24%. Each unit was fabricated in 0.3 /spl mu/m 2.5 V four-layer-metal CMOS technology and achieved a two-cycle latency at 150 MHz.
Data Analysis and Mining in Ordered Information Tables
Authors: Ying Sai, Y. Y. Yao, Ning Zhong
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Many real world problems deal with ordering objects instead of classifying objects, although majority of research in machine learning and data mining has been focused on the latter. For modeling ordering problems, we generalize the notion of information tables to ordered information tables by adding order relations on attribute values. The problem of mining ordering rules is formulated as findingassociation between orderings of attribute values and the overall ordering of objects. An ordering rules ay state that "if the value of an object x on an attribute a is ordered ahead of the value of another object y on the same attribute, then x is ordered ahead of y" For mining ordering rules, we first transform an ordered information table into a binaryinformation, and then apply any standard machine learning and data mining algorithms. As an illustration, we analyze in detail MacLean's universities ranking for the year 2000.
An Euler Path Based Technique for Deadlock-free Multicasting
Authors: Nidhi Agrawal, C. P. Ravikumar
Venue: Proceedings of the international Conference on Parallel Processing (1997)

The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamiltonian property in the networks topology. However, these networks fail to be Hamiltonian in the presence of faults. This paper investigates the use of Euler circuits in deadlock-free multicasting. Not only are Euler circuits known to exist in all connected networks, a fast polynomial-time algorithm exists to find an Euler circuit in a network. We present a multicasting algorithm which works for both regular and irregular topologies. Our algorithm is applicable to store-and-forward as well as wormhole-routed networks. We show that at most two virtual channels are required per physical channel for any connected network. We also prove that no virtual channels are required to achieve deadlock-free multicasting on a large class of networks. Unlike other existing algorithms for deadlock-free multicasting in faulty networks, our algorithm requires a small amount of information to be stored at each node. The potential of our technique is further illustrated with the help of various examples. A performance analysis on wormhole-routed networks shows that our routing algorithm outperforms existing multicasting procedures.
A Capabilities Based Communication Model for High-Performance Distributed Applications: The Open HPC++ Approach
Authors: Shridhar Diwan, Dennis Gannon
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Typical high-performance distributed applications consist of clients accessing computational and information resources implemented by remote servers. Different clients may have different requirements for accessing a single server resource. A server resource may also want to provide different kinds of accesses for different clients, depending on factors such as the amount of trust between the server and a client. The requirements or attributes of remote access, such as data compression (and encryption) or client authentication, can be encapsulated under the concept of remote access capabilities.This paper presents a capabilities based model of communication and describes how it is implemented at application level in a programming environment called Open HPC++. Open HPC++ capabilities are associated with a remote reference and determine the kinds of remote access that it supports. Capabilities can be exchanged between processes, and can also be changed dynamically to helps applications adapt to varying run-time environments. Capabilities also work with the load-balancing features of Open HPC++ to help applications achieve higher performance. The paper presents a set of experiments to demonstrate the usefulness of the capabilities based model. It also describes Open HPC++'s communication protocol adaptivity mechanism, which is the basis of the capabilities based model.
Mining Constrained Association Rules to Predict Heart Disease
Authors: Carlos Ordonez, Edward Omiecinski, Levien de Braal, Cesar A. Santana, Norberto Ezquerra, Jose A. Taboada, David Cooke, Elizabeth Krawczynska, Ernest V. Garcia
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This work describes our experiences on discovering association rules in medical data to predict heart disease. We focus on two aspects in this work: mapping medical data toa transaction format suitable for mining association rules and identifying useful constraints. Based on these aspects we introduce an improved algorithm to discover constrainedassociation rules. We present an experimental sectionexplaining several interesting discovered rules.
Exact Dichotomy-based Constrained Encodi
Authors: Olivier Coudert, C.-J. Richard Shi
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Constrained encoding has several applications in the synthesis of finite state machines (FSMs). E.g., it can be used to generate asynchronous FSM state assignment that guarantees a critical hazard-free implementation, or to generate synchronous FSM state assignment with minimum PLA implementation. This paper presents ZeDicho, an original zero-suppressed binary decision diagram (ZBDD) based algorithm that solves exactly the dichotomy-based constrained encoding problem.
Resource Instantiation Policies for Software Process Environments
Authors: Carla Alessandra Lima Reis, Rodrigo Quites Reis, Heribert Schlebbe, Daltro José Nunes
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Software Process Management deals with activities that demand limited resources. The definition of resource allocation strategies is based on characteristics about required resources and their dynamic availability. However, most of existing PSEEs do not allow precise resource specification, and the instantiation is often based on the knowledge and experience of a process designer, mostly without automated support. This situation difficults resource allocation analysis and optimization in process systems and can influence project management and overall software quality. This paper proposes Instantiation Policies as a compact formalism to allow user-defined reusable allocation strategies. The motivations for this solution, the proposed meta-model, language and some application examples for this approach are presented and discussed.
Why Modern Systems Should Minimize the Use of Safety Critical Software
Authors: John M. Covan
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Many high consequence systems today are being controlled, or are under consideration for control, by software. Such systems are called high consequence because their failure could result in large numbers of fatalities or injuries, great environmental despoilment, or complete loss of mission or business purpose.
Systolic algorithms for tree pattern matching
Authors: Abdel Ejnioui, N. Ranganathan
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The objective of tree matching is to find the set of nodes at which a pattern tree matches a subject tree. Several sequential and parallel algorithms have been proposed in the literature for this compute bound problem. Most of the parallel algorithms are based on the theoretical PRAM model of computation. In this paper, we propose two efficient parallel algorithms for tree pattern matching based on the linear systolic array model. The algorithms can be mapped onto any SIMD machine. The algorithms require O(n+m) time to perform the matching using either n or m processors, where n is the size of the subject tree and m is the size of the pattern tree. The algorithms represent a significant improvement over the existing ones in view of implementation.
Reactive-Associative Caches
Authors: Brannon Batson, T. N. Vijaykumar
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: While set-associative caches typically incur fewer misses than direct-mapped caches, set-associative caches have slower hit times. We propose the reactive-associative cache (r-a cache), which provides flexible associativity by placing most blocks in direct-mapped positions and reactively displacing only conflicting blocks to set-associative positions. The r-a cache uses way-prediction (like the predictive associative cache, PSA) to access displaced blocks on the initial probe. Unlike PSA, however, the r-a cache employs a novel feedback mechanism to prevent unpredictable blocks from being displaced. Reactive displacement and feedback allow the r-a cache to use a novel PC-based way-prediction and achieve high accuracy; without impractical block swapping as in column associative and group associative, and without relying on timing-constrained XOR way prediction. A one-port, 4-way r-a cache achieves up to 9% speedup over a direct-mapped cache and performs within 2% of an idealized 2-way set-associative, 1-cycle cache. A 4-way r-a cache achieves up to 13% speedup over a PSA cache, with both r-a and PSA using the PC scheme. CACTI estimates that for sizes larger than 8KB, a 4-way r-a cache is within 1% of direct-mapped hit times, and 24% faster than a 2-way set-associative cache.
False Sharing Elimination by Selection of Runtime Scheduling Parameters
Authors: Jyh-Herng Chow, Vivek Sarkar
Venue: Proceedings of the international Conference on Parallel Processing (1997)

False sharing can be a source of significant overhead on shared-memory multiprocessors. Several program restructuring techniques to reduce false sharing have been proposed in past work. In this paper, we propose an approach for elimination of false sharing based solely on selection of runtime schedule parameters for parallel loops. This approach leads to more portable code since only the schedule parameters need to be changed to target different multiprocessors. Also, the guarantee of elimination (rather than reduction) of false sharing in a parallel loop can significantly reduce the bookkeeping overhead in some memory consistency mechanisms. We present some preliminary experimental results for this approach.
Rental Application to Rental Service Development of Advanced ASP Framework
Authors: Takahiro Kawamura, Tetsuo Hasegawa, Akihiko Ohsuga, Shinichi Honiden
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

We propose a new concept called Rental Service. Recently, Rental Application has been applied as ASP (Application Service Provider). For the next step in advancing ASP, we would prefer to provide Service which creates new functions, coordinating and facilitating already-existing functions, provided by many applications in the network. In this paper, we firstly made a list of problems for adding such service into the current ASP systems. Then, we developed a framework as a solution to the problems, in which the service itself is regarded as an agent. Moreover, we introduced a practical system developed by the framework, and finally examined its effectiveness for the above problems through that practical case.
Improvement and Invariance Analysis of Zernike Moments using as a Region-Based Shape Descriptor
Authors: Ye Bin, Peng Jia-xiong
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

An improved Zernike moment using as a region-based shape descriptor is presented. The improved Zernike moment not only has rotation invariance, but also has scale invariance that the unimproved Zernike moment does not have. The experimental results show that the improved Zernike moment has better invariant properties than unimproved Zernike moment using as region-based shape descriptor.
2D Object Recognition on a Reconfigurable Mesh
Authors: Concettina Guerra
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents an approach to recognizing two-dimensional multiscale objects on a reconfigurable mesh architecture with horizontal and vertical broadcasting. The object models are described in terms of a convex/concave multiscale boundary decomposition that is represented by a tree structure. The problem of matching an observed object against a model is formulated as a tree matching problem. A parallel dynamic programming solution to this problem is presented that requires O(max(n, m)) time on nxm reconfigurable mesh, where n and m are the sizes of the two trees.
A Framework for Parallelizing Load/Stores on Embedded Processors
Authors: Xiaotong Zhuang, Santosh Pande, John S. Greenland,  Jr.
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve code density and/or performance. In order to effectively utilize the parallel load/store instructions, the compiler must partition the memory resident values into X or Y bank. This paper gives a post-register allocation solution to merge the generated load/store instructions into their parallel counterparts. Simultaneously, our framework performs allocation of values to X or Y memory banks.We first remove as many load/stores and register-register moves through an excellent iterated coalescing based register allocator by Appel and George [14]. We then attempt to maximally parallelize the generated load/stores using a multi-pass approach with minimalgrowth in terms of memory requirements. The first phase of our approach attempts the merger of load stores without replication of values in memory. We model this problem in terms of a graph coloring problem in which each value is colored X or Y. We then construct a Motion Scheduling Graph (MSG) based on the range of motion for each load/store instruction. MSG reflects potential instructions which could be merged. We propose a notion of pseudo-fixedboundaries so that the load/store movement is minimally affected by register dependencies. We prove that the coloring problem for MSG is NP-complete. We then propose a heuristic solution, which minimally replicates load/stores on different control flow paths if necessary.Finally, the remaining load/stores are tackled by register rematerialization and local conflicts are eliminated. Registers are re-assigned to create motion ranges if opportunities are found for merger which are hindered by local assignment of registers. We show that our framework results in parallelization of a large number of load/stores without much growth in data and code segments.
Automating the Assembly of Presentations from Multimedia Databases
Authors: Gultekin Özsoyoglu, Veli Hakkoymaz, Joel Kraft
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

A multimedia presentation refers to the presentation of multimedia data using output devices such as monitors for text and video, and speakers for audio. Each presentation consists of multimedia segments which are obtained from a multimedia data model. In this paper, we propose to express semantic coherency of a multimedia presentation in terms of presentation inclusion and exclusion constraints that are incorporated into the multimedia data model. Thus, when a user specifies a set of segments for a presentation, the DBMS adds segments into and/or deletes segments from the set in order to satisfy the inclusion and exclusion constraints. To automate the assembly of a presentation with concurrent presentation streams, we also propose presentation organization constraints that are incorporated into the multimedia data model, independent of any presentation. We give two algorithms for automated presentation assembly and discuss their complexity. We discuss the satisfiability of inclusion and exclusion constraints when negation is allowed. And, we briefly describe a prototype system that is being developed for automated presentation assembly.