ppxscal/embedding_network huggingface dataset:
Multimedia Interaction for Learning and Knowing: Inspirational Knowledge Management to Create Value for Individuals in Organizations
Authors: Sara Albolino, Maurizio Mesenzani
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper is a critical presentation of the work done by the authors during the past years in two European Projects in the knowledge management area: Klee & Co (Knowledge and Learning Environments for European & Creative Organisations ¿ ESPRIT Program) and MILK (Multimedia Interaction for Learning and Knowing ¿ IST Program).Both projects focus on the dynamic vision of knowledge management as a way to enact communities and to enable innovation and new ideas generation. Technical and organisational sides of knowledge management are considered. The result of the designeffort is the "view with context": a visualisation feature based on keywords and automatic text processing, permitting users to see objects inside their context.
A Generic System for Processing Invoices
Authors: Thomas Bayer, Heike Mogg-Schneider
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a generic system which automatically extracts the requested items from invoices with arbitrary form layout in arbitrary domains. The system consists of two components, an OCR tool which need not be adapted to the current domain and an information extraction component FRESCO which contains the knowledge about the domain. The automation rate for interpreting invoices in the domain of health insurance is above 50 % with an error rate below 1 % with respect to the items to be extracted.
Identifying modules via concept analysis
Authors: Michael Siff, Thomas W. Reps
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Describes a general technique for identifying modules in legacy code. The method is based on concept analysis-a branch of lattice theory that can be used to identify similarities among a set of objects based on their attributes. We discuss how concept analysis can identify potential modules using both "positive" and "negative" information. We present an algorithmic framework to construct a lattice of concepts from a program, where each concept represents a potential module.
Improving Service Availability via Low-Outage Upgrades
Authors: Chryssa Dislis
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Service availability is of key importance to operations and maintenance systems for mobile telephony networks. This paper will describe some of the challenges in providing continuous service and the impact of upgrade related outages. Potential methods for low outage upgrades will be discussed from an industrial perspective, including practical and logistic considerations.
Deputy Mechanisms for Object-Oriented Databases
Authors: Zhiyong Peng, Yahiko Kambayashi
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Concepts of deputy objects and deputy classes for object-oriented databases (OODBs) are introduced. They can be used for unified realization of object views, roles and migration. The previous researches on these concepts were carried out separately, although they are very closely related. Objects appearing in a view can be regarded as playing roles in that view. Object migration is caused by change of roles of an object. Deputy objects can be used for unified treatment of them and generalization of these concepts. The schemata of deputy objects are defined by deputy classes. A set of algebraic operations are developed for deputy class derivation. In addition, three procedures for update propagation between deputy objects and source objects have been designed, which can support dynamic classification. The unified realization of object views, roles and migration by deputy mechanisms can achieve the following advantages. (1) Treating view objects as roles of an object allows them to have additional attributes and methods so that the autonomous views suitable for OODBs can be realized. (2) Handling object roles in the same way as object views enables object migration to be easily realized by dynamic classification functions of object views. (3) Generalization of object views, roles and migration makes it possible that various semantic constraints on them can, be defined and enforced uniformly.
Optimization Schemas for Parallel Implementation of Nondeterministic Languages and Systems
Authors: Gopal Gupta, Enrico Pontelli
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language) can result in poor performance. We present three optimization schemas based on flattening of the computation tree, procrastination of overheads, and sequentialization of computations that can be systematically applied to parallel implementations of non-deterministic systems/languages to reduce the parallel overhead and to obtain improved efficiency of parallel execution. The effectiveness of these schemas is illustrated by applying them to the ACE parallel logic programming system. Performance data presented shows that considerable improvement in performance can result.
Just-In-Time Java? Compilation for the Itanium&reg; Processor
Authors: Tatiana Shpeisman, Guei-Yuan Lueh, Ali-Reza Adl-Tabatabai
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

This paper describes a just-in-time (JIT) Java1 compiler for the Intel¯ Itanium¯ processor. The Itanium processor is an example of an Explicitly Parallel Instruction Computing (EPIC) architecture and thus relies on aggressive and expensive compiler optimizations for performance. Static compilers for Itanium use aggressive global scheduling algorithms to extract instruction-level parallelism. In a JIT compiler, however, the additional overhead of such expensive optimizations may offset any gains from the improved code.In this paper, we describe lightweight code generation techniques for generating efficient Itanium code. Our compiler relies on two basic methods to generate efficient code. First, the compiler uses inexpensive scheduling heuristics to model the Itanium microarchitecture. Second, the compiler uses the semantics of the Java virtual machine to extract instruction-level parallelism.
Analysis of the Numerical Effects of Parallelism on a Parallel Genetic Algorithm
Authors: William E. Hart, Scott B. Baden, Richard K. Belew, Scott R. Kohn
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper examines the effects of relaxed synchronization on both the numerical and parallel efficiency of parallel genetic algorithms (GAs). We describe a coarse-grain geographically structured parallel genetic algorithm. Our experiments provide preliminary evidence that asynchronous versions of these algorithms have a lower run time than synchronous GAs. Our analysis shows that this improvement is due to (1) decreased synchronization costs and (2) high numerical efficiency (e.g. fewer function evaluations) for the asynchronous GAs. This analysis includes a critique of the utility of traditional parallel performance measures for parallel GAs.
Automating Negotiation over B2B Processes
Authors: Andrew Byde, Giacomo Piccinelli, Winfried Lamersdorf
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Business processes underpin the operations of every company. The procedural logic behind business activities is fundamental for effective and efficient management of resources. Effective coordination translates into better quality for products and services. Efficient management translates into costs reduction. In highly competitive environments, quality and cost constitute key competitive advantages for companies.Moving from the company to the supply chain, processes become even more important. Companies have access to internal resources beyond those specified in internal processes. Still, companies have access to other companies only in accordance with and within the scope of the interaction processes agreed in contracts. Interaction processes directly impact internal operations, and have direct cost implications. Hence, interaction processes are central to the negotiation of B2B relationships.In this paper, we present a framework for the automatic negotiation of business interaction processes. The main component of the framework is a technique for the automatic reconciliation of process proposals. Elements of the framework have been embedded in a prototype, which is also presented.
A faster sorting algorithm in the broadcast communication model
Authors: Stephan Olariu, James L. Schwing
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We present a simple sorting algorithm for the broadcast communication model (BCM, for short). With a sequence on n items as input, our algorithm runs in O(/sup n///sub p/log/sup n///sub p/+logk) time on a p-processor, k-channel BCM, a considerable improvement over the state of the art.
A Study of the Efficiency of Shared Attraction Memories in Cluster-Based COMA Multiprocessors
Authors: Anders Landin, Mattias Karlgren
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The performance of a COMA multiprocessor greatly depends on the efficiency of the large node caches, the attraction memories. When more than one processor share an attraction memory its behavior is changed.From experiments with program-driven simulation we have found that clustering may improve the performance of the attraction memory significantly. Traffic is reduced, and the miss rates are lower for shared attraction memories. However, clustering may introduce contention for the attraction memory that may ruin any potential performance gain from increased attraction memory hit rate. Provided enough local bandwidth, application execution can remain efficient at higher memory pressure in clustered systems than in systems with single processor nodes. At very high memory pressure some applications change behavior and start suffering from clustering. This is caused by conflict misses due to the relatively lower associativity of the shared attraction memory.
Opportunities and pitfalls in HDL-based system design
Authors: Rajesh Gupta, Daniel Gajski, Randy Allen, Yatin Trivedi
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

This panel discusses the complexities of system designs using textual Hardware Description Languages (HDLs) such as Verilog and VHDL. As the proliferation of circuits and systems design using HDLs continues questions arise as to whether HDL-based programming provides any real productivity gains in the design of complex integrated hardware. Are there are any alternatives, such as graphical or visual formalisms that are perhaps better suited for the task? We start the discussion by examining the relevant features of today's complex hardware systems and the requirements these impose on the modeling language and methodologies.
Real-Time Traffic Updates in Moving Objects Databases
Authors: Goce Trajcevski, Ouri Wolfson, Bo Xu, Peter Nelson
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This work addresses the problem of updating Moving Objects Databases (MOD) using real-time traffic information. The motion of the object is represented by a trajectory, which can be constructed using the available electronic maps and the information about traffic patterns. However, the statistical information about traffic patterns may change due to accidents, extreme weather conditions, road work, etc.In this work, we present a model for updating the trajectories of moving objects when unexpected traffic conditions occur .Many sites provide an up-to-date information about traffic conditions on major express ways . However, the unexpected traffic conditions may affect not only the vehicles on the express ways for which an on-line monitoring is provided, but may also have an effect on the streets near those express ways. We propose a model of this spill-over effect and we utilize it in the process of identifying the trajectories which are affected by the abnormal traffic.
Action Synchronization over the Web
Authors: Bogdan D. Czejdo, Maciej Zakrzewicz
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The paper discusses the need and the problems associated with web-based cooperative activities in which several team members work in parallel on a common task. Models for software systems supporting such cooperative activities are discussed. Our models describe behavior of each team member and cooperation modes that are of prime importance whenthe system members work at different places and communicate over the Internet. We show conversion of these models into a network message synchronization model, which is the basis for the web software design. The discussion of software architecture for implementing cooperative activities over web is also provided.
Querying Web Data - The WebQA Approach
Authors: Sunny K. S. Lam, M. Tamer Özsu
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

The common paradigm of searching and retrieving informationon the Web is based on keyword-based search usingone or more search engines, and then browsing throughthe large number of returned URLs. This is significantlyweaker than the declarative querying that is supported byDBMSs. The lack of a schema and the high volatility ofWeb make "database-like" querying of Web data difficult.In this paper we report on our work in building a system,called WebQA, that provides a declarative query-based approachto Web data retrieval that uses question-answeringtechnology in extracting information from Web sites that areretrieved by search engines. The approach consists of firstusing meta-search techniques in an open environment togather candidate responses from search engines and otheron-line databases, and then using information extractiontechniques to find the answer to the specific question fromthese candidates. A prototype system has been developedto test this approach. Testing includes evaluation of itsperformance as a question-answering system using a well-knownevaluation system called TREC-9. Its accuracy usingTREC-9 data for simple questions is high and its retrievalperformance is good. The system employs an open systemarchitecture allowing for on-going improvements in variousaspects.
A Structure Based Schema Integration Methodology
Authors: Manuel García-Solaco, Fèlix Saltor, Malú Castellanos
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

The process of integrating the schemas of several databases into an integrated schema is not easy, due to semantic heterogeneities. We present a method/sup 1/ to detect class similarities by following a strategy and applying comparison criteria, that exploits the semantically rich structures of the schemas (previously enriched), along both the generalization/specialization and the aggregation dimensions. Relaxations may be applied to conform a pair of classes, resulting in penalizations in the computation of the degree of similarity. Our approach needs less comparisons than methods based on attribute comparison.
Adaptive Normalization of Handwritten Characters Using Global/Local Affine Transformation
Authors: Toru Wakahara, Kazumi Odaka
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Conventional normalization methods for handwritten characters have limitations as preprocessing operations because they are category-independent. This paper introduces an adaptive or category-dependent normalization method that normalizes an input pattern against each reference pattern using global/local affine transformation (GAT/LAT) in a hierarchical manner as a general deformation model. Experiments using input patterns of 3,171 character categories, including Kanji, Kana, and alphanumerics, written by 36 people in the cursive style against square-style reference patterns show not only that the proposed method can absorb a fair large amount of handwriting fluctuation within the same category but also that discrimination ability is greatly improved by the suppression of excessive normalization against similarly shaped but different categories.
On Distributed Representation of Output Layer for Recognizing Japanese Kana characters Using Neural Networks
Authors: Kanad Keeni, Hiroshi Shimodaira, Kenji Nakayama
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents an automatic coding scheme for representing the output layer of a neural network. Compared to local representation where the number of output unit is p, the number of output unit required for the proposed representation is close to log p. The output of seven different printers were used for evaluating the performance of the system. The proposed automatic representation gave the average recognition rate of 98.7 \% for 71 categories.
Applying Wireless Technologies to Build a Highly Interactive Learning Environment
Authors: Tzu-Chien Liu, Hsue-Yie Wang, Jen-Kai Liang, Tak-Wai Chan, Jie-Chi Yang
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This study tries to apply wireless technologies to build a highly interactive environment. For this purpose, this study first identifies four types of interaction between the members in the technology-embedded classroom contexts, including: (1) face-to-face interaction; (2)computer-mediated interaction; (3) human-computer interaction; and (4) personal device supported simultaneous group interaction. In our analysis, each type of interaction above has its advantages and limitations, and there is no one can achieve all instructional goals along. So, the second purpose of this study is to integrate wireless local area network (WLAN), electronic whiteboard, interactive classroom server, and resource and class management serve to build a highly interactive learning environment, which can support members to flexibly proceed any type of interaction to achieve specific instructional goals. Finally, this study integrates the learning environment design with one of traditional pedagogical models ¿ the Jigsaw? Model to demonstrate how such highly interactive learning environment can best promote instructor's teaching and students' learning.
Semantic Dictionary Design for Database Interoperability
Authors: Silvana Castano, Valeria De Antonellis
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Criteria and techniques to support the establishment of a semantic dictionary for database interoperability are described. The techniques allow the analysis of conceptual schemas of databases in a federation and the definition and maintenance of concept hierarchies. Similarity-based criteria are used to evaluate concept closeness and, consequently, to generate concept hierarchies. Experimentation of the techniques in the public administration domain is discussed.
Towards Real-Time Image Segmentation using Polynomial Functions
Authors: Angel Domingo Sappa, Luiz M. Garcia
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

We present current developments towards a real-time method for segmentation of images for robotics applications. Our algorithm follows a fast scan line procedure (rows and columns), thus breaking the 2D segmentation problem in two 1D processes. In the first phase we use polynomial functions to find possible 1D boundaries in the image columns and rows separately. In a second step, a fusion method is applied, removing redundancies and false boundaries to find the regions of interest in the segmented images. We try to improve the algorithm using a coarse to fine multi-resolution approach. Preliminary results demonstrate possible applicability in real-time.
A New Memory-Saving Technique to Map System of Affine Recurrence Equations (SARE) onto Distributed Memory Systems
Authors: Alessandro Marongiu, Paolo Palazzari, C. Casaccia
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this work we present a procedure for automatic parallel code generation in the case of algorithms described through Set of Affine Recurrence Equations (SARE); starting from the original SARE description in an N-dimensional iteration space, the algorithm is converted into a parallel code for an m-dimensional distributed memory parallel machine (m
A File Naming Scheme Using Hierarchical-Keywords
Authors: Harumasa Tada, Osamu Honda, Masahiro Higuchi
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

We propose a file naming scheme, which we call HK (Hierarchical-Keyword-based) naming. In file systems, hierarchical naming has been used for these several decades. As the number of files stored in file systems increases, the weakness of hierarchical naming is gettingrecognized. Some researchers have proposed hybrid naming schemes which introduce attribute-based naming into hierarchical naming. However, they are unsatisfactory or too complicated. HK naming is the hybrid naming scheme that integrates hierarchical naming and attribute-based naming in a simple way. In HK naming, a file is named by a set of keywords and keywords are organized hierarchically. We illustrate the usefulness of HK naming by showing that HK naming can solve some problems in practical usage of file systems.
Reverse Engineering Concurrent Programs using Formal Modelling and Analysis
Authors: E. J. Younger, Z. Luo, Keith H. Bennett, T. M. Bull
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

We describe a formally based approach to reverse engineering programs with concurrent constructs. This has been a topic which has not previously been addressed, yet is required for safety critical systems and many others. To achieve this we have used a transformation based approach which has been successful in coping with sequential systems. To accommodate concurrency we have extended the core kernel language (WSL) and introduce and then prove new transformations. We then describe preliminary results. The novel aspects of this work are the application of formal program transformations to the maintenance of concurrent software, and the use of modern type theory and type checking/proof tools to extend our existing method and the tool to new domains, namely concurrency and safety critical systems.