ppxscal/embedding_network huggingface dataset:
An Efficient Hash-Based Method for Discovering the Maximal Frequent Set
Authors: Don-Lin Yang, Ching-Ting Pan, Yeh-Ching Chung
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

The association rule mining can be divided into two steps. The first step is to find out all frequent itemsets, whose occurrences are greater than or equal to the user-specified threshold. The second step is to generate reliable association rules based on all frequent itemsets found in the first step. Identifying all frequent itemsets in a large database dominates the overall performance in the association rule mining. In this paper, we propose an efficient hash-based method, HMFS, for discovering the maximal frequent itemsets. The HMFS method combines the advantages of both the DHP (Direct Hashing and Pruning) and the Pincer-Search algorithms. The combination leads to two advantages. First, the HMFS method, in general, can reduce the number of database scans. Second, the HMFS can filter the infrequent candidate itemsets and can use the filtered itemsets to find the maximal frequent itemsets. These two advantages can reduce the overall computing time of finding the maximal frequent itemsets. In addition, the HMFS method also provides an efficient mechanism to construct the maximal frequent candidate itemsets to reduce the search space. We have implemented the HMFS method along with the DHP and the Pincer-Search algorithms on a Pentium III 800 MHz PC. The experimental results show that the HMFS method has better performance than the DHP and the Pincer-Search algorithms for most of test cases. In particular, our method has significant improvement over the DHP and the Pincer-Search algorithms when the size of a database is large and the length of the longest itemset is relatively long.
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
Authors: Smaïl Niar, Arnaud Freville
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The 0 1 MultidimensionalKnapsack Problem (0 1MKP) is a NP-complete problem. Its resolution for large scale in-stances requires a prohibitive processing time. In this paper we propose a new parallel meta heuristic algorithm based on the Tabu Search (TS) for the resolution of the 0-1 MKP. We show that, in addition to reducing execution time, parallel processing can perform automatically and dynamically the settings of some TS parameters . This last point is realized by analyzing the information given by cooperative parallel search processes, and by modifying the search processes during the execution. This approach introduces a new level where balancing between intensification and diversification can be realized.
Theory and Applications of Attribute Decomposition
Authors: Lior Rokach, Oded Mainon
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper examines the Attribute Decomposition Approach with simple Bayesian combination for dealing with classi£cation problems that contain high number ofattributes and moderate numbers of records. According to the attribute Decomposition approach, the set of input attributes is automatically decomposed into several subsets. classi£cation model is built for each subset, then all the models are combined using simple Bayesian combination.This paper presents theoretical and practical foundation for the Attribute Decomposition approach. A greedyprocedure, called D-IFN, is developed to decompose the input attributes set into subsets and build a classi£cation model for each subset separately. The results achieved in theempirical comparison testing with well-known classi£cationmethods (like C4.5)indicate the superiority of the decomposition approach.
Parallel Algorithms for Image Processing: Practical Algorithms with Experiments
Authors: Armin Bäumker, Wolfgang Dittrich
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper we design and analyse parallel algorithms with the goal to get exact bounds on their speed-ups on real machines. For this purpose we employ the BSP* model which is an extension of Valiant's BSP model and rewards blockwise communication. Further we use Valiant's notion of c-optimality. Intuitively a c-optimal parallel algorithm for p processors tends to speed-up p/c, where the communication time is asymptotically smaller than the computation time. We consider a basic problem in Image Processing, Connected Component Labeling for two and three dimensional images. Our algorithms are randomized and 2-optimal with high probability for a wide range of BSP* parameters where the range becomes larger with growing input sizes. Our algorithms improve on previous results as they either need an asymptotically smaller amount of data to be communicated or fewer communication rounds. We further report on implementation work and experiments.
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
Authors: Yu-Hua Lee, Shi-Jinn Horng
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract information about the shape and position of foreground pixels relative to each other. Extensively applications of these two transforms are used in the fields of computer vision and image processing, such as expanding/shrinking, thinning, computing the shape factor, etc. There are many different DTs based on different distance metrics. Finding the DT with respect to the Euclidean distance metric is easier to use, but rather time-consuming, so many approximate Euclidean DTs (EDTs) are also widely used in the computer vision and image processing fields. The chessboard DT (CDT) is one kind of DT, which converts an image based on the chessboard distance metric. Traditionally, the MAT and the CDT have usually been viewed as two completely different image computation problems. In this paper, we first point out that the processes to find the CDT and the MAT are almost identical, i.e. the two transforms are interchangeable through the proposed algorithms, so that a MAT can be found by utilizing a CDT algorithm and vice versa.
Practical Experiences of Designing a Distributed Collaborative System
Authors: Takao Ookubo, Takahide Matsutsuka, Yoshihide Nomura, Hirotaka Hara, Sanya Uehara
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

The PI-CEE(Project Information Cooperative Enterprise Environment) system is a project information management system that uses Java applications and is based on the model-based distributed collaborative work support concept. It is designed to achieve optimal performance with model-based Java applications for application to large-scale projects. We applied the first prototype of PI-CEE to a large-scale project. The result was twofold: memory use and response time worsened with increases in data quantity. Our design concept is based on doing four things: designing a server transaction system and database, implementing client cache management, making improvements in server-client communication, and multiple-server replication. We discuss our system, the general lessons that we learned from its application, and the problems we encountered and their resolutions.
A Comparison of Stacking with Meta Decision Trees to Bagging, Boosting, and Stacking with other Methods
Authors: Bernard Zenko, Ljupco Todorovski, Saso Dzeroski
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Abstract. Meta decision trees (MTs) are a method for combining multiple classifiers. We present an integration of the algorithm MLC4.5 for learning MTs into the Weka data mining suite. We compare classifier ensembles combined with MDTs to bagged and boosted decision trees, and to classifier ensembles combined with other methods: voting and stacking with three different meta-level classifiers (ordinary decision trees, naive Bayes, and multi-response linear regression -MLR).
Trends and developments in CASE and structured methods: a European perspective
Authors: Colin J. Hardy, Hlen M. Edwards, J. Barrie Thompson
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

There is a close association between many current CASE tools and structured methods. Both technologies offer benefits to developers, but unfortunately they are not as widely used as they might be. Possible reasons for this are reported which have been deduced from an analysis of replies to two surveys carried out in the 1990's of computer users in the UK. A possible resolution to the situation is suggested through the use of metaCASE tools; however, existing paradigms do not go far enough to resolve the problem. It is argued that it is possible to take advantage of existing models to provide a more holistic approach to the engineering of methods.
Interactive Configuration Management for Distributed Object Systems
Authors: Halldor Fosså, Morris Sloman
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Imperial CollegeThis paper describes an environment for interactive configuration management of the software components comprising a distributed enterprise application. The environment permits one or more managers to view and modify the structure of components in terms of component instances, their allocation to hardware nodes and the bindings between their interfaces. Our graphical management is based upon the Darwin configuration language which can be used to create the initial system. It supports hierarchical composition of CORBA components to form a composite distributed application or service. When this structure has been modified interactively, a persistent specification of the configuration can be saved to backing store. This can be used to determine unreachable or failed components and, if necessary, to recreate them. The configuration management environment is integrated into an overall domain-oriented platform for enterprise management. The paper illustrates the use of the management system in terms of a simple banking example, and outlines our implementation based on a CORBA platform.
On Some Global Operations in Faulty SIMD Hypercubes
Authors: Amit Sengupta, C. S. Raghavendra
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper we extend our prior results to obtain algorithms for performing all-to-all broadcast, global sum and broadcast operation in an N = 2^{n} node n dimensional faulty SIMD hypercube, Q_{n}, (n \ge 9) with the number of faults n - 1
Knowledge Transfer from University to Industry
Authors: Simon Rogerson
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The paper introduces a discussion concerning knowledge transfer from university to industry. Some approaches are mentioned which can be adopted to achieve such transfer.
SWEB: Towards a Scalable World Wide Web Server on Multicomputers
Authors: Daniel Andresen, Tao Yang, Vegard Holmedahl, Oscar H. Ibarra
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We investigate the issues involved in developing a scalable World Wide Web (WWW) server on a cluster of workstations and parallel machines. The objective is to strengthen the processing capabilities of such a server by utilizing the power of multicomputers to match huge demands in simultaneous access requests from the Internet. We have implemented a system called SWEB on a distributed memory machine, the Meiko CS-2, and networked workstations. The scheduling component of the system actively monitors the usages of CPU, I/O channels and the interconnection network to effectively distribute HTTP requests across processing units to exploit task and I/O parallelism. We present the experimental results on the performance of this system.
Auditory Browsing for Acquisition of Information in Cyberspace
Authors: Naoto Oki, Kunio Teramoto, Ken-ichi Okada, Yutaka Matsushita
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Today, various novel telecommunication systems have been proposed. The idea of a virtual communication space shared by multiple distributed users via networks, so-called cyberspace, has received considerable communication. In cyberspace, there are tremendously many users, on-line services, and much information, and users have great opportunity to encounter all of these. We think the most serious problem in cyberspace is the great risk that a user might miss a chance to get relevant or important information. In this paper, we propose a strategy for auditory browsing to address this problem, using a spatial sound interface. We implemented VCP (Virtual Cocktail Party), an experimental system for achieving efficient and flexible telecommunication and data retrieval, which takes advantage of human auditory capability. This system can support a number of physically separated users in a single shared sound cyberspace and consists of distributed terminals with a spatial sound interface.
Some Image Processing Algorithms on a RAP with Wider Bus Networks
Authors: Shung-Shing Lee, Shi-Jinn Horng, Horng-Ren Tsai, Yu-Hua Lee
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Based on the reconfigurable array of processors with wider bus networks (Li et al., 1995), we propose a series of algorithms for image processing. Conventionally, only one bus is connected between two processors but in this machine it has a set of buses. Such a characteristic increases the computation power of this machine greatly. Based on the base-m number system, we first introduce some basic operation algorithms. Then three related applications are derived in constant time; one is the histogram of an image, another is the image segmentation and the other is the image labeling.
Dynamic Policy Model for Large Evolving Enterprises
Authors: Nicole Dunlop, Jadwiga Indulska, Kerry Raymond
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: The nature of an open distributed environment provides a resoundingly diverse yet potentially chaotic environment for users. A great deal of research has focused on the management of resources in such an environment and policy-based management has emerged as one such promising solution. In order to support large evolving enterprises we are currently developing a policy model that will be scalable and able to cope with the extraordinarily high rate of change inherent in such environments. To do this we have developed a number of novel concepts including, enterprise domain, policy space and policy authority which are unique and central to our approach. The overall objective of producing this model is to support dynamic roles, dynamic policies and the subsequent dynamic conflict analysis. Prevailing policy-based management models largely promote the static definition and analysis of policy. We argue that although these models are suitable for homogenous, largely static environments, they are too rigid to adequately represent large, heterogeneous, evolving enterprise as the fluidity and complexity of interactions occurring in such environments are genuinely difficult and often impossible to pre-empt at the time of policy specification and role assignment.
Determining Asynchronous Acyclic Pipeline Execution Times
Authors: Val Donaldson, Jeanne Ferrante
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Pipeline execution is a form of parallelism in which subcomputations of a repeated computation, such as statements in the body of a loop, are executed in parallel. A measure of the execution time of a pipeline is needed to determine if pipelining is an effective form of parallelism for a loop, and to evaluate alternative scheduling choices. We derive a formula for precisely determining the asynchronous pipeline execution time of a loop modeled as iterated execution of an acyclic task graph. The formula can be evaluated in time linear in the number of tasks and edges in the graph. We assume that computation and communication times are fixed and known, interprocessor communication and buffering capability are unbounded, and each task is assigned to a distinct processor.
A unified theory for a traffic analysis in product networks
Authors: Abdelghani Bellaachia, Abdou Youssef
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Instead of providing separate solutions for each individual network, a unified theory is desirable to cover the study of a class of networks. Cartesian product graphs provide a common framework to investigate the performance of several individual networks. This paper addresses communication capabilities of product networks. It presents a unified theory to evaluate the traffic intensity and the saturation level of product networks. We have theoretically computed the traffic intensity and the saturation level. Examples of product networks that have been investigated are multidimensional meshes, multidimensional tori, and r-ary n-cube networks.
A Practical Method for Watermarking Java Programs
Authors: Akito Monden, Hajimu Iida, Ken-ichi Matsumoto, Koji Torii, Katsuro Inoue
Venue: 24th International Computer Software and Applications Conference (2000)

Java programs distributed through Internet are now suffering from program theft. It is because Java programs can be easily decomposed into reusable class files and even decompiled into source code by program users. In this paper, we propose a practical method that discourages program theft by embedding Java programs with a digital watermark. Embedding a program developer's copyright notation as a watermark in Java class files will ensure the legal ownership of class files. Our embedding method is discernible by program users, yet enable us to identify an illegal program that contains stolen class files. The result of the experiment to evaluate our method showed most of the watermarks (20 out of 23) embedded in class files survived two kinds of attacks that attempt to erase watermarks: an obfuscactor attack, and a decompile-recompile attack.
Building Distributed Enterprise OLTP Applications: Current CORBA Limitations
Authors: Bruce Blackshaw, John Ellwood
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

On-line Transaction Processing (OLTP) applications have special requirements in the areas of scalability and performance. Mincom currently markets a successful product, MIMS (Mincom Information Management System), which is a large, monolithic OLTP system consisting of about 16 000 KLOC, mostly COBOL. Our research group is developing prototypes in preparation for migrating MIMS into a distributed architecture. CORBA is the current research focus. This paper will examine the limitations of CORBA for current use in enterprise OLTP development. Major concerns include: lack of a standardized persistence interface for use with major database vendors, immaturity of the Object Transaction Service and Concurrency Service, lack of integrated workflow solutions, scalability and robustness, lack of performance monitoring tools, and poor enterprise development environments. We are optimistic that vendors and the OMG will eventually solve these problems, but feel that it may be a few years before workable solutions are in place.
A Comparison of POCS Algorithms for Tomographic Reconstruction Under Noise and Limited View
Authors: Fernando V. Salina, Nelson D. A. Mascarenhas, Paulo E. Cruvinel
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We present in this work a comparison among four algorithms for transmission tomography. The algorithms are based on the formalism of POCS (Projection onto Convex Sets): ART (Algebraic Reconstruction Technique), SIRT (Simultaneous Iterative Reconstruction Technique), equential POCS and parallel POCS. We found that the use of adequate a priori knowledge about the solutions, expressed by convex sets restrictions, particularly in the case of the last algorithm, is an efficient way to reduce the variations on the solutions due to the ill-conditioning of the reconstruction problem, not only due to the noise in the projections, butalso due to limited view reconstruction.
Virtual Private Resources
Authors: Thomas Preuß, Jens-Hagen Syrbe, Hartmut König
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Current approaches for service mediation, such as trading, do not provide means for a long-term binding of services. They do not ensure that certain services are provided and that the desired service properties are fulfilled. Moreover, a server may withdraw a service offer at any time. For the integration of external services into an enterprise internal service market, it is necessary to guarantee the permanent availability of the services with desired properties and to sustain these properties. This requires that the technical relationship between service provider and customer has to be extended by commercial and legal ones. In this paper, we introduce the concept of Virtual Private Resources to enable long-term relationships between the customer and the provider of a service. Virtual Private Resources are services that can be bound by contract for a longer period of time. They can be considered as private ones, although the physical resources that provide the service may change or be shared with other customers. We introduce the basics of the approach and present a possible architecture for implementing Virtual Private Resources. Finally, we give an example for the application of Virtual Private Resources to implement a traffic information system.
Effort-Index-Based Software Reliability Growth Models and Performance Assessment
Authors: Chin-Yu Huang, Sy-Yen Kuo, Michael R. Lyu
Venue: 24th International Computer Software and Applications Conference (2000)

In this paper, we first show that the logistic testing effort function is practically acceptable/helpful for modeling software reliability growth and providing a reasonable description of resource consumption. Therefore, in addition to the exponential-shaped models, we will integrate the logistic testing-effort function into S-shaped model for further analysis. The model is designated as the Yamada Delayed S-shaped model. A realistic failure data set is used in the experiments to demonstrate the estimation procedures and results. Furthermore, the analysis of the proposed model under imperfect debugging environment is investigated. In fact, from these experimental results and discussions, it is apparent that the logistic testing-effort function is well suitable for making estimations of resource consumption during the software development/testing phase.
Performance Prediction for Complex Parallel Applications
Authors: Jürgen Brehm, Patrick Worley
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Today's massively parallel machines are typically message-passing systems consisting of hundreds or thousands of processors. Implementing parallel applications efficiently in this environment is a challenging task, and poor parallel design decisions can be expensive to correct. Tools and techniques that allow the fast and accurate evaluation of different parallelization strategies would significantly improve the productivity of application developers and increase throughput on parallel architectures. This paper investigates one of the major issues in building tools to compare parallelization strategies: determining what type of performance models of the application code and of the computer system are sufficient for a fast and accurate comparison of different strategies. The paper is built around a case study employing the Performance Prediction Tool (PerPreT) to predict performance of the Parallel Spectral Transform Shallow Water Model code (PSTSWM) on the Intel Paragon.