ppxscal/embedding_network huggingface dataset:
Industrial software architecture with Gestalt
Authors: R. W. Schwanke, V. A. Strack, T. Werthmann-Auzinger
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

The architecture of a software system specifies, among other things, its decomposition into parts and the communication between those parts. The structure of this decomposition and interconnection is separable from the protocols (types and sequencing) of communication. A language for specifying this structure and a toolset for checking consistency between structure specifications and code would provide substantial benefits to practicing industrial software architects. Gestalt is an architecture language for specifying structure, with separate, partial support for protocol specifications. The Gestalt toolset checks structural consistency between the architecture and the code. It specifies and checks protocol type compatibility at the interfaces, using the implementation language and tools (e.g. compiler). It provides annotation support for sequencing and other architectural information.
Knowledge Management: Current Issues and Challenges
Authors: Elayne Coakes
Venue:  (2003)

:This scholarly discussion of managerial challenges details the most recent research on how organizations can better create, share, and exploit knowledge. Spanning the business and public service context, the information provided covers practical issues such as measuring returns, establishing trust, and integrating technology. Also discussed are knowledge management systems, Internet support, and information systems development.Author Biography: Elayne Coakes is a senior lecturer in business information management at the University of Westminster. She is the author of Socio-Technical and Human Cognition Elements of Information Systems, The New Sociotech, and Knowledge Management in the Socio-Technical World.
Hidden line removal for 2D cartoon images
Authors: Zhanggui Zeng, Hong Yan
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

In this paper, we describe a hidden line removal scheme for 2D cartoon images. The depths are introduced to the polylines of the image. The surfaces of the image are classified and their depths updated according to the depths of polylines forming the surfaces. The hidden lines are identified by comparing the depths of the polylines with the depths of the surfaces. This algorithm has been applied successfully to our cartoon development system.
Methodologies, tools and languages for building ontologies: where is their meeting point?
Authors: Oscar Corcho, Mariano Fernández-López, Asunción Gómez-Pérez
Venue: Data Knowledge Engineering (2003)

In this paper we review and compare the main methodologies, tools and languages for building ontologies that have been reported in the literature, as well as the main relationships among them. Ontology technology is nowadays mature enough: many methodologies, tools and languages are already available. The future work in this field should be driven towards the creation of a common integrated workbench for ontology developers to facilitate ontology development, exchange, evaluation, evolution and management, to provide methodological support for these tasks, and translations to and from different ontology languages. This workbench should not be created from scratch, but instead integrating the technology components that are currently available.
Performance of a Class of Highly-Parallel Divide-and-Conquer Algorithms
Authors: John Thornley
Venue:  (1995)

A wide range of important problems have efficient methods of solution based on the divide-and-conquer strategy. However, the traditional approach to parallel divide-and-conquer does not scale well due to the sequential component of the algorithms. We investigate the performance of a non-traditional, highly-parallel divide-and-conquer strategy that we refer to as "one-deep parallel divide-and-conquer". As representative examples, we measure and analyze the performance of highly-parallel variants of the quicksort and mergesort algorithms on a shared-memory multiprocessor. Both algorithms deliver impressive speedups. We present a systematic approach to modeling the performance of one-deep parallel divide-and-conquer algorithms and we demonstrate this approach with the two parallel sorting algorithms.
Quicken 2003: The Official Guide, 1 edition
Authors: Maria Langer
Venue:  (2002)

:Manage your finances with help from this official guide to the latest release of the world's #1 personal finance software! Endorsed and reviewed by Intuit, this resource offers up-to-date coverage of the newest product tools as well as the classic features. Learn to manage your money and investments, and track and regulate spending, savings, budgets, banking, and more.
Multimedia synchronization
Authors: Michal Haindl
Venue:  (1995)

This paper presents a hierarchical synchronization model for the description of the time relations and regimes necessary for the presentation of multimedia or animated data which have either natural or implied time dependencies. The model generalizes some previous multimedia synchronization models by unifying time and event based synchronization concepts and offering a consistent framework in which to handle dynamic media presentation functionality.
O3F: an object oriented ontology framework
Authors: Luís Mota, Luís Botelho, Hugo Mendes, António Lopes
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes an object-oriented framework for ontology representation, which was derived from the analysis of a set of use cases for ontology services provided by ontology agents in open agent networks. The described use cases are converted into a set of requirements for the Information System supporting the ontology service.Each ontology on the server has classes, properties and methods. Classes have attributes, which are properties, methods and axioms. Attributes have facets. Methods have arguments, return value and method definition through axioms. Classes and properties may be arranged in hierarchies. The proposed framework accommodates the expression of arbitrary axioms about the entities in the ontology. We propose a situation calculus approach for describing the action methods of the ontology. Action methods are described by state change and state constraint axioms. The frame problem is handled assuming that nothing changes unless explicitly stated.We present the definition of several relations between entities of different ontologies that allow inferring global relations between those ontologies. Finally, we propose Extended-SL as the Representation Language of O3F.
Programming with Shared Bulletin Boards in Asynchronus Distributed Systems
Authors: Kenneth P. Birman, Thomas A. Joseph, Frank B. Schmuck, Patrick Stephenson
Venue:  (1986)

We consider loosely coupled distributed computing systems in which processes interact through shared resources, which are modeled as bulletin boards. The first part of the paper formalizes the notion of consistent behavior when unreliable processes concurrently access a bulletin board. This model is interesting both as a tool for showing the correctness of a board implementation and also because it provides a mechanism for reasoning about consistency in distributed systems, which was previously lacking. The remainder of the paper discusses software techniques for implementing consistent bulletin boards in a network of processors lacking shared memory. Applications for our approach range from asynchronous interprocess communication to mechanisms for achieving mutual exclusion, deadlock detection and for building distributed database systems.
Reconstructing optimal phylogenetic trees: a challenge in experimental algorithmics
Authors: Bernard M. E. Moret, Tandy Warnow
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

The benefits of experimental algorithmics and algorithm engineering need to be extended to applications in the computational sciences. In this paper, we present on one such application: the reconstruction of evolutionary histories (phylogenies) from molecular data such as DNA sequences. Our presentation is not a survey of past and current work in the area, but rather a discussion of what we see as some of the important challenges in experimental algorithmics that arise from computational phylogenetics. As motivational examples or examples of possible approaches, we briefly discuss two specific uses of algorithm engineering and of experimental algorithmics from our recent research. The first such use focused on speed: we reimplemented Sankoff and Blanchette's breakpoint analysis and obtained a 200, 000-fold speedup for serial code and 108-fold speedup on a 512-processor supercluster. We report here on the techniques used in obtaining such a speedup. The second use focused on experimentation: we conducted an extensive study of quartet-based reconstruction algorithms within a parameter-rich simulation space, using several hundred CPU-years of computation. We report here on the challenges involved in designing, conducting, and assessing such a study.
An Autonomous Agent-Based Infrastructure for the Inter-LAN Systems Management
Authors: Shyh-horng Jou, Shang-Juh Kao
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Along with the growth of distributed services and applications in a networked system, to monitor, interpret, and control the behavior of the distributed resources become relatively complicated. A centralized management could be efficient in a privileged-owned LAN system. However, without a privileged owner, to manage multiple LANs requires self-determined management within a LAN, and cooperating operations between LANs. This paper presents an agent-based architecture distributed framework which has the advantages of centralized control. This approach relies upon several well established technologies including objected resources, intelligent agents, and cooperated communication. The framework addresses the hierarchical domain management and functionalities of layered modules within a domain agency. A simplified application of printer management is also presented in the paper.
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors
Authors: Chi-Hsiang Yeh, B. Parhami
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper, we propose a new class of interconnection networks, called swapped networks, for general-purpose parallel processing. Swapped networks not only generate a wide class of high-performance interconnection networks, but also generalize, and serve to unify, many proposed parallel architectures as well as their algorithms. We show that swapped networks can efficiently emulate hypercubes, high-dimensional meshes, or generalized hypercubes, while having node degrees significantly smaller than the emulated network in each case. We also show that some subclasses of swapped networks can achieve asymptotically optimal diameters. Swapped networks are highly modularized, make the use of fixed-degree building blocks possible for any practically realizable system, and lead to the construction of high-performance scalable networks with reasonable cost.
A management information repository for distributed applications management
Authors: P. Martin
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The management of distributed applications and systems (MANDAS) project addresses problems arising in the management applications. The MANDAS information repository (MIR) provides database support for the management applications and supports their integration into a single management environment. We examine the problem of distributed applications management to extract the requirements for an MIR. Based on the requirements, we present an information model for distributed applications management and outline a prototype MIR developed for the MANDAS project.
Streaming Media Demystified, 1 edition
Authors: Michael Topic
Venue:  (2002)

:With uncommon skill, Michael Topic's excellent guide takes you inside today's essential killer app. More than just an implementation guide -- though it certainly is that, packed with needed data on the latest formats and standards -- Streaming Media Demystified offers a complete picture of the application that will soon threaten television's dominance as the primary transmitter of video. With future potential bigger than television, streaming video over the Internet is the essential application for broadband and 3G. This book takes you inside a billion-dollar technology. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Provision of Data (IP) Services in Third Generation Mobile Networks
Authors: C. G. Ware, J. F. Chicharo, G. J. Anido
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Third generation mobile networks will enable services which are regularly available through fixed networks (WWW, Internet) to be offered into the mobile domain. The impact IP data services may have on the base station is, at this time, unclear. Coupled with this is a particularly poor performance characteristic achieved with TCP over (lossy) wireless links. Starting with results from IMT-2000 proposals, this paper makes a preliminary investigation into these issues, indicating that placement of a router in the base station controller is feasible, in terms of both capacity and additional system complexity. Results also indicate that the relationship between good-put and base station capacity (number of users) shows a significant reduction in efficient use of routing capacity, even though the radio resource may be fully occupied.
Nestor: A Trail Blazer for Hypertexts
Authors: Y. Marchand, J. L. Guerin
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper presents ' Nestor', a hypertext system on the World Wide Web dedicated to the consultation of technical documents at France Telecom. Assuming the double hypothesis that navigations carried out by the user have on one hand a goal and on the other become more and more efficient through time, our connectionist approach aims to find relevant implicit links. Discovering these informal and useful links can be seen as a concrete realization of what Vannevar Bush, one of the pioneers of hypertext, imagined, namely, the activity of trail blazers.
Test Case Prioritization: An Empirical Study
Authors: Gregg Rothermel, Roland H. Untch, Chengyun Chu, Mary Jean Harrold
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Test case prioritization techniques schedule test cases for execution in an order that attempts to maximize some objective function. A variety of objective functions are applicable; one such function involves rate of fault detection --- a measure of how quickly faults are detected within the testing process. An improved rate of fault detection during regression testing can provide faster feedback on a system under regression test and let debuggers begin their work earlier than might otherwise be possible. In this paper, we describe several techniques for prioritizing test cases and report our empirical results measuring the effectiveness of these techniques for improving rate of fault detection. The results provide insights into the tradeoffs among various techniques for test case prioritization.
Resilient Image Fusion
Authors: Tiranee Achalakul, Joohan Lee, Stephen Taylor
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The paper describes a distributed spectral-screening PCT algorithm for fusing hyper-spectral images in remote sensing applications. The algorithm provides intrusion tolerance from information warfare attacks using the notion of computational resiliency. This concept uses replication to achieve fault tolerance, but goes further to dynamically regenerate replication in response to an attack or failure. The concepts of resiliency are incorporated through library technology that is application independent. This library hides the details of communication protocols required to achieve dynamic replication and reconfiguration in distributed applications. The paper provides a status report on our progress in developing the concept and applying it to image fusion. In particular, we examine the performance of the PCT algorithm and compare the results with and without resiliency to assess the associated overheads
Bounds on Oblivious, Conservative Matrix Transposition Networks
Authors: Cynthia Dwork
Venue:  (1983)

A matrix transposition network of depth $k$ is shown to require $\theta (kn^{1+1/k})$ edges.
Finiteness Assumptions and Intellectual Isolation of Computer Scientists
Authors: Robert A. Wagner
Venue:  (1970)

We investigate the consequences of assuming integer variables of algorithmic languages to be finite vs. infinite in number and/or range. We suggest that different groups of computer scientists use different postulates about algorithmic languages. This leads to difficulty in communication, since the assumptions are usually unstated. Key words and phrases: Algol vs. FORTRAN, finiteness assumptions, intellectual isolation, integer variable range, memory finiteness, finite word size.
The use of a virtual instruction set for the software synthesis of Hw/Sw embedded systems
Authors: A. Balboni, W. Fornaciari, D. Sciuto, M. Vincenzi
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

The application range of embedded computing is going to cover the majority of market products spanning from consumer electronic, automotive, telecom and process control. For such applications, typically there is strong cooperation between dedicated hardware modules and software systems. An important issue toward a fully automated system-level implementation is represented by the software development process. The basic requirements are: accurate timing characterization to be used during the early stages of the design to compare alternative architectures and reliable synthesis techniques to ensure the respect of the correct functionality by avoiding, as much as possible, the direct designer's intervention during the development process. This paper describes a novel methodology to address the needs of concurrently synthesizing the software component of a control-dominated hardware-software system, possibly under real-time constraints. An intermediate model (Virtual Instruction Set) for the software is presented, suitable for both for synthesis and analysis purposes. The overall system synthesis is presented with particular emphasis on the problem of low level performance estimation, static scheduling of the software process and retargetable code synthesis.
Modal Event Calculus in Lolli
Authors: Iliano Cervesato, Luca Chittaro, Angelo Montanari
Venue:  (1994)

This paper introduces two variants of the Event Calculus (EC) with relative timing of events: the Credulous and the Skeptical Event Calculus (CREC and SKEC respectively). A model that takes into account the dynamics of event ordering updates is constructed for EC. In this model, that appears to be a restriction of the usual model for the modal logic S4, CREC and SKEC are proved to be the modal counterparts of EC. It is then shown how a full propositional modal logic based on these calculi can be conveniently and elegantly coded by means of the linear logic programming language Lolli.
Task Concurrency Management Experiment for Power-Efficient Speed-Up of Embedded MPEG4 IM1 Player
Authors: Aggeliki Prayati, Chun Wong, Paul Marchal, Francky Catthoor, Hugo de Man, Nathalie Cossement, Rudy Lauwereins, Diederik Verkest, Alexis Birbas
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

This paper addresses the concurrent task management of complex multimedia systems, like the MPEG4 IM1 player. Starting with a critical part of the code in the IM1 player, we extracted the concurrency hidden by implementation decisions and represented it with our ¿grey-box¿ modeling approach. Based on this ¿grey-box¿ model, high-level transformations have been made to improve the concurrency. By scheduling the transformed graph, we have improved the performance of an important bottleneck in the system layer of the IM1 player, while simultaneously lowering the system energy cost. A two-processor target platform is used in the experiment, combining processors running at a high Vdd and a low Vdd respectively.
General Correctness: A Unification of Partial and Total Correctness
Authors: Dean Jacobs, David Gries
Venue:  (1984)

General correctness, which subsumes partial and total correctness, is defined for both weakest preconditions and strongest postconditions. Healthiness properties for general-correctness predicate transformers are more uniform and complete than those for partial-and-total-correctness systems. In fact, the healthiness properties for partial and total correctness are simple restrictions of those for general correctness. General correctness allows simple formulations of the connections between weakest and strongest postconditions and between the notions of weakest precondition under the ``demonic'''' and ``angelic'''' interpretations of nondeterminism. A problem that plagues $sp sp(P, C)$ is undefined if execution of $C$ begun in some state of $P$ may not terminate disappears with the generalization. This paper is a study of some simple theory underlying predicate transformer semantics, and as yet has little bearing on current programming practices. The theory uses a relational model of programs.
Reducing Uncertainty About Common-Mode Failures
Authors: Jeffrey Voas, Anup Ghosh, Frank Charron, Lora Kassab
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Multi-version programming is employed in fault-tolerant computer systems in order to provide protection against common-mode failure in software. Multi-version programming involves building diverse software implementations of critical functions. The premise of building diverse versions is that the likelihood of a programming error in one version causing a failure in an identical manner as an error in another version is reduced. Skeptics of multi-version programming have correctly pointed out that common-mode failures between redundant diverse versions can reduce the return on investment in creating diverse versions.To date, other than using historical data from other projects, there has been no way to estimate the potential for a given multi-version programming system to suffer a common-mode failure. This paper presents an algorithm and software analysis prototype to reduce the uncertainty of whether software flaws in diverse versions can result in common-mode failure. The analysis uses software fault-injection techniques to subject one or more versions to anomalous behavior. From this, we can predict how the software will behave if real faults exist in the multiple versions.