ppxscal/embedding_network huggingface dataset:
Automatic modification of a protocol specification based on changes of a service specification
Authors: K. Go, K. Takahashi, H. Kaminaga, N. Shiratori
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The problem of modifying an existing protocol specification of a communicating system in Labelled Transition System (LTS) based on changes of it's service specification in LTS is discussed. Two types of changes of a service specification are treated: addition of a behaviour expression to the service specification and deletion of some parts of the behaviour expression from the service specification. For each change, a modification method is proposed and a property of the method is shown. From the point of view of verification and validation of a specification, it is desirable to separate a changed part of the specification from the existing specification. Thus, especially for the former type of changes that is addition of a behaviour expression to the service specification, the method to express changes of the service specification by using a concurrent LTS is proposed. The method proposed in this paper is efficient and desirable when the size of the changed part of the service specification is small in terms of behaviour expressions.
Evolution: A More Practical Approach than Refinement for Software Development
Authors: Shaoying Liu
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Refinement of operations is well defined in terms of refinement rules and is considered as a reasonable discipline for software development. This paper, however, observes that refinement is not sufficient to serve this role for the entire software development process and then proposes evolution for substitution. We show that refinement is indeed a special case of evolution and evolution is transitive. A small case study is given to demonstrate that using evolution rather than refinement as the discipline for software development is a more practical approach. The idea presented in this paper may be controversial, but the author believes that this idea is more useful, practical, and instructive than refinement approach, and expects to inspire more discussions about this issue.
Creating a Self-Tuning Oracle Database: Automating Oracle9i Dynamic Sga Performance
Authors: Donald K. Burleson
Venue:  (2003)

:The dynamic memory features of Oracle9i make it possible to create a self-tuning database. This book explores proven techniques for monitoring the behavior of the Oracle System Global Area (SGA) and shows proven techniques that can be used to anticipate upcoming problems and adjust the SGA before a performance problem occurs. Written for senior Oracle DBA's this guide focuses on proactive tuning and scripting, and shows how to collect historical data and use it to develop signatures for all memory areas. Using these metrics DBAs will be able to develop scripts that will anticipate and correct upcoming SGA performance problems. Provided are the commands to modify the Oracle9i SGA areas, sample scripts for automating SGA tuning, and access to an online code deport full of interesting Oracle scripts.About the Author:Donald K. Burleson is the author of sixteen Oracle database books and is the editor-in-chief of Oracle Internals. His is an Oracle consultant with extensive experience with designing and implementing Oracle8 databases, including systems architect, project manager, data warehouse design, implementation and tuning, tuning massively parallel Oracle databases, Oracle SQL tuning, using Oracle with SAP and tuning very large Oracle databases. He lives in Kittrell, North Carolina.
Conceptual Evolution of Object-Oriented Programming
Authors: Peter Wegner
Venue:  (1989)

We address the following questions for object-oriented programming: What are its goals? What are its origins? What are its paradigms? What are its design alternatives? What are its models of concurrency? What are its formal computational models? What comes after object-oriented programming? What are its design alternatives? What are its models of concurrency? What are its formal computational models? What comes after object-oriented programming? Starting from software engineering goals, we examine the origins and paradigms of object-oriented programming. Language design alternatives for objects, classes, inheritance, and object-based concurrency are then explored, and mathematical models for objects, types, inheritance, and reflection are reviewed. Finally, we briefly speculate on what may come after object-oriented programming. 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
Topological design of local area networks using genetic algorithms
Authors: R. Elbaum, M. Sidi
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Continually growing number of users have to exchange increasing amounts of information. Local area networks (LANs) are commonly used as the communication infrastructure that meets the demands of the users in the local environment. These networks typically consist of several LAN segments connected together via bridges. The authors describe an algorithm for designing LANs with the objective of minimizing the average network delay. The topology design includes issues such as determination of the number of segments in the network, allocating the users to the different segments and determining the interconnections and routing among the segments. The determination of the optimal LAN topology is a complicated combinatorial optimisation problem. Therefore, a heuristic algorithm which is based on genetic ideas is used. Numerical examples are provided and the quality of the designs obtained by using the algorithm is compared with lower bounds on the average network delay that are developed.
Decentralized Control of Hybrid Systems
Authors: Rainer Palm, Thomas A. Runkler
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The key issue of a multiagent system is the decentralized control and optimization of a given global system which is normally of large scale. In this connection features like stability, controllability, and observability are important aspects. The paper deals with control structures of decentralized agent driven hybrid systems. In addition some stability features of decentralized hybrid systems are discussed. An example of agent control of two coupled heaters show that even stable systems may show periodic behavior.
Civil Society in the Information Age
Authors: Peter I. Hajnal
Venue:  (2002)

:In this age of globalization, non governmental organizations (NGOs) and other civil society movements and coalitions have become vastly more diverse and influential. This informed text explores the crucial role that efficient, skilful use of information and communications technology and news media has played in increasing the influence and enhancing the work of civil society organizations. Rich in case study material, it examines NGOs and other civil-society organizations in the policy fields of development, security, international law, human rights and humanitarian action. In addition, the book examines the relationship between civil society and intergovernmental institutions such as the United Nations, The World Trade Organization and the G7/G8. Scholars, analysts and practitioners in fields ranging from politics and economics through international law and information studies will find this book indispensable.
The Fourier Transform - A Primer
Authors: Hagit Shatkay
Venue:  (1995)

The Fourier transform is among the most widely used tools for transforming data sequences and functions from what is referred to as the {\it time domain} to the {\it frequency domain}. Applications of the transform range from designing filters for noise reduction in audio-signals (such as music or speech), to fast multiplication of polynomials. This report is meant to serve as a brief introduction to the Fourier transform, for readers who are not familiar with frequency domain. It introduces the basic terminology and the main concepts of the area, as well as several application domains, providing common ground for further discussion and study.
Dynamic slicing of distributed programs
Authors: M. Kamkar, P. Krajina
Venue: Proceedings of the International Conference on Software Maintenance (1995)

As software applications grow larger and become more complex, program maintenance activities such as adding new functionality, debugging, and testing consume an increasing amount of available resources for software development. This is especially true for distributed systems communicating via message passing. In order to cope with this increased complexity, programmers need effective computer supported methods for decomposition and dependence analysis of programs. Program slicing is one method for such decomposition and dependence analysis. A program slice with respect to a specified variable at some program point consists of those parts of the program which potentially affect the value of that variable at the particular program point. A static slice is valid for all possible executions of a program while a dynamic slice considers only a particular execution of a program. In this paper we present a technique for dynamic slicing of distributed programs which computes accurate slices. We introduce the notion of distributed dynamic dependence graph (DDDG) which represents control, data and communication dependences in a distributed program. This graph is built at run time and used to compute dynamic slices of the program. A distributed dynamic slicer for ANSI-C programming language has been implemented on a parallel MIMD computer of type Parsytec GC/Powerplus with 128 PowerPC processors.
Exploring legacy systems using types
Authors: Arie Deursen, L. Moonen
Venue:  (2000)

We show how hypertext-based program understanding tools can achieve new levels of abstraction by using inferred type information for cases where the subject software system is written in a weakly typed language. We propose TypeExplorer, a tool for browsing COBOL legacy systems based on these types. The paper addresses (1) how types, an in-vented abstraction, can be presented meaningfully to soft-ware re-engineers; (2) the implementation techniques used to construct TypeExplorer; and (3) the use of TypeExplorer for understanding legacy systems, at the level of individual statements as well as at the level of the software architecture -- which is illustrated by usingTypeExplorer to browse an industrial COBOL system of 100,000 lines of code.
Spotting structure in complex time dependent flow
Authors: Wim C. Leeuw, Robert Liere
Venue:  (1998)

Analysing structure in complex time dependent flow fields is a challenging problem. Spot noise is a technique which utilizes texture for the visualization of flow fields. In this paper, two extensions of spot noise are discussed. These extensions allow spot noise to be used for very detailed analysis of time dependent flow fields. Two applications are discussed: a large data set resulting from a direct numerical simulation of turbulence and a data set resulting from a global climate data.
Runtime verification of .NET contracts
Authors: Mike Barnett, Wolfram Schulte
Venue: Journal of Systems and Software (2003)

We propose a method for implementing behavioral interface specifications on the .NET platform. Our interface specifications are expressed as executable model programs. Model programs can be run either as stand-alone simulations or used as contracts to check the conformance of an implementation class to its specification. We focus on the latter, which we call runtime verification.In our framework, model programs are expressed in the new specification language AsmL. We describe how AsmL can be used to describe contracts independently from any implementation language, how AsmL allows properties of component interaction to be specified using mandatory calls, and how AsmL is used to check the behavior of a component written in any of the .NET languages, such as VB, C#, or C++.
Sympathy-MV: Fast Exact Minimization of Fixed Polarity Multi-Valued Linear Expressions
Authors: Rolf Drechsler, Martin Keim, Bernd Becker
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

In this paper a polynomial time algorithm for the minimization of Fixed Polarity Multi-Valued Linear expressions (FPMVLs) for totally symmetric functions based on an extension of Binary Moment Diagrams (BMDs) is presented. A generalization to partially symmetric functions is investigated.
Evaluating CORBA latency and scalability over high-speed ATM networks
Authors: A. S. Gokhale, D. C. Schmidt
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We present two contributions to the study of CORBA performance over high-speed networks. First, we measure the latency of various types and sizes of two-way client requests using a pair of widely used implementations of CORBA-Orbix 2.1 and VisiBroker for C++ 2.0. Second, we use Orbix and VisiBroker to measure the scalability of CORBA servers in terms of the number of objects they can support efficiently. These experiments extend our previous work on CORBA performance for bandwidth-sensitive applications (such as satellite surveillance, medical imaging, and teleconferencing). Our results show that the latency for CORBA implementations is relatively high and server scalability is relatively low. Our latency experiments show that non-optimized internal buffering in CORBA implementations can cause substantial delay variance, which is unacceptable in many real-time or constrained-latency applications. Likewise our scalability experiments reveal that neither Orbix nor VisiBroker can handle a large number of objects in a single server process.
Caching XML Web Services for Mobility
Venue: Queue (2003)

Web services are emerging as the dominant application on the Internet. The Web is no longer just a repository of information but has evolved into an active medium for providers and consumers of services: Individuals provide peer-to-peer services to access personal contact information or photo albums for other individuals; individuals provide services to businesses for accessing personal preferences or tax information; Web-based businesses provide consumer services such as travel arrangement (Orbitz), shopping (eBay), and e-mail (Hotmail); and several business-to-business (B2B) services such as supply chain management form important applications of the Internet.
An Architecture for Programmable Systolic Arrays
Authors: Richard Hughey, Daniel Lopresti
Venue:  (1989)

Systolic algorithms are a systematic and powerful methodology for realizing the potential of very large scale integration. After an initial wave of special-purpose systolic processors, research has turned to the implementation of programmable systolic machines. These machines are often too large and complicated to be able to support massive parallelism: many of the benefits to be reaped from systolic algorithms are lost. Few of the current architectures provide the simple systolic communication of the early special-purpose processors. The primary contribution of this research is the systolic shared register paradigm. Unlike previous research efforts, the architecture provides a natural means of systolic communication and uses simple processing elements; the architecture can be both easily programmed and easily formed into very large systolic arrays. The main features of the architecture are broadcast instructions, a regular topology, and register sets that are shared between neighboring processing elements. The Brown Systolic Array, an implementation of the concept, is also described. Using the Brown Systolic Array as an example, the programming of these machines is investigated.
Partitioning Unstructured Meshes for Homogeneous and Heterogeneous Parallel Computing Environments
Authors: PeiZong Lee, Jan-Jan Wu, Chih-Hao Chang
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Partitioning meshes is a preprocessing step for parallel scientific simulation. The quality of a partitioning is measured by load balance and communication overhead. The effectiveness of a partitioning significantly influences the performance of parallel computation. In this paper, we propose a quadtree spatial-based domain decomposition method for partitioning unstructured meshes. The background quadtree, which is originally used to represent the density distribution among elements within the computing domain, can be used to obtain an initial partitioning and to do multi-level refinement. As the quadtree implicitly defines hierarchical relationship, which is a natural way to define coarsening and uncoarsening phases, we can repeatedly apply coarsening, partitioning, and uncoarsening multi-level refinement phases, until no improvement can be made. Thus, for most cases, the partitioning results by our method are better than those produced by other graph-based partitioning methods. Experimental studies for the NACA0012 airfoil, the NASA EET wing, and an artillery shell within a shock tube are reported.
Optimal Parallel MPEG Encoding
Authors: Jeffrey Moore, William Lee, Scott Dawson, Brian Smith
Venue:  (1996)

The Tcl/Tk extension, Tcl/Rivl, provides a suite of commands to manipulate audio and video data. Compressing long sequences of MPEG video requires a significant amount of computation power. This paper outlines a parallel algorithm that achieves real-time MPEG compression without specialized hardware.
An architectural framework for interoperation of distributed heterogeneous database systems
Authors: Xuequn Wu
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

As database technology advances rapidly, there are usually heterogeneous databases used by different departments in an enterprise. On the other hand, the object oriented technology is becoming the dominant application development paradigm. Thus, there is a data modeling gap between applications and heterogeneous databases. We present some main architecture aspects of the system VHDBS which has been developed by an ongoing research project. This architecture provides a way to support cooperative access to distributed heterogeneous databases and to fill the data modeling gap in a distributed heterogeneous environment. Our work contributes not only to an implementation solution but also to an architecture framework and paradigmatic solution.
Logic Synthesis of Controllers for B-Ternary Asynchronous Systems
Authors: Yasunori Nagata, D. Michael Miller, Masao Mukaidono
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Asynchronous digital circuits and self-timed circuits are once again receiving attention due to the rapid development of VLSI technology and the difficulty of global clock distribution. An asynchronous system consumes lower power because unused parts of the system are deactivated, and the computational time is average-case instead of worst-case.We earlier presented an asynchronous system exploiting B-ternary logic in the data-path of the system. The B-ternary data-path elegantly processes binary data and has some advantage in hardware cost.In this paper, a logic synthesis method for designing the controller for a B-ternary fashioned data-path is discussed. To control the B-ternary data-path asynchronously, external-binary, internal-ternary signaling is required. We derive an asynchronous state transition graph from the signal transition graph of the controller and then synthesize a hazard-free asynchronous implementation of the controller as a two-level combinational circuit together with a ternary-in binary-out C-element.
Automatically inferring patterns of resource consumption in network traffic
Authors: Cristian Estan, Stefan Savage, George Varghese
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

The Internet service model emphasizes flexibility -- any node can send any type of traffic at any time. While this design has allowed new applications and usage models to flourish, it also makes the job of network management significantly more challenging. This paper describes a new method of traffic characterization that automatically groups traffic into minimal clusters of conspicuous consumption. Rather than providing a static analysis specialized to capture flows, applications, or network-to-network traffic matrices, our approach dynamically produces hybrid traffic definitions that match the underlying usage. For example, rather than report five hundred small flows, or the amount of TCP traffic to port 80, or the "top ten hosts", our method might reveal that a certain percent of traffic was used by TCP connections between AOL clients and a particular group of Web servers. Similarly, our technique can be used to automatically classify new traffic patterns, such as network worms or peer-to-peer applications, without knowing the structure of such traffic a priori. We describe a series of algorithms for constructing these traffic clusters and minimizing their representation. In addition, we describe the design of our prototype system, AutoFocus and our experiences using it to discover the dominant and unusual modes of usage on several different production networks.
A Note on One-way and Two-way Automata
Authors: Juris Hartmanis
Venue:  (1969)

The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this difference cannot be exceeded.
Evaluating the Software Test Strategy for the 2000 Sydney Olympics
Authors: Kathryn Bassin, Shrinram Biyani, P. Santhanam
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

The 2000 summer Olympic Games event was a major information technology challenge.With a fixed deadline for completion, its inevitable dependency on software systems and immense scope, the testing and verification effort was critical to its success.One way inwhich success was assured was the use of innovative techniques using ODC based analysis to evaluate planned and executed test activities.These techniques were used to verify that the plan was comprehensive, yet efficient, and ensured that progress could be accurately measured.This paper describes some of these techniques and provides examples of the benefits derived.We also discuss the applicability of the techniques to other software projects.