ppxscal/embedding_network huggingface dataset:
Storing and Maintaining Semistructured Data Efficiently in an Object-Relational Database
Authors: Yuanying Mo, Tok Wang Ling
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

We propose to use object-relational databasemanagement systems to store and manage semi-structureddata. ORA-SS (Object-Relationship-Attribute model forSemi-Structured data) [9] is used as the data model. Itnot only reflects the nested structure of semi-structureddata, but also distinguishes between object classes andrelationship types, and between attributes of objectclasses and attributes of relationship types. ORA-SS canspecify the degree of n-ary relationship types and indicateif an attribute is an attribute of a relationship type or anattribute of an object class. Existing semi-structured datamodels cannot specify such information. We use theseinformation to translate XML Schemas/DTD to ORA-SSschemas, then to object-relational databases correctlyand without avoidable redundancy. The existingtechniques have a lot of redundancy in storage andintroduce node IDs of the tree instance which are notneeded in our approach.
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output
Authors: Arnold L. Rosenberg
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We derive efficient guidelines for scheduling data-parallel computations within a draconian mode of cycle-stealing in networks of workstations wherein an interruption by the owner of the "borrowed" workstation kills all jobs currently in progress. We derive both adaptive and non-adaptive scheduling guidelines that maximize, up to low-order additive terms, the amount of work that one is guaranteed to accomplish during a cycle-stealing opportunity, no matter when the opportunity is interrupted-up to a prespecified number of times.
Reconstruction by using a Wavelet Representation of the Algebraic Radon Transform
Authors: José Geraldo Franco Méxas, Antônio De Oliveira, Claudio Esperança
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

We use a wavelet representation of the algebraic Radon transform for reconstructing an image from its sinogram at a controlled level of resolution.
Supporting Collaborative Activities in Computer Integrated Classrooms-the NIMIS Approach
Authors: Heinz Ulrich Hoppe, Andreas Lingnau, Isabel Machado, Ana Paiva, Rui Prada, Frank Tewissen
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

The paper presents the concept of a collaborative computer integrated classroom (CiC) specially designed to achieve a unique combination of interactive and collaborative software with spatial arrangements, special furniture, and new peripherals including furniture ("roomware"). Although, technologically innovative, the CiC approach respects grown pedagogical traditions and classroom procedures. In line with the notion of ubiquitous computing, it tries to augment the real classroom instead of defining a virtual learning environment. Based on these principles, the European NIMIS project has put into practice a specific classroom environment for early learning with general tools and specific applications supporting literacy-related activities. In addition to the collaborative nature of the classroom scenario as such, specific mechanisms for co-construction in shared workspaces are provided.
Application Transformations for Energy and Performance-Aware Device Management
Authors: Taliver Heath, Eduardo Pinheiro, Jerry Hom, Ulrich Kremer, Ricardo Bianchini
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Energy conservation without performance degradation is an important goal for battery-operated computers, such as lap-tops and hand-held assistants. In this paper we determine the potential benefits of application-supported device management for optimizing energy and performance. In particular, we consider application transformations that increasedevice idle times and inform the operating system about the length of each upcoming period of idleness. We assess the potential energy and performance benefits of this type of applicationsupport for a laptop disk. Furthermore, we propose and evaluate a compiler framework for performing the transformations automatically for a disk device. Our experimental results demonstrate that unless applications are transformed, they cannot accrue any of the predicted benefits. In addition, they show that our compiler can produce almost the same performance and energy results that we obtain by hand-modifying applications. Overall, we find that the transformations we propose can reduce disk energy consumption from 55% to 89% with only a small degradation in performance.
A Generic Query-Translation Framework for a Mediator Architecture
Authors: Jacques Calmet, Sebastian Jekutsch, Joachim Schü
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

A mediator is a domain-specific tool to support uniform access to multiple heterogeneous information sources and to abstract and combine data from different but related databases to gain new information. This middleware product is urgently needed for these frequently occurring tasks in a decision support environment. In order to provide a front end, a mediator usually defines a new language. If an application or a user submits a question to the mediator, it has to be decomposed into several queries to the underlying information sources. Since these sources can only be accessed using their own query language, a query translator is needed. This paper presents a new approach for implementing query translators. It supports conjunctive queries as well as negation. Care is taken to enable information sources of which processing capabilities do not allow conjunctive queries in general. Rapid implementation is guided by reusing previously prepared code. The specification of the translator is done declaratively and domain--independent.
Evaluating Bayes nets with concurrent process networks
Authors: Evan Tick, Bruce D'Ambrosio
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The computation complexity of the total probability mass of a leaf node of a general Bayes network can be exponential in the number of ancestor nodes of that leaf. It is a well known result that for a large class of networks, a number of minterms only linear in the number of ancestor nodes contributes about 67% of the total probability mass. The problem of Bayes net search is to generate only these high mass minterms. We introduce a concurrent algorithm for attempting this, based on converting the net into a concurrent process network. Each parent node sends messages containing partial minterms to child nodes. The novel idea is to prioritize these messages to give higher weight to partial terms that are likely candidates for inclusion in the final high mass minterms. We have implemented this algorithm in KL1 and discuss its attributes.
Intelligent Virtual Environment and Camera Control in Behavioural Simulation
Authors: Flavia Pereira Ferreira, Giorgenes Gelatti, Soraia Raupp Musse
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper presents a model describing Intelligent Information present in the Virtual Environment, as well as the Camera Control. We are interested in modeling Intelligent Virtual Environments, integrated with our Intelligent Camera control in order to provide information to be used in behavioural simulations. Our main goal is to be able to populate Virtual Environments with virtual agents endowed with different Levels of Autonomomy: from guided to autonomous.
Using Informal and Formal Techniques for the Reverse Engineering of C Programs
Authors: Gerald C. Gannod, Betty H. C. Cheng
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Reverse engineering of program code is the process of constructing a higher level abstraction an implementation in order to facilitate the understanding of system that may be in a legacy" or "geriatric" state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer program code. At the same time, there is a need to preserve the functionality of existing systems as well as reason about the correctness of changed code, each of which is facilitated by the existence of formal specifications. This paper describes an approach that incorporates the use of semi-formal analysis and formal program semantics to reverse engineer C programs. The reverse engineering techniques are applied to a portion of a ground-based command system for unmanned flight systems.
A Decentralized Authorization Mechanism for E-Business Applications
Authors: Zoltán Miklós
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

E-business applications need robust and powerful mechanisms to authorize security-critical actions. This actions can be very complex, since they can be initiated not only by human users but also by applications or software agents.Existing authorization mechanisms do not scale for large number of users if the trust relations are dynamic and fail to provide reliable authorization among strangers. Our mechanism uses authorization relevant attributes to define the policy. The attributes are assigned to principals in a decentralized manner.We also present a method to reduce the financial losses which may arise if the authorization mechanism fails.We conclude the paper with our plans for future research.
Buffer and I/O Resource Pre-allocation for Implementing Batching and Buffering Techniques for Video-on-Demand Systems
Authors: M. Y. Y. Leung, John C. S. Lui, Leana Golubchik
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

To design a cost effective VOD server, it is important to carefully manage the system resources so that the number of concurrent viewers can be maximized. Previous research results use data sharing techniques, such as batching, buffering and piggybacking, to reduce the demand for I/O resources in a VOD system. However, these techniques still suffer from the problem that additional I/O resources are needed in the system for providing VCR functionality --- without careful resource management, the benefits of these data sharing techniques can be lost. In this paper, we first introduce a model for determining the amount of resources required for supporting both normal playback and VCR functionality to satisfy predefined performance characteristics. Consequently, this model allows us to maximize the benefits of data sharing techniques. Furthermore, one important application of this model is its use in making system sizing decisions. Proper system sizing will result in a more cost-effective VOD system.
A CORBA-Based Architecture for Service Change Notification
Authors: Twittie Senivongse, Pasin Suriyentrakorn
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: The nature of distribution and autonomy in an open environment makes it difficult to maintain a consistent view of service provision among distributed groups of clients. Change in services may have an impact on current operation of clients if they are not properly informed. Better management for change notification is necessary so as for the clients to be able to prepare for the change accordingly. This paper proposes a service change notification system that can manage service change events for subscribing clients. The architecture of this service is CORBA-based as it cooperates with a CORBA Trading Service to gather change events and has an Event Notification Service as the core component for change notification. Service providers can also register with this system to announce change events, and clients can subscribe for notification of change in services of their interest, specifying their preference for delivery style, notification format, and quality of service.
A Hybrid Object Clustering Strategy for Large Knowledge-Based Systems
Authors: Arun Ramanujapuram, Jim E. Greer
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Object bases underlying knowledge-based applications tend to be complex and require management. This research aims at improving the performance of object bases underlying a class of large knowledge-based systems that utilize object-oriented technology to engineer the knowledge base. In this paper, a hybrid clustering strategy that beneficially combines semantic clustering and iterative graph-paritioning techniques has been developed and evaluated for use in knowledge bases storing information in the form of object graphs. It is demonstrated via experimentation that such a technique is useful and feasible in realistic object bases. A semantic specification mechanism similar to placement trees has been developed for specifying the clustering. The workload and the nature of object graphs in knowledge bases differ significantly from those present in conventional object-oriented databases. Therefore, the evaluation has been performed by building a new benchmark called the Granularity Benchmark. A segmented storage scheme for the knowledge base using large object storage mechanisms of existing storage managers is also examined.
A Speech Orientation Animation System to Disabled People
Authors: Jesuliana Nascimento Ulysses, Aura Conci
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Audio disabled children or adults under oral rehabilitating therapy learn how to treat speech disorders or even how utter sounds imitating mouth elements position and movement. This technique has been proved beneficial to help people since specialized instructional programadopt it. The main proposal of this work is the development of an affordable tool to aid in thistherapy.
Evaluating options in a context
Authors: John F. Horty, Martha E. Pollack
Venue: Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge (1998)

The theory of rational choice, as formulated in the economic and philosophical literature, assumes that agents evaluate alternative actions by reference to a probability distribution over their possible outcomes together with a utility function defined on those outcomes: in the simplest case, the agent combines probability and utility into a notion of expected utility defined over actions, and then chooses some action whose expected utility is maximal. A good deal of attention has been devoted to the structure of those utility functions that might actually be thought to underlie human decision making [9], and the more applied literature on decision analysis has focused on the task of eliciting such preference information from humans [8]. When we attempt to build artificial agents that are capable of making rational decisions, we likewise need to provide them with techniques for evaluating the options they encounter.
Using Channels for Multimedia Communication
Authors: David May, Henk L. Muller
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this paper we present a paradigm to express streams and its implementation. Streams are a convenient mechanism to communicate multimedia data, for example video or audio, between systems. The paradigm is based on channels, as found in CSP and Occam, but with two important modifications. First, our Flexible Channels can be connected dynamically, and passed around as first class objects. Second, although synchronous in nature, the compiler and run time support will implement communication over channels in a less synchronised mode, when program semantics allow for this. With this technique, a programmer can use a high level language to communicate tiny messages (audio samples) at a high data rate. We have initially used streaming mode to optimise inter node communications, but we hope to use optimisations based on the same techniques to reduce overheads of communications within a node.
The Unique Reference NCSLOC Metric
Authors: Stephanie D. Crouch, Dick B. Simmons
Venue: 23rd International Computer Software and Applications Conference (1999)

We propose that by utilizing certain metrics and gathering operating system information it can be determined if a file is a version or duplicate of another file on the system. In a software development environment knowing what files are versions of other files would be beneficial in many areas. It would help a manager estimate the amount of code that needs to be modified in a reengineering project. When comparing files to a software reuse library the amount of reuse can be measured. If a survey is being done on the entire contents of the computer's file system, then all code for a variety of programming languages can be located and the amount of new and the reused code can be quantified. Following is a description of the metrics, how they are collected, and the results of processing a large number of files using the metrics.
Lexical Analyzer based on a Self-Organizing Feature Map
Authors: G. Menier, Guy Lorette
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In a lexical analyzer, the scanning of a whole dictionary using an editing distance is of very high computational cost. We present a lexical analyzer designed to focus on a very limited sub-set of the whole dictionary. The system is based on a Self-Organizing Feature Map which maps the dictionary on a two-dimensional space. The neighborhood relationships on this space are then used to define a short list of hypotheses. We introduce a multi-staged pyramidal network to speed-up the access and we present the performance of the system. these results are then interpreted.
FlExPat: Flexible Extraction of Sequential Patterns
Authors: Pierre-Yves Rolland
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper addresses sequential data mining, a sub-area of data mining where the data to be analyzed is organized in sequences. In many problem domains a natural ordering exists over data. Examples of sequential databases (SDBs) include: (a)collections of temporal data sequences, such as chronologicalseries of daily stock indices or multimedia data (sound, music, video..); and (b) macromolecule banks, where aminoacid or proteic sequences are represented as strings.In a SDB it is often valuable to detect regularities through one or several sequences. In particular, finding exact or approximate repetitions of segments ca be utilized directly (e.g.for determining the biochemical activity of a protein region) or indirectly, e.g. for prediction in finance. To this end, we present concepts and an algorithm for automatically extracting sequential patterns from a sequential database. Such a patter is defined as a group of significantly similar segments from one or several sequences. Appropriate functions for measuringsimilarity between sequence segments are proposed, generalizing the edit distance framework. There is a trade off here between flexibility, particularly in sequence data representation and in associated similarity metrics, and computational efficiency. Wedesigned the FlExPat algorithm to satisfactorily cope with this trade-off. FlExPat's complexity is in practice lesser than quadratic in the total length of the SDB analyzed, while allowinghigh flexibility. Some experimental results obtained with FlExPat on music data are presented and commented.
Latency Tolerance: A Metric for Performance Analysis of Multithreaded Architectures
Authors: Shashank S. Nemawarkar, Guang R. Gao
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Multithreaded multiprocessor systems (MMS) have been proposed to tolerate long latencies for communication. This paper provides an analytical framework based on closed queueing networks to quantify and analyze the latency tolerance of multithreaded systems. We introduce a new metric, called the tolerance index, which quantifies the closeness of performance of the system to that of an ideal system. We characterize the latency tolerance with the changes in the architectural and program workload parameters. We show how an analysis of the latency tolerance provides an insight to the performance optimizations of fine grain parallel program workloads.
Adaptive Document Binarization
Authors: Jaakko J. Sauvola, Tapio Seppänen, Sami Haapakoski, Matti Pietikäinen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A new method is presented for adaptive document image binarization, where the page is considered as a collection of subcomponents such as text, background and picture. The problems caused by noise, illumination and many source type related degradations are addressed. The algo= rithm uses document characteristics to determine (surface) attributes, often used in document segmentation. Using characteristics analysis, two new algorithms are applied to determine a local threshold for each pixel. An algorithm based on soft decision control is used for thresholding background and picture regions. An approach utilizing local mean and variance of gray values is applied to textual regions. Tests were performed with images including different types of document components and degradations. The results show that the method adapts and performs well in each case.
An efficient systolic array for the discrete cosine transform based on prime-factor decomposition
Authors: Hyesook Lim, Earl E. Swartzlander,  Jr.
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

A new design of a systolic array for computing the discrete cosine transform (DCT) based on prime-factor decomposition is presented. The basic principle of the proposed systolic array is that one-dimensional (1-D) DCT can be decomposed to a 2-dimensional (2-D) DCT by input and output index mappings and the 2-D DCT is computed efficiently on a 2-D systolic array. We modify Lee's input index mapping method in order to construct one input mapping table instead of three input index mapping tables. The proposed systolic array avoids the need for the array transposer that was required by earlier implementations for the prime-factor DCT algorithms, and thus all processing can be pipelined. The proposed design of systolic array provides a simple and regular structure, which is well suited for VLSI implementation.
A Nested Invocation Suppression Framework for Active Replication Fault-Tolerant CORBA
Authors: Deron Liang, Chen-Liang Fang, JiChiang Tsai
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Active replication is a common approach to building highly available and reliable distributed software applications. The redundant nested invocation (RNI) problem arises when servers in a replicated group issue nested invocations to another server group in response to a client invocation. Automatic suppression of RNI is always a desirable solution, yet it is usually a difficult design issue. In this research, we propose a new determinism reference model based on accomplishing the verification process in a more systematic manner. The proposed determinism reference model consists of four levels, namely: ideal determinism, isomorphic determinism, similar determinism, and non-determinism. We consider a class of multi-threading CORBA environments to demonstrate the power of the proposed determinism reference model.