ppxscal/embedding_network huggingface dataset:
Constant-Time Algorithm for Medial Axis Transform on the Reconfigurable Mesh
Authors: Amitava Datta
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The medial axis transform (MAT) of a set S is defined as the set of centers and radii of maximal disks that are contained in S.If S is a region of a binary image, the disks are defined as upright maximal squares of black pixels and the region S is the union of these maximal squares. In this paper, we present an O(1) time algorithm for computing the medial axis transform of an N × N binary image on a reconfigurable mesh of size N × N × N.
Mining Frequent Closed Itemsets with the Frequent Pattern List
Authors: Fan-Chen Tseng, Ching-Chi Hsu, Henry Chen
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The mining of the complete set of frequent itemsets willlead to a huge number of itemsets. Fortunately, thisproblem can be reduced to the mining of frequent closeditemsets (FCIs), which results in a much smaller number ofitemsets. The approaches to mining frequent closeditemsets can be categorized into two groups: those withcandidate generation and those without. In this paper, wepropose an approach to mining frequent closed itemsetswithout candidate generation: with a data structure calledthe Frequent Pattern List (FPL). We designed thealgorithm FPLC -Mining to mine the frequent closeditemsets (FCIs). Experimental result shows that our methodis faster than the previously existing ones.
2D-CHI: A Tunable Two-Dimensional Class Hierarchy Index for Object-Oriented Databases
Authors: Jong-Hak Lee, Kyu-Young Whang, Wook-Shin Han, Wan-Sup Cho, Il-Yeol Song
Venue: 24th International Computer Software and Applications Conference (2000)

This paper presents a tunable two-dimensional class hierarchy indexing technique (2D-CHI) for object-oriented databases. We use a two-dimensional file organization as the index structure. 2D-CHI deals with the problem of clustering objects in a two-dimensional domain space consisting of the key attribute domain and the class identifier domain. In conventional class indexing techniques using one-dimensional index structures such as the B+-tree, the clustering property is exclusively owned by one attribute. These indexing techniques do not efficiently handle the queries that address both the attribute keys and the class identifiers. 2D-CHI enhances query performance by adjusting the degree of clustering between the key value domain and the class identifier domain based on the pre-collected usage pattern. For performance evaluation, we first compare 2D-CHI with the conventional class indexing techniques using an analytic cost model based on the assumption of uniform object distribution, and then, verify the cost model through experiments using the multilevel grid file as the two-dimensional index. We further perform experiments with non-uniform object distributions. Our experiments show that our proposed method does indeed build optimal class index structures regardless of query types and object distributions. We strongly believe that our paper significantly contributes to building a self-tunable database system by supporting automatically tunable index structure.
An Object-Oriented Architecture Supporting Web Application Testing
Authors: Ji-Tzay Yang, Jiun-Long Huang, Feng-Jian Wang, William C. Chu
Venue: 23rd International Computer Software and Applications Conference (1999)

The development and deployment of three-tier Web-based applications are getting prevalent in the Internet and Intranet environment. Several frameworks and techniques have been proposed to ease the development of web-based application. However, few tools are provided to directly support the software testing on Web-based applications.In this thesis, a three-tier Web application model is proposed to extract the behavior of three-tier Web application, and several conventional software testing techniques are extended and applied based on this model. In addition, an architecture for three-tier Web application testing environment is also proposed. This architecture contains six subsystems: Source Document Analysis Subsystem (SDAS), Test Management Subsystem (TMS), Test Development Subsystem (TDS), Test Execution Subsystem (TES), Test Failure Analysis Subsystem (TFAS), and Test Measurement Subsystem (TMES). All testing processes (e.g. test case generation) can be achieved with the cooperation of the subsystems. Finally, a prototype of Web application testing environment is built based on this architecture to demonstrate its practicability.
Gigabit Packet Classification by Using Lookahead Caching
Authors: Pi-Chung Wang, Wei-Chun Tseng, Chia-Tai Chan, Yaw-Chung Chen
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Hashing is a widely used method to perform fast lookup. Several schemes have been proposed to support Internet lookup that includes IP lookup and packet classification. Rectangular search is a well-known packet classification scheme based on multiple hash accesses for different filter length. It shows good scalability with respect to the number of filters; however, the lookup performance is not satisfactory. For example, through experiments, each packet classification takes about 40 hash accesses in a 100,000-filter database and each hash access may take more than one memory access. Obviously, this is insufficient to provide gigabits throughput. In this paper, we proposed a novel "Lookahead Caching" which can significantly improve the performance of hash-based algorithm. The basic idea is to find out the unmatched case for each incoming packet, thus it is different from the traditional caching mechanism. The experimental results indicate that the proposed scheme can improve the performance by a factor of two. The scheme can be further enhanced using parallel processing.
Bayesian Data Mining on the Web with B-Course
Authors: Petri Myllymäki, Tomi Silander, Henry Tirri, Pekka Uronen
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

B-Course is a free 1 web-based Bayesian data mining service. This service allows the users to analyze their own data for multivariate probabilistic dependencies represented as Bayesian network models. In addition to this, B-Course also offers facilities for inferring certain type of causal dependencies from the data. The software is especially suitable for educational purposes as the tutorial style user-friendly interface intertwines the steps in the data analysiswith support material that gives an informal introduction to the Bayesian approach adopted. Nevertheless, although the analysis methods, modeling assumptions and restrictionsare totally transparent to the user, this transparency is not achieved at the expense of analysis power: with the restrictions stated in the support material, B-Course is a powerful analysis tool exploiting several theoretically elaborate results developed recently in the fields of Bayesian and causal modeling.
Contour-based Image Preprocessing for Holistic Handwritten Word Recognition
Authors: Sriganesh Madhvanath, Venu Govindaraju
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The one-dimensional nature of contour representations presents interesting challenges for processing of images for handwritten word recognition. In this paper, we discuss the issues of determination of upper and lower contours of the word, determination of significant local extrema on the contour, and determination of reference lines from contour representations of handwritten words.
Fast parallel algorithms for minimum and related problems with small integer inputs
Authors: Omer Berkman, Yossi Matias
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The fundamental problem of minimum computation has several well studied generalizations such as prefix minima, range minima, and all nearest smaller values computations. Recent papers introduced parallel algorithms for these problems when the n input elements are given from an integer domain [1..s], obtaining O(lg lg lg s) running time and linear work for s/spl ges/n. However, most of these algorithms have the running time of O(lg lg lg n) (rather than O(lg lg lg s)) for all values of s/spl les/n, except for the case s=O(1) in which case the running time is O(/spl alpha/(n)). In this paper we focus on the range s/spl les/n and provide linear-work algorithms whose running time is O(lg lg lg s+f(n)) for all s/spl ges/0, where f(n) is either one of the slow growing functions lg* n or /spl alpha/(n). We show how to generalize our algorithms to the case that the domain size s is unknown, with the same complexities. (All previous algorithms work only under the assumption that the domain sire s is known.) Moreover, we make our algorithms output-sensitive with the lg lg lg s term replaced by lg lg lg M, where M is the maximum input value. In fact, for the minimum computation problem the running time is O(lg lg lg m) for all s/spl ges/0, where m is the minimum input value.
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Authors: Soner Önder
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time without causing a significant number of memory order violations. We present a simple mechanism which incorporates multiple speculation levels within the processor and classifies the load and the store instructions at run time to the appropriate speculation level. Each speculation level istermed as a color and the sets of load and store instructions are called color sets. We present how this mechanism can be incorporated into the issue logic of a conventional super-scalarprocessor and show that this simple mechanism can provide similar performance to that of more costly schemes resulting in reduced hardware complexity and cost. The performance of the technique is evaluated with respect to the store set algorithm.At very small table sizes, the color set approach provides up to 21% better performance than the store set algorithm for floating point Spec-95 benchmarks and up to 18% better performance for integer benchmarks using harmonic means.
Distributed games
Authors: Dov Monderer, Moshe Tennenholtz
Venue: Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge (1998)

The Internet exhibits forms of interactions which are not captured by existing models in economics, artificial intelligence and game theory. New models are needed to deal with these multi-agent interactions. In this paper we present a new model -- distributed games. In such a model each player controls a number of agents which participate in asynchronous parallel multi-agent interactions (games). The agents jointly and strategically (partially) control the level of information monitoring and the level of recall by broadcasting messages. As an application, we show that the cooperative outcome of the Prisoner's Dilemma game can be obtained in equilibrium in such a setting.
Model Checking of Workflow Schemas
Authors: Christos T. Karamanolis, Dimitra Giannakopoulou, Jeff Magee, Stuart M. Wheater
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Practical experience indicates that the definition of real-world workflow applications is a complex and error-prone process. Existing workflow management systems provide the means, in the best case, for very primitive syntactic verification, which is not enough to guarantee the overall correctness and robustness of workflow applications. The paper presents an approach for formal verification of workflow schemas (definitions). Workflow behaviour is modelled by means of an automata-based method, which facilitates exhaustive compositional reachability analysis. The workflow behaviour can then be analysed and checked for safety and liveness properties. The model generation and the analysis procedure are governed by well-defined rules that can be fully automated. Therefore, the approach is accessible by designers who are not experts in formal methods.
Persistent Cache in a Distributed Search Engine
Authors: Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Cooperative Search Engine (CSE) is a distributed search engine, which can update indexes in very short time for the purpose of fresh information retrieval in an intranet. In CSE, the retrieval performance is dependent on cache contents because communication delay occurs at retrieval time. In the other hand, however, cache is invalidated as soon as indexes are updated. Therefore, we need persistent cache that can hold valid data before and after updating. In this paper, we describe the principle and evaluations of persistent cache.
Profiling Dependence Vectors for Loop Parallelization
Authors: Shaw-Yen Tseng, Chung-Ta King, Chuan-Yi Tang
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

A dependence relation between two data references is linear if it generates dependence vectors that are linear functions of the loop indices. A linear dependence relation often induces a large number of dependence vectors. Empirical studies also show that linear dependencies often intermix with uniform dependencies in loops These factors make it difficult to analyze such loops and extract the inherit parallelism. In this paper, we propose to manipulate such dependencies in the dependence vector space and summarize the large number of dependence vectors with their convex hull. The convex hull, as a profile of the dependence vectors, can be used to deduce many important properties of the vectors. We will show how to find the convex hull and then apply it to loop parallelization. The proposed approach will be compared with other schemes.
Practical Key Distribution Schemes for Channel Protection
Authors: Yu-Lun Huang, Shiuh-Pyng Winston Shieh, Jian-Chyuan Wang
Venue: 24th International Computer Software and Applications Conference (2000)

This paper presents three key distribution schemes for channel protection. With the proposed schemes, encryption keys of the ordered programs can be distributed to the authorized subscribers efficiently and securely. In these schemes, for key updates, at most two messages are transmitted and simpler computation functions, including one-way hash function and XOR operation, are used to reduce the computation cost compared to existing solutions. With our key distribution schemes, only the authorized subscribers can decrypt the ordered programs. Thus, the service provider in a Pay-TV system can charge his subscribers according to their subscriptions and the intelligent property rights of TV programs can be protected by the proposed schemes.
High Performance Computational Steering of Physical Simulations
Authors: Jeffrey S. Vetter, Karsten Schwan
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Computational steering allows researchers to monitor and manage long running, resource intensive applications at runtime. Limited research has addressed high performance computational steering. High performance in computational steering is necessary for three reasons. First, a computational steering system must act intelligently at runtime in order to minimize its perturbation of the target application. Second, monitoring information extracted from the target must be analyzed and forwarded to the user in a timely fashion to allow fast decision-making. Finally, steering actions must be executed with low latency to prevent undesirable feedback. This paper describes the use of language constructs, coined ACSL, within a system for computational steering. The steering system interprets ACSL statements and optimizes the requests for steering and monitoring. Specifically, the steering system, called Magellan, utilizes ACSL to intelligently control multithreaded, asynchronous steering servers that cooperatively steer applications. These results compare favorably to our previous Progress steering system.
Supporting Self-Facilitation in Distributed Group Decisions
Authors: Constantin B. Zamfirescu, Florin G. Filip
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The paper addresses the problem of supporting self-facilitation of distributed autonomous groups of decision-makers from an agent-oriented perspective. In contrast to the monolithic designs, based on functional decomposition, it is argued that an agent-oriented approach is the appropriate means to provide better support for group meetings. The focus is on distributed and asynchronous meetings, detailing the conceptual modelling aspects of an implemented agent-based GDSS which exhibit an emergent functionality able to support in an effective way the dynamic of the group decision process.
Calibrating Computational Feasibility by Abstraction Rank
Authors: Daniel Leivant
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We characterize computationally the functions provable in second order logic with set existence restricted to natural classes of first order formulas. A classification of first-order set-existence by implicational rank yields a natural hierarchy of complexity classes within the class of Kalmar-elementary functions: The functions over {0, 1}*constructively provable using set existence for formulas of implicational rank \leqslant k are precisely the functions computable in deterministic time 0(\exp_\kappa (n)), where \exp_0 = \cup_\kappa (\lambda n.n^\kappa), and \exp_{\kappa + 1} = 2^{\exp_\kappa}. 1 In particular, set-existence for positive formulas yields exactly PTime. We thus obtain lean and natural formalisms for codifying feasible mathematics, which are expressive both in allowing second order definitions and reasoning, and in incorporating equational programming and reasoning about program convergence in a direct and uncoded style.Through a formula-as-type morphism, we also obtain a link with lambda definability, which we exhibit in the full paper: The functions over {0, 1}* definable in the polymorphic lambda calculus F2 over a base of type of words, using first-order type-arguments of rank \leqslant k, are precisely the functions computable in deterministic time 0(exp_\kappa (n)). 2 The poly-time case was proved (directly) in [15].
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
Authors: Andrej Bogdanov, Kenji Obata, Luca Trevisan
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We consider the problem of testing 3-colorability in the bounded-degree model.We show that, for small enough \varepsilon, every tester for 3-colorability must have query complexity \Omega \text{(n)}. This is the first linear lower bound for testing a natural graph property in the bounded-degree model. An \Omega (\sqrt n ) lower bound was previously known.For one-sided error testers, we also show an \Omega \text{(n)} lower bound for testers that distinguish 3-colorable graphs from graphs that are({\raise0.7ex\hbox{$1$} \!\mathord{\left/ {\vphantom {1 3}}\right.\kern-\nulldelimiterspace} \!\lower0.7ex\hbox{$3$}} - \alpha )- far from 3-colorable, for arbitrarily small \alpha. In contrast a polynomial time algorithm by Frieze and Jerrum distinguishes 3-colorable graphs from graphs that are {1 \mathord{\left/{\vphantom {1 5}} \right.\kern-\nulldelimiterspace} 5}-far from 3-colorable.As a by-product of our techniques, we obtain tight unconditional lower bounds on the approximation ratios achievable by sublinear time algorithms for Max E3SAT, Max E3LIN-2 and other problems.
Multi-Mesh-an efficient topology for parallel processing
Authors: Debasish Das, Bhabani P. Sinha
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper introduces a new interconnection scheme, called Multi-Mesh (MM) network, for parallel processing which uses multiple meshes as the basic building blocks interconnected in a suitable manner. The interconnection pattern is regular and suitable for VLSI implementation. Each processor in the network has degree four with a resulting diameter upper bounded by 2n for n/sup 4/ processors. Routing can easily be done within 2n time on this network. Sum/minimum/maximum of n/sup 4/ data values can be found in O(n) time. Two n/spl times/n matrices can be multiplied by the MM network in O(n/sup 0.6/) with an AT-cost of O(n/sup 3/). The DFT of n sample points can be computed in O(n/sup 0.6/) time on this network. Sorting of n/sup 3/ data elements resident on n/sup 3/ processors can be done in 2n log n+14n+o(n) time.
Multiscale Denoising Algorithm Based on the &agrave; Trous Algorithm
Authors: R. C. P. Marques, C. M. Laprano, F. N. S. Medeiros
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

In this work we present a novel application to the multiscale denoising algorithm proposed bySita & Ramakrishnan [1]. We used it to filter artificially contaminated images by multiplicative speckle and additive Gaussian noise, respectively. This filtering scheme is a combination of the shift invariant discrete wavelet and nonlinear filtering applied to evoked potential signals. It employs a redundant discrete wavelet (the algorithm à trous) removing the smallest wavelet coefficients in each dyadic scale guided by the correlation existing between them in different scales.
Parallel algorithms for maximum matching in interval graphs
Authors: M. G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Given a set of n intervals representing an interval graph, the problem of finding a maximum matching between pairs of disjoint (nonintersecting) intervals has been considered in the sequential model. We present parallel algorithms for computing maximum cardinality matchings among pairs of disjoint intervals in interval graphs an the EREW PRAM and hypercube models. For the general case of the problem, our algorithms compute a maximum matching in O(log/sup 3/ n) time using O(n/log/sup 2/ n) processors on the EREW PRAM and using O(n) processors on the hypercubes. For the case of proper interval graphs, our algorithm runs in O(log n) time using O(n) processors if the input intervals are not given already sorted and using O(n/log n) processors otherwise, on the EREW PRAM. On n-processor hypercubes, our algorithm for this case takes O(log n loglog n) time for unsorted input and O(log n) time for sorted input. Our parallel results also lead to optimal sequential algorithms for computing maximum matchings among disjoint intervals. We also present an improved parallel algorithm for maximum matching between overlapping intervals in proper interval graphs.
Problems with Mining Medical Data
Authors: Shusaku Tsumoto
Venue: 24th International Computer Software and Applications Conference (2000)

Since early 1980's, the rapid growth of hospital information systems (HIS) stores the large amount of laboratory examinations as databases. Thus, it is highly expected that data mining methods will find interesting patterns from databases as reuse of stored data and be important for medical research and practice because human beings cannot deal with such a huge amount of data. In this paper, we focus on the characteristics of medical data and discuss how data miners deal with medical data.