ppxscal/embedding_network huggingface dataset:
Generalized Contextual Recognition of Hand-Printed Documents Using Semantic Trees with Lazy Evaluation
Authors: L. Du, Andy C. Downton, Simon M. Lucas, Badr Al-Badr
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes a new general-purpose contextual architecture which provides a unified framework for efficiently combining all types and levels of context in hand-print recognition applications. The architecture has been designed and built as a C++ class library, and utilised within an initial demonstrator which implements full contextual constraints for a combination of postcode and corresponding postal address. Preliminary evaluation of the demonstrator suggests the system has the potential to achieve genuinely remarkable performance compared with previous context systems: its memory requirements are an order of magnitude less than an equivalent trie-based dictionary; its search speed is at least an order of magnitude faster than the trie, and actually get faster as the dictionary size increases; and its error rate is virtually zero if suitable contextual constraints can be applied. Using this architecture, it appears to be possible to build real-time solutions to large-scale heterogeneous contextual problems.
Speculative Alias Analysis for Executable Code
Authors: Manel Fernández, Roger Espasa
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Optimizations performed at link time or directly applied to final program executables have received increased attention in recent years. Such low-level optimizations can benefit greatly from pointer alias information. However, as almost all existing alias analyses are formulated in terms of source language constructs, they turn out to be of limited utility at the machine code level.This paper describes two different approaches to high-quality, low-cost, speculative may-alias analysis, to be applied in the context of link-time or executable code optimizers. The key idea behind our proposals is the introduction of unsafe speculations at analysis-time, which increases alias precision on important portions of code, and keeps the analysis reasonably cost-efficient. Experimental results indicate that introducing speculation at analysis-time is clearly beneficial: precision increases up to 83% in average, against a baseline precision of 16%. Furthermore, the percentage of dynamic misspeculations is typically about 2%, which shows that our technique can be used even for scenarios where speculation recovery is expensive.
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
Authors: Keqin Li, Xian-He Sun
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. For the purpose of average-case performance prediction, we formally define the concepts of average-case average-speed and average-case isospeed scalability. By modeling parallel algorithms on multiprocessors using task precedence graphs, we are mainly interested in the effects of synchronization overhead and load imbalance on the performance of parallel computations.Thus, we focus on the structures of parallel computations, whose inherent sequential parts are limitations to high performance. Task execution times are treated as random variables, so that we can analyze the average-case performance of parallel computations. For several typical classes of task graphs, including iterative computations, search trees, partitioning algorithms, and diamond dags, we derive the growth rate of the number of tasks as well as isospeed scalability in keeping constant average-speed. In addition to analytical results, extensive numerical data are also demonstrated.An important discovery of our study is that while a parallel computation can be made scalable by increasing the problem size together with the system size, it is actually the amount of parallelism that should scale up with the system size.We also argue that under our probabilistic model of parallel algorithms and the list scheduling strategy, the number of tasks should grow at least in the rate of $\mit\Theta(P\log P)$, where $P$ is the number of processors, so that a constant average-speed can be maintained. Furthermore, $\mit\Theta(\log P/\log P')$ is the highest isospeed scalability achievable.
A Method to Combine any Process Algebra with an Algebraic Specification Language: the p-Calculus Example
Authors: Gwen Salaün, Michel Allemand, Christian Attiogbé
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

We introduce in [10] the formal foundations to make a generic combination of one process algebra and one algebraic specification language possible. Furthermore, to strengthen the contribution of this work, a concrete illustration about an orders invoicing case study is detailed in [9]. In this paper, we especially focus on the addition of other languages; indeed in the initial work, we only consider a restricted number of process algebras: CCS, CSP, ACP, basic LOTOS. Therefore, we aim at formalizing the way to extend the previous combination. To achieve this goal, we present a method to enhance the syntax and semantics of the formalkernel introduced in [10]. These guidelines are illustrated with the ¿-Calculus.
Distributed Workflow Management System for Electronic Commerce
Authors: Nobuyuki Kanaya, Hirotaka Hara, Yoshihide Nomura, Hitoshi Komori, Tsuyoshi Ebata
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

We describe a new architecture and protocol that we have developed to meet the requirements of workflow systems that are used for electronic commerce systems among enterprises. We developed practical electronic commerce systems using XML-based workflow systems among enterprises. We found that the requirements are greatly different from traditional workflow systems in some points; such as process management, server communication protocol, history log management, data conversion, and external application calls. In this paper, we illustrate the new requirements and problems when EC systems are developed using traditional workflow architecture and protocols, then we propose our new architecture and protocol that provide solutions for these requirements and problems. In this architecture based on XML, servers have the server communication module and the external-call module. The server commutation module provides a way to make a batch request. The external-call module provides a reliable way to call business applications. We also presented a retrying algorithm that maintains consistency between a workflow engine and an external application. The logging server provides a stable and fast way to query logs by collecting events from workflow servers. Our new protocol is being proposed of WfMC (WorkFlow Management Coalition) as an extension of Wf-XML.
Evaluation of high speed LAN protocols as multimedia carriers
Authors: W. Melody Moh, Yu-Feng Chung, Teng-Sheng Moh, Joanna Wang
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

The complexity of multimedia applications, which integrate a variety of information sources, such as audio, voice, graphics, images, animation, and full-motion video, into a wide range of applications, stresses all the components of computer and communication systems. Many new ideas have been proposed and implemented for advanced LAN (Local Area Network) protocols in order to support multimedia networking. In this paper we study three recently proposed high speed LAN protocols including the 100 Base-T Fast Ethernet, the Ethernet++, and the 100 VG-AnyLAN. We also propose a new enhancement for the 100 VG-AnyLAN. For these four protocol, we describe their design methodology, strengths, weaknesses, and compare their performance in supporting multimedia communications including both real-time and non-real-time traffic. We believe that the results and discussions presented here provide important information for network designers and engineers when designing or deciding network protocols for multimedia systems.
The Hardness of 3 - Uniform Hypergraph Coloring
Authors: Irit Dinur, Oded Regev, Clifford D. Smyth
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We prove that coloring a 3-uniform 2-colorable hypergraph with any constant number of colors is NP-hard. The best known algorithm [20] colors such a graph using O(n1/5) colors. Our result immediately implies that for any constants k >2 and c2 > c1 > 1, coloring a k-uniform c1-colorable hypergraph with c2 colors is NP-hard; leaving completely open only the k = 2 graph case.We are the first to obtain a hardness result for approximately-coloring a 3-uniform hypergraph that is colorable with a constant number of colors. For k ¿ 4 such a result has been shown by [14], who also discussed the inherent difference between the k = 3 case and k ¿ 4.Our proof presents a new connection between the Long-Code and the Kneser graph, and relies on the high chromatic numbers of the Kneser graph [19, 22] and the Schrijver graph [26]. We prove a certain maximization variant of the Kneser conjecture, namely that any coloring of the Kneser graph by fewer colors than its chromatic number, has many' non-monochromatic edges.
Sufficient Conditions for Optimal Multicast Communication
Authors: Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, we give a general technique for computing optimal multicast calling schedules in any multiprocessor system that utilizes a direct network interconnection structure as long as a few simple conditions are satisfied. Since almost any real system will satisfy these conditions, this result essentially means that multicast can always be performed in the ceiling of log (d+1) phases, where d is the number of multicast destinations. In particular, previous results on optimal multicast algorithms in specific direct network topologies \cite{far80,mck92,rob94} are simply corollaries of our result.
An Argument in Favour of Presumed Commit Protocol
Authors: Yousef J. Al-Houmaily, Panos K. Chrysanthis, Steven P. Levitan
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

We argue in favor of the presumed commit protocol by proposing two new presumed commit variants that significantly reduce the cost of logging activities associated with the original presumed commit protocol. Furthermore, for read-only transactions, we apply our unsolicited update-vote optimization and show that the cost associated with this type of transactions is the same in both presumed commit and presumed abort protocols, thus, nullifying the basis for the argument that favors the presumed abort protocol. This is especially important for modern distributed environments which are characterized by high reliability and high probability of transactions being committed rather than aborted.
One System, Two Ideologies: Integrating the Two Worlds of Software Engineering Education
Authors: T. H. Tse
Venue: 23rd International Computer Software and Applications Conference (1999)

There are two contradicting ideologies in software engineering education. Each of them, however, has its own problems. We advocate that the future of software engineering education lies in integrating the two worlds. SE education should not only be an engineering discipline in name, but also an engineering discipline in substance. Software engineer students should not be artisans who regard their trade as an art and learn only from experience; nor should they be mathematics students who are more comfortable with theory than practice. They should be trained as genuine engineers, who are competent with industrial applications as well as the supporting theory.
Logarithmic Spiral Grid and Gaze Control for the Development of Strategies of Visual Segmentation on a Document
Authors: Veronique Eglin, Hubert Emptoz
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a page segmentation method which is based on perception phenomenon and displays the unequal importance of information in the visual field. The access of information is directly linked to the search of attractive areas. This search is based on the idea to free oneself from an unbending physical structuring and from a uniform vertical and horizontal scanning of the document, so as to classify the data in order of importance and interest. Using a space-variant geometry for the block selection, the page image, instead of being represented by the bitmap format, can be abstractly represented by the block format. This space-variant geometry lays a sound basis for elaborating the kinetic of the ocular shifting on a document, which provides not only a meaningless document representation in blocks, but shows a unified view corresponding to the integration of time-variant representations of the same visual field.
Mining Image Features for Efficient Query Processing
Authors: Beitao Li, Wei-Cheng Lai, Edward Y. Chang, Kwang-Ting Cheng
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The number of feature required to depict an image can be very large. Using all features simultaneously to measure image similarity and to learn image query-concepts can suffer from the problem of dimensionality curse ,which degrades both search accuracy and search peed. Regarding search accuracy, the presence of irrelevant features with respect to a query can contaminate similarity measurement, and hence decrease both the recall and precision of thatquery. To remedy this problem, we present a mining method that learns online user query concept and identities important features quickly. Regarding search speed, the presence of a large number of feature can low down query-concept learning and indexing performance. We propose a divide-and-conquer method that divides the concept-learning task into G subtasks to achieve speedup. We notice that a task must be divided carefully, or search accuracy maysuffer. We thus propose a genetic-based mining algorithm to discover good feature groupings. Through analysis and mining result, we observe that organizing image features in a multi-resolution manner, and minimizing intra-group feature correlation, can peed up query-concept learning substantially while maintaining high search accuracy.
A Next Generation Industry Multimedia Database System
Authors: Hiroshi Ishikawa, Koki Kato, Miyoki Ono, Naomi Yoshikawa, Kazumi Kubota, Akiko Kondo
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

New multimedia applications have emerged on top of information infrastructures, such as on-demand services, digital libraries and museums, online shopping, and document management, which require new databases. That is, next-generation database systems must enable users to efficiently and flexibly develop and execute such advanced multimedia applications. We focus on development of a database system which enables flexible and efficient acquisition, storage, access and retrieval, and distribution and presentation of large amounts of heterogeneous media data. We take an approach based on an object-oriented database, which is more suitable for description of media structures and operations than a traditional relational database. And we extend the object-oriented approach by providing temporal and spatial operators, and control of distributing computing and QOS (quality of service). In this paper, we describe a multimedia data model and its efficient implementation.
A Parallel Adaptive version of the Block-based Gauss-Jordan Algorithm
Authors: Nordine Melab, El-Ghazali Talbi, Serge G. Petiton
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm used in numerical analysis to invert matrices. This version includes a characterization of the workload of processors and a mechanism of its adaptive folding/unfolding. The application is implemented and experimented with MARS 1 in dedicated and non-dedicated environments. The results show that an absolute efficiency of 92% is possible on a cluster of DEC/ALPHA processors interconnected by a Gigaswitch network and an absolute efficiency of 67% can be obtained on an Ethernet network of SUN-Sparc4 workstations.Moreover, the adaptability of the algorithm is experimeted on a non-dedicated meta-system including both the two parks of machines.
Parallel volume rendering
Authors: Rüdiger Westermann
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Several methods have been developed to visualize three dimensional volume data on multiprocessor computer systems. Most of these algorithms were strongly adapted to the underlying target architecture, and often did not take account requirements such as scalability, portability, or memory minimization. The paper outlines a new approach for rendering large scale volume data on distributed memory parallel computers. Within this framework, the only limiting factor concerning the resolution of the processed data is the node local memory. Furthermore, porting to other multiprocessor systems is straight forward, and scalability with increasing numbers of processors is achieved.
On the Complexity of the Minimum and Maximum Global Snapshot Problems
Authors: Loon-Been Chen, I-Chen Wu
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Deriving the minimum and maximum global snapshots is very useful for some error detection problems in distributed programs. Several researchers, e.g., Groselj, Chen and Wu, have shown that the minimum and maximum global snapshot problems are linear-time reducible to the maximum constant-ratio network flow (MCNF) problem, here defined as the well-known maximum network flow problem with m = \Theta(n), where m is the number of edges and n is the number of vertices in the given flow network. In this paper we show in a reverse way that the MCNF problem is also linear-time reducible to these global snapshot problems. Thus, we can conclude that the global snapshot problems are ``as difficult as" the MCNF problem in terms of time complexity.
The AQUA Approach to Querying Lists and Trees in Object-Oriented Databases
Authors: Bharathi Subramanian, Theodore W. Leung, Scott L. Vandenberg, Stanley B. Zdonik
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Relational database systems and most object-oriented database systems provide support for queries. Usually these queries represent retrievals over sets or multisets. Many new applications for databases, such as multimedia systems and digital libraries, need support for queries on complex bulk types such as lists and trees. In this paper we describe an object-oriented query algebra called AQUA (= A Query Algebra) for lists and trees. The operators in the algebra preserve the ordering between the elements of a list or tree, even when the result list or tree contains an arbitrary set of nodes from the original tree. We also present predicate languages for lists and trees which allow order-sensitive queries because they use pattern matching to examine groups of list or tree nodes rather than individual nodes. The ability to decompose predicate patterns enables optimizations that make use of indices.
Software Can Be Entrusted with High Consequence Functionality
Authors: Ben L. Di Vito
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Some observers believe it is the nature of software to be inherently unreliable. Others are more hopeful, but doubt we can ever analyze software systems sufficiently well to justify dependability. Both of these viewpoints are overly pessimistic. Although building a high consequence system is not a casual undertaking, emerging assurance technologies promise improved dependability. The decision to deploy such systems must consider these assurances as well as weigh the expected benefits against the residual risk of trusting a digital control mechanism. Increased functionality can be a powerful motivation while simultaneously enhancing operational safety itself. Formal methods can give us the strong assurances we need to follow this path. 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
Using COTS Software in High Assurance Control Applications
Authors: Lui Sha
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

The vast majority of COTS software components are not developed for high reliability applications. Using them directly in embedded systems with high reliability requirements could be hazardous, as shown in the incidents of Navy ships Yorktown, Vicksburg and USS Hue City.Challenges to Fault Avoidance Approach: Ensuring the reliability of COTS software at the users' site is not an easy task. COTS software components are not subject to customers' high assurance development processes. Customers can buy source code and then subject them to a high-assurance process and make any modifications that are needed. However, this is a high cost solution. Furthermore, once a COTS software component has been modified, it is unlikely compatible with vendors' future releases. As a result, most of the benefits of using COTS are lost. Therefore this approach - making proprietary modifications to COTS components - is inconsistent with the original motivation for their use.Challenges to Fault Tolerance Approach: There are basically two fault tolerance approaches: fault masking and forward recovery. Fault masking tries to prevent incorrect outputs from being used. For example, Recovery Block attempts to check if an output is correct before using it.Unfortunately, it is often difficult to determine the correctness of a computation without knowing what the correct answer is. Forward fault recovery attempts to recover after incorrect outputs are used and it is not suitable for all the applications. Nor is there a general domain independent approach to forward fault recovery. 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
Combining Ontologies and Document Retrieval Techniques: A Case Study for an E-Learning Scenario
Authors: Stephan Baumann, Andreas Dengel, Markus Junker, Thomas Kieninger
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Ontologies are a perfect knowledge base for enriching standard document retrieval and classification techniques. In this paper we will describe such an approach for the applicationof e-learning. We choose a basic combination of ontologies, some simple heuristics and classic term, resp. document similarity measure to deliver the required functionality. Our system has a distributed architecture handling the linkage to a database-driven document management system with browser-suited output. First results are presented showing the advantages of automatic generation of queries based on ontologies.