ppxscal/embedding_network huggingface dataset:
Design for Constraint Violation Detection in Safety-Critical Systems
Authors: Satish Subramanian, Sanjai Rayadurgam, Wei-Tek Tsai
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

In safety-critical systems, certain safety constraints must be satisfied before an operation can be performed. Violation of these constraints can lead to serious hazards. Such safety constraints typically depend on the state of the system at the instant of invocation of the operation. Thus the constraints may vary for different invocations of the same operation. Further, for a specific version in a family of related systems, its intended application and the individual user profiles may play a role in determining the constraints. To promote reuse of system design while allowing customizability of specific constraints, a good design should de-couple the operations from their associated constraints. Also, it is highly desirable and often mandatory that the increased flexibility does not entail significant addition to execution time and memory requirements. This paper presents one such design of an object-oriented framework for detecting constraint violations. It discusses an application of this framework to our motivational problem in the context of implantable cardiac medical devices. This paper also serves a broader objective of cataloging the experience gained in developing safety-critical systems. Such a knowledge base will be of practical value to the developer community.
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
Authors: Hettihe P. Dharmasena, Ramachandran Vaidyanathan
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

A binary-tree algorithm, Bin(n), proceeds level-by-level from the leaves of a 2 n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on multiple bus networks (MBNs) in which processors communicate via buses. Every binary-tree "MBN" has a degree (maximum number of buses connected to a processor) of at least 2. There exists a degree-2 MBN [15] for Bin(n) that has a loading (maximum number of processors connected to a bus) of T(n). For any MBN that runs Bin(n) optimally, the loading was recently proved to be ?(n 1/2 ) [3]. In this paper, we narrow the gap between the results in [3, 15] by deriving a tighter lower bound of (n 2/3 ). We also establish a tradeoff between the speed and loading of degree-2 binary-tree MBNs.
Developing Web-Based Applications through e-Prototyping
Authors: Wolf-Gideon Bleek, Martti Jeenicke, Ralf Klischewski
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

"Traditional" prototyping is based on assumptions that are not ¿ or only partially ¿ valid for the development of Web-based applications. In this paper, the "traditional"approaches of prototyping are recalled, and the new conditions, difficulties and challenges of involving and communicating with the relevant actors as a way of gathering sound requirements in the context of Web-projects are examined. The paper presents a modifiedprototyping approach called e-prototyping. It includes frequent releases of software versions (based on short development cycles) as well as gathering feedback from users and other relevant actors in "productive mode". The approach points at the need for offering variouscommunication channels and systematically sorting out the stream of feedback to create sound requirements for evolutionary software process and release management.
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
Authors: S. Chingchit, Mohan Kumar, Laxmi N. Bhuyan
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and reduce problem execution times. In this paper we present a novel approach where clustering and scheduling of tasks can be tuned to achieve maximal speedup or efficiency. The proposed scheme is based on the relation between the costs of computation and communication of task clusters. In this paper, we show how clustering can be adapted to suit different architectures and number of available processors. The proposed efficient clustering and scheduling algorithm is flexible : the clustering and scheduling can be tuned to suit bounded or unbounded number of processors and/or parallel computing environment. Comparative studies indicate superior efficiency compared to most other schemes proposed in recent years.
Description Logics: Foundations for Class-based Knowledge Representation
Authors: Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

Class-based languages express knowledge in terms of objects and classes, and have inspired a huge number of formalisms in computer science. Description logics form a family of both class-based and logic-based knowledge representation languages which allow for modeling an application domain in terms of objects, classes and relationships between classes, and for reasoning about them. This paper presents an overview of the research carried out in the lastyears in description logics, with the main goal of illustrating how these logics provide the foundations for class-based knowledge representation formalisms.
Time scale combining of conservative parallel discrete event simulations
Authors: Hatem Sellami, Sudhakar Yalamanchili
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Very often many parameterized trials of a simulation are required. Modifying parameters of a simulation will often only modify a fraction of the work. This paper proposes time scale combining (TSC) to combine multiple independent simulation trials by sharing common events and inter-processor communication messages across distinct simulations. As a result, some of the overhead experienced in parallel computation can be amortized across these multiple simulations, reducing the total time required to execute all of the simulations. The results from an experimental evaluation on both asynchronous and synchronous parallel architectures are presented.
An Experimental Comparison of Supervised and Unsupervised Approaches to Text Summarization
Authors: Tadashi Nomoto, Yuji Matsumoto
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The paper presents a direct comparison of supervised and unsupervised approaches to text summarization. As a representative supervised method, we use the C4.5 decision tree algorithm, extended with the Minimum Description Length Principle (MDL), and compare it against several unsupervised methods. It is found that a particular un-supervised method based on an extension of the K-means clustering algorithm, performs equal to and in some cases superior to the decision tree based method.
On-line Configuration of a Time Warp Parallel Discrete Event Simulator
Authors: Radharamanan Radhakrishnan, Nael B. Abu-Ghazaleh, Malolan Chetlur, Philip A. Wilsey
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

In Time Warp simulations, the overheads associated with rollbacks, state-saving and the communication induced by rollbacks are the chief contributors to the cost of the simulation; thus, these aspects of the simulation have been primary targets for optimizations. Unfortunately, the behavior of the Time Warp simulation is highly dynamic and greatly influenced by the application being simulated. Thus, the suggested optimizations are only effective for certain intervals of the simulation. This paper argues that the performance of Time Warp simulators benefits from a dynamic on-line decision process that selects and configures the sub-algorithms implementing the different aspects of the simulator to best match the current behavior of the simulation. In particular, we study control strategies to dynamically: (i) adjust the checkpointing (or state-saving) interval (ii) select the cancellation strategy (lazy or aggressive), and (iii) determine the policy for aggregating the application messages (an optimization that significantly improves the performance in message passing environments). The strategies have been implemented in the WARPED Time Warp simulation kernel and the performance obtained via the dynamically controlled optimizations is shown to surpass that of their best performing static counterparts.
A Code Generation Strategy for CORBA-Based Internet Applications
Authors: C. W. Loftus, A. Olsen, E. Inocencio, P. Viana
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

We present an integrated approach (practices) to object- oriented, distributed, application development that covers all phases of software development: requirements capture, analysis, design (structural and behavioural), simulation and targeting to CORBA-based distributed processing environments. We focus on a code generation strategy that addresses and supports all phases of the practices. We highlight code generation objectives including support for multiple paths through the practices, reuse of existing tool-sets and support for traceability. We describe one path in more detail and present an example of design OMT to SDL translation based on labelling in OMT. We describe two development environments used in the project and analyze them with respect to their support for our code generation objectives. Our tool adaptation work is addressing identified weaknesses. This includes an SDL to Java/CORBA code generator, the generation of CORBA-to-SDL-mapping C++ wrappers for C code generated by existing tools and the use of CORBA to integrate development tools and support traceability.
Using Separation and Composition of Concerns to Build Multiuser Virtual Environments
Authors: Miguel Antunes, António Rito Silva
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Developing multiuser virtual environments (MUVE) is a very complex task since it involves several engineering domain aspects such as virtual reality, cooperative work and distributed systems. Furthermore, existing technologies like graphics capabilities, processing power and network bandwidth, are permanently evolving. For MUVE systems to be successfully developed, they must not only deal with all the different aspects that are inherent to these systems but also have the ability to deal with the continuous technology and requirements evolution. To cope with these problems, a software engineering separation of concerns approach is proposed. Concerns are identified for each of the different aspects of MUVEs. To obtain the necessary flexibility, each one of the concerns should abstract its possible variations in order to support the future system evolution. Moreover it is shown how concerns composition has the necessary expressive power to build multiuser virtual environments.
Model and Heuristic Technique for Efficient Verification of Component-Based Software Systems
Authors: Jeffrey J. P. Tsai, Eric Y. T. Juan
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

With the rapid growth of networking and high-computing power, the demand of larger and more complex software systems has increased dramatically. To deal with the complexity in designing large-scale complex software systems, the concept of component-based software design has gained popularity recently. However, in pursuing a component-based approach there are obstacles to be overcome. One of them is the state-explosion problem in the formalverification of large-scale component-based systems. In this paper, we introduce a modeling mechanism and a set of heuristic rules to facilitate the verification of component-based software systems. Our heuristic techniques are much weaker than current theories usefulfor the compositional verification. More significantly, our technique can eliminate the interleaved behaviors caused by asynchronously sending actions. Therefore, our technique provides a much more powerful means for the compositional verification of asynchronousprocesses. Our technique can efficiently analyze several state-based properties: deadlock, reachable, and livelock state. The experimental results show a significant improvement in the analysis of large-scale component-based systems.
A Cost-effective Near-line Storage Server for Multimedia System
Authors: Siu-Wah Lau, John C. S. Lui, P. C. Wong
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We consider a storage server architecture for multimedia information systems. While most other works on multimedia storage servers assume on-line disk storage, we consider a two-tier storage architecture with a robotic tape library as the vast near-line storage and on-line disks as the front-line storage. Magnetic tapes are cheaper, more robust, and have a larger capacity; hence they are more cost effective for large scale storage systems (e.g., video on demand (VOD) systems may store tens of thousands of videos). We study in detail the design issues of the tape subsystem and propose some novel tape scheduling algorithms which give faster response and require less disk buffering.
Singularities and Regularities on Line Pictures via Symmetrical Trapezoids
Authors: Jairo Rocha, Rafael Bernardino
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

An algorithm that decomposes a line image into singular and regular regions is presented. We define a contour trapezoid as the building block of regular regions, and postulate a Maximal Trapezoid Set as the core of regular regions. Then, we describe an algorithm that calculates a Maximal Trapezoid Set of a polygon and show how to use it to find a skeleton of a polygonal approximation of a contour. Several experiments are explained to show the behavior of the new concept on real images as compared to previous algorithms and criteria.
A Workflow and Agent Based Platform for Service Provisioning
Authors: Santosh K. Shrivastava, Luc Bellissard, D. Feliot, M. Herrmann, Noel De Palma, Stuart M. Wheater
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

The design and implementation of a dependable system that provides a composition and execution environment for distributed applications whose executions could span arbitrarily large durations is described. The objective is to create a framework for complex service provisioning. By complex service provisioning we primarily mean the ability to compose a given service out of existing ones as well as the ability to exercise dynamic control over the execution of the service. The approach taken is centred around building middleware services based on integration of workflow and agent technologies. The platform enables these two systems to interact via CORBA services. Service behaviour and service deployment are represented as workflow processes. Individual tasks that make up the workflow would be legacy applications, specially created tasks, and agent applications. Agents are able to create workflow instances, receive results from workflow and send inputs to workflows. This enables agents to act as user agents capable of managing workflows on behalf of users.
UW-ISL Document Image Analysis Toolbox: An Experimental Environment
Authors: Jisheng Liang, Richard Rogers, Robert M. Haralick, Ihsin Tsaiyun Phillips
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A document image analysis toolbox, including a collection of data structures and algorithms to support a variety of applications, is described in this paper. An experimental environment is built to allow developers to develop, test and optimize their algorithms and systems. The Document Attribute Format Specification (DAFS) is used as the internal data representation in the environment. The architecture allows for convenient experimentation to evaluate the performance of different algorithms and sequences of modules. Appropriate and quantitative performance metrics for each kind of information a document analysis technique infers have been developed. The toolbox provides a set of algorithms from which the document image analysis applications can be constructed. The performance of each algorithm has been evaluated based on those metrics and the UW-III document image database which contains a total of 1600 English document images randomly selected from scientific and technical journals. We have constructed a prototype of the document analysis system and demonstrated its flexibility and functionality on different applications.
An EREW PRAM fully-dynamic algorithm for MST
Authors: Paolo Ferragina
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We provide an EREW PRAM fully-dynamic algorithm to maintain the minimum spanning tree (MST) of an undirected weighted graph under single edge insertions and deletions. Our approach combines the sparsification data structure with a novel parallel technique which efficiently treats edge deletions. The proposed parallel algorithm requires O(log n) time and O(n/sup 2/3/ log m/n) work, where n and m are respectively the number of nodes and edges of the given graph.
Modeling Scientific Experiments with an Object Data Model
Authors: I-Min A. Chen, Victor M. Markowitz
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We examine the main requirements for modeling scientific experiments and propose constructs that fulfil these requirements. We show that existing object-oriented and semantic data models do not provide such constructs. Experiment (protocol) and object constructs can be combined in order to provide seamless object and experiment modeling. We present an example of combining protocol and object constructs into a unified framework, the Object-Protocol Model (OPM), and briefly describe the implementation of an OPM interface on top of commercial relational database management systems (DBMSs).
Execution-time profiling for multiple-process behavioral synthesis
Authors: Jay K. Adams, John Alan Miller, Donald E. Thomas
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper presents a technique for back-annotating the results of high-level synthesis into the source description to produce a timing-accurate behavioral simulation model. The resulting simulation model exhibits the same cycle-by-cycle behavior as a register-transfer level model, but can be simulated in a fraction of the time. This idea has analogies both to software profiling and to back-annotation at lower levels of hardware design. Experimental results demonstrate that the annotated behavioral simulation models run two to three orders of magnitude faster than register-transfer level simulation models, and only about an order of magnitude slower than behavioral models with no timing information.
Testing-what's missing? An incomplete list of challenges
Authors: Sudhakar M. Reddy
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Summary form only given. As the testing area becomes mature, the challenges it poses shift. We describe some of these challenges and how they are addressed in recent works in various areas of testing. In recent years, the formulations of testing problems have changed from "given a problem, find a solution" to "given a problem and quality measures, find a high-quality solution". Quality guarantees in the form of lower and upper bounds and optimal solutions are derived, in addition to the more conventional demonstration of performance on benchmark circuits. Quality guarantees allow one to measure the distance between a given solution and an optimal solution, and provide criteria for evaluating a new procedure that are more effective than comparison to previously proposed procedures. We review several areas where bounds and optimal solutions have been found. Most procedures are specific to a given problem, and cannot be reused to solve other problems. In contrast, general-purpose paradigms allow a large variety of problems to be solved cost-effectively by plugging in the appropriate procedures into the same algorithm. Such paradigms allow faster program development and reuse of expertise acquired in solving other problems under the same paradigm. We describe several attempts at using existing paradigms and developing new ones, that successfully compete with special-purpose procedures. Recent works address testing issues at increasingly higher levels of the design cycle and offer an integrated treatment of design and test. High-level failure models are considered as well as solutions that are completely independent of a failure model. We describe some of these works and the advantages of the two directions. We conclude with an (incomplete) list of challenges for future research.
Query Folding
Authors: Xiaolei Qian
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previous queries, or queries answerable by other databases. We investigate query folding in the context where queries and resources are conjunctive queries. We develop an exponential-time algorithm that finds all complete or partial foldings, and a polynomial-time algorithm for the subclass of acyclic conjunctive queries. Our results can be applied to query optimization in centralized databases, to query processing in distributed databases, and to query answering in federated databases.
Ad Hoc Association Rule Mining as SQL3 Queries
Authors: Hasan M. Jamil
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Although there have been several encouraging attempts at developing methods for data mining using SQL, simplicity and efficiency still remain significant impediments for furtherdevelopment. In this paper, we propose a significantly new approach and show that any object relational database can be mined for association rules without any restructuring orpreprocessing using only basic SQL3 constructs and functions, and hence no additional machineries are necessary. In particular, we show that the cost of computing associationrules for a given database does not depend on support and confidence thresholds. More precisely, the set of large items can be computed using one simple join query and anaggregation once the set of all possible meets (least fix point) of item set patterns in the input table is known. The principal focus of this paper is to demonstrate that several SQL3expressions exists for the mining of association rules.
Fast Parallel Association Rule Mining without Candidacy Generation
Authors: Osmar R. Zaïane, Mohammad El-Hajj, Paul Lu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper we introduce a new parallel algorithm MLFPT (Multiple Local Frequent Pattern Tree) [11] for parallel mining of frequent patterns, based on FP-growth mining, that uses only two full I/O scans of the database, eliminating the need for generating the candidate items and distributing the work fairly among processors. We have devised partitioning strategies at different stages of the mining process to achieve near optimal balancing between processors.We have successfully tested our algorithm on datasets larger than 50 million transactions.