ppxscal/embedding_network huggingface dataset:
Minute Feature Analysis in Speckled Imagery
Authors: Alejandro César Frery, Francisco Cribari-Neto, Marcelo de O. Souza
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. This paper tackles the problem of estimating the parameters of relevant distributions that describe speckled imagery. Speckle noise appears in data obtained with coherent illumination, as is the case of sonar, laser, ultrasound-B and synthetic aperture radar images. This noise is non-Gaussian and non-additive and, therefore, classical techniques of processing and analysis may fail. A universal parametric statistical model has been proposedfor such data, and numerical issues arise when estimating its parameters. In particular, the usual techniques for optimization and for solving systems of non-linear equations often fail to converge and/or to produce acceptable results, specially when dealing with small samples. An alternated method is proposed and assessed, and it is shown to produce sensible results. As an application, real and simulated data are analyzed. We show that the discrimination of minute features in synthetic aperture radar images can be performed using the proposed procedure.
Semantics and Logic of Object Calculi
Authors: Bernhard Reus, Thomas Streicher
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

The main contribution of this paper is a formal characterization of recursive object specifications based on a denotational untyped semantics of the object calculus and thediscussion of existence of those (recursive) specifications. The semantics is then applied to prove soundness of a programming logic [2] for the object calculus [1] and to suggestpossible extensions. For the purposes of this discussion we use an informal logic of predomains in order to avoid any commitment to a particular syntax of specification logic.
DSVOL II - A Distributed Visualization and Sonification Application Communicating via an XML-Based Protocol
Authors: Veridiana Christie Lucas Salvador, Rosane Minghim, Haim Levkowitz
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Distribution of the visualization process over the World-Wide Web allows remote access to expensive resources, and the cooperation amongst teams of experts that are located in different places. This paper presents an architecture and a corresponding prototype implementation of a distributed system for visualization and sonification of scientific data. The distribution is accomplished by the addition of visualization and sonification servers, accessible over the Internet, and implemented using an XML-based SOAP (Simple Object Access Protocol) protocol. The system is an evolution of a previously-developed prototype, with improvement in the visualization and in the distribution aspects of the architecture. Former distribution scheme employed CORBA (Common Object Request Broker). A discussion on the use of both distribution tools is given in the light of visualization tasks.
Layout and Language: Preliminary Investigations in Recognizing the Structure of Tables
Authors: Matthew Hurst, Shona Douglas
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We describe a prototype system for assigning table cells to their proper place in the logical structure of the table, based on a simple model of table structure combined with a number of measures of \term{cohesion} between cells. A framework is presented for examining the effect of particular variables on the performance of the system, and preliminary results are presented showing the effect of cohesion measures based on the simplest domain-independent analyses, with the aim allowing future comparison with more knowledge-intensive analyses based on Natural Language Processing. These baseline results suggest that very simple string-based cohesion measures are not sufficient to support the extraction of tuples as we require. Future work will pursue the aim of more adequate approximations to a notional subtype/supertype definition of the relationship between value cells and label cell.
Analytical Partition of Software Components for Evolvable and Reliable MEMS Design Tools
Authors: Carol L. Hoover, Pradeep K. Khosla
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Transforming software requirements into a software design involves the iterative partition of a solution into software components. The process is human-intensive and does not guarantee that design objectives such as reusability, evolvability, and reliable performance are satisfied. The costly process of designing, building, and modifying high assurance systems motivates the need for precise methods and tools to generate designs whose corresponding implementations are reusable, evolvable, and reliable. This paper demonstrates an analytical approach for partitioning basic elements of a software solution into reusable and evolvable software components. First, we briefly overview the role of partitioning in current design methods and explain why computer-aided design (CAD) tools to automate the design of microelectromechanical systems (MEMS) are high assurance applications. Then we present our approach and apply it to the design of CAD software to layout an optimized design of a MEMS accelerometer to be used in the navigational units of aircraft. Lastly, we discuss the implications of our approach and future research directions.
Modeling the impact of run-time uncertainty on optimal computation scheduling using feedback
Authors: R. D. Dietz, Thomas L. Casavant, Todd E. Scheetz, Terry A. Braun, Mark S. Andersland
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Increasingly, feedback of measured run-time information is being used in the optimization of computation execution. This paper introduces a model relating the static view of a computation to its run-time variance that is useful in this context. A notion of uncertainty is then used to provide bounds on key scheduling parameters of the run-time computation. To illustrate the relationship between fidelity in measured information and minimum schedulable, grain size, we apply the bounds to three existing parallel architectures for the case of run-time variance caused by monitoring intrusion. We also outline a hybrid static-dynamic scheduling paradigm-SEDIA-that uses the model of uncertainty to optimize computation for execution in the presence of run-time variance from sources other than monitoring intrusion.
A Feature for Character Recognition Based on Directional Distance Distributions
Authors: Il-Seok Oh, Ching Y. Suen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The performance of a character recognition system depends heavily on what features are being used. Though many kinds of features have been developed and their test performances on standard database have been reported, there is still room to improve the recognition rate by developing an improved feature. In this paper, we propose a new feature based on DDD (Directional Distance Distribution) information. This new concept regards the input pattern array as being circular. Also it contains very rich information by encoding in one representation both the white/black distribution and the directional distance distribution. A test performed on the CENPARMI handwritten numeral database showed a promising result of 97.3% recognition with a neural network classifier using the DDD feature.
Hybrid Role Hierarchy for Generalized Temporal Role Based Access Control Model
Authors: James B. D. Joshi, Elisa Bertino, Arif Ghafoor
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Generalized Temporal Role Based Access Control (GTRBAC) model that captures an exhaustive set of temporal constraint needs for access control has recently been proposed. GTRBAC's language constructs allow one to specify various temporal constraints on role, user-role assignments and role-permission assignments. In this paper, we present the notion of different types of role hierarchies based on the permission-inheritance and role activationsemantics. In particular, we look at how new hierarchical relations between a pair of roles that are not directly related can be derived through other well-defined hierarchically related roles. When the different hierarchy types coexist in a role hierarchy, inferring such derived hierarchical relations between a pair of roles can be complex. The results presented here provides a basis for formally analyzing the derived inheritance and activation semantics between every pairs of roles in a hierarchy.
Efficient Parallel Algorithms for Selection and Multiselection on Mesh-Connected Computers
Authors: Hong Shen
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 set of efficient parallel algorithms for selection and multiselection on a vp × vp mesh-connected computer.
Awareness in Logic and Cognitive Neuroscience
Authors: Ahti Pietarinen
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Cognitive neuroscience has provide d important insights into the notions like implicit versus explicit information processing in perception, object identification, memory, and general information retrieval. Even more topically, neuroscience has brought the notion of awareness in the forefront of human knowledge. Yet the logical reflections of awareness and the implicit/explicit distinction have remained by and large uncharted. To improve on this situation, we introduce cognitively motivated logical operators related to actual experimental aspects of awareness into the modal language. Their semantics is given by grounding logical senses of awareness on a dynamic structure of possible worlds. We show that many neuroscientific findings on neural dysfunctions can be made to contribute to the logical level of investigation. In particular, the logics of awareness are enriched by experimental findings on brain and cognitive disorders such as blindsight, unilateral neglect, prosopagnosia, and implicit memory.
An Empirical Study of Admission Control Strategies in Video Servers
Authors: Tzi-cker Chiueh, Michael Vernick
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

A video server guarantees the I/O bandwidth required for the smooth playback of a video access request once it has been admitted into the system. To ensure that new video access requests will not jeopardize the bandwidth guarantees promised to existing streams, an admission control module that decides whether a new request should be granted based on the resource usage is essential in the design of video servers. This paper presents a general framework in which video server admission control algorithms can be described in terms of how I/O delays are estimated. Then five specific admission control algorithms are studied in detail. The performances of these algorithms are analyzed in the context of an operational disk-array-based video server called SBVS. Detailed measurements from actual implementations of these admission control algorithms are used to compare their performances in terms of the maximum numbers of streams that can be admitted without causing overloads. One surprising result from this work is that the performance gap between the statistical and deterministic algorithms is between 10% to 40%, which is much smaller than were reported in earlier work.
A Consistent History Link Connectivity Protocol
Authors: Paul S. LeMahieu, Jehoshua Bruck
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal computers, workstations and interconnect technologies. In particular, the issue of reliable communication is addressed by introducing redundancy in the form of multiple network interfaces per compute node.When using compute nodes with multiple network connections the question of how to determine connectivity between nodes arises. We examine a connectivity protocol that guarantees that each side of a point-to-point connection sees the same history of activity over the communication channel. In other words, we maintain a consistent history of the state of the communication channel. At any give moment in time the histories as seen by each side are guaranteed to be identical to within some number of transitions. This bound on how much one side may lead or lag the other is the slack.Our main contributions are: (i) a simple, stable protocol for monitoring connectivity that maintains a consistent history with bounded slack, and (ii) proofs that this protocol exhibits correctness, bounded slack, and stability.
A method for connecting disappeared junction patterns on frame lines in form documents
Authors: Hiroshi Shinjo, Kazuki Nakashima, Masashi Koga, Katsumi Marukawa, Yoshihiro Shima, Eiichi Hadano
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Form document structure analysis is an essential technique for recognizing the positions of characters in general forms. However, it has a fundamental problem that interruptions of lines, as well as noise, lead to incorrect analysis. The paper focuses on a method for connecting junction patterns in which portions of the horizontal and vertical lines are not visible, referred to as "disappeared junction patterns". Our method has two key stages for making correct connections. The first is noise elimination, in which lines whose two end points meet no other lines and which are shorter than the minimum line length parameter, are eliminated. The second is object line selection, where only frame lines of tables are selected as object lines for connection. Experiments with 39 form images demonstrated the feasibility of this method.
Exploiting task and data parallelism in parallel Hough and Radon transforms
Authors: Dilip Krishnaswamy, Prithviraj Banerjeer
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Edge detection and shape detection in digital images are very computationally intensive problems. Parallel algorithms can potentially provide significant speedups while preserving the quality of the result obtained. Hough and Radon Transforms are projection-based transforms which are commonly used for edge detection and shape detection respectively. We propose in this paper various new parallel algorithms which exploit both task and data parallelism available in Hough and Radon transforms algorithms. A memory scalable aggressive task parallel algorithm is shown to be the most optimal algorithm in terms of memory scalability and performance on an IBM SP2.
Formalization of Software Testing Criteria using the Z Notation
Authors: Sergiy A. Vilkomir, Jonathan P. Bowen
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

This paper describes an approach to formalization of criteria of computer systems software testing. A brief review of control-flow criteria is introduced. As a formal language for describing the criteria, the Z notation is selected. Z schemas are presented for definitions of the following criteria: statement coverage, decision coverage, condition coverage, decision/condition coverage, full predicate coverage, modified condition/decision coverage, and multiple condition coverage. This characterization could help in the correct understanding of different types of testing and also the correct application of a desired testing regime.
Concurrent Embedded Real-Time Software Verification
Authors: Pao-Ann Hsiung
Venue: 24th International Computer Software and Applications Conference (2000)

The verification of software is more complex than hardware due to inherent flexibilities (dynamic behavior) that incur a multitude of possible system states. The verification of Concurrent Embedded Real-Time Software (CERTS) is all the more difficult due to its concurrency and embeddedness. The work presented here shows how the complexity of CERTS verification can be reduced significantly through answering common engineering questions such as when, where, and how one must verify embedded software. Application examples illustrate the usefulness of our technique in increasing verification scalability.
Preprocessors from an Abstract Point of View
Authors: Jean-Marie Favre
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

It is well known that the extensive use of preprocessors can lead to serious maintenance problems. However, these tools are still heavily used by developers and maintainers to implement software variants. Without adequate tools, understanding complex preprocessor files is a really tedious task. Problems are difficult to formulate and seem very specific. This paper shows that considering preprocessors from an abstract point of view can lead to surprising results. The use of abstractions considerably increases problem comprehension and solutions can be derived directly from existing techniques like slicing, program specialization or interprocedural data flow analysis. The preprocessor of the C language (CPP), is taken as a case study, and the functionalities of Champollion/APP, a tool for preprocessor maintenance, are briefly described.
Dynamically Evolvable Distributed Systems
Authors: Raju Pandey, Scott Malabarba, Tim Stapko, Brant Hashii
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Software systems must change over time. Changing business practices, the relentless advance of technology, and the demands of end users drive this evolution. The functionalityrequired of applications inevitably changes in response to these factors. Consequently, in order to remain viable, applications must evolve to meet new requirements. Software component evolution is a major focus of effort in software engineering [15, 26].
Efficient Processing of Proximity Queries for Large Databases
Authors: Walid G. Aref, Daniel Barbará, Stephen Johnson, Sharad Mehrotra
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Emerging multimedia applications require database systems to provide support for new types of objects and to process queries that may have no parallel in traditional database applications. One such important class of queries are the proximity queries that aims to retrieve objects in the database that are related by a distance metric in a way that is specified by the query. The importance of proximity queries has earlier been realized in developing constructs for visual languages. In this paper, we present algorithms for answering a class of proximity queries-fixed-radius nearest-neighbor queries over point object. Processing proximity queries using existing query processing techniques results in high CPU and I/O costs. We develop new algorithms to answer proximity queries over objects that lie in the one-dimensional space (e.g., words in a document). The algorithms exploit query semantics to reduce the CPU and I/O costs, and hence improve performance. We also show how our algorithms can be generalized to handle d-dimensional objects.
Multi-Threaded Design and Implementation of Parallel Pipelined STAP on Parallel Computers with SMP Nodes
Authors: Wei-keng Liao, Alok N. Choudhary, Donald Weiner, Pramod K. Varshney
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper presents performance results for the multi-threaded design and implementation of a parallel pipelined Space-Time Adaptive Processing (STAP) algorithm on parallel computers with Symmetrical Multiple Processor (SMP) nodes. In particular, the paper describes our approach to parallelization and multi-threaded implementation on an Intel Paragon MP system. Our goal is to determine how much more performance can be enhanced using small SMPs on each node of a large parallel computer for such an application. The paper also discusses the process of developing software for such an application on parallel computers when latency and throughput are both considered together and presents their tradeoffs. The results show that not only scalable performance was achieved for individual component tasks of STAP but linear speedups were obtained for the integrated task performance, both for latency as well as throughput.
Distributing Semantic Constraints Between Heterogeneous Databases
Authors: Stefan Grufman, Fredrik Samson, Suzanne M. Embury, Peter M. D. Gray, Tore Risch
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

In recent years, research on distributing databases over networks has become increasingly important. In this paper, we concentrate on the issues of the interoperability of heterogeneous DBMSs and enforcing integrity across a multi-database made in this fashion. This has been done through a cooperative project between Aberdeen and Linko/spl uml/ping universities, with database modules distributed between the sites. In the process, we have shown the advantage of using DBMSs based on variants of the functional data model (FDM), which has made it remarkably straightforward to interoperate queries and schema definitions. Further, we have used the constraint transformation facilities of P/FDM (Prolog implementation of FDM) to compile global constraints into active rules installed locally on one or more AMOS (Active Mediators Object System) servers. We present the theory behind this, and the conditions for it to improve performance.
A Transactional Nested Process Management System
Authors: Qiming Chen, Umeshwar Dayal
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Providing flexible transaction semantics and incorporating activities, data and agents are the key issues in workflow system development. Unfortunately, most of the commercial workflow systems lack the advanced features of transaction models, and an individual transaction model with specific emphasis lacks sufficient coverage for business process management.This report presents our solutions to the above problems in developing Open Process Management System (OPMS) at HP Labs. OPMS is based on nested activity modeling with the following extensions and constraints: in-process open nesting} for extending closed/open nesting to accommodate applications that require improved process-wide concurrency without sacrificing top-level atomicity; confined open as a constraint on open and in-process open activities for avoiding the semantic inconsistencies in activity triggering and compensation; and two-phase remedy as a generalized hierarchical approach for handling failures.