ppxscal/embedding_network huggingface dataset:
Automatic Dependability Analysis for Supporting Design Decisions in UML
Authors: Andrea Bondavalli, Ivan Mura, Istvan Majzik
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Even though a thorough system specification improves the quality of the design, it is not sufficient to guarantee that a system will satisfy its reliability targets. Within this paper, we present an application example of one of the activities performed in the European ESPRIT project HIDE, aiming at the creation of an integrated environment where design toolsets based on UML are augmented with modeling and analysis tools for the automatic validation of the system under design. We apply an automatic transformation from UML diagrams to Timed Petri Nets for model based dependability evaluation. It allows a designer to use UML as a front-end for the specification of both the system and the user requirements, and to evaluate dependability figures of the system since the early phases of the design, thus obtaining precious clues for design refinement. The transformation completely hides the mathematical background, thus eliminating the need for a specific expertise in abstract mathematics and the tedious remodeling of the system for mathematical analysis.
Evolutionary Structure Learning Algorithm for Bayesian Network and Penalized Mutual Information Metric
Authors: Gang Li, Fu Tong, Honghua Dai
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper formulates the problem of learning Bayesian network structures from data as determining the structure that best approximates the probability distribution indicated by the data. A new metric, Penalized Mutual Information metric, is proposed, and a evolutionary algorithm is designed to search for the best structure among alternatives. The experimental results show that this approach is reliable and promising.
An Information Infrastructure and E-Services for Supporting Internet-Based Scalable E-Business Enterprises
Authors: Stanley Y. W. Su, Herman Lam, Minsoo Lee, Sherman Bai, Zuo-Jun (Max) Shen
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: This paper presents an information infrastructure for supporting Internet-based scalable e-business enterprises (ISEE). The information infrastructure is formed by a network of ISEE hubs, each of which has a number of replicable e-business servers providing various e-services to individuals and businesses. The servers are the implementations of a number of core technologies developed to facilitate collaborative e-business, including business event and rule management, active distributed objects, constraint satisfaction processing, and cost-benefit analysis and selection. Using the e-services provided by these servers, other e-services such as constraint-based brokering, supplier selection, active business process management, and automated negotiation can be developed. Supply chain management is used as an example of collaborative e-business in the descriptions of these technologies and their implementations.
Network Planning and Tuning in Switch-Based LANs
Authors: Wenjian Qiao, Lionel M. Ni
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

Switch-based networks have received much attention in local area networks (LANs) due to their higher network bandwidth and greater interconnect scalability than shared-medium networks. While arbitrary topologies are allowed to provide the needed flexibility and scalability, the design of an appropriate network topology is a challenging issue. In this paper, we discuss design considerations and propose efficient methods for network planning and tuning in switch-based LANs. The idea of block design is applied to initial topology design. For network tuning, a systematic method is proposed to reduce message latency and increase network throughput. Simulations are conducted to demonstrate the performance improvement by applying our method.
Mining the Smallest Association Rule Set for Predictions
Authors: Jiuyong Li, Hong Shen, Rodney W. Topor
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Mining transaction databases for association rules usually generates a large number of rules, most of which are unnecessary when used for subsequent prediction. In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the association rule set by the confidence priority. We call this subset the informative rule set. The informative rule set is not constrained to particular target items; and it is smaller than the non-redundant association rule set. We present an algorithm to directly generate the informative rule set, i.e., without generating all frequentitemsets first, and that accesses the database less often than other unconstrained direct methods. We show experimentally that the informative rule set is much smaller than boththe association rule set and the non-redundant association rule set, and that it can be generated more efficiently.
Establishing Guidelines for Suitability of COTS for a Mission Critical Application
Authors: Ronald J. Kohl
Venue: 23rd International Computer Software and Applications Conference (1999)

Commercial Off The Shelf (COTS) products are being considered for inclusion in ever more complex and critical systems. There are clearly advantages to consider the use of COTS in such complex or critical systems but given the rigorous needs of such critical systems or subsystems, there have begun to emerge concerns about the suitability of COTS for such applications. This paper hopes to identify some of the characteristics of Mission Critical systems that makes the selection process of COTS products (h/w, s/w, subsystems, etc) an emerging factor in total system acceptance. This paper will also suggest a path towards creating a set of best practices that would assist both the acquisition community as well as the development/integration community in this area.Mission Critical System characteristics such as reliability, safety, availability, maintainability and certification tend to influence whether or not COTS should be considered for a given application. Once the suitability of COTS has been determined, then it is possible that additional requirements may be placed on the product and/or the product's vendor for such Mission Critical applications. Further, it is possible that certain system requirements and expectations may need to be modified because of the inclusion of COTS products into that system. As COTS products continue to be considered as candidates for inclusion within Mission Critical systems, there are likely to be additional concerns and factors to emerge that will influence how both acquirers and suppliers decide if and/or when to use COTS products. Ongoing monitoring of this technology area seems to be warranted. 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
Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using Slack-Based Backfilling
Authors: David Talby, Dror G. Feitelson
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Distributed memory parallel systems such as the IBM SP2 execute jobs using variable partitioning. Scheduling jobs in FCFS order leads to severe fragmentation and utilization loss, which lead to the development of backfilling scheudlers such as EASY. This paper presents a backfilling scheduler that improves EAST in two ways: It supports both user selected and administrative priorities, and guarantees a bounded wait time for all jobs. The scheduler gives each waiting job a slack, which determines how long it may have to wait before running: `important' and `heavy' jobs will have little slack in comparison with others. Experimental results show that the priority scheduler reduces the average wait time by about 15% relative to EASY in an equal priorities scenario, and is responsive to differential priorities as well.
A Metamodel-Based Approach to Formalizing UML
Authors: Betty H. C. Cheng
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

The {\it Unified Modeling Language} (UML) comprises several different notations for object-oriented modeling with no formal semantics attached to the individual diagrams. We have developed a general framework for formalizing a subset of UML diagrams in terms of various formal languages, with a focus on embedded systems. We take a homomorphic approach in our formalization framework by constructing mappings from the metamodels of UML diagrams to the metamodel of a given target specification language. Using this approach, we have formalized UML in terms of VHDL and Promela, the specification language for the SPIN model checker. An overarching goal of this project is to provide users with a migration path from existing object-oriented modeling notations to target specification languages that have extensive tool support. The existing tools enable the analysis of the UML diagrams via their corresponding specifications. We have also developed a number of visualizations to assist in the interpretation of the analysis results. 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
Matching form lines based on a heuristic search
Authors: Uli Bohnacker, Johannes Schacht, Tulug Yucel
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A major problem in form reading applications is that form fields cannot be located exactly because of nonlinear distortions on the form images. Such nonlinear distortions appear for example on photocopied forms or on forms transmitted by fax. One way to solve this problem is to determine the form fields by considering the positions of the form lines. This paper describes a new method to find pairs of corresponding form lines on a reference form and a filled form. The advantage of this method is that the corresponding line pairs can be used to map any pixel of the filled form and the reference form without any assumption about the kind of distortion. The core of this method is an algorithm that is based on the A*-search algorithm. Two sets of horizontal or vertical lines, one from the reference form and one from the filled form, are searched for pairs of corresponding lines. The algorithm's run time is low and nonlinear distortions of the form images hardly influence its results. With increasing complexity-i.e. increasing number of lines or decreasing image quality-the number of rejected form lines grows, but the error rate stays low.
Semantics and Implementation of a Generalized forall Statement for Parallel Languages
Authors: Paul Dechering, Leo C. Breebaart, Frits Kuijlman, Kees van Reeuwijk, Henk J. Sips
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

In this paper we present a generalized forall statement for parallel languages. The forall statement occurs in many (data) parallel languages and specifies which computations can be performed independently. Many different definitions of such a construct can be found in literature, with differ-ent conditions and execution models. We will show how for-all constructs of a wide class of parallel languages can be mapped to this generalized forall statement. In addition, the forall statement we propose has the ability to spawn more complex independent activities than can be found in these languages. Denotational semantics are used to define the meaning of the forall and define only one possible program state change. It is shown that it is easy to use and that it is feasible to implement this forall efficiently.
d-Dimensional Range Search on Multicomputers
Authors: Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric and database applications. The authors describe the first non-trivial adaptation of range trees to the parallel distributed memory setting (BSP like models). Given a set L of n points in d-dimensional Cartesian space, they show how to construct on a coarse grained multicomputer a distributed range tree T in time O(s/p+T/sub c/(s,p)), where s=n log/sup d-1/ n is the size of the sequential data structure and T,(s, p) is the time to perform an h-relations with h=/spl Theta/(s/p). They then show how T can be used to answer a given set Q of m=O(n) range queries in time O(s log n/p+T/sub c/(s,p)) and O(s log n/p+T/sub c/(s,p)+k/p), for the associative-function and report modes respectively, where k is the number of results to be reported. These parallel construction and search algorithms are both highly efficient, in that their running times are the sequential time divided by the number of processors, plus a constant number of parallel communication rounds.
Use of Categorization and Structuring of Messages in Order to Organize the Discussion and Reduce Information Overload in Asynchronous Textual Communication Tools
Authors: Marco Aurélio Gerosa, Hugo Fuks, Carlos José Pereira de Lucena
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: This paper shows how the use of categorization and structuring of messages in asynchronous textual communication tools could be useful in course deliver via the Internet in order to facilitate the argumentation and to guide the participants to reflect about their messages. Although the use of categorization caused an increase in the total number of messages, there was a reduction of the information overload and an increase in the quality of the discussion. We also present how the message categorization was used in a distance course delivered through the AulaNet environment, showing how we defined and improved the set of categories, and how it helped accompanying the learners.
Quantifying Instruction Criticality
Authors: Eric Tune, Dean M. Tullsen, Brad Calder
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Information about instruction criticality can be used to control the application of micro-architectural resources efficiently. To this end, several groups have proposed methods to predict critical instructions. This paper presents a framework that allows us to directly measure the criticality of individual dynamic instructions. This allows us to (1) measure the accuracy of proposed critical path predictors, (2) quantify the amount of slack present in non-critical instructions, and (3) provide a new metric, called tautness, which ranks critical instructions by their dominance on the critical path. This research investigates methods for improving critical path predictor accuracy and studies the distribution of slack and tautness in programs. It shows that instruction criticality changes dynamically, and that criticality history patterns can be used to significantly improve predictor accuracy.
Marshaling/Demarshaling as a Compilation/Interpretation Process
Authors: Christian Queinnec
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Marshaling is the process through which structured values are serialized into a stream of bytes; unmarshaling converts this stream of bytes back to structured values. Most often, for a given data structure, the marshaler and the unmarshaler are tightly related pieces of code that are synthesized conjunctly. This paper proposes a new point of view: the unmarshaler is considered as a byte-code interpreter evaluating a stream of bytes considered as a program i.e., a sequence of commands interspersed with quoted raw data. This program is an expression of the marshaling language. From that point of view, the marshaler logically appears as a compiler translating values into expressions of the marshaling language.
Randomness Extractors and their Many Guises
Authors: Salil P. Vadhan
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Since its introduction by Nisan and Zuckerman (STOC93) nearly a decade ago, the notion of a randomness extractor has proven to be a fundamental and powerful one. Extractors and their variants have found widespread application in a variety of areas, including pseudorandomness and derandomization, combinatorics, cryptography, data structures, and computational complexity. Equally striking has been a sequence of discoveries showing that, under different interpretations, extractors are close relatives of a number of other important objects, such as expander graphs, hash functions, error-correcting codes, pseudorandom generators, and sampling algorithms. Through these connections, extractors have unified the study of these objects and have led to new and improved constructions of each.In this tutorial, we give an introduction to the study of extractors. The structure of the tutorial is built around the connections between extractors and the other objects mentionedabove. Within the context of these connections, we hope to convey an understanding of the definition of extractors, some intuition for how they are constructed, and a glimpse of their use in applications.
Lessons Learned Applying Software Engineering Principles to Visual Programming Language Application Development
Authors: Teresa G. Sparkman
Venue: 23rd International Computer Software and Applications Conference (1999)

Visual programming languages make software design accessible even to untrained programmers, but basic software engineering practices must still be followed to create a usable product. This paper describes the process by which software was developed to control sophisticated laboratory equipment for a radio frequency interference monitoring system (RFIMS.) Development of requirements and specifications is discussed. It is shown that the product was improved by the use of extensive planning and user testing. In addition, the steps required for designing a clear and intuitive graphical user interface (GUI) are discussed. The GUI interface specifications, user panel templates, menu system hierarchy, and programmatically guiding the user are some of the tools that were successfully employed in the project development.
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Authors: Cong Fu, Tao Yang
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general asynchronous DAG schedules on distributed memory machines. Our solution tightly integrates the run-time scheme with a fast communication mechanism to eliminate unnecessary overhead in message buffering and copying, and takes advantage of task dependence properties to ensure the correctness of execution. We demonstrate the applications of this scheme in sparse LU and Cholesky factorizations for which actual speedups have been hard to obtain in the literature because parallelism in these problems is irregular and limited. Our experiments on Meiko CS-2 show the promising results of our approach in exploiting irregular task parallelism with mixed granularities.
The Relation of Scalability and Execution Time
Authors: Xian-He Sun
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Scalability has been used extensively as a de facto performance criterion for evaluating parallel algorithms and architectures. In this paper, the relation between scalability and execution time is carefully studied. Results show that isospeed scalability well characterizes the variation of execution time. Three algorithms from scientific computing are implemented on an Intel Paragon and an IBM SP2 parallel computer. Experimental and theoretical results show that scalability is an important, distinct metric for parallel and distributed systems, and may be as important as execution time in a scalable parallel and distributed environment.
Mathematical properties of the native integral ratio handwriting and text extraction technique
Authors: Yan Solihin, Graham Leedham
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Investigates the nature and performance of the native integral ratio (NIR) technique for separating the foreground from the background in a grey-scale handwriting image. The technique separates the pixels into three groups: background, foreground and a fuzzy group of pixels which may be either foreground or background. The NIR has previously been shown to perform well in qualitative experiments by comparing of the resulting thresholded images with other thresholding techniques. In this paper, the properties of the NIR technique are analysed on hypothetical (Gaussian) distributions. The technique is found to be robust to the variation of the distribution strength and variance, and to the presence of strong uniform noise.
A New Mathematical Notation for Describing Notion and Thought in Software Design
Authors: Yingxu Wang
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Conventional software description is algorithm-based. However, a large part of things in software description are non-algorithmic and non-functional, such as those of system architectures, dynamic behaviors, performance, and quality. Therefore, contemporary concept in software description has been shifted from algorithms to software architectures and behaviors.Software behaviors can be modeled as a 3-D representation comprising mathematical operations, event/process timing, and memory manipulation. This paper introduces the real-time process algebra (RTPA) that serves as an expressive notation system for describing thoughts and notions in software design. RTPA is used to address the 3-D problem in component-based software description and specification. Case studies on applications of RTPA in component-based software engineering are demonstrated with real-worldexamples.
A distributed management system for testing document image analysis algorithms
Authors: Jaakko J. Sauvola, S. Haapakoski, Hannu Kauniskangas, Tapio Seppänen, Matti Pietikäinen, David S. Doermann
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We describe a new approach to manage the testing of document analysis and understanding applications. We propose and present a collection of document images, a set of techniques to prepare the test cases interactively and means to control the testing process. The systems architecture is designed to be distributed, scalable and platform independent utilizing Java, C++ and object-oriented databases. The main features of this system are a basic document categorization and ground truth, degradation models, custom test case creation facilities, a test management module (pipelining, test history), the ability to embed document analysis algorithms into the system, remote usage facilities and robust graphical user interfaces.