ppxscal/embedding_network huggingface dataset:
Automatic Knowledge Acquisition for Spatial Document Interpretation
Authors: Hanno Walischewski
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper, a qualitative representation for the layout of structured documents as well as classes of documents is presented, which is established by the means of supervised learning from a labeled training set of documents. For this formal representation, an inference algorithm has been developed, adopted from error tolerant subgraph isomorphism, which assigns logic labels to layout objects of a test document.
Form--Based Localization of the Destination Address Block on Complex Envelopes
Authors: Matthias Wolf, Heinrich Niemann
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Address block localization on mail pieces is an important task in postal automation. Unlike personal letters, business letters or postcards which have a high degree of global spatial structure among a limited number of entities, mail pieces of magazines and advertising do not have a prefered position of the address block which can be pasted in an arbitrary position and orientation. Items packaged in clear plastic, allowing the underlying print to show through, may cause further problems, as well as graphics, pictures and other printed text on such covers which also make the address block localization more complicated. In this paper, we present an approach for automatically locating the address block on covers of magazines, advertising letters and newspapers based on the recognition of the structure of a German address. First, we use a thresholding technique to decompose the image into smaller blocks. Then, these blocks are classified into characters and large characters. Afterwards blocks are searched which might be a corner of an address block. Starting from these blocks adjacent blocks are combined to connected regions line by line. These regions are candidates for an address block and are assessed in the last step. Heuristic rules and typical features are used to identify the correct destination address block among these candidates. Experimental results using images of different magazines, newspapers and advertising letters are given. Performance and speed are also indicated.
Notes on Application-Orientated Access Control
Authors: Adrian Spalka, Hanno Langweg
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The protection qualities of discretionary access control systems realised by today's prevalent operating systems are based on an assessment of the trustworthiness of users. By starting a program a user transfers his trustworthiness to it, ie, there is the tacit assumption that the program's trustworthiness at least matches that of the user. However, malicious programs are a growing source of threat. They perform operations without the user's consent and often incontravention of his interests. To eliminate this danger we examine program-orientated protection strategies. We then present, firstly, a small enhancement to the operating system and, secondly, an addition to the operating system, which support both a user and an application with high security demands in the enforcement of authenticity and integrity even in the presence of malicious programs.
Planning Computer Modeled Animation: Towards an Animation Machine
Authors: Adailton José Alves Da Cruz, Alberto Barbosa Raposo, Léo Pini Magalhães
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

In this work the architecture of an animation machine is proposed. Its main goals are the definition of the animation in a more abstract level and the simulation of the characters' behaviors to detect undesired situations.
Decision Logics for Knowledge Representation in Data Mining
Authors: Tuan-Fang Fan, Wu-Chih Hu, Churn-Jung Liau
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

In this paper, the qualitative and quantitative semantics for rules in data tables are investigated from a logical viewpoint. In modern data analysis, knowledge can be discovered from data tables and is usually represented by some rules. However, the knowledge is useful for a human user only when he can understand the meaning of the rules. This is called the interpretability problem of intelligent data analysis. The solution of the problem depends on the selection of the rule representation language. A good representation language should have clear semantics so that a rule can be effectively validated with respect to the given data tables. In this regard, logic is one of the best choices. Starting from reviewing the decision logic for data tables, we subsequently generalize it to fuzzy and possibilistic decision logics. The rules are then viewed as the implications between well-formed formulas of these logics and their semantics with respect to precise or uncertain data tables are presented. The validity, support, and confidence of a rule are also rigorously defined in the framework.
Software Techniques for Improving MPP Bulk-Transfer Performance
Authors: Eric A. Brewer, Paul Gauthier, Armando Fox, Angela Schuett
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Brewer & Kuszmaul (1994) demonstrated how barriers and traffic interleaving can alleviate the problem of bulk-transfer performance degradation on the Thinking Machines CM-5 massively parallel processor (MPP) by exploiting the observation that one-on-one communication avoids network congestion. We apply and extend these techniques on the Intel Paragon and MIT Alewife machines. Because these machines lack the CM-5's fast hardware support for barriers, we introduce a token-passing scheme that avoids barriers while maintaining one-on-one communication. We also introduce a new algorithm-distributed dynamic scheduling-that brings Brewer & Kuszmaul's observations to bear on irregular traffic patterns by massaging traffic into a sequence of near-permutations at runtime, without requiring any preprocessing or global state. The measured performance of our algorithm exceeds that of traffic interleaving (the most effective technique proposed by Brewer & Kuszmaul) on all three platforms, and is comparable to the performance of static scheduling, which requires preprocessing and global state.
DMASC: A Tool for Visualizing User Paths through a Web Site
Authors: Catherine Stones, Stephen Sobol
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In an e-learning environment it is crucial that accurate web usage data can be collected and analysed to ensure that on-line learning material is optimally structured and designed. In this paper we investigate the relationship between cached and non-cached web log files as weidentify and analyse user paths through an e-learning web site. We outline the development of a web data mining and data visualization tool DMASC (Direction Mapping and Sequence Chart). We also demonstrate, using a set of test data, how our mining and mapping methods can be used to reveal otherwise unseen web design flaws.
The Characterization of Data-Accumulating Algorithms
Authors: Stefan D. Bruda, Selim G. Akl
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data have been processed before another datum arrives. In this paper, the class of d-algorithms is characterized. It is shown that this class is identical to the class of on-line algorithms. The parallel implementation of d-algorithms is then investigated. It is found that, in general, the speedup achieved through parallelism can be made arbitrarily large for almost any such algorithm. On the other hand, we prove that for d-algorithms whose static counterparts manifest only unitary speedup, no improvement is possible through parallel implementation.
Active Customization of GIS User Interfaces
Authors: Juliano Lopes de Oliveira, Claudia Bauzer Medeiros, Mariano Cilia
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

This paper presents a new approach to user interface customization in Geographic Information Systems (GIS). This approach is based on the integration of three main components: a GIS user interface architecture; an active database mechanism; and a generic interface builder. The GIS interface architecture provides the default interface behavior, while the active system allows customization of interfaces according to the specific context. The generic interface builder relies on a library of interface objects to dynamically construct generic and customized interfaces. The main advantage of this approach is that it decreases the costs associated with developing customized \gis\ interfaces.
Using Artificial Anomalies to Detect Unknown and Known Network Intrusions
Authors: Wei Fan, Matthew Miller, Salvatore J. Stolfo, Wenke Lee, Philip K. Chan
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Intrusion detection systems (IDSs) must be capable of detecting new and unknown attacks, or anomalies. We study the problem of building detection models for both pure anomaly detection and combined misuse and anomaly detection (i.e., detection of both known and unknown intrusions). We propose an algorithm to generate artificial anomalies to coerce the inductive learner into discovering an accurate boundary between known classes (normal connections and known intrusions) and anomalies.Empirical studies show that our pure anomaly detection model trained using nor al and artificial anomalies is capable of detecting ore than 77%of all unknown intrusion classes with more than 50%accuracy per intrusion class. The combined misuse and anomaly detection models are as accurate as a pure misuse detection model in detecting known intrusions and are capable of detecting at least 50%of unknown intrusion classes with accuracy measurements between 75% and 100%per class.
Similarity Indexing with the SS-tree
Authors: David A. White, Ramesh Jain
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Efficient indexing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this paper, we define this problem as "similarity indexing" and describe the fundamental types of "similarity queries" that we believe should be supported. We also propose a new dynamic structure for similarity indexing called the similarity search tree or SS-tree. In nearly every test we performed on high dimensional data, we found that this structure performed better than the R*-tree. Our tests also show that the SS-tree is much better suited for approximate queries than the R*-tree.
Filtering Sparse Data with 3D Tensorial Structuring Elements
Authors: Marcelo B. Vieira, Matthieu Cord, Paulo P. Martins,  Jr., Arnaldo De Albuquerque Araújo, Sylvie Philipp-Foliguet
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We address in this paper the problem of filtering three-dimensional sparse data representing real objects. The main application is to eliminate points that are not structured on surfaces. Points classified as organized can be the input for other processes. An accumulation process infers the organization of each input element. The tensorial fields used in our method act as three-dimensional structuring elements. They define normal orientations in space indicating possible surface continuations.
Towards a Philosophy of M-Learning
Authors: Kristóf Nyíri
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

On the Internet e-mail is the most popular application, and mobile devices, too, are used mainly for purposes of person-to-person communication. These observations confirm the view, long entertained in philosophy, that to communicate is an anthropological necessity. Startingfrom an analysis of the ubiquitous nature of communication the paper refers to the intimate connection between communication and education, and proceeds to examine the historical origins of the separation between school and society; recalls that childhood itself is sociallyconstructed; and points to the advantages of a learning environment containing not just texts but also pictures. In such an environment person-to-person mobile communication by itself becomes learning. Communication is the source from which m-learning emerges.
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
Authors: Ragavan Manian, Joanne Bechta Dugan, David Coppit, Kevin J. Sullivan
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Fault trees provide a conceptually simple modeling framework to represent system-level reliability in terms of interactions between component reliabilities. DIFtree effectively combines the best static fault tree solution technique (Binary Decision Diagrams) with Markov solution techniques for dynamic fault trees. DIFtree includes advanced techniques for modeling coverage; coverage modeling has been shown to be critical to the analysis of fault-tolerant computer systems. DIFtree is based on a divide-and-conquer technique for modularizing the system-level fault tree into independent subtrees; different solution techniques can be used for subtrees. In this paper we extend the DIFtree analysis capability to model several different distributions of time to failure, including fixed probabilities (no time component), exponential (constant hazard rate), Weibull (time varying hazard rate) and log normal. Our approach extends both the BDD and Markov analytical approaches and incorporates simulation as well.
A Clustering Method for Very Large Mixed Data Sets
Authors: Guillermo Sánchez-Díaz, José Ruiz-Shulcloper
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In the developed countries, especially over the last decade, there has been an explosive growth in the capability to generate, collect and use very large data sets. The objects of these data sets could be simultaneously described by quantitative and qualitative attributes. At present, algorithms able to process either very large data sets (in metric spaces) or mixed(qualitative and quantitative) incomplete data (missing value) sets have been developed, but not for very large mixed incomplete data sets. In this paper we introduce a new clustering method named GLC+to process very large mixed incomplete data sets in order to obtain apartition in connected sets.
On Incremental Cache Coherency Schemes in Mobile Computing Environments
Authors: J. Cai, Kian-Lee Tan, Beng Chin Ooi
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Re-examines the cache coherency problem in a mobile computing environment in the context of relational operations (i.e. selection, projection and join). We propose a taxonomy of cache coherency schemes, and as case studies, we pick several schemes for further study. These schemes are novel in several ways. First, they are incremental. Second, they are an integration of (and built on) techniques in view maintenance in centralized systems and cache invalidation in client-server computing environments. We conducted extensive studies based on a simulation model. Our study shows the effectiveness of these algorithms in reducing uplink transmission and average access times. Moreover, the class of algorithms that exploit collaboration between the client and server performs best in most cases. We also study extended versions of this class of algorithms to further cut down on the work performed by the server.
EPNR: an energy-efficient automated layout synthesis package
Authors: G. Holt, A. Tyagi
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper reports our experiences with incorporating energy (or switched capacitance) based algorithms into an automated layout synthesis system based on standard cells. Our experimental results show an average savings of 18.5% in interconnect energy at a cost of about 6.2% area increase relative to area-minimized layouts on MCNC Logic Synthesis '93 benchmarks. The basic premise is that the wires with high switching should be made short even if it involves stretching several low switching wires. We modified an existing layout system, VPNR, to include these techniques during the placement and global routing phases. Attempts to include switching probabilities into channel routing did not produce appreciable results. Our experiments also lend insight into the composition of the solution space for VLSI energy minimization problems.
Study of Scalable Declustering Algorithms for Parallel Grid Files
Authors: Bongki Moon, Anurag Acharya, Joel H. Saltz
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Efficient storage and retrieval of large multidimensional datasets is an important concern for large-scale scientific computations such as long-running time-dependent simulations which periodically generate snapshots of the state. The main challenge for efficiently handling such datasets is to minimize response time for multidimensional range queries. The grid file is one of the well known access methods for multidimensional and spatial data. We investigate effective and scalable declustering techniques for grid files with the primary goal of minimizing response time and the secondary goal of maximizing the fairness of data distribution. The main contributions of this paper are (1) analytic and experimental evaluation of existing index-based declustering techniques and their extensions for grid files, and (2) development of a proximity-based declustering algorithm called minimax which is experimentally shown to scale and to consistently achieve better response time compared to available algorithms while maintaining perfect disk distribution.
Parallel Solutions of Indexed Recurrence Equations
Authors: Gadi Haber, Yosi Ben-Asher
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

A new type of recurrence equations called "indexed recurrences" (IR) is defined, in which the common notion of X[i] = op(X[i],X[i-1]) i=1..n is generalized to X[g(i)] = op(X[f(i)],X[h(i)]) f,g,h:{1..n} -> {1..m}. This enables us to model sequential loops of the form for i = 1 to n do begin X[g(i)] := op(X[f(i)],X[h(i)]); as IR equations.Thus, a parallel algorithm that solves a set of IR equations is in fact a way to transform sequential loops into parallel ones. Note that the circuit evaluation problem (CVP) can also be expressed as a set of IR equations. Therefore an efficient parallel solution to the general IR problem is not likely to be found, as such solution would also solve the CVP, showing that P is a subset of, or equal NC.In this paper we introduce parallel algorithms for two variants of the IR equations problem: 1. An O(log n) greedy algorithm for solving IR equations where g(i) is distinct and h(i) = g(i) using O(n) processors.2. An O(log^2 n) algorithm with no restriction on f,g or h, using up to O(n^2) processors.However, we show that for general IR, 'op' must be commutative so that a parallel computation can be used.
Quantifying Complexity and Performance Gains of Distributed Caching in a Wireless Mobile Computing Environment
Authors: Cedric C. F. Fong, John C. S. Lui, Man Hon Wong
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

In a mobile computing system, the wireless communication bandwidth is a scarce resource that needs to be managed carefully. In this paper, we investigate the use of distributed caching as an approach to reduce the wireless bandwidth consumption for data access. We find that conventional caching techniques cannot fully utilize the dissemination feature of the wireless channel. We thus propose a novel distributed caching protocol that can minimize the overall system bandwidth consumption at the cost of CPU processing time at the server side. This protocol allows the server to select data items into a broadcast set, based on a performance gain parameter called the bandwidth gain, and then send the broadcast set to all the mobile computers within the server's cell. We show that in general, this selection process is NP-hard, and therefore we propose a heuristic algorithm that can attain a near-optimal performance. We also propose an analytical model for the protocol and derive closed-form performance measures, such as the bandwidth utilization and the expected response time of data access by mobile computers. Experiments show that our distributed caching protocol can greatly reduce the bandwidth consumption so that the wireless network environment can accommodate more users and, at the same time, vastly improve the expected response time for data access by mobile computers.
Efficient implementation strategies for the DRB approach in fault-tolerant hypercubes
Authors: Trevor Williams, Jack Tan, Chungti Liang
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The distributed recovery block (DRB) is an efficient approach for the uniform treatment of hardware and software faults in real-time applications. Full DRB mapping assigns each task of an application tasks graph to run on a pair of processor nodes. The primary cost factors that determine its efficiency are dilation bound, expansion factor and congestion. In this paper, two alternative schemes are described that improves the DRB approach. The first describes a mapping of application tasks such that each node in the hypercube executes one or more application tasks in the lifetime of a task graph. The second scheme incorporates spare processors to provide an efficient architecture for implementing the DRB approach.
Hindsight Helps: Deterministic Task Scheduling with Backtracking
Authors: Yueh-O Wang, Nancy M. Amato, Donald K. Friesen
Venue: Proceedings of the international Conference on Parallel Processing (1997)

This paper considers the problem of scheduling a set of precedence-related tasks on a nonpreemptive homogeneous message-passing multiprocessor system in order to minimize the makespan, that is, the completion time of the last task relative to start time of the first task. We propose a family of scheduling algorithms, called IPR for immediate predecessor rescheduling, which utilize one level of backtracking. We also develop a unifying framework to facilitate the comparison between our results and the various models and algorithms that have been previously studied. We show, both theoretically and experimentally, that the IPR algorithms outperform previous algorithms in terms of both time complexity and the makespans of the resulting schedules. Moreover, our simulation results indicate that the relative advantage of the IPR algorithms increases as the communication constraint is relaxed.
Parallel Monte Carlo simulation of MBE growth
Authors: Isabel Beichl, Y. Ansel Teng, James L. Blue
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We present a parallel algorithm for Monte Carlo simulation of molecular beam epitaxial growth (MBE) focusing on the software we have developed and the experiences gained. An efficient sequential method to do MBE simulation was developed that uses a single binary tree to store the rates of occurrence of all possible events at a given time. The challenge was to find a way to adapt this method to a parallel machine.