ppxscal/embedding_network huggingface dataset:
Mining Decision Trees from Data Streams in a Mobile Environment
Authors: Hillol Kargupta, Byung-Hoon Park
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper presents a novel Fourier analysis-based technique toaggregate, communicate, and visualize decision trees in a mobile environment. Fourier representation of a decision tree has several useful properties that are particularly useful for mining continuous data streams from small mobile computing devices. This paper presents algorithms to compute the Fourier spectrum of a decision tree and the vice versa. It offers a framework to aggregate decision trees in their Fourier representations. It a so describes atouch-pad/ticker-based approach to visualize decision trees using their Fourier spectrum and an implementation for PDAs..
An Efficient Logging Algorithm for Incremental Replay of Message
Authors: Franco Zambonelli
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

To support incremental replay of message-passing applications, processes must periodically checkpoint and the content of some messages must be logged, to break dependencies of the current state of the execution on past events. The paper presents a new adaptive logging algorithm that dynamically decides whether to log a message based on dependencies the incoming message introduces on past events of the execution. The paper discusses the implementation issues of the algorithm and evaluates its performances on several applications, showing how it improves previously known schemes.
Designing an Integrated Holonic Scheduler with JACK
Authors: M. Fletcher, Robert W. Brennan
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The paper identifies one of the key gaps in the current model of holonic manufacturing systems (HMS). Namely the lack of an integrated scheduler to satisfy both top-down (order-driven) and bottom-up (resource-driven) approaches within the scope of an agent-based HMS. The paper also presents how some of these conceptual ideas could be implemented using JACK, a commercial autonomous agent system from Agent Oriented Software (AOS).
Materialized Views in Data Mining
Authors: Bogdan D. Czejdo, Mikolaj Morzy, Marek Wojciechowski, Maciej Zakrzewicz
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Data mining is an interactive and iterative process. It is highly probable that a user will issue a series of similar queries until he or she receives satisfying results. Currently available mining algorithms suffer from long processing times depending mainly on the size of the dataset. Asthe pattern discovery takes place mainly in the data warehouse environment, such long processing times are unacceptable from the point of view of interactive data mining. On the other hand, the results of consecutive data mining queries are usually very similar. This observation leads to the idea of reusing materialized results of previous data mining queries in order to improve performance of the system. In this paper we present the concept of materialized data mining views and we show how the results stored in these views can be used to accelerate processing of data mining queries. We demonstrate the use of materializedviews in the domains of association rules discovery and sequential pattern search.
An enhanced algorithm for the minimization of exclusive-OR sum-of-products for incompletely specified functions
Authors: Tomasz Kozlowski, Erik L. Dagless, Jonathan Saul
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Most of the current exclusive-OR sum-of-products minimization algorithms use rule-based heuristics to transform an initial circuit description into a possibly compact form. This paper presents an enhanced minimization algorithm, MINT, introducing new transformations including rules operating on three product terms at a time. These multiple-product-term transformations prove to be an efficient extension of previously defined two-product-term operating rules. Additionally, new efficient procedures for the optimization based on the use of don't cares are introduced. The algorithm can simplify multiple-valued input two-valued multiple-output incompletely specified functions.
Leakage Energy Management in Cache Hierarchies
Authors: L. Li, Ismail Kadayif, Yuh-Fang Tsai, Narayanan Vijaykrishnan, Mahmut T. Kandemir, Mary Jane Irwin, Anand Sivasubramaniam
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Energy management is important for a spectrum of systems ranging from high-performance architectures to low-end mobile and embedded devices. With the increasing number of transistors, smaller feature sizes, lower supply and threshold voltages, the focus on energy optimization is shifting from dynamic to leakage energy. Leakage energy is of particular concern in dense cache memories that form a major portion of the transistor budget. In this work, we present several architectural techniques that exploit the data duplication across the different levels of cache hierarchy. Specifically, we employ both state-preserving (data-retaining) and state-destroying leakage control mechanisms to L2 subblocks when their data also exist in L1. Using a set of media and array-dominated applications, we demonstrate the effectiveness of the proposed techniques through cycle-accurate simulation. We also compare our schemes with the previously proposed cache decay policy. This comparison indicates that one of our schemes generates competitive results with cache decay.
Security Analysis and the DSM Model
Authors: Bingyang Zhou
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper mainly discusses the security analysis in web-based information systems. The analysis focuses on current client/server system application environment and system vulnerabilities. The paper also briefly describes a proposed conceptual security model ¿ dual security model (DSM). The model focus on risk management by identifying possible attacks to the system and address them before they can impact significantly the system security and the business of the organisation. The key design feature of this model is to develop a high level risk assessment framework for analysing and evaluating the system environment, interrelated system functions, risk modelling and evaluation process in web-based information systems.
N-grams: a well-structured knowledge representation for recognition of graphical documents
Authors: Edward Lank, Dorothea Blostein
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

N-grams are a well-structured knowledge representation that has proven useful in the recognition of textual documents. In this paper, we propose that n-grams can be extended to the domain of graphical documents as well. This has the advantage of providing a regular, easily-maintainable knowledge representation for local constraints, specifically symbol-interaction knowledge, in the graphical domain. To extend the definition of an n-gram from the textual to the graphical domain, we must resolve how to handle directional considerations, how to treat the variety of relations that can occur between image primitives, and how to treat multiple neighbours. We have implemented a prototype system for the application of n-gram knowledge to the recognition of sketch maps. Early results are encouraging. We look forward to further refining this system. N-grams appear to be a promising tool for representing spatial constraints in a form that is useful to the recognition of graphical documents.
A Novel Compilation Framework for Supporting Semi-Regular Distributions in Hybrid Applications
Authors: Dhruva R. Chakrabarti, Prithviraj Banerjee
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper explains how efficient support for semi-regular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work is in showing how, unlike other existing schemes, our scheme is able to minimize preprocessing overheads and maintain sophisticated communication optimizations (such as reduction of inter-processor communication during schedule generation and sharing of communicated information between regular and irregular accesses) even in the presence of semi-regular distributions. It is only natural that preprocessing overheads associated with semi-regular distributions be intermediate between those involved for regular and irregular distributions. This paper shows how various properties can be inferred for semi-regular distributions. These allow the use of the interval representation which in turn reduces the preprocessing overhead and makes possible compatible code generation for hybrid references. Experimental results on a 16-processor IBM SP-2 for a number of sparse applications using semi-regular distributions show that our scheme is feasible.
Adaptive Filters for Image Processing Based on Artificial Neural Networks
Authors: João Ricardo Bittencourt, Fernando Santos Osório
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

The paper presents our research in image processing (filters used for edge detection, color transformation, and distortion correction) using artificial neural networks. We have developed a tool, Neuron Color, in order to carry out these experiments and improving our adaptive methods.
Behavioral Verification of an ATM Switch Fabric using Implicit Abstract State Enumeration
Authors: Michel Langevin, Sofiène Tahar, Zijian Zhou, Xiaoyu Song, Eduard Cerny
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

We investigate equivalence checking of the RTL hardware implementation of the Cambridge Fairisle Asynchronous Transfer Mode (ATM) 4 by 4 switch fabric against a high-level behavioral specification which has unrestricted frame size, cell length and word width. The verification is based on the reachability analysis of the product machine of the implementation and the specification, both modeled as Abstract State Machines (ASM). Multiway Decision Graphs (MDG) are used to encode both the output and transition relations of the ASMs and of the set of reachable abstract states, allowing implicit abstract state enumeration. Since MDGs avoid model explosion induced by data values, this experiment demonstrates the effectiveness of MDG-based verification as an extension of ROBDD-based approaches.
Maintenance and abstraction of program data using formal transformations
Authors: Richard E. Mortimer, Keith H. Bennett
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

The authors present the DREAM (Data Reverse Engineering and Abstraction Mechanism) method for restructuring program data to meet the changing demands upon it. It is important that data changes are made correctly to avoid undesirable effects on the operation of the program and to minimise effort in maintenance. To facilitate this program transformations are used to manipulate the code, allowing the maintainer to concentrate upon the restructuring strategy without having to worry about the correctness of changes. Restructuring of programs containing discrete types is examined within the paper. This allows work to be focussed upon a small subset of commonly available data types to make development of solutions feasible and to provide a starting point for the development of a generic method which covers other types.
Compiler Techniques for Effective Communication on Distributed-Memory Multiprocessors
Authors: Angeles G. Navarro, Emilio L. Zapata, Yunheung Paek, David A. Padua
Venue: Proceedings of the international Conference on Parallel Processing (1997)

The Polaris restructurer transforms conventional Fortran programs into parallel form for various types of multiprocessor systems. This paper presents the results of a study on strategies to improve the effectiveness of Polaris' techniques for distributed-memory multiprocessors. Our study, which is based on the hand analysis of MDG and TRFD from the Perfect Benchmarks and TOMCATV and SWIM from SPEC benchmarks, identified three techniques that are important for improving communication optimization. Their application produces almost perfect speedups for the four programs on the Cray T3D.
Performance and Configuration of Hierarchical Ring Networks for Multiprocessors
Authors: V. Carl Hamacher, Hong Jiang
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Analytical queueing network models for expected message delay in %level and S-level hierarchical-ring interconnection networks (INS) are developed. Such networks have recently been used in commercial and research prototype multiprocessors. A major class of traffic carried by these INS consists of cache line transfers, and associated coherency control messages, between processor caches and remote memory modules in shared-memory multiprocessors. Memory modules are assumed to be evenly distributed over the processor nodes. Such traffic consists of short, fixed-length messages. They can be conveniently transported using the slotted ring transmission technique, which is studied here. The message delay results derived from the models are shown to be quite accurate when checked against a simulation study. The comparisons to simulations include heavy traffic situations where queueing delays in ring crossover switches are significant for ring utilization levels of 80 to 90%. As well as facilitating analysis, the analytical models can be used to determine optimal sizes for the rings at different levels in the hierarchy under specified traffic distributions in a system with a given total number of processor nodes. Optimality is in terms of minimizing average message delay. A specific example of such a design exercise is provided for the uniform traffic case.
Inexact Field Learning: An Approach to Induce High Quality Rules from Low Quality Data
Authors: Honghua Dai, Xiaoshu Hang, Gang Li
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

To avoid low quality problem caused by low quality data, this paper introduces an inexactfield learning approach which derives rules by working on the fields of attributes with respect to classes, rather than on individual point values of attributes. The experimental results show that field learning achieved a higher prediction accuracy rate on new unseen test cases which is particularly true when the learning is performed on large low qualitydata.
Statement-level independent partitioning of uniform recurrences
Authors: J. Ramanujam, S. Vasanthakumar
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This papers presents an approach to statement-level independent partitioning of uniform recurrences, i.e., loops with constant dependence distance vectors. Uniform recurrences may be partitioned into independent subsets-of the set of all statement instances-that require no communication or synchronization on a multiprocessor. Therefore, independent partitioning is highly efficient and desirable. This paper presents a method to partition uniform recurrences using statement-level affine schedules, and an algorithm for code generation. We consider a statement instance as a basic unit that can be allocated to a processor, in contrast to existing methods that use an iteration instance. Using this approach, we not only find maximal independent partitions for problems with a single statement inside a perfectly nested loop, but also solve the partitioning problem for multiple statements in a single or multiple nested loops. The method uses schedules derived using linear programming, which is very fast in practice.
A Hybrid Classifier for Recognizing Handwritten Numerals
Authors: Raymund Yee-Mian Teo, Rajjan Shinghal
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper, we propose a combination of rule-based and neural classifiers to recognize unconstrained handwritten numerals, 0 to 9. During training, the rule-based classifier identifies the candidate set for each character class. The candidate set of a character class i comprises the character classes with which a pattern of i is most likely to be confused. For each candidate set, a neural net is then trained to distinguish patterns within the candidate set, but to reject all patterns that do not belong to the candidate set. During testing, based upon the output of the rule-based classifier, appropriate neural nets are invoked to confirm or reject the decision of the rule-based classifier.
A Framework for Object Identification and Refinement Process in Object-Oriented Analysis and Design
Authors: Romi S. Wahono, Behrouz H. Far
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

There are already many projects focusing on Computer Aided Software Engineering (CASE) tools for object-oriented analysis and design. However, at this moment, there are certain limitations to such solutions, such as, they are concentrated on object-oriented notation and forward/reverse engineering, and the methodology for object identification and refinementare not implemented well. This paper presents a methodology for object identification and refinement from the software requirements, which is based on object-based formal specification (OBFS). This methodology provides the mean of understanding the object-oriented paradigm easily, and supports us with identifying and refining the objects. As a case study for a comprehensive explanation about how to use this methodology, an example of software project for an air traffic control system is given.
A Transaction Transformation Approach to Active Rule Processing
Authors: Danilo Montesi, Riccardo Torlone
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Describes operational aspects of a novel approach to active rule processing based on a transaction transformation technique. A user-defined transaction, which is viewed as a sequence of atomic database updates forming a semantic unit, is translated by means of active rules into a new transaction that explicitly includes the additional updates due to active rule processing. It follows that the execution of the new transaction in a passive environment corresponds to the execution of the original transaction within the active environment defined by the given rules. Both immediate and deferred execution models are considered. The approach presents two main features. First, it relies on a well known formal basis that allow us to derive solid results on equivalence, confluence and optimization issues. Second, it is easy to implement as it does not require any specific run-time support.
The Impact of Memory Hierarchies on Cluster Computing
Authors: Xing Du, Xiaodong Zhang
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform for a given budget and for certain types of application workloads is mainly determined by its memory hierarchy and interconnection network of the cluster.Finding such a solution from exhaustive simulations would be highly time-consuming and expensive; and predictions from measurements on existing clusters would be impractical. We present an analytical model for evaluating performance impact of memory hierarchies and networks on cluster computing. The model covers the memory hierarchy of a single SMP, a cluster of workstations/PCs, or a cluster of SMPs by changing various modeling and architectural parameters. Network variations covering bus and switch networks are also included in the analysis. Applications of different types are characterized by parameterized workloads with different computation and communication requirements. The model has been validated by simulations.Our study shows that the length of memory hierarchy is the most sensitive factor to affect the execution time for many types of workloads. However, the interconnection network cost of a tightly coupled system with a short length of memory hierarchy, such as an SMP is significantly more expensive than a normal cluster network connecting independent computer nodes. Thus, the essential issue to be considered is the trade-off between the length of memory hierarchy and system cost. Based on analytical and case studies, we present our quantitative recommendations for building cost-effective clusters for different application workloads.
Function Point Measurement for Object-Oriented Requirements Specification
Authors: Shinji Kusumoto, Katsuro Inoue, Takashi Kasimoto, Ayane Suzuki, Katsuhiko Yuura, Michio Tsuda
Venue: 24th International Computer Software and Applications Conference (2000)

Function point analysis (FPA) was proposed to help measure the size of software system and has been widely used in the actual software development. However, it has been reported that since function point counting involves judgment on the part of the counter, some difference for the same product would be caused even in the same organization. This paper describes an actual experience of applying FPA to requirements specification at Hitachi Ltd. Here, we propose detailed FPA measurement method for the requirements specification analyzed using the requirements analysis system REQUARIO developed in Hitachi Ltd., and develop a measurement tool based on the method. We have also applied the tool to the actual requirements specification and shown the applicability of the tool.
Order Preserving Compression
Authors: Gennady Antoshenkov, David B. Lomet, James Murray
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Order-preserving compression can improve sorting and searching performance, and hence the performance of database systems. We describe a new parsing (tokenization) technique that can be applied to variable-length "keys", producing substantial compression. It can both compress and decompress data, permitting variable lengths for dictionary entries and compressed forms. The key notion is to partition the space of strings into ranges, encoding the common prefix of each range. We illustrate our method with padding character compression for multi-field keys, demonstrating the dramatic gains possible. A specific version of the method has been implemented in Digital's Rdb relational database system to enable effective multi-field compression.
Singapore NII: Building the Electronic Universe
Authors: Michael Yap
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

The National Information Infrastructure (NII) is an infrastructure consisting of efficient transport, information processing and service facilities that combine both computer and communication technologies. The needs of business and the public in general drive the definition of the infrastructure. Its goal is to increase the well-being of people as a whole. To deliver the promise of a more effective way to do business, the NII must strive to bring as many of these services or their equivalent to the end-users. Further, these services must be easily accessible and easy to use in addition to being affordable. The NII attempts to (re)engineer the real-world capabilities over the physical telecommunication network. In addition, the NII provides for a rich set of common computing services and supports the reuse of large components, over and above providing a physical telecommunication network.