ppxscal/embedding_network huggingface dataset:
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing
Authors: Yu Lei, Kuo-Chung Tai
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Pairwise testing (or 2-way testing) is a specification-based testing criterion, which requires that for each pair of input parameters of a system, every combination of valid values of these two parameters be covered by at least one test case. Empirical results show that pairwise testing is practical and effective for various types of software systems. In this paper, we show that the problem of generating a minimum test set for pairwise testing is NP-complete. We propose a test generation strategy, called in-parameter-order (or IPO), for pairwise testing. For a system with two or more input parameters, the IPO strategy generates a pairwise test set for the first two parameters, extends the test set to generate a pairwise test set for the first three parameters, and continues to do so for each additional parameter. The IPO strategy allows the use of local optimization techniques for test generation and the reuse of existing tests when a system is extended with new parameters or new values of existing parameters. We present practical, IPO-based test generation algorithms. We describe the implementation of an IPO-based test generation tool and show some empirical results.
ODP-Based QoS-Support in UML
Authors: Jan Øyvind Aagedal, Arne-Jørgen Berre
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Traditional systems development methodologies are not focused on the development of distributed systems. However, efforts to address these problems are going on within OMG, with the focus to standardize a meta-model for analysis and design methodologies. The initial submissions converged into a meta-model of Unified Modeling Language (UML), which is emerging as the standard from OMG. This meta-model defines a set of modelling elements that can be used by different methodologies supporting different domains. In this paper we investigate, in the context of Open Distributed Processing (ODP), the support for the modelling of Quality of Service (QoS) in UML when modelling distributed multimedia applications. In the context of OMG's architecture, we propose some extensions based on the current version of UML to support QoS and multimedia applications. We use a car computer system with Global Positioning System (GPS)-support as an example.
Clustering Web Content for Efficient Replication
Authors: Yan Chen, Lili Qiu, Weiyu Chen, Luan Nguyen, Randy H. Katz
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Recently there has been an increasing deployment of content distribution networks (CDNs) that offer hosting services to Web content providers. In this paper, we first compare the un-cooperative pulling of Web contents used by commercial CDNs with the cooperative pushing. Our results show that the latter can achieve comparable users' perceived performance with only 4 - 5% of replication and update traffic compared to the former scheme. Therefore we explore how to efficiently push content to CDN nodes. Using trace-driven simulation, we show that replicating content in units of URLs can yield 60-70% reduction in clients' latency, compared to replicating in units of Web sites. However, it is very expensive to perform such a fine-grained replication.To address this issue, we propose to replicate content in units of clusters, each containing objects which are likely to be requested by clients that are topologically close. To this end, we describe three clustering techniques, and use various topologies and several large Web server traces to evaluate their performance. Our results show that the cluster-based replication achieves 40-60% improvement over the per Web site based replication. In addition, by adjusting the number of clusters, we can smoothly trade off the management and computation cost for better client performance.To adapt to changes in users' access patterns, we also explore incremental clusterings that adaptively add new documents to the existing content clusters. We examine both offlineand online incremental clusterings, where the former assumes access history is available while the latter predicts access pattern based on the hyperlink structure. Our results show that the offline clusterings yield close to the performance of the complete re-clustering at much lower overhead. The online incremental clustering and replication cut down the retrieval cost by 4.6 - 8 times compared to no replication and random replication, so it is especially useful to improve document availability during flash crowds.
A Process for Framework Construction Based on a Pattern Language
Authors: Rosana T. V. Braga, Paulo Cesar Masiero
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

A process for building an object-oriented framework based on a pattern language, both for the same domain, is proposed. This process includes several activities, as the identification of the framework hot-spots, the framework design, implementation, and validation. All these activitiesare supported by the pattern language. Besides that, by using the process here proposed, the resulting framework is implicitly documented by the pattern language. This makes it easier for the developer to instantiate applications, as the knowledge about the pattern language is used during the instantiation process.
Verification of a subtractive radix-2 square root algorithm and implementation
Authors: Miriam Leeser, John W. O'Leary
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Many modern microprocessors implement floating point square root hardware using subtractive algorithms. Such processors include the HP PA7200, the MIPS R4400, and the Intel Pentium. The Intel Pentium division bug highlights the importance of verifying such implementations. In this paper we discuss the verification of a radix-2 square root unit similar to that used in the MIPS R4400. The verification is done by theorem proving to bridge the gap between the algorithm and the implementation. At the top level, we verify that a subtractive, non-restoring algorithm correctly calculates the square root function. We then show a series of optimizing transformations that refine the top level algorithm into the hardware implementation. Each transformation can be verified. We show the transformation of the top level proof to a level that is closer to the hardware implementation. The implementation is at the RTL level, and consists of a structural description of the hardware including an adder/subtracter, simple combinational hardware and some registers.
A Pragmatic Approach to Formalizing Object-Oriented Modeling and Development
Authors: Xiaoping Jia
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Despite recent developments in formal methods, formal methods have yet to enter the mainstream of software industry. In this paper, we first examine the pragmatic obstacles of making formal methods practical and usable. Then, we present a pragmatic approach to integrate a popular object-oriented modeling notation UML and a popular formal notation Z. Our approach is distinctive in its emphasis on overcoming the practical obstacles. We also present a light-weight supporting tool for our approach. A prototype of the supporting tool is completed. It allows us to demonstrate the feasibility and capability of our approach.
Sparse Matrix Block-Cyclic Redistribution
Authors: Gerardo Bandera, Emilio L. Zapata
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterization of the sparse matrix redistribution and its associate problematic due to the use of compressed representations. Two main improvements about the buffering and the coordinates calculation modify the original algorithm.Our solutions contain a Collecting, a Communication and Mixing stage with different influence in the execution time depending on the sparsity of the matrix and the number of processors. Experimental results have been carried out on a Cray T3E for real matrices and different redistribution parameters.
A Synchronization Based Algorithm for Discovering Ellipsoidal Clusters in Large Datasets
Authors: Hichem Frigui, Mohamed Ben Hadj Rhouma
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper introduces a new scalable approach to clusteringbased on synchronization of pulse-coupled oscillators. Eachdata point is represented by an integrate-and-fire oscillator, and the interaction between oscillators is defined according to the relative similarity between the points. The set of oscillators will self-organize into stable phase-locked subgroups. Our approach proceeds by loading only a subset of the data and allowing it to self-organize. Groups ofsynchronized oscillators are then summarized and purged from memory. We show that our method is robust, scales linearly, and can determine the number of clusters. The proposedapproach is empirically evaluated with several synthetic data sets and is used to segment large color images.
Constraints on handwriting Korean characters to improve the machine readability
Authors: Choi Baek Young, Sung Yang Bang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Realizing that the availability of a practical recognition system for Korean handwritten characters without any constraints has a long way to go, we have attempted to find a set of writing constraints which significantly improves the machine-readability. Based on our observation that the majority of the misrecognitions reported are caused by ambiguous characters, we have developed a set of writing constraints which maximally disambiguate those characters. Through experiments, we have confirmed that the recognition rate of those handwritten data could be improved significantly by applying the proposed set of constraints.
Designing the Reengineering Services for the DOK Federated Database System
Authors: Zahir Tari, John Stokes
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Addresses the design of the reengineering service for the DOK (Distributed Object Kernel) federated database. This service allows the hiding of the heterogeneity of databases involved in a federation by generating object-oriented representations from their corresponding schemata. We propose a complete methodology that supports the identification and the translation of both the explicit and implicit information. The identification of object-oriented constructs is performed by classifying a relational schema into different categories of relations, namely base, dependent and composite relations. The main difficulty in designing the reengineering service relies on the distinction between the different types of relationships amongst classes. Our approach deals with this problem by analysing relations according two types of correlation: (i) the degree of correlation between the external and primary keys, and (ii) the degree of correlation between sets of tuples in the relations. Examining these correlations uncovers implicit relationships contained as well-hidden classes in a relational schema.
On the (non)Universality of the One-Time Pad
Authors: Yevgeniy Dodis, Joel Spencer
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a common abstraction, it is assumed that there is a source of truly random bits available to all the participants of the system. While convenient, this assumption is often highly unrealistic, and cryptographic systems have to be built based on imperfect sources of randomness. Remarkably, this fundamental problem has received little or no attention so far, despite the fact that a related question of simulating probabilistic (BPP) algorithms with imperfect random sources has a long and rich history.In this work we initiate the quantitative study concerning feasibility of building secure cryptographic primitives using imperfect random sources. Specifically, we concentrate on symmetric-key encryption and message authentication, where the shared secret key comes from an imperfect random source instead of being assumed truly random. In each case, we compare the class of "cryptographic" sources for the task at hand with the classes of "extractable" and "simulatable" sources, where: (1) "cryptographic" refers to sources for which the corresponding symmetric-key primitive can be build; (2) "extractable" refers to a very narrow class of sources from which one can extract nearly perfect randomness; and (3) "simulatable" refers to a very general class of weak random sources which are known to suffice for BPP simulation. For both encryption and authentication, we show that the corresponding cryptographic sources lie strictly in between extractable and simulatable sources, which implies that "cryptographic usage" of randomness is more demanding than the corresponding "algorithmic usage", but still does not require perfect randomness. Interestingly,cryptographic sources for encryption and authentication are also quite different from each other, which suggests that there might not be an elegant way to describe imperfect sources sufficient for "general cryptographic use". We believe that our initial investigation in this new area will inspire a lot of further research.
Communication in Parallel Applications: Characterization and Sensitivity Analysis
Authors: Dale Seed, Anand Sivasubramaniam, Chita R. Das
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Communication characterization of parallel applications is essential to understand the interplay between architectures and applications in determining the maximum achievable performance. Although a significant amount of research has been conducted on execution-based architectural evaluations, very little effort has gone into capturing the communication behavior of an application mathematically. In this paper, we attempt to characterize the communication behavior of applications by temporal, spatial and volume attributes. We also study the impact of variation in application and architectural parameters on the communication behavior in terms of the three attributes. Our results show that for the chosen suite of applications, the message arrival and spatial distributions can be closely approximated by known statistical distributions and that the temporal as well as spatial distributions of all applications remain unchanged with respect to four parameters considered in this study. These results lead us closer to the belief that it is possible to abstract the communication properties of parallel applications in convenient mathematical forms that have wide applicability.
Topic Extraction from News Archive Using TF*PDF Algorithm
Authors: Khoo Khyou Bun, Mitsuru Ishizuka
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

Busy and no time to digest the news archive .... ? Eversince the Web wide-spreading, the amount of electronicallyavailable information online, especially news archive proliferatesand threatens to overwhelm human attention. See-ingthis, we propose an information system that will extractthe main topics in the news archive in a weekly basis. Bygetting a weekly report, user can know what were the mainnews events in the past week.
New Model and Scheduling Protocol for Transactional Workflows
Authors: Ke Ding, Beihong Jin, Jun Wei, Yulin Feng
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

A transactional workflow is composed of traditional flat transactions, and its execution has relaxed transactional atomicity. Due to different termination characteristics of transactions, a transactional workflow may be not well-formed. Moreover, only one workflow is allowed toexecute a non-compensatable transaction with current scheduling protocol. In this paper, we present a transactional workflow model and formally define the correctness criteria of transactional workflow structure (well-formedness) and execution (serializability). We then propose an efficient method for well-formedness validation through a set of computation rules. Finally a scheduling protocol based on two kinds of locking granularities is presented. The protocol is different from related research in the fine-grained locking on transaction instances and coarse-grained locking on transaction classes, multiple workflows are therefore allowed toexecute non-compensatable transactions if they are not conflict in predicated future execution.
alpha-Surface and Its Application to Mining Protein Data
Authors: Xiong Wang
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Given a finite set of points in three dimensional Euclidean space R3, the subset that forms its surface could bedifferent when observed in different levels of details. In thispaper, we introduce a notion called a-surface. We presentan algorithm that extracts the a-surface from a finite set ofpoints in R3. We apply the algorithm to extracting the a-surfaces of proteins and discover patterns from these surface structures, using the pattern discovery algorithm wedeveloped earlier. We then use these patterns to classify theproteins. Experimental results show the good performanceof the proposed approach.
The Design and Experimental Evaluation of an Information Discovery Mechanism for Networks of Autonomous Database Systems
Authors: Dennis McLeod, Antonio Si
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

An approach and mechanism to support the dynamic discovery of information units within a collection of autonomous and heterogeneous database systems is described. The mechanism is based upon a core set of database constructs that characterizes object database systems, along with a set of self-adaptive heuristics employing techniques from machine learning. The approach provides an uniform framework for organizing, indexing, searching, and browsing database information units within an environment of multiple, autonomous, interconnected databases. The feasibility of the approach and mechanism is illustrated using a protein/genetics application environment. Metrics for measuring the performance of the discovery system are presented and the effectiveness of the system is thereby evaluated. Performance tradeoffs are examined and analyzed by experiments performed, employing a simulation model.
Optimizing Queries with Materialized Views
Authors: Surajit Chaudhuri, Ravi Krishnamurthy, Spyros Potamianos, Kyuseok Shim
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

While much work has addressed the problem of maintaining materialized views, the important question of optimizing queries in the presence of materialised views has not been resolved. In this paper, we analyze the optimization question and provide a comprehensive and efficient solution. Our solution has the desirable property that it is a simple generalization of the traditional query optimization algorithm.
Design of Scalable and Multicast Capable Cut-Through Switches for High-Speed LANs
Authors: Mingyao Yang, Lionel M. Ni
Venue: Proceedings of the international Conference on Parallel Processing (1997)

High-speed switches play an important role in building switched LANs. Among different techniques used in switch design, cut-through switching promises short latency delivery and thus is well suited to distributed/parallel applications. The back pressure flow control of cut-through switching also prevents packet loss due to buffer overflow. This paper presents an incremental switch design based on modular building blocks using cut-through switching technique. The switch can be either nonblocking with full configuration and deterministic routing, or blocking but having more flexibility in configuration and fault tolerance. A kind of switch configuration that fits the client/server computing paradigm is presented. Simulation results are given for various switch configurations and traffic loads. The switch also has built-in hardware multicast capability. Issues of physical layout and integration into practical LANs are also discussed.
The CORD Appraoch to Extensible Concurrency Control
Authors: George T. Heineman, Gail E. Kaiser
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Database management systems (DBMSs) have been increasingly used for advanced application domains, such as software development environments, workflow management systems, computer-aided design and manufacturing, and managed healthcare. In these domains, the standard correctness model of serializability is often too restrictive. We introduce the notion of a Concurrency Control Language (CCL) that allows a database application designer to specify concurrency control policies to tailor the behavior of a transaction manager. A well-crafted set of policies defines an extended transaction model. The necessary semantic information required by the CCL run-time engine is extracted from a task manager, a (logical) module by definition included in all advanced applications. This module stores task models that encode the semantic information about the transactions submitted to the DBMS. We have designed a rule-based CCL, called CORD, and have implemented a run-time engine that can be hooked to a conventional transaction manager to implement the sophisticated concurrency control required by advanced database applications. We present an architecture for systems based on CORD and describe how we integrated the CORD engine with the Exodus Storage Manager to implement Altruistic Locking.
Software Reuse through a Novel Representation that Supports Factorization
Authors: Hee Beng Kuan Tan, Hua Koon Tan
Venue: 23rd International Computer Software and Applications Conference (1999)

Software reuse has received more attention in recent years. However, very often, we still require to re-design and re-develop parts of software ranging from small to very large size (we shall call them software factors) that have been developed before, for the development of new software systems. These software factors do not fall into any existing implementation constructs. The problem that prevents the reuse of these software factors is the lack of a representation that can represent them separately and compose them together to form a software system. This paper proposes a novel software representation, called the software event net (the SE net), to address the problem. The SE net is based on the high-level Petri net with some modification and extension for the specification of events produced in software systems. It applies implicit invocation software architecture in representing a software factor.