ppxscal/embedding_network huggingface dataset:
Segmentation of Stick Text Based on Sub Connected Area Analysis
Authors: Gao Jingbo, Li Xinyou, Zesheng Tang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A new stick text segmentation method based on the sub connected area analysis is introduced in this paper. The foundation of this method is the sub connected area representation of text image that can represent all connected areas in an image efficiently. This method consists mainly four steps: sub connected area classification, finding initial boundary following point, finding optimal segmentation point by boundary tracing, text segmentation. This method is similar to boundary analysis method but is efficient than boundary analysis.
Precise Call Graph Construction for OO Programs in the Presence of Virtual Functions
Authors: Deepankar Bairagi, Dharma P. Agrawal, Sandeep Kumar
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Several intra- and inter-procedural program analysis techniques form the backbone of an optimizing and parallelizing compiler. The efficacy of these analyses depends upon how precise the call graph is. However, due to lack of exact type information for objects in an object-oriented (OO) program, the existing call graph construction algorithms are rendered imprecise. In this paper, we present an algorithm for constructing a more precise call graph by exploiting the static class hierarchy of an OO program. The information collected during the class hierarchy analysis helps in avoiding unnecessary addition of many spurious call graph edges for virtual-function calls. We have implemented our algorithm for handling C++ programs within a restructuring tool, Sage++. With our precise algorithm for call graph construction, the percentage reduction in the number of nodes and edges in the call graphs for the benchmark programs we had selected, ranged between 4% to 56% and between 22% to 58%, respectively.
English as a Formal Specification Language
Authors: Rolf Schwitter
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

PENG is a computer-processable controlled natural language designed for writing unambiguous and precise specifications. PENG covers a strict subset of standard English and is precisely defined by a controlled grammar and a controlled lexicon. In contrast to other controlled languages, the author does not need to know the grammatical restrictions explicitly. ECOLE, a look-ahead text editor, indicates the restrictions while the specification is written. The controlled lexicon contains domain-specific content words that can be defined by the author on the fly and predefined function words. Specifications written in PENG can be deterministically translated into discourse representations structures to cope with anaphora and presuppositions and also into first-order predicate logic. To test the formal properties of PENG, we reformulated Schubert's steamroller puzzle in PENG, translated the resulting specification via discourse representation structures into first-order predicate logic with equality, and proved the steamroller's conclusion with OTTER, a standard theorem prover.
Efficient Backtracking in And-Parallel Implementations of Non-deterministic Languages
Authors: Enrico Pontelli, Gopal Gupta
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

We consider the problem of efficiently supporting backtracking in independent and-parallel non-deterministic systems. We consider this problem in the context of logic programming, although the solution proposed is sufficiently general to be applicable to any non-deterministic language or system. Our model employs various optimizations, as well as a novel memory organization scheme in which processors are allowed to traverse each others' stacks to achieve this efficiency. The solution developed has been implemented in the ACE Prolog system. The performance of the system is analyzed on a variety of non-deterministic benchmarks.
Modeling the Communication Performance of the IBM SP2
Authors: Gheith A. Abandah, Edward S. Davidson
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

The objective of this paper is to develop models that characterize the communication performance of a message-passing multicomputer by taking the IBM SP2 as a case study. The paper evaluates and models the three aspects of the communication performance: scheduling overhead, message-passing time, and synchronization overhead. Performance models are developed for the basic communication patterns, enabling the estimation of the communication times of a message-passing application. Such estimates facilitate activities such as application tuning, selection of the best available implementation technique, and performance comparisons among different multicomputers.
A Generic Approach of Static Analysis for Detecting Runtime Errors in Java Programs
Authors: Xiaoping Jia, Sotiris Skevoulis
Venue: 23rd International Computer Software and Applications Conference (1999)

This paper presents a generic approach to statically analyze Java programs in order to detect potential errors (bugs). We discuss a framework that supports our approach and carries out the static analysis of Java code automatically. Our approach can detect potential bugs and report them before the program is executed.For a Java class, invariants related to the category of error under examination are automatically generated and used to assess the validity of variable usage in the implementation of this class. Our approach is distinctive in its emphasis to provide a practical generic mechanism for error detection that is capable of addressing error detection for a variety of error categories via a web of specialized components. A research prototype has been developed that demonstrates the feasibility and effectiveness of our approach.
A Control Theory Approach for Real-Time Animation of Artificial Agents
Authors: Fernando Wagner da Silva, Luiz-Marcos Garcia, Ricardo C. Farias, Antonio A. F. Oliveira
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

We propose basic mechanisms in support to autonomous, artificial animated agents. We use an approach based on robotics control theory, dealing with physics constraints and dynamics and kinematics issues, providing a well structured way to control the agent resources. We validate the mechanisms by presenting three computer animated platforms with different structures (sensors, actuators, and dynamics) which have used them. As a practical result, our animated agents are able to perform different tasks on the top of the same control structure.
Selectivity Estimation in the Presence of Alphanumeric Correlations
Authors: Min Wang, Jeffrey Scott Vitter, Balakrishna R. Iyer
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we need to estimate the fraction of records in the database that satisfy P. Almost all previous work dealt with the estimation of numeric selectivity, i.e., the query contains only numeric variables. The general problem of estimating alphanumeric selectivity is much more difficult and has attracted attention only very recently, and the focus has been on the special case when only one column is involved. In this paper, we consider the more general case when there are two correlated alphanumeric columns. We develop efficient algorithms to build storage structures that can fit in a database catalog. Results from our extensive experiments to test our algorithms, on the basis of error analysis and space requirements, are given to guide DBMS implementors.
Memory Management for Scalable Web Data Servers
Authors: Shivakumar Venkataraman, Miron Livny, Jeffrey F. Naughton
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Popular web sites are already experiencing very heavy loads, and these loads will only increase as the number of users accessing them grows. These loads create both CPU and I/O bottlenecks. One promising solution already being employed to eliminate the CPU bottleneck is to replace a single processor server with a cluster of servers. Our goal in this paper is to develop buffer management algorithms that exploit the aggregate memory capacity of the machines in such a server cluster to attack the I/O bottleneck. The key challenge in designing such buffer management algorithms turns out to be controlling data replication so as to achieve a good balance between intra-cluster network traffic and disk I/O. At one extreme, the straightforward application of client-server memory management techniques to this cluster architecture causes duplication in memory among the servers and this tends to reduce network traffic but increases disk I/O, whereas at the other extreme, eliminating all duplicates tends to increase network traffic while reducing disk I/O. Accordingly, we present a new algorithm, Hybrid, that dynamically controls the amount of duplication. Through a detailed simulation, we show that on workloads characteristic of those experienced by Web servers, the Hybrid algorithm correctly trades off intra-cluster network traffic and disk I/O to minimize average response time.
Tools to Enable Interoperation of Heterogeneous Databases
Authors: Wernher Behrendt, N. J. Fiddian, Ajith P. Madurapperuma
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

We demonstrate a prototype toolkit called ITSE (Integrated Translation Support Environment), for interoperation and migration of heterogeneous database systems. The main objective of ITSE is to enable transparency in heterogeneous database environments. Therefore, tools have been developed to support flexible configuration of databases and the wrapping or migrating of legacy systems in intranets. The tools themselves are aimed at MDBMS administrators and MIS analysts. These users can tailor the toolkit's operation so that end users are shielded from the underlying heterogeneity of their information system.
A Parallel Algorithm for Weighted Distance Transforms
Authors: Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n * n binary image. We show that the algorithm runs in O(log n) time using n^2 / log n processors on the EREW PRAM and in O(log log n) time using n^2 / log log n processors on the common CRCW PRAM. We also show that the algorithm runs in O(n^2/p^2 + n) time on a p \times p mesh and in O(n^2/p^2 + (n log p) / p) time on a p^2 processor hypercube (for 1
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Authors: Michael Alekhnovich
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We generalize classical Knuth-Schiinhage algorithm computing GCD of two polynomials for solving arbitrary linear Diophantine systems over polynomials in time, quasi-linear in the maximal degree. As an application, we consider the following weighted curve fitting problem: given a set of points in the plain, find an algebraic curve (satisfying certain degree conditions) that goes through each point the prescribed number of times. The main motivation for this problem comes from the coding theory, namely it is ultimately related to the list decoding of Reed-Solomon codes.We present a new fast algorithm for the weighted curve fitting problem, based on the explicit construction of Groebner basis. This gives another fast algorithm for soft-decoding of Reed-Solomon codes different from the procedure proposed by Feng, which works in time (\frac{w}{r})^{0(1)} n\log ^2 n\log \log n, where r is the rate of the code, and w is the maximal weight assigned to a vertical line.
Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints
Authors: Sherri K. Harms, Jitender S. Deogun, Jamil Saquer, Tsegaye Tadesse
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Discovering association rules from time-series data is an important data mining problem. The number of potential rules grows quickly as the number of items in the antecedent grows. It is therefore difficult for an expert to analyze the rules and identify the useful. An approach for generating representative association rules for transactions that uses only a subset of the set of frequent itemsets called frequent closed itemsets was presented in [6 ]. We employ formalconcept analysis to develop the notion of frequent closed episodes. The concept of representative association rules is formalized in the context of event sequences. Applying constraints to target highly significant rules further reduces the number of rules. Our approach results in a significant reduction of the number of rules generated, while maintaining the minimum set of relevant association rules and retaining the ability to generate the entire set of association rules with respect to the given constraints. We show how our method can be used to discover associations in a drought risk management decision support system and use multiple climatology datasets related to automated weather stations1
Combining Multiple Non-Homogeneous Classifiers: An Empirical Approach
Authors: J. R. Parker
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

The use of prior behavior of a classifier, as measured by the confusion matrix, can yield useful information for merging multiple classifiers. In particular, a ranking of possible classes can be produced which can allow Borda type reconciliation methods to be applied. A simulation of multiple classifiers is used to evaluate this idea, and compare with three other classifier combination techniques. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Implementations of a Feature-Based Visual Tracking Algorithm on Two MIMD Machines Mark Bernd
Authors: Mark Bernd Kulaczewski, Howard Jay Siegel
Venue: Proceedings of the international Conference on Parallel Processing (1997)

As an example of a task that processes complex visual information to generate control signals for a system, an existing feature-based visual tracking algorithm for a static camera was mapped onto two parallel machines representing the MIMD execution model. The algorithm is described and a version suitable for mapping onto parallel machines is developed. Timing results for the implementation on the Intel Paragon and the IBM SP2 are presented, using real image data for all experiments. For each subtask of the algorithm, its performance is measured as a function of data layout. In addition, the impact of the time required to distribute image data across processing elements on the performance is considered. For the subtask of finding the best match of a feature in an image, load balancing approaches dependent on machine characteristics and submachine size are discussed. This type of matching is used in many vision tasks.
Dynamic Multi-Agent Dispatching Control for Flexible Manufacturing Systems
Authors: Yuki Indrayadi, Hadeli, Paul Valckenaers, Hendrik Van Brussel
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper presents a design of a dispatching control system for flexible manufacturing systems with dynamic order arrival. The design is a multi-agent implementation of the Holonic Manufacturing System architecture PROSA [1]. The dispatching control system combines twomain subsystems: a routing dispatcher and a resource dispatcher. The routing dispatcher offers routing flexibility by utilising the subnet capability concept together with ant-based route exploration, while the resource dispatcher brings the operation flexibility offered by the resources. Combination of the routing dispatcher and the resource dispatcher offers more flexibility to control the internal logistics of manufacturing systems. Furthermore, the control isdesigned to accommodate the earliness/tardiness cost optimisation objective.
A multiseed counter TPG with performance guarantee
Authors: Dimitrios Kagaris, Spyros Tragoudas
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Several mechanisms based on ROMs, LFSRs, counters, cellular automata, have been proposed as built-in test pattern generators with trade-offs between hardware and time overhead. This paper presents and analyses a scheme based on a counter with multiple seeds to generate a test set with low hardware overhead. A fast CAD tool determines the number of clock cycles required for the test set generation and this number is shown to be close to the best possible. A comparison to other existing approaches on the ISCAS'85 benchmarks shows that the proposed mechanism can offer a favorable hardware/time overhead for many circuits.
A New Heuristic to Discriminate between Transient and Intermittent Faults
Authors: Fabrizio Grandoni, Andrea Bondavalli, Silvano Chiaradonna
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Effective discrimination between transient and permanent faults is a very important practical problem in (dependable) system design. A count-and-threshold mechanism named alfa-count, designed to discriminate between transient faults and intermittent faults in computing systems, is presented in an enhanced embodiment. It retains enough simplicity to allow exhaustive analysability through simple models. It is shown that the introduction of two operating thresholds, instead of the single one present in the basic scheme already known, both improves the performance figures of the mechanism and eases the designer's task of tuning the internal parameters.
Interactive Visualization over the WWW
Authors: Alexandre Donizeti Alves, Maria Cristina Ferreira de Oliveira, Rosane Minghim, Luis Gustavo Nonato
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

The authors discuss several approaches for providing visualization solutions over the WWW, exploiting available technology for programming Web based applications. An implementation that supports interactive visualization of user data through a set of Java applets that interface with the Visualization Toolkit is presented, and its advantages and limitations are discussed. Such an implementation provides a general framework for providing high quality visualization resources on the WWW.
Compiler-Controlled Caching in Superword Register Files for Multimedia Extension Architectures
Authors: Jaewook Shin, Jacqueline Chame, Mary W. Hall
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

In this paper, we describe an algorithm and implementation of locality optimizations for architectures with instruction sets such as Intel's SSE and Motorola's AltiVec that support operations on superwords, i.e., aggregate objects consisting of several machine words. We treat the large superword register file as a compiler-controlled cache, thus avoiding unnecessary memory accesses by exploiting reuse in superword registers. This research is distinguished from previous work on exploiting reuse in scalar registers because it considers not only temporal but also spatial reuse. As compared to optimizations to exploit reuse in cache, the compiler must also manage replacement, and thus, explicitly name registers in the generated code. We describe an implementation of our approach integrated with a compiler that exploits superword-level parallelism (SLP). We present a set of results derived automatically on 4 multimedia kernels and 2 scientific benchmarks. Our results show speedups ranging from 1.3 to 2.8X on the 6 programs as compared to using SLP alone, and we eliminate the majority of memory accesses.
Mining Generalized Association Rules for Sequential and Path Data
Authors: Wolfgang Gaul, Lars Schmidt-Thieme
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

While association rules for set data se and describe relations between parts of set valued objects completely, association rules for sequential data are restricted by specific interpretations of the subsequence relation: contiguous subsequences describe localfeatures of a sequence valued object, noncontiguous subsequences its global features. We model both types of features with generalized subsequences that describe local deviations by wildcards, and present a new algorithm of Apriori type for mining all generalized subsequences with prescribed minim m support from a given database of sequences. Furthermore we show that the givenalgorithm automatically takes into account an eventually underlying graph structure, i.e., is applicable to path data also.
User-Centric Portals for Managed Learning Environments
Authors: Bin Ling, Colin Allison
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

There is a growing concern throughout Higher Education that the gap between what university central services traditionally provide and what academics currently need is widening. Members of both the administrative staff and the academic community (staff and students) are finding that the performance of routine tasks is becoming increasingly difficult due to the nature of their institution's information systems. These systems have evolved in an ad hoc basis and are usually comprised of multiple unconnected data repositories. Users are often prevented from carrying out work by inappropriate access control mechanisms and the lack of appropriate client software. There are broadly two approaches to addressing this problem. One is the "big bang", where all existing systems are replaced simultaneously with a new single centralised system. Before such an approach can be taken it is necessary to fully understand the dynamics of an institutions information systems, in order to specify the new, allencompassing system. This is a major task in itself. An alternative, more attractive, approach is to integrate existing systems using user-centric portals. This is the objective of the INSIDE project, which is piloting value-added services based on distributed information bases, inorder to further the development and delivery of a "joined up system" for an institution.
RBE: Rendering By Example
Authors: Ravi Krishnamurthy, Moshé M. Zloof
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Rendering is defined to be a customized presentation of data in such a way that allows users to subsequently interact with the presented data. Traditionally such a user interface would be a custom application written using conventional programming languages; in contrast we propose an application-independent, declarative (i.e., what-you-want) language that we call Rendering By Example, RBE, with the capability to specify a wide variety of renderings. RBE is a domain calculus language over user interface widgets. Most previous domain calculus database languages (e.g., QBE, LDL, Datalog) mainly addressed the data processing problem. The main contribution in developing RBE is to model semantics of user interactions in a declarative way. This declarative specification not only allows quick and ad-hoc specification of renderings (i.e., user interfaces) but also provides a framework to understand renderings as an abstract concept, independent of the application. Further, such a linguistic abstraction provides the basis for user-interface research. RBE is part of the ICBE language that is being prototyped in the Picture Programming project at HP Labs.