ppxscal/embedding_network huggingface dataset:
Software Error Classification using Purify
Authors: Howard D. Owens, Baxter F. Womack, Mario J. Gonzalez
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Perfect quality represents 100% conformance to specifications. Complex systems make it difficult and expensive to assure conformance to specifications by post production testing alone. As a result quality assurance processes are moving upstream in the life cycle, i.e., statistical process control and design for manufacturability. These processes try to avoid defects or make it easier to detect defects. In software systems this move to upstream processes for quality control is still in its early stages. As with more traditional manufacturing systems, maturity of the software design and development process will dramatically reduce the cost of attaining conformance to specifications. Even so, it is difficult to imagine a "bug free" complex software system. Downstream processes will continue to play an important part in the efforts to achieve defect-free software. This paper presents results of a survey which used the defect detection tool Purify to examine off-the-shelf software products in order to show that software errors continue to escape testing and threaten field failures. Errors detected are compiled and presented. All data were collected on C and C++ programs running in a UNIX operating system environment.
Formalizing Incremental Design in Real-time Area: SCTL/MUS-T
Authors: Ana Fernández Vilas, José J. Pazos Arias, Rebeca P. Díaz Redondo, Belén Barragáns Martínez
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Achievement of quality in software design, while never easy, is made more difficult by the inherent complexity of hard real-time (HRT) design. Furthermore, timing requirements in HRT are by nature functional requirements, since system correctness depends on their fulfillment. Whereas the correctness dependence of the time imposes considering timing requirements from the early stages of the production process, complexity enforces a lifecycle model which fits in with requirements change and splits complexity by means of an incremental and iterative structure. Taking these aims as a starting point, this paper introduces SCTL/MUS-T methodology as supporting HRT design in a formalized and incremental way.
Data Integration and Interrogation
Authors: J. Verso
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Summary form only given. One major concern of the Verso group at Inria is the development of technology for data integration and interrogation, especially for non traditional data formats such as structured text. The article describes aspects of Verso's technology as partly sponsored by the European Community (AQUARELLE project, Esprit IV projects OPAL and WIRE).
Visual Tracking of Objects Using Multiresolution
Authors: Raquel A. F. Mini, Mario F. M. Campos
Venue: Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing (1999)

This work presents a methodology for multiple object tracking in image sequences at high video rate using a multiresolution technique based on Haar basis of wavelet transform. The main objective of visual tracking is to closely follow objects in each frame of a video stream such that the object position as well as other geometric information are always known. The idea is to locate and accompany an object based on previously identified features such as salient geometric properties. The methodology was implemented and experiments were conducted where single and multiple objects were successfully tracked at high video rates. Important applications of this system include real time tracking of single or multiple targets.
A Cost-Model-Based Online Method for Ditributed Caching
Authors: Markus Sinnwell, Gerhard Weikum
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The paper presents a method for distributed caching to exploit the aggregate memory of networks of workstations in data-intensive applications. In contrast to prior work, the approach is based on a detailed cost model as the basis for optimizing the placement of variable-size data objects in a distributed, possibly heterogeneous two-level storage hierarchy. To address the online problem with a priori unknown and evolving workload parameters, the method employs dynamic load tracking procedures and an approximative, low-overhead version of the cost model for continuous reoptimization steps that are embedded in the decisions of the underlying local cache managers. The method is able to automatically find a good tradeoff between an "egoistic" and an "altruistic" behavior of the network nodes, and proves its practical viability in a detailed simulation study under a variety of workload and system configurations.
PILOTE: A Tool Suite to Support UML-Based Engineering Processes
Authors: María José Presso, Gilbert Raymond, Mariano Belaunde
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

The development of object systems can be improved through the use of tools which assist in the complete development cycle, from development process definition to software production. We propose a reference model and a workbench for UML-based development processes founded on the decoupling of dynamic (workflow) and static (work contexts) aspects of a process and developed in the French RNRT PILOTE project. The workbench is based on a flexible architecture, which integrates tools specialized in each aspect and which should allow the replacement of any element in the tool-suite.
Delta-Sets for Optimized Reactive Adaptive Playout Management in Distributed Multimedia Database Systems
Authors: Heiko Thimm, Wolfgang Klas
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

A novel database system service called playout management service which performs multimedia presentations was proposed recently. In distributed multimedia database systems without end-to-end guarantees, such a playout management service faces the potential problem that system performance can become insufficient when realizing a stored presentation. This problem can be overcome by making the playout management service reactive such that it balances the data amount to be fetched from a remote multimedia database with the system performance available. For the users this means that, a running presentation is adapted by the playout management service. In this paper, we propose the concept of delta-set to adapt the execution of arbitrary multimedia presentations in an optimized way. We show a heuristic scheme to identify the most adequate delta-set with respect to (1) the actual system state, (2) the user preferences, and (3) the specific properties of multimedia presentations.
Recognition of Essential Folding Operations: A Step for Interpreting Illustrated Books of Origami
Authors: Jien Kato, Toyohide Watanabe, Takeshi Nakayama
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

To interpret motions by analyzing a series of illustrations is an interesting topic. This paper describes an approach for interpreting essential folding operations in illustrated books of origami. Since a folding operation such as ``folding up'' can be defined by a rotative surface, axis and direction, we proposed the algorithms to identify arrows and dashed lines which represent rotative surfaces, axes and directions in a typical book of origami. The arrow detection process consists of the arrow-head detection and arc detection. The former is accomplished by applying the distance transformation and border following to an input image, while the latter is composed of two phases: all paths which would correspond to arcs are found out in the thinned and approximated image first, an evaluative function is then applied to them to determine arcs. Dashed lines with different patterns are detected using a nearest-neighbor clustering method. A folding operation is finally interpreted based on the identified graphical primitives and the spatial relationships among them. The experimental results on several test images are presented. The effectiveness of our approach in generating meaningful interpretations of origami diagrams is clear from these results.
DISHA: a deadlock recovery scheme for fully adaptive routing
Authors: K. V. Anjan, Timothy Mark Pinkston
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper presents a simple method of implementing an efficient and cost effective routing scheme. The strategy considers deadlock recovery as opposed to prevention to optimize performance in the absence of deadlocks. Cycles are broken by re-routing a blocked packet through a deadlock-free lane which is implemented as a central "floating" buffer. The proposed scheme is extremely simple, ensuring quick recovery from deadlocks and enabling the design of fast routers.
Multimodal query support in database servers
Authors: William O'Connell, Grace Au, David Schrader
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

This paper introduces a novel approach to optimizing and monitoring database queries which involve operations on multiple data types in a parallel multimedia engine. Our approach uses dataflow graphs to represent the multimedia operations in a query. We have extended the Actors parallel programming model by designing an agent model for query execution that incorporates extensions for efficient data streaming, agent migration, and agent cloning. We incorporate algorithms for dynamic run-time workload control of both the number of queries in the system as well as the number of instances of agents executing multimedia operators. We describe an approach for capturing cost statistics for user-defined functions that is used by the system to estimate and schedule the execution of nested user-defined functions.
Using Combination of Structural, Feature and Raster Classifiers for Recognition of Handprinted Characters
Authors: Konstantin Anisimovich, Vladimir Rybkin, Alexander Shamis, Vadim Tereshchenko
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a novel method for off- and on-line handprinted character recognition using structural patterns. A character is described as a set of structural elements such as segments, arcs, circles and points. Possible relative placement of elements is described with the help of spatial relations, which are expressed as fuzzy logic predicates. Structural pattern is matched against a character image by establishing correspondence between structural elements and parts of the image which satisfy all spatial relations. Developed matching procedure can successfully find this correspondence on broken and distorted images. The found match for structural pattern effectively segments a character into meaningful parts, thus giving access to plenty of information about character structure and properties. This allows to develop simple yet accurate pairwise discriminant functions for similar characters and use them to further increase recognition accuracy. The described system has been implemented and structural patterns for digits and Cyrillic alphabet have been developed. Detailed results of experimentation are presented.
Software Quality Knowledge Discovery: A Rough Set Approach
Authors: S. Ramanna, James F. Peters, Taechon Ahn
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper presents a practical knowledge discovery approach to software quality and resource allocation that incorporates recent advances in rough set theory, parameterized approximation spaces and rough neural computing. In addition, this research utilizes the results of recent studies of software quality measurement and prediction. A software quality measure quantifies the extent to which some specific attribute is present in a system. Such measurements are considered in the context of rough sets. . It has been shown rough setswork well in coping with the uncertainty in making decisions based on software engineering data. The thrust of this research is to provide a framework for making resource allocation decisions based on evaluation of various measurements of the complexity of software. Knowledge about software quality is gained during preprocessing during which, softwaremeasurements are analyzed using discretization techniques, genetic algorithms in deriving reducts, and in the derivation of training and testing sets, especially in the context of the Rough Sets Exploration System (RSES) developed by the logic group at the Institute ofMathematics at Warsaw University. The results of preprocessing provide a basis for rough neural computing and resource allocation decisions. Experiments have shown that both RSES and rough neural network models are effective in classifying software modules. The contribution of this paper is a presentation of a rough set based framework for making decisions about software quality and resource allocation.
Form Processing based on Background Region Analysis
Authors: Hiroyuki Arai, Kazumi Odaka
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We present a novel approach for processing form documents based on background region analysis. Our goal is to achieve line-property-free form processing. Background regions can be extracted independently of line width or length, and multi-layer analysis employing a series of coarse-to-fine background images makes it possible to extract background regions regardless of small line-breaks. We propose two multi-layer analysis algorithms for different situations. One is applied in a registration process of a form model. It reliably extracts box regions from un-filled forms without using any model. The other is applied in a character extraction process. By using a spatial model of a form, it reliably extracts background regions, and re-integrates these regions if they are divided by characters written in the boxes. From these re-integrated regions, the exact locations of the character boxes are determined on the input image. Besides these algorithms, we present a form identification method that uses coarse background images. We implemented the algorithms into a prototype system that processes pre-printed forms. 50 types of existing forms were tested without any customization. Model registration, character extraction, and form identification were reliably carried out.
Impact analysis in the software change process: a year 2000 perspective
Authors: Shawn A. Bohner
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Software change impact analysis has gained considerable attention with recent challenges of the Year 2000 Date situation. As the software community recognizes the growing need to identify consequences of these changes, impact analysis is making its way into the software process. Dependencies between software life cycle objects are becoming more numerous and complex as many software systems grow beyond a million of lines of code. Software change efforts are plagued with widely varying estimates for implementing software changes, since the impacts of the change are not readily known in advance. The introduction of software change impact analysis into the software process adds more fidelity to software change visibility, enabling more accurate software change estimates. The paper examines where impact analysis is applied during software changes and describes how impact analysis can be addressed in the software process.
A Design Pattern for Autonomous Vehicle Software Control Architectures
Authors: Michael L. Nelson
Venue: 23rd International Computer Software and Applications Conference (1999)

Design patterns represent a generalized approach to solving a related set of problems. Typically, a design pattern does not provide reusable code. Instead, it provides a common vocabulary and a generalized approach in an application-independent manner. We have developed a design pattern for use in controlling autonomous vehicles. The control of individual components within an autonomous vehicle will obviously differ from one vehicle to another. However, all of the components and subsystems must work together as a whole. This overall control is carried out by a Software Control Architecture, and includes concepts from artificial intelligence, computer vision, vehicle navigation, and graph theory. The Strategic-Tactical-Execution Software Control Architecture (STESCA) was developed to serve as a design pattern for autonomous vehicle control systems. The STESCA approach is currently being used to control both an autonomous underwater vehicle and a land-based wheeled autonomous vehicle in simulation.
Fast Customization of Geometric Models
Authors: Marcelo Walter, Cristiano G. Franco
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

We present a technique for customization of geometric models of animals based on pictures. The object to be customized is divided into a set of hierarchically related local coordinate systems which allow for independent transformations of different body parts. A picture of the desired result is used as a visual aid to drive the customization process. We show the results of applying this technique to customize a generic three-dimensional horse model to three different horse breeds.
Towards Social Regulation in Computer-Supported Collaborative Work
Authors: Carmen Mezura-Godoy, Stephane Talbot
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Computer-based tools supporting collaborative work are becoming crucial elements to organize the activities of groups of people. Nevertheless, current tools do not enable users to incorporate social regulation aspects. In particular, it is not possible to set-up social rules (and the conditions to execute them) to control the interactions among the members of a workgroup. In this paper, we explore the main issues on introducing social regulation in computer-supported collaborative work. Based on our regulation model, we propose an infrastructure enabling users to ease the development of regulated collaborative applications. The proposed infrastructure is composed by a framework of regulation components and a component management service.
Broadcasting and Multicasting in Cut-through Routed Networks
Authors: Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. In thispaper we study these problems under both line model, and cut-through model. The former assumes long distance calls between non neighboringprocessors. The latter com- pletes the line model by taking into account the use of a routing function. It is known that one can find time optimal broadcast and multicastprotocols in the line model inpoly- nomial time. We present a new time optimal broadcasting and multicasting algorithm in the line model. This algorithm efficiently uses the bandwidth of the network. Moreover, it also applies to the cut-through model as soon as the routing junction generates shortest paths only.
Patterns in the analysis, design and implementation of frameworks
Authors: Eyðun Eli Jacobsen, Bent Bruun Kristensen, Palle Nowack
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Patterns are investigated in relation to the development of applications and frameworks in the context of analysis, design, and implementation. The results are based on a framework for virtual machines. Different pattern characteristics are identified in the analysis, design, and implementation of applications and frameworks.
Computing Reachability Relations in Timed Automata
Authors: Catalin Dima
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We give an algorithmic calculus of the reachability relations on clock values defined by timed automata. Our approach is a modular one, by computing unions, compositions and reflexive-transitive closure (star) of "atomic" relations. The essential tool is a new representation technique for n-clock relations ¿ the 2n-automata ¿ and our strategy is to show the closure under union, composition and star of the class of 2n-automata that represent reachability relations in timed automata.
A Method for Register Allocation to Loops in Multiple Register File Architectures
Authors: David J. Kolson, Alexandru Nicolau, Nikil D. Dutt, Ken Kennedy
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Multiple instruction issue processors place high demands on register file bandwidth. One solution to reduce this bottleneck is the use of multiple register files. Register allocation for these architectures then becomes exceedingly important as spill code increases memory bandwidth demands and decreases performance, especially within loops. Previously, we have addressed the issue of finding an optimal allocation of variables to registers within loops for a consolidated register file model. In this paper, we extend that work to architectures where the available registers have been partitioned into multiple banks. Experimental results demonstrate that, while the optimal algorithm may be computationally prohibitive, heuristic versions obtain acceptable performances.
Incremental Learning of Bayesian Networks with Hidden Variables
Authors: Fengzhan Tian, Hongwei Zhong, Yuchang Lu, Chunyi Shi
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper, an incremental method for learning Bayesian networks based on evolutionary computing, IEMA, is put forward. IEMA introduces the evolutionary algorithm and EM algorithm into the process of incremental learning, can not only avoid getting into local maxima, but also incrementally learn Bayesian networks with high accuracy in presence of missing values andhidden variables. In addition, we improved the incremental learning process by Friedman et al. The experimental results verified the validity of IEMA. In terms of storage cost, IEMA is comparable with the incremental learning method of Friedman et al, while it is ore accurate.
Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns
Authors: Chi-Hsiang Yeh, Behrooz Parhami
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, we propose simple and efficient algorithms for sorting on incomplete meshes. No hardware redundancy is required and no assumption is made about the availabil-ity of a complete submesh. The proposed robust sorting al-gorithms are very efficient when only a few processors are faulty and degrade gracefully as the number of faults in-creases. In particular, we show that 1-1 sorting (1 key per healthy processor) in row-major or snakelike row-major or-der can be performed in 3n+o(n) communication and com-parison steps on an n . n incomplete mesh that has an arbi-trary pattern of o(pn) faulty processors. This is the fastest algorithm reported thus far for sorting in row-major and snakelike row-major orders on faulty meshes and the time complexity is quite close to its lower bound.