ppxscal/embedding_network huggingface dataset:
Cooperation of Heterogeneous Legacy Information Systems: A Methodological Framework
Authors: Massimo Mecella, Carlo Batini
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

In many enterprises the presence of heterogenous legacy information systems is pervasive, nevertheless the different component organizations need to cooperate in order to offer new services. The Distributed Object Computing is a valid approach for the definition of a cooperative model among heterogeneous legacy information systems, but few methodologies and architectures explicitly address these issues. This paper describes a case study (or better, a set of case studies) in which these issues were addressed: it is the Cooperative Architecture over the Unitary Network of the Italian Public Administration. Then it proposes some methodological suggestions, stemming from the case studies, for the development of cooperative systems based on distributed object middleware.
Automatic Acquisition of Layout Knowledge for Understanding Business Cards
Authors: Toyohide Watanabe, Xiaoou Huang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The document knowledge plays very importants roles in many currently proposed document image understanding methods. In these methods the document knowledge is utilized to classify/ extract individual item data interpretatively from paper-based sheets as a kind of document model. Of course, the document knowledge is classified into layout knowledge about locational information of composite item blocks, item sequence knowledge about compositional information of individual item fields, item property knowledge about characteristic information of item data and so on. Today, these knowledge are specified into the document image understanding system as ready-made information in advance.In this paper, we propose an experimental method to acquire the layout knowledge automatically from sample document images: especially, we focus on the acquisition subject for business cards. Our idea for this subject is to generate individual knowledge of layout structures of business cards from a predefined logical structure. Namely, the logical structure is used as a kind of meta-knowledge to interpretatively generate the layout knowledge of given business cards.
Design and Implementation of a TCP-Friendly Transport Protocol for Ad Hoc Wireless Networks
Authors: Zhenghua Fu, Benjamin Greenstein, Xiaoqiao Meng, Songwu Lu
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Transport protocol design for mobile ad hoc networks is challenging because of unique issues, including mobility-induced disconnection, reconnection, and high out-of-order delivery ratios; channel errors; and network congestion. In this work, we describe the design and implementation of a TCP-friendly transport protocol for ad hoc networks. Our key design novelty is to perform multi-metric joint identification for packet and connection behaviors based on end-to-end measurements. Our testbed measurements and ns-2 simulations show a significant performance improvement over standard TCP in ad hoc networks.
Design Considerations in Boeing 777 Fly-By-Wire Computers
Authors: Y. C. (Bob) Yeh
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

The new technologies in flight control avionics systems selected for the Boeing 777 airplane program consist of the following: Fly-By-Wire (FBW), ARINC 629 Data Bus, and Deferred Maintenance.The FBW must meet extremely high levels of functional integrity and availability. The heart of the FBW concept is the use of triple redundancy for all hardware resources: computing system, airplane electrical power, hydraulic power and communication paths.The multiple redundant hardware are required to meet the numerical safety requirements. Hardware redundancy can be relied upon only if hardware faults can be contained; fail-passive electronics are necessary building blocks for the FBW systems. In addition, FBW computer architecture must consider other fault tolerance issues: generic errors, common mode faults, near-coincidence faults and dissimilarity.
Using Genetic Algorithms to Automate System Implementation in a Novel Three-Dimensional Packaging Technolog
Authors: Steven P. Larcombe, David J. Prendergast, Neil A. Thacker, Peter A. Ive
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Implementing electronic systems in a low-cost, three-dimensional multichip module (MCM) technology provides significantly improved system density over planar packaging technologies. However, the extra dimension necessitates a new approach to design automation. Through experience gained in manually partitioning electronic systems, generic design rules have been formulated and implemented in software. The approach adopted is based on a genetic algorithm which can produce multiple candidate solutions and has the potential to simultaneously optimize multiple design criteria. This paper presents the initial results for the automatic configuration of a variety of systems. The results obtained by the algorithm are compared to known optimal solutions for "test" cases and to the results obtained by manual partitioning for the first heterogeneous MCM-V system.
Operating system support for concurrent remote task creation
Authors: Dejan S. Milojicic, David L. Black, Steven J. Sears
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper describes improvements to the Mach microkernel's support for efficient application startup across multiple nodes in a cluster or massively parallel processor. Significant improvements in application startup times have been achieved by optimizing the existing remote task creation operation, implementing a facility to concurrently create multiple remote tasks in a single operation, and restructuring the underlying distributed virtual memory system to improve its scalability. One component of the restructuring involves the use of a hierarchical tree of objects to implement the paging path instead of a flat single level tree; this eliminates bottlenecks at the node that initiates the application. The other component consists of limiting the copy on write virtual memory optimization to single node operations; this achieves a separation of network sharing (read/write)from network read access (implemented by copy on reference). Although our implementation is specific to Mach, the architecture and design are applicable to other modern operating systems.
Location and recognition of legal amounts on Chinese bank cheques
Authors: Chin L. Yu, Ching Y. Suen, Yuan Yan Tang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes a Chinese cheque processing system currently under development at the Centre for Pattern Recognition and Machine Intelligence (CENPARMI). The information on Chinese bank cheques is not the same as that on alphanumeric bank cheques. The legal amount in a Chinese bank cheque is the Chinese character text associated with each currency unit. This paper discusses a technique using each currency unit as a key word to locate/extract the legal amount in bank cheques. In the analysis and recognition process, the system tries to locate the smallest currency units in the image and identifies it first. Then, the system tries to locate the image strings associated with each currency unit. Each image string is separated and recognized. Next, a set of rules and context are applied to recognize the characters. In order to choose the correct one, the recognized character string is accepted only if it satisfies all the conditions governed by rules.
The Tempest approach to distributed shared memory
Authors: David A. Wood, Mark D. Hill, James R. Larus
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

This paper summarizes how distributed shared memory (DSM) can be both efficiently and portably supported by the Tempest interface. Tempest is a collection of mechanisms for communication and synchronization in parallel programs. These mechanisms provide compilers, libraries, and application programs the ability to exploit the best of shared memory, message passing, and hybrid combinations of the two. Because Tempest provides mechanisms, not policies, programmers can tailor communication to a program's sharing pattern and semantics. And since the mechanisms are easily supported on different machines, Tempest provides a portable interface across a wide range of platforms.
Designing Efficient Distributed Algorithms Using Sampling Techniques
Authors: Sanguthevar Rajasekaran, David S. L. Wei
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, selection can be done in such a way that the message complexity is independent of the cardinality of the set (file), provided the file size is polynomial in the network size. For example, given a file F of size n and an integer k(1\leq k\leq n), on a p-processor de Bruijn network, our deterministic selection algorithm can find the kth smallest key from F using O(p\log^{3}p) messages and with a communication delay of O(\log^{3}p), and that our randomized selection algorithm can finish the same task using only O(p) messages and a communication delay of O(\log p) with high probability, provided the file size is polynomial in network size. Our randomized selection outperforms the existing approaches in terms of both message complexity and communication delay.The property that the number of messages needed and the communication delay are independent of the size of the file makes our distributed selection schemes extremely attractive in such domains as very large database systems. Making use of our selection algorithms to select pivot element(s), we also develop a near optimal quicksort-based sorting scheme and a nearly optimal enumeration sorting scheme for sorting large distributed files on the hypercube and de Bruijn networks. Our algorithms are fully distributed without any a priori central control.
The Powerdomain of Indexed Valuations
Authors: Daniele Varacca
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using the notion of powerdomain, while probability is modeled using the powerdomain of valuations. Those two functors do not combine well, as they are. We define the notion of powerdomain of indexed valuations, which can be combined nicely with the usual nondeterministic powerdomain. We show an equational characterization of our construction. Finally we discuss the computational meaning of indexed valuations, and we show how they can be used, by giving a denotational semantics of a simple imperative language.
A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing Systems
Authors: JunSeong Kim, David J. Lilja
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth requirements, and the difficulty of predicting the system network load. To help address this deficiency, and thereby support dynamic network resource scheduling, we propose the Network Status Predictor (NSP). This tool is a general and extensible network load monitor that introduces lower and upper latency prediction bounds. We evaluate its ability to dynamically predict TCP/IP end-to-end latency with varying network loads using a cluster of SGI multiprocessors interconnected with a Fibre Channel network. Our results show that a combination of numerical predictors can be dynamically selected based on the network's recent state to produce better predictions than when using a single predictor alone.
Smart Visible Sets for Networked Virtual Environments
Authors: Fábio O. Moreira, João Comba, Carla Maria Dal Sasso Freitas
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

The real-time visualization of complex virtual environments across the network is a challengingproblem in Computer Graphics. The use of pre-computed visibility associated to regions in space, such as in the Potentially Visible Sets (PVS) approach, may reduce the amount of data sent across the network. However, a PVS for a region may still be complex, and further partitions of the PVS are necessary. In this paper we introduce the concept of a Smart Visible Set (SVS), which corresponds to (1) a partition of PVS information into dynamic subsets that take into account client position, and (2) an ordering mechanism that enumerates these dynamic sets using a visual importance metric. Results comparing the SVS and the PVS approach are presented.
A Heuristic Information Retrieval Model on a Massively Parallel Processor
Authors: Inien Syu, Sheau-Dong Lang, Kien A. Hua
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We adapt a competition-based connectionist model to information retrieval. This model, which has been proposed for diagnostic problem solving, treats documents as "disorders" and user information needs as "manifestations", and it uses a competitive activation mechanism which converges to a set of disorders that best explain the given manifestations. Our experimental results using four standard document collections demonstrate the efficiency and the retrieval precision of this model, comparable to or better than that of various information retrieval models reported in the literature. We also propose a parallel implementation of the model on a SIMD machine, MasPar's MP-I. Our experimental results demonstrate the potential to achieve significant speedups.
Group Awareness Support in Collaborative Writing Systems
Authors: Sonia Mendoza, Manuel Romero Salcedo, Hanna Oktaba
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Collaborative writing systems allow co-authors, spread out across different locations, to work together sharing common documents. One key element that, in most cases, is poorly supported in collaborative writing systems is group awareness. Many research studies have defined several types of group awareness. The paper presents a comparative analysis of workspace and conversational awareness support in collaborative writing systems. For this purpose, we adapted R. Vertegaal's (1997) framework in order to analyze the group awareness mechanisms for collaborative writing. This framework considers the workspace and conversational awareness elements. Based on these elements, we analyzed and compared Quilt, GROVE, PREP, SASSE, Calliope and Alliance collaborative writing systems. Finally, we identified their strengths and weaknesses.
Improving SQL with Generalized Quantifiers
Authors: Ping-Yu Hsu, Douglas Stott Parker,  Jr.
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

A generalized quantifier is a particular kind of operator on sets. Coming under increasing attention recently by linguists and logicians, they correspond to many useful natural language phrases, including phrases like: three, Chamberlin's three, more than three, fewer than three, at most three, all but three, no more than three, not more than half the, at least two and not more than three, no student's, most male and all female, etc. Reasoning about quantifiers is a source of recurring problems for most SQL users, and leads to both confusion and incorrect expression of queries. By adopting a more modern and natural model of quantification these problems can be alleviated. We show how generalized quantifiers can be used to improve the SQL interface.
SPI: an instrumentation development environment for parallel/distributed systems
Authors: Devesh Bhatt, Rakesh Jha, Todd Steeves, Rashmi Bhatt, David Wills
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper presents an overview of the Scalable Parallel Instrumentation (SPI) tool being developed at Honeywell. SPI provides a complete development and execution environment for developing real-time instrumentation functions for heterogeneous parallel/distributed systems. This includes: C-extensions and development tools for the event-action programming model, run-time support for transparent event-action execution on a heterogeneous distributed platform, and a library of primitives (actions) ranging from real-lime data collection, analysis to graphic display. Concurrent instrumentation functions can be flexibly parallelized/distributed over the heterogeneous platform to selectively analyze and display desired activity at the hardware, OS, IPC, and application levels. SPI is currently operational on a heterogeneous platform of SUN workstations and Intel Paragon.
A Simple Algorithmic Characterization of Uniform Solvability
Authors: Eli Gafni
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

The Herlihy-Shavit (HS) conditions characterizing the solvability of asynchronous tasks over n processors have been a milestone in the development of the theory of distributed computing. Yet, they were of no help when researcher sought algorithms that do not depend on n.Tohelp in this pursuit we investigate the uniform solvability of an infinite uniform sequence of tasks T0, T1, T2, ¿,where Ti is a task over processors p0, p1,¿, pi , and Ti extends Ti- 1. We say that such a sequence is uniformly solvable if there exit protocols to solve each Ti and the protocol for Ti extends the protocol for Ti. This paper establishes that although each Ti may be solvable, the uniform sequence is not necessarily uniformly solvable. We show this by proposing a novel uniform sequence of solvable tasks and proving that the sequence is not amenable to a uniform solution. We then extend the HS conditions for a task over n processors, to uniform solvability in a natural way. The technique we use to accomplish this is to generalize the alternative algorithmic proof, by Borowsky and Gafni, of the HS conditions, by showing that the infinite uniform sequence of task of Immediate Snapshots is uniformly solvable. A side benefit of the technique is a widely applicable methodology for thedevelopment of uniform protocols.
Analysing Large COBOL Programs: the extraction of reusable modules
Authors: Elizabeth Burd, Malcolm Munro, Clazien D. Wezeman
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

This paper describes work performed for the IDENT project which is concerned with the identification and encapsulation of reusable modules. The aim of the project is to look at the integration of two methods for supporting maintenance; RE2 and RECAST. In this paper we describe a case study where we try to extract reusable modules from a 21,000 line COBOL program. We approach this through the use some of the basic methods addressed by the RE2 reuse reengineering paradigm and some of the stages of the reverse engineering RECAST method. We have found that the identification of modules is very difficult because of high connectivity between data items. In order to deal with this problem we identify a number of strategies for removing particular data items using some of the RECAST stages and steps. These include the logical data model and system processing steps. However, in most cases we have found that such approaches were insufficient and that expert domain knowledge is also required to assist in module identification.
Shape Matrices as a Mixed Shape Factor for Off-line Signature Verification
Authors: Robert Sabourin, J.-P. Drouhard, Etienne Sum Wah
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Shape matrices have been used as a representation of planar shapes like industrial parts or printed characters. In this paper, we investigate the use of shape matrices as a mixed shape factor for off-line signature verification. By mixed shape factor we mean any global shape factor where the position of local measurements are take into account in the definition of a similarity measure between two representations. It was demonstrated that using a good similarity measure between two shape matrices, this shape factor is relatively well suited for the global interpretation of signature images.
Transient analysis of coupled transmission lines characterized with the frequency-dependent losses using scattering-parameter based macromodel
Authors: Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper describes two novel macromodels for incorporating the single and coupled transmission lines characterized by the frequency-dependent losses into a scattering-parameter (S-parameter) macromodel based simulator. This approach computes the moments of the S-parameter based upon the frequency-dependent parasitic functions: R(f), L(f), C(f), and G(f) which characterize either the single or the coupled transmission lines. These same moments can be used later to construct the macromodels. Once the macromodels are built, the transient analysis can be performed by using the S-parameter based macromodel simulator.
Tree Extension Algebras: Logics, Automata, and Query Languages
Authors: Michael Benedikt, Leonid Libkin
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation T
Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel Programs
Authors: Arash Baratloo, Ayal Itzkovitz, Zvi M. Kedem, Yuanyuan Zhao
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Adaptive parallel computations-computations that can adapt to changes in resource availability and requirement- can effectively use networked machines because they dynamically expand as machines become available and dynamically acquire machines as needed. While most parallel programming systems provide the means to develop adaptive programs, they do not provide any functional interface to external resource management systems. Thus, no existing resource management system has the capability to manage resources on commodity system software, arbitrating the demands of multiple adaptive computations written using diverse programming environments.This paper presents a set of novel mechanisms that facilitate dynamic allocation of resources to adaptive parallel computations. The mechanisms are built on low-level features common to many programming systems, and unique in their ability to transparently manage multiple adaptive parallel programs that were not developed to have their resources managed by external systems. We also describe the design and the implementation of the initial prototype of ResourceBroker, a resource management system built to validate these mechanisms.