ppxscal/embedding_network huggingface dataset:
A System for Extracting and Recognizing Numeral Strings on Maps
Authors: Liang-Hua Chen, Jiing-Yuh Wang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a complete procedure for the extraction and recognition of hand-printed numeral strings on maps. The character extraction algorithm can even segment slant and touching characters into individual components. Our feature-based recognition algorithm can recognize numeral characters of any size, position, and orientation. Experimental results on utility and cadastral maps have shown that the proposed technique is effective in the automatic data capture of geographic information systems.
High-Dimensional Similarity Joins
Authors: Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, called the epsilon-kdB tree, for fast spatial similarity joins on high-dimensional points. This index structure reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal cost of finding appropriate branches in the internal nodes. The storage cost for internal nodes is independent of the number of dimensions. Hence the proposed index structure scales to high-dimensional data. Empirical evaluation, using synthetic and real-life datasets, shows that similarity join using the epsilon-kdB tree is 2 to an order of magnitude faster than the R+ tree, with the performance gap increasing with the number of dimensions.
MOOSE - A Task-Driven Program Comprehension Environment
Authors: Juergen Rilling, Ahmed Seffah
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Many tools have been developed to derive abstract representations from existing source code. Yet, most of these tools provide only little help in providing an encompassing picture of the system under examination. Graphical visualization techniques derived from reverse engineered source code have long been recognized for their impact on improving the comprehensibility of software systems and their source code. In this paper, we present a task-oriented approach to software comprehension by introducing our MOOSE environment that provides a task-driven wizard approach that supports a cognitive comprehension model combined with reverse engineering techniques, algorithmic and visualization support. We close our discussion with a brief overview of typical software comprehension tasks and how the MOOSE environment will benefit users during these comprehension tasks.
Segment Directory Enhancing the Limited Directory Cache Coherence Schemes
Authors: Jong Hyuk Choi, Kyu Ho Park
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We present a new arrangement of directory bits called the segment directory to improve directory storage efficiency: a segment directory can point to several sharing processors with almost the same number of bits as the pointer which can point to only one. Many directory overflows can be eliminated by using the segment directory element in place of the pointer in the limited directory schemes. Also, the segment directory can be implemented without introducing additional hardware overhead and protocol complexity. The detailed execution-driven simulations show that the segment directory always does better than the pointer and eliminates many directory overflows by up to 85%. The resulting improvement in bandwidth and execution time is analyzed in detail for limited directory schemes having different behaviors, with respect to the reduced directory overflows.
A workload characterization for coarse-grain multiprocessors
Authors: Christopher Connelly, Carla Schlatter Ellis
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Scalable shared memory multiprocessors commonly employ replication and the associated coherency maintenance of memory blocks, but differ in the granularity from fine-grain (cache-coherent multiprocessors) to coarse-grain (page-based distributed shared memory systems). Regardless of the size of coherency blocks, attaining good performance may depend on the number of copies staying small. Previous workload characterization studies of fine-grain systems have shown sharing patterns that tend toward small worker sets. Coarse-grain architectures offer scalability advantages unless sharing patterns for larger blocks are considerably less favorable. This is the question we address in this paper. Our results are encouraging in that, despite the coarse granularity, worker sets scale reasonably.
Toward an Interactive Museum Guide System with Sensing and Wireless Network Technologies
Authors: Fusako Kusunoki, Masanori Sugimoto, Hiromichi Hashizume
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

In this paper, we describe an interactive guide system for kids in museums. The system uses a sensing board which can rapidly recognize types and locations of multiple objects, and creates an immersive environment by giving users visual and auditory feedback to their manipulations on the board. The purpose of the system is to attract users' interests in a real exhibition by allowing them to interact with the corresponding virtual exhibition on the board, and providing them with its information.We have evaluated the system in a museum. From the interviews and questionnaires, we have confirmed that it is easy for kids to use the system and it can raise their motivation for visiting real exhibitions.
To Unlock the Learning Value of Wireless Mobile Devices, Understand Coupling
Authors: Jeremy Roschelle, Charles Patton, Roy D. Pea
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

Handheld computers will become an increasingly compelling choice of technology for K-12 classrooms because they will enable a transition from occasional, supplemental use to frequent, integral use. Early evaluations suggest teachers and students respond to handhelds favorably. At the same time, these devices will become communication enabled, through wireless technologies such as infrared beaming or radio-based local area networks. This current research base, however, is insufficient to unlock the value of wireless internet learning devices (WILDs). A important issue, hinted at but not fully explored in prior work, now mustbecome our central focus of attention. The issue is the nature of the coupling between social and informatic worlds, and within the social and informatic worlds. We articulate three coupling issues: (1) Curricular Activity Spaces versus Personal Learning Connections (2) Integrated vs. Synchronized Educational Databases (3) Broad vs. Narrow Technological Mediation of Discourse.
The impact of pipelining on SIMD architectures
Authors: James D. Allen, David E. Schimmel
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper explores the fundamental impacts of pipeline technology on massively parallel SIMD architectures. The potential for performance improvement in the instruction delivery is explored, and stall penalties associated with reduction operations are derived. Scheduling mechanisms to mitigate stall cycles are also presented. In addition, the design of pipelined processing elements is considered, and formula for stall penalties, and area costs are constructed. These results indicate that a 5-10 fold improvement in SIMD performance is well within technological limits.
Unconstrained Japanese Address Recognition Using a Combination of Spatial Information and Word Knowledge
Authors: Eiki Ishidera, Daisuke Nishiwaki, Keiji Yamada
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes a new handwritten address recognition method which can correct the errors occurring in line extraction, character segmentation, and character recognition as a possible means of avoiding the error accumulation which occurs during the recognition sequence in conventional methods. We formulated the address recognition method as a minimum cost search problem. We defined the character recognition cost which estimates the reliability of the character recognition result, the arrangement cost which estimates the plausibility of the character string's spatial arrangement, and the word knowledge cost which estimates the plausibility of the linguistic conditions. By using a combination of these costs, the proposed method can recognize an address which has not been extracted as a single line from input images by a conventional method. The efficiency of the proposed method is evaluated through an experiment using 600 Japanese mail images. An address recognition rate of 79.38% was obtained.
Decisive Path Scheduling: A New List Scheduling Method
Authors: Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis, Hyunseung Choo
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Scheduling parallel tasks, represented as a Directed Acyclic Graph (DAG), on a multiprocessor system has been an important research area in the past decades. One of the critical aspects of a class of scheduling algorithms, called "List Scheduling," is how to decide which task is to be scheduled next. This is achieved by assigning priorities to the nodes or the edges of the input DAG, and thus the task with the highest priority will be scheduled next. This paper proposes a low complexity scheduling algorithm to improve the priority node selection criteria in list scheduling algorithms. The worst case performance of the proposed algorithm is analyzed for general input DAGs. Also, the worst case performance and the optimality conditions are obtained for tree structured input DAGs. The performance comparison study shows that the proposed algorithm outperforms existing scheduling algorithms especially for input DAGs with high communication overheads. The performance improvement over existing algorithms becomes larger as the input DAG becomes more dense and the level of parallelism in the DAG is increased.
Modeling Multidimensional Databases
Authors: Rakesh Agrawal, Ashish Gupta, Sunita Sarawagi
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

We propose a data model and a few algebraic operations that provide semantic foundation to multidimensional databases. The distinguishing feature of the proposed model is the symmetric treatment not only of all dimensions but also measures. The model provides support for multiple hierarchies along each dimension and support for adhoc aggregates. The proposed operators are composable, reorderable, and closed in application. These operators are also minimal in the sense that none can be expressed in terms of others nor can any one be dropped without sacrificing functionality. They make possible the declarative specification and optimization of multidimensional database queries that are currently specified operationally. The operators have been designed to be translated to SQL and can be implemented either on top of a relational database system or within a special purpose multidimensional database engine. In effect, they provide an algebraic application programming interface (API) that allows the separation of the frontend from the backend. Finally, the proposed model provides a framework in which to study multidimensional databases and opens several new research problems.
A Stratified Semantics of General References A Stratified Semantics of General References
Authors: Amal J. Ahmed, Andrew W. Appel, Roberto Virga
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We demonstrate a semantic model of general references ¿ that is, mutable memory cells that may contain values of any (statically-checked) closed type, including other references. Our model is in terms of execution sequences on a von Neumann machine; thus, it can be used in a Proof-Carrying Code system where the skeptical consumer checks even the proofs of the typing rules. The model allows us to prove a frame-axiom introduction rule that allows locality of specification and reasoning, even in the event of updates to aliased locations. Our proof is machine-checked in the Twelf metalogic.
A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOWEnvironment
Authors: José Duato, Antonio Robles, Federico Silla, Ramón Beivide
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Most commercial routers designed for networks of workstations (NOWs) implement wormhole switching. However, wormhole switching is not well suited for NOWs. The long wires required in this environment lead to large buffers to prevent buffer overflow during flow control signaling.Moreover, wire length is limited by buffer size. Virtual cut-through (VCT) achieves a higher throughput than wormhole switching. Moreover, the traditional disadvantages of VCT switching, as buffer requirements and packetizing overhead, disappear in NOWs.In this paper, we show that VCT routers can be simpler than wormhole ones, while still achieving the advantages of using virtual channels and adaptive routing. We also propose a fully adaptive routing algorithm for VCT switching in NOWs. Moreover, we show that VCT routers outperform wormhole routers in a NOW environment at a lower cost.
Mapping Enterprise Events to the CORBA Notification Service
Authors: Shelby Abraham, Keith Duddy, Michael Lawley, Zoran Milosevic, Kerry Raymond, Andrew Wood
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

To satisfy the need for a wide range of enterprise modelling choices, it is necessary to have a rich set of process based and role based modelling concepts. It is also necessary to have a sound and expressive business event model that includes a flexible way of associating business events with business processes and roles. However, the ability to construct detailed and expressive enterprise models is not useful in a business context without some means of realising the model in technology. The paper introduces the basic modelling concepts from the DSTC's UML Profile for Enterprise Distributed Object Computing before describing in detail the profile's business event model. The paper then describes how this event model can be mapped in a straightforward manner to implementations using the OMG's CORBA Notification Service. This mapping can then be used as the basis for building automated tools that support generating implementations of systems from high level enterprise models.
Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications
Authors: Rupak Biswas, Leonid Oliker, Sajal K. Das, Daniel J. Harvey
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is rather difficult, particularly from the viewpoint of portability on various multiprocessor platforms.We address this problem by developing PLUM, an automatic and architecture-independent framework for adaptive numerical computations in a message-passing environment. Portability is demonstrated by comparing performance on an SP2, an Origin2000, and a T3E, without any code modifications. We also present a general-purpose load balancer that utilizes symmetric broadcast networks (SBN) as the underlying communication pattern, with a goal to providing a global view of system loads across processors. Experiments on an SP2 and an Origin2000 demonstrate the portability of our approach which achieves superb load balance at the cost of minimal extra overhead.
On Approximating the Radii of Point Sets in High Dimensions
Authors: Kasturi R. Varadarajan, S. Venkatesh, Jiawei Zhang
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Let P be a set of n points in \mathbb{R}^d. For any 1 \leqslant k \leqslant d, the outer k-radius of P, denoted by Rk (P), is the minimum, over all (d - k)-dimensional flats F, of \max _{p\varepsilon P} d(p,f), where d (p, F) is the Euclidean distance between the pointp and flat F . We consider the scenario when the dimension d is not fixed and can be as large as n. Computing the various radii of point sets is a fundamental problem in computational convexity with many applications.The main result of this paper is a randomized polynomial time algorithm that approximates Rk(P) to within a factor of 0(\sqrt {\log n \cdot \log d}) for any 1 \leqslant k \leqslant d. This algorithm is obtained using techniques from semidefinite programming and dimension reduction. Previously, good approximation algorithms were known only for the case k =1and for the case when k = d - c for any constant c ; there are polynomial time algorithms that approximate Rk(P) to within a factor of (1 + \varepsilon), for any e>0, when d - k is any fixed constant [23, 7]. On the other hand, some results from the mathematical programming community on approximating certain kinds of quadratic programs [28, 27] imply an 0(\sqrt {\log n} ) approximation for R1(P), the width of the pointset P.We also prove an inapproximability result for computing Rk(P), which easily yields the conclusion that our approximation algorithm performs quite well for a large range ofvalues of k . Our inapproximability result for Rk(P) improves the previous known hardness result of Brieden [13], and is proved by improving the parameters in Brieden's construction using basic ideas from PCP theory.
Can a software project be like Einstein?
Authors: Tsuneo Yamaura
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The author discusses his approach to software quality assurance and considers software projects in the United States and Japan. The author's proposal concerns the collaboration of opposite-typed programmers and organizations. If the US and Japan, for example, work together on software development as a single project, the short-coming of both programmers will be cancelled, and will work like genius.
Information Acquisition and Storage of Forms in Document Processing
Authors: Yuan Yan Tang, Jiming Liu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper, an automatic form information acquisition and storage system is presented. By semantic meaning analysis and registration of every kind of forms in advance, the system is able to recognize incoming forms and extract information from them automatically. An efficient form image storage method is also proposed. Instead of keeping the entire form image, this system greatly reduces the memory needed to store the form images in a database by extracting and storing user filled data images only.
Axiomatization of Dynamic Schema Evolution in Objectbases
Authors: Randal J. Peters, M. Tamer Özsu
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

The schema of a system consists of the constructs that model its entities. Schema evolution is the timely change and management of the schema. Dynamic schema evolution is the management of schema changes while the system is in operation. We propose a sound and complete axiomatic model for dynamic schema evolution in object-base management systems (OBMSs) that support subtyping and property inheritance. The model is formal, which distinguishes it from the traditional approach of informally defining a number of invariants and rules to enforce them. By reducing systems to the axiomatic model, their functionality with respect to dynamic schema evolution can be compared within a common framework.
Implementing a Contract-Based Multi-Agent Approach for Shop Floor Agility
Authors: José Barata, Luis M. Camarinha-Matos
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper describes implementation approaches for a multiagent shop floor control architecture supported by cooperation contracts and designed to support agile manufacturing. The architecture being proposed is based on the concepts of cluster, consortium, manufacturing components, manufacturing resource agent, agent machine interface, and contracts, which are used to govern the skills brought to the consortium or cluster. The basic architecture for each agent is indicated and analysed as well as the knowledge model and ontologies used. Finally the development environment is presented and some practical results are shown.
A Comparison of Parallel Approaches for Algebraic Factorization in Logic Synthesis
Authors: Sumit Roy, Prithviraj Banerjee
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Algebraic factorization is an extremely important part of any logic synthesis system, but it is computationally expensive. Hence, it is important to look at parallel processing to speed up the procedure. This paper presents three different parallel algorithms for algebraic factorization. The first algorithm uses circuit replication and uses a divide-and-conquer strategy. A second algorithm uses totally independent factorization on different circuit partitions with no interactions among the partitions. A third algorithm represents a compromise between the two approaches. It uses a novel L-shaped partitioning strategy which provides some interaction among the rectangles obtained in various partitions. For a large circuit like ex1010, the last algorithm runs 11.5 times faster over the sequential kernel extraction algorithms of the SIS sequential circuit synthesis system on six processors with less than 0.2% degradation in quality of the results.
Component-Based Design of Large-Scale Distributed Systems
Authors: Franck Barbier
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Cooperative and distributed object systems can in essence be specified in using the Unified Modeling Language (UML) that is nowadays recognized as a worldwide standard. In practice, UML fails due to its lack of accuracy. Scenarios in UML, a.k.a. Sequence Diagrams, are natural tools for modeling object interactions and collaborations. Unfortunately, there is no support to deal with combinatory explosion, no support to arrange scenarios in independent packages or to express formal relations between scenarios. Large complex applications and their specification however generate such expectations, and more generally, scalability issues impose a component-based software development. By introducing scenario invariants and contracts in conformance with Class Diagrams, we provide here an original design method. It is illustrated by means of a concrete large-scale networking application. Since implementation is also highlighted, we sketch how the UML models can be derived into components as for instance Enterprise Java Beans (EJBs).