ppxscal/embedding_network huggingface dataset:
A Neural-Based Architecture for Spot-Noisy Logo Recognition
Authors: Francesca Cesarini, Enrico Francesconi, Marco Gori, Simone Marinai, J. Q. Sheng, Giovanni Soda
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Recently, much attention has been paid on the recognition of graphical objects, like company logos and trademarks. Recognizing these objects facilitates the recognition of document class. Some promising results have been achieved by using Autoassociator-based Artificial Neural Networks (AANN) also in the presence of homogeneously distributed noise. However, the performance drops significantly when dealing with spot-noisy logos, where strips or blobs produce a partial obstruction of the pictures.In this paper, we propose a new approach for training AANNs especially conceived for dealing with spot noises. The basic idea is that of introducing a new norm for assessing the reproduction error in AANNs. The proposed algorithm, which is referred to as Spot-Backpropagation (S-Bp), is significantly much more robust with respect to spot-noise than classical Euclidean norm-based Backpropagation (Bp). Our experimental results are based on a database of 88 real logos that are artificially corrupted by spot-noise.
Performance Range Comparison for Restructuring Compilation
Authors: Xian-He Sun, Mario Pantano, Thomas Fahringer
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

A major difficulty in restructuring compilation is how to compare parallel performance over a range of system and problem sizes. This study introduces the concept of range comparison for data-parallel programming. Unlike conventional execution time comparison in which performance is compared for a particular system and problem size, range comparison compares the performance of programs over a range of ensemble and problem sizes via scalability and performance crossing point analysis. An algorithm is developed to predict the crossing point automatically. The correctness of the algorithm is proved and a methodology is developed to integrate range comparison into restructuring compilations. A preliminary prototype of the methodology is implemented and tested under Vienna Fortran Compilation System. Experimental results demonstrate that range comparison is feasible and effective.
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
Authors: Martin Sköld, Tore Risch
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently monitor rules with complex conditions. The calculus is based on partial differencing of queries derived from rule conditions. For each rule condition, several partially differentiated queries are generated that each considers changes to a single base relation or view that the condition depends on. The calculus considers both insertions and deletions. The algorithm is optimized for deferred rule condition monitoring in transactions with few updates. The calculus allows us to optimize both space and time. Space optimization is achieved since the calculus and the algorithm does not presuppose materialization of monitored conditions to find its previous state. This is achieved by using a breadth-first, bottom-up propagation algorithm and by calculating previous states by doing a logical rollback. Time optimization is achieved through incremental evaluation techniques. The algorithm has been implemented and a performance study is presented at the end of the paper.
On Effective Conceptual Indexing and Similarity Search in Text Data
Authors: Charu C. Aggarwal, Philip S. Yu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Similarity search in text has proven to be an interesting problem from the qualitative perspective because of inherent redundancies and ambiguities in textual descriptions. The methods used in search engines in order to retrieve documents most similar to user-defined sets of keywords are not applicable to targets which are medium to large size documents, because of even greater noise effects stemming from the presence of a large number of words unrelated to the overall topic in the document. The inverted representation is the dominant method for indexing text, but it is not as suitable for document-to-document similarity search, as for short user-queries. One way of improving the quality of similarity search is Latent Semantic Indexing (LSI), which maps the documents from the original set of words to a concept space. U fortunately, LSI maps the data into a domain in which it is not possible to provide effectiveindexing techniques. In this paper, we investigate new ways of providing conceptual search among documents bycreating a representation in terms of conceptual word-chains. This technique also allows effective indexing techniques so that similarity queries ca be performed on large collectionsof documents by accessing a small amount of data. We demonstrate that our scheme outperforms standard textual similarity search o the inverted representation both in terms of quality a d search efficiency.
Preparations for Semantics-Based XML Mining
Authors: Jung-Won Lee, Kiho Lee, Won Kim
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

XML allows users to define elements using arbitrary words and organize them in a nested structure. These features of XML offer both challenges and opportunities in information retrieval, document management, and data mining. In this paper,we propose a new methodology for preparing XML documents for quantitative determination of similarity between XML documents by taking account of XML semantics (i.e.,meanings of the elements andnested structures of XML documents).Accurate quantitative determination of similarity between XML documents provides an important basis for a variety of applications of XML document mining and processing. Experiments with XML documents show that ourmethodology provides a 50-100%improvement in determining similarity, over the traditional vector-space model that considers only term-frequency and 100% accuracy in identifying the category of each document from an on-line bookstore.
System Modeling and Design using Genetic Programming
Authors: Henry Leung, Vinay Varadan
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

In this paper we describe nonlinear system modeling and design using genetic programming (GP). In order to demonstrate the ability of GP to design complex systems, we first present a novel scheme called Improved Least Squares Genetic Program (ILS-GP) that attempts toreconstruct the functional form of a nonlinear dynamical system from its noisy time series measurements. ILS-GP augments the structural search ability of GP with a novel parameter estimation scheme called Improved Least Squares designed specifically to eliminate bias inparameter estimates of the nonlinear dynamical system in the presence of measurement noise. We use different test chaotic systems and real-life radar sea scattered signals to demonstrate the effectiveness of the ILS-GP approach in reconstructing nonlinear systems. Having shown the ability of GP to reconstruct complex systems from their time series measurements, we apply GP to the reverse problem of constructing optimal systems for generating specific sequences called spreading codes in CDMA communications. Using different approaches includingcorrelation properties and the bit error rate, we use the proposed GP approach to design chaotic piece-wise maps that generate optimal spreading codes in complicated communication environments such as multi-path. Based on computer simulations, we have shown improved performance of the GP-generated maps when compared to the other approaches including the standard Gold code.
LT Codes
Authors: Michael Luby
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
Modeling Compiled Communication Costs in Multiplexed Optical Networks
Authors: Charles A. Salisbury, Rami G. Melhem
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Improvements in optical technology will enable the construction of high bandwidth, low latency switching networks. These networks have many applications in massively parallel processing. However current circuit switching and packet switching techniques are not quite suitable for controlling such networks. Time division multiplexing (TDM) schemes can improve the performance of circuit switched optical interconnection networks by taking advantage of the locality of references present in the communication patterns. In this paper, we construct a model for the cost of compiled communications in circuit switched networks. We show how the cost is affected by the characteristics of the network and by the application's communication locality of references. We show how a compiler can use this information to choose the most appropriate multiplexing degree.
Edugraph: Software to Teach Computer Graphics Concepts
Authors: André L. Battaiola, Nassim Chamel Elias, Rodrigo de Godoy Domingues
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Computational processing capacity allows the development of sophisticated interactive animation with different kinds of media resources. Computer games are examples of multimedia software with entertainment and high sophistication characteristics. Such technology allied with cognitive concepts can be used to implement educational software. This poster describes the implementation of a software to teach computer graphics concepts based on entertainment and cognitive criteria.
Dependence Analysis of Java Bytecode
Authors: Jianjun Zhao
Venue: 24th International Computer Software and Applications Conference (2000)

Understanding program dependencies in a computer program is essential for many software engineering tasks such as program understanding, testing, debugging, reverse engineering, and maintenance. In this paper, we present an approach to dependence analysis of Java bytecode, and discuss some applications of our technique, which include Java bytecode slicing, understanding, and testing.
Using RAIC for Dependable On-line Upgrading of Distributed Systems
Authors: Chang Liu, Debra J. Richardson
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The technology of redundant arrays of independent components (RAIC) uses groups of similar or identical distributed components to provide dependable services [9]. RAIC allows components in the redundant array to be added or removed dynamically during run-time.This position paper gives a brief overview of RAIC and discusses its special application for dependable on-line upgrading of distributed systems. A proof-of-concept example is given to illustrate how problems that occur during upgrading can be masked by RAIC and thus not affect smooth operations of the system-under-upgrade.
The Ode Active Database: Trigger Semantics and Implementation
Authors: Daniel F. Lieuwen, Narain H. Gehani, Robert M. Arlein
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Triggers are the basic ingredient of active databases. Ode triggers are event-action pairs. An event can be a composite event (i.e., an event composed from other events). Composite events are detected by translating the event specifications into finite state machines. In this paper, we describe the integration and implementation of composite event based triggers into the Ode object database. We focus on implementation details such as the basic trigger events supported, the efficient posting of these events, the handling of transaction-related events, and the integration of triggers into a real database. We also describe the run-time facilities used to support trigger processing and describe some experiences we gained while implementing triggers. We illustrate Ode trigger facilities with a credit card example.
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States
Authors: Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We prove a fundamental theorem about the relative entropy of quantum states, which roughly states that if the relative entropy, S(\rho \left\| \sigma\right.) \triangleqTr \rho (\log \rho- \log \sigma ), of two quantum states \rho and \sigma is at most c, then \frac{\rho }{{2^0 (c)}} sits inside' \sigma. Using this substate' theorem, we give tight lower bounds for the privacy loss of bounded error quantum communication protocols for the index function problem. We also use the substate' theorem to give tight lower bounds for the k-round bounded error quantum communication complexity of the pointer chasing problem, when the wrong player starts, and all the log n bits of the kth pointer are desired.
Integrating E-Commerce and Data Mining: Architecture and Challenges
Authors: Suhail Ansari, Ron Kohavi, Llew Mason, Zijian Zheng
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We show that the e-commerce domain can provide all the right ingredients for successful data mining. We describe an integrate architecture for supporting this integration. Thearchitecture can dramatically reduce the pre-processing, cleaning, and data understanding effort often documented to take 80%of the time in knowledge discovery projects. We emphasize the need for data collection at the application server layer (not the web server)in order to support logging of data and metadata that is essential to the discovery process. We describe the datatransformation bridges require from the transaction processing systems an customer event streams (e.g.,clickstreams) to the data warehouse. We detail the mining workbench, which needs to provide multiple views of the data through reporting, data mining algorithms, visualization, and OLAP. We conclude with a set of challenges.
Parallel algorithms for space-time adaptive processing
Authors: Serge J. Olszanskyj, James M. Lebak, Adam W. Bojanczyk
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We examine the signal processing problem of space-time adaptive processing (STAP) from a computational point of view. Specifically, we implement an STAP algorithm on the IBM PowerParallel SP1 computer. The two main challenges are solving multiple least squares problems simultaneously and finding an efficient way of implementing multiple computational steps that demand different optimal data distributions in parallel. The effectiveness of our implementation is demonstrated with experimental results.
New data-parallel language features for sparse matrix computations
Authors: Manuel Ujaldon, Emilio L. Zapata, Barbara M. Chapman, Hans P. Zima
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

High level data parallel languages such as Vienna Fortran and High Performance Fortran (HPF) have been introduced to allow the programming of massively parallel distributed memory machines at a relatively high level of abstraction, based on the single program multiple data (SPMD) paradigm. Their main features include mechanisms for expressing the distribution of data across the processors of a machine. The paper introduces additional language functionality to allow the efficient processing of sparse matrix codes. It introduces methods for the representation and distribution of sparse matrices, which forms a powerful mechanism for storing and manipulating sparse matrices able to be efficiently implemented on massively parallel machines.
Metric Rule Generation with Septic Shock Patient Data
Authors: Jürgen Paetz
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this contribution we present an application of metric rule generation in the domain of medical research. We consider intensive car unit patients developing a septic shockduring their stay at the hospital. To analyse the patient data, rule generation is embedded in a medical data mining cycle. For rule generation, we improve an architecture basedon a growing trapezoidal basis function network.
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
Authors: Jau-Der Shih
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. Based on the concept of unsafe nodes, we design a routing algorithm for hypercubes that can tolerate at least n-1 node faults and can route a message via a path of length no more than the Hamming distance between the source and destination plus four. We also develop a routing algorithm for meshes that can tolerate any block faults, as long as the distance between any two nodes in different faulty blocks is at least 2 in each dimension.
Efficient Processing of Nested Fuzzy SQL Queries
Authors: Qi Yang, Chengwen Liu, Jing Wu, Clement T. Yu, Son Dao, Hiroshi Nakajima
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Fuzzy databases have been introduced to deal with uncertain or incomplete information in many applications. The efficiency of processing fuzzy queries in fuzzy databases is a major concern. We provide techniques to unnest nested fuzzy queries of two blocks in fuzzy databases. We show both theoretically and experimentally that unnesting improves the performance of nested queries significantly. The results obtained in the paper form the basis for unnesting fuzzy queries of arbitrary blocks in fuzzy databases.
Simple and Secure Mobile Access under the Flexible Organization Management
Authors: Masahiro Mambo, Eiji Okamoto, Yasushi Sengoku, Takashi Tanaka
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In business we often encounter a situation where two organizations in alliance organize a temporal inter-organizational group to accomplish joint-work. Ideally arbitrary subgroups of these organizations should be able to form a new subgroup with low cost even though these organizations are often run with different subnetwork management policies. In this paper, we propose simple, effortless and transparent mobile communication suitable for the cooperative working environments with protection against the outside attacks. A distinguished property of our approach is that we can achieve our goal without changing the existent router networks. Unlike Mobile IP, our system is more suitable for flexible access control among subnetworks.
A Unified Modulo Scheduling and Register Allocation Technique for Clustered Processors
Authors: Josep M. Codina, Jesús Sánchez, Antonio González
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: This work presents a modulo scheduling framework for clustered ILP processors that integrates the cluster assignment, instruction scheduling and register allocation steps in a single phase. This unified approach is more effective than traditional approaches based on sequentially performing some (or all) of the three steps, since it allows optimizing the global code generation problem instead of searching for optimal solutions to each individual step. Besides, it avoids the iterative nature of traditional approaches, which require repeated applications of the three steps until a valid solution is found. The proposed framework includes a mechanism to insert spill code on-the-fly and heuristics to evaluate the quality of partial schedules considering simultaneously inter-cluster communications, memory pressure and register pressure. Transformations that allow trading pressure on a type of resource for another resource are also included. We show that the proposed technique outperforms previously proposed techniques. For instance, the average speed-up for the SPECfp95 is 36% for a 4-cluster configuration.
Internet Emulation for Java Applications through Socket Factories
Authors: Marco Avvenuti, Alessio Vecchio
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Network emulation provides the capability of evaluating distributed applications on a stand-alone system: Applications can be exposed to adverse and repeatable network conditions without requiring complex testbeds. This paper describes the design and implementation of a portable and object-oriented network emulator targeted to the development and test of Java-based Internet applications. The emulator is based on instrumented sockets, say EmuSockets, able to emulate the behavior of links with a given bandwidth and communication delay. The emulator is organized modularly, so that it is possible to plug-in user-defined classes for bandwidth and delay figures generation. Carrying out experiments with EmuSockets is as simple as running the tested application code on a single host.
ELKAR: A Component Based Re-engineering Methodology to Provide Cooperation
Authors: Philippe Roose
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

There is an increasing demand from firms to evolve their applications to be more co-operative. The problem is to realise this migration and to maintain the quality of existing applications which are reliable due to previously encountered difficulties. We will propose a method based on an organisation of dynamic workgroups (their composition can evolve with time) composed of components. Thus method is entirely derivable (after a formal verification) into rules integrated into a cooperative architecture allowing the cooperation. In order to propose an operational method, the last stage will propose to obtain rules derived from a specification language associated to the method. Our approach allows the provision of cooperation thanks to the application re-engineering without modifying any existing component.
Software Process Disturbances
Authors: Tsang-Ming Jiang, Michael Coyner
Venue: 24th International Computer Software and Applications Conference (2000)

Developing reliable and high quality software on time and within budget requires a well-coordinated and executed software process. Many data have shown that investments in software process improvement can actually pay off. However, external market and customer demands create disturbances in the software process. Software process disturbances reduce the effectiveness of the software process improvement and increase the cost and time of the software development. Exemplary solutions to software process disturbances are early product characterization, confirmed customer expectation, calibrated product roadmap, and establishing process accountability.