ppxscal/embedding_network huggingface dataset:
Network outage impact measures for telecommunications
Authors: E. S. Tollar, J. M. Bennett
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Standard measures do not adequately reflect the importance of the very large and significant outages that can now occur in the modern telecommunications networks. The impact measure developed originally at Bellcore that is the basis for the new T1A1 measure of network performance is described. We assumed a useful impact measure must: (a) appropriately order a set of outages by the severity of the outages, and (b) allow for meaningful comparisons of network performance on a yearly or quarterly basis. Comparisons of the new impact measure to some standard measures of reliability illustrate that the new measure provides a significant improvement in the ability to assess the severity of individual outages, and the performance of the network over a given time period. Also provided are examples consistent with network performance which illustrate that the new impact measure is more consistent with the actual assessment of the network performance than other proposed measures of reliability.
Consideration of Changing Roles in Multiagent Game
Authors: Keiji Suzuki
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper shows the agent based simulation with changing roles in the social dilemmagame, the tragedy of the common.The tragedy of the common is known to treat the problemthat is how to manage the limited common resource.To control the usage of a commonresource, meta-agents are introduced in the game.The objective of the meta-agents is toget the revenue from the agents according to their activities.To introduce the meta-agents,it should be considered that who became the meta-agents and how to make the charging planof levy against the activities of the agents.Therefore, it is proposed the decision makingof the agents that includes the selection of roles.Concerning to adjusting the chargingplan, co-evolutionary approach is employed.Throughout the experiments, the effects of thechanging roles and the formation of the charging plan are examined. 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
An Analysis Of The Stochastic Approaches To The Problems Of Flow AndTransport In Porous Media: Upscaling Of Dispersivity
Authors: D. W. Dean, T. F. Russell
Venue:  (1998)

One need in the current theory of subsurface transport in porous media is an improved understanding of the basic transport physics in highly heterogeneous subsurface environments using mathematical models which are valid at multiple scales. This report documents work in progress on converting theory into scalable numerical models and testing them in laboratory experiments. Assumptions of low variance, ergodicity, single correlation scale, ..., are avoided through the use of a flexible, Lagrangian numerical, not analytic, framework. To the extent possible, the results of the theoretical investigation are compared to the results of actual experimental tank experiments conducted by the Civil Engineering Department of the University of Colorado in Boulder.
An Implementation of the Vesta Parallel File System API on the Galley Parallel File System
Authors: Matthew P. Carter, David Kotz
Venue:  (1998)

To demonstrate the flexibility of the Galley parallel file system and to analyze the efficiency and flexibility of the Vesta parallel file system interface, we implemented Vesta''s application-programming interface on top of Galley. We implemented the Vesta interface using Galley''s file-access methods, whose design arose from extensive testing and characterization of the I/O requirements of scientific applications for high-performance multiprocessors. We used a parallel CPU, parallel I/O, out-of-core matrix-multiplication application to test the Vesta interface in both its ability to specify data access patterns and in its run-time efficiency. In spite of its powerful ability to specify the distribution of regular, non-overlapping data access patterns across disks, we found that the Vesta interface has some significant limitations. We discuss these limitations in detail in the paper, along with the performance results.
Relativistic Birefringence and Dichroism
Authors: M. W. Evans
Venue:  (1990)

A circularly polarised pump laser produces magnetisation, and has the effect of enriching and shifting to higher frequencies a conventional ESR and NMR spectrum. A mediating property in these effects is the gyroptic ratio, which links the appropriate angular momenta to the appropriate imaginary part of the dynamic atomic or molecular polarisability. The gyroptic ratio is analogous with the gyromagnetic ratio of conventional ESR, and the nuclear gyromagnetic ratio of conventional NMR. The gyroptic ratios are developed in this paper in terms of fundamental quantities. The electronic gyroptic ratio is found to be proportional to the effective electronic orbital area, inversely proportional to the magnitude of the electronic angular momentum, proportional to the circularly polarised pump laser frequency, and becomes infinite at resonance, when the pump laser is tuned exactly to a transition frequency. These properties determine the optimum conditions for maximum effect in laser ESR, and analogous results are obtained for laser NMR. The theory is developed to encompass, within the contexts of both laser ESR and NMR, chemical shifts and shielding constants, shielding by neighboring groups, the g value, spin spin coupling, hyperfire interaction, and the potential development of optical imaging NMR and ESR using magnetic and electromagnetic field gradients.
Formalizing Certificate Management Systems
Authors: Chuchang Liu, Tony Cant, Maris A. Ozols, Marie Henderson
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Certificate Management Systems (CMSs) are used for generating, distributing, storing and verifying certificates. They play an important role in network security applications. This paper presents a mathematical model for such systems. An approach to the formal specification of a CMS structure and its dynamic changes is described.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
Authors: Ranveer Chandra, Venugopalan Ramasubramanian, Kenneth Birman
Venue:  (2001)

In recent years, a number of applications of ad-hoc networks have been proposed. Many of them are based on the availability of a robust and reliable multicast protocol. In this paper, we address the issue of reliability and propose a scalable method to improve packet delivery of multicast routing protocols and decrease the variation in the number of packets received by different nodes. The proposed protocol works in two phases. In the first phase, any suitable protocol is used to multicast a message to the group, while in the second concurrent phase, the gossip protocol tries to recover lost messages. Our proposed gossip protocol is called Anonymous Gossip(AG) since nodes need not know the other group members for gossip to be successful. This is extremely desirable for mobile nodes, that have limited resources, and where the knowledge of group membership is difficult to obtain. As a first step, anonymous gossip is implemented over MAODV without much overhead and its performance is studied. Simulations show that the packet delivery of MAODV is significantly improved and the variation in number of packets delivered is decreased.
A Design, Simulation and Visualization Environment for Object-Oriented Mechanical and Multi-Domain Models in Modelica
Authors: Hakan Larsson
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The complexity of mechanical and multi-domain simulation models is rapidly increasing. Therefore new methods and standards are needed for model design. A new language, Modelica, has been proposed by an international design committee as a standard, object-oriented, equation-based language suitable for description of the dynamics of systems containing mechanical, electrical, chemical and other types of components. However, it is complicated to describe the system models in textual form whereas CAD systems are convenient tools for this purpose. We have designed an environment that supports the translation from CAD models to standard Modelica notation. This notation is then used for simulation and visualization. Assembly information is extracted from the CAD models, from which a Modelica model is generated. By solving equations expressed in Modelica, the system is simulated. A 3D visualization tool based on OpenGL visualizes expected and actual model behavior, as well as additional parameters. The environment has been applied for robot and flight simulation.
Competitive video on demand schedulers for popular movies
Authors: Christos Bouras, Vaggelis Kapoulas, Grammati Pantziou, Paul Spirakis
Venue: Discrete Applied Mathematics (2003)

In this paper we investigate the online video on demand problem, namely having to accept or reject a request for a movie without knowing the future requests. We present online movie-scheduling schemes that implement the principles of refusal by choice and delayed notification. A novel way to schedule movies that exploits the knowledge of the distribution of the preference of requests for movies, is shown to have a competitive ratio that outperforms all the previously known schemes in practical situations. In fact, our scheduler has a competitive ratio bounded above by a constant, independent of the number of the users, channels, or movies, in the case that a large fraction of the requests tends to concentrate in a small number of movies. We extend our approach by presenting an "adaptive" randomized scheduler which initially is not aware of the movie popularities but it adapts to it, and achieves the same asymptotic competitive ratio.
To Be and Not to Be: On Managing Inconsistency in Software Development
Authors: Bashar Nuseibeh
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

The development of software systems involves the detection and handling of inconsistencies. These inconsistencies arise in system requirements, design specifications and, quite often, in the descriptions that form the final implemented software product. This paper presents a critical review of approaches that explicitly tolerate and manage inconsistencies, and explores different kinds of inconsistencies that arise during different stages of software development. Managing inconsistency refers not only to the detection and removal of inconsistencies, but also to activities that facilitate continued development in their presence. Such activities include procedures for controlled amelioration or avoidance of inconsistency, which in turn may require analysis and reasoning in the presence of inconsistency.
Collaborative software development
Authors: M. Jonge, E. Visser, J. M.W. Visser
Venue:  (2001)

We present an approach to collaborative software development where obtaining components and contributing components across organizational boundaries are explicit phases in the development process. A lightweight generative infrastructure supports this approach with an online package base, and several generators that simplify the construction and composition of component packages. The infrastructure ensures availability, portability, and adaptability of components without centralized orchestration of the development process.
Heterogeneous Software Reliability Modeling
Authors: Wen-Li Wang, Mei-Hwa Chen
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

A number of Markov-based software reliability modelshave been developed for measuring software reliability.However, the application of these models is strictly limitedto software that satisfies the Markov properties. Theobjective of our work is to expand the application domainof the Markov-based models, so that most software can bemodeled and software reliability can be measured at thearchitecture level. To overcome the limitations of Markovproperties, our model takes execution history into accountand addresses both deterministic and probabilistic softwarebehaviors. Each state represents the executions ofone or more components depending on the architecturalstyles. In addition, the executions of one component aredepicted by using distinctive states, when such executionsare influenced by past states. Furthermore, we constructloops to eliminate the likelihood of unlimited state expansionand utilize a binomial tree structure to account forall the different execution paths. We show that Markovmodels are applicable even to software that does not fullysatisfy the Markov properties. Therefore, we significantlyimprove the state of the art in architecture-based softwarereliability modeling.
Flow logic: a multi-paradigmatic approach to static analysis
Authors: Hanne Riis Nielson, Flemming Nielson
Venue: The essence of computation: complexity, analysis, transformation (2002)

Flow logic is an approach to static analysis that separates the specification of when an analysis estimate is acceptable for a program from the actual computation of the analysis information. It allows one not only to combine a variety of programming paradigms but also to link up with state-of-the-art developments in classical approaches to static analysis, in particular data flow analysis, constraint-based analysis and abstract interpretation. This paper gives a tutorial on flow logic and explains the underlying methodology; the multi-paradigmatic approach is illustrated by a number of examples including fimctional, imperative, object-oriented and concurrent constructs.
A Java Technology Based Shared Browser for Tele-Lecturing in University 21
Authors: Runhe Huang, Jianua Ma
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper describes a shared browser and explains how it is integrated into a desktopgroupware system called VCR and used to achieve effective and interactive tele-lecturingin a virtual university,University21. The shared browser allows multiple users in differentremote sites to synchronously navigate on the Web and watch the same web documents inthe mode of what you see is what I see.This is a significant advantage over current popularbrowsers.The shared browser is composed of a shared browser server (SBS) written in aJava application and a shared browser client (SBC) written in a Java applet.To overcomethe Java applet security restriction, a proxy server for processing a requested URL andhandling a received web document is designed and implemented in the SBS.Apart from tele-lecturing, there is a list of potential applications in group tour in virtual worlds,shopping together in virtual malls, and tele-conferencing.
Proof Rules for Communicating Sequential Processes
Authors: Gary M Levin
Venue:  (1980)

This thesis presents proof rules for an extension of Hoare''s Communicating Sequential Processes (CSP). CSP is a notation for describing processes that interact through communication, which provides the sole means of synchronizing and passing information between processes. A sending process is delayed until some process is ready to receive the message; a receiving process is delayed until there is a message to be received. It is this delay that provides synchronization. A proof of a program is with respect to preand postconditions. A proof of weak correctness shows that execution of the program beginning in a state satisfying the precondition terminates in a state satisfying the postcondition, provided deadlock does not occur. A proof of strong correctness, in addition, shows that deadlock cannot occur. A proof of weak correctness has three stages: a sequential proof, a satisfaction proof, and a non-interference proof. A sequential proof reflects the effects of a process running in isolation. A satisfaction proof combines sequential proofs of processes, reflecting the message passing and synchronization aspects of communication. A non-interference proof shows that no process affects the validity of the proof of another process. The introduction of the satisfaction proof and our symmetric treatment of send and receive are important aspects of this thesis. By treating send and receive on an equal basis, we simplify our rules and allow the inclusion of send in guards. A sufficient condition for freedom from deadlock is given that depends on the proof of weak correctness; this is used to prove strong correctness. In general, freedom from deadlock can be very hard to check. Therefore, we derive special cases in which we can reduce the work needed to verify that a program is free from deadlock. We also present an algorithm for globally synchronizing processes; that is, each process can recognize that all processes are simultaneously in a given state. It works by recognizing a special class of deadlock. Having this algorithm allows us to modify programs that deadlock when the postcondition is established, so that they terminate normally.
Language Features that Support Program Verification (illustrated in PL/C)
Authors: Robert L. Constable
Venue:  (1976)

The author of a program can convince its readers (including himself) that it computes as he intended by writing into the program text a precise description of what it should do. This description can include a clear proof that the program behaves as advertised. In the future, programming languages may offer far more mechanical assistance in expressing, checking, and processing these descriptions than they do now. However, some existing languages, such as PL/C, provide features which help in these tasks considerably. Here we examine such features applied to simple programs of the type traditionally taught in beginning programming classes. We discuss various proposals for expanding programming languages to provide more assistance of this type. Keywords and phrases: program correctness, automatic program verification, Hoare axioms, Scott induction, recursive programs, least number operator, bounded quantifiers, inductive assertion method, programming language design, very high level programmng languages, PL/I, PL/C, macro facilities.
Human-Computer Interaction in the School of Computer Science
Authors: Bonnie E. John, Philip L. Miller, Brad A. Myers, Christine M. Neuwirth, Steven A. Shafer
Venue:  (1992)

The SCS faculty interested in Human-Computer Interaction (HCI) presents its position on what role HCI can play in Carnegie Mellon''s School of Computer Science. We present a short description of the need for HCI research and recommend a task/human/computer approach to satisfying that need. After presenting illustrative research scenarios, we draw implications of adopting this approach for our research and educational programs. SCS is well positioned to implement this approach, given the interests and skills of our faculty and faculty in other organizations at CMU. We recommend that the Computer Science Departrment form a new area in HCI.
Efficiently Distributing Component-Based Applications Across Wide-Area Environments
Authors: Deni Llambiri, Alexander Totok, Vijay Karamcheti
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Distributed deployment of network applications in wide-areaenvironments has proven effective for improving end-userexperience. Another trend is the use of componentframeworks for building network services. Theircomponent-based nature makes such applications naturalcandidates for distributed deployment, but it is unclear ifthe design patterns underlying component frameworks alsoenable efficient service distribution.In this paper, we investigate the application designrules and accompanying system-level support essential toa beneficial and efficient service distribution process. Ourstudy targets the widely used Java 2 Enterprise Edition(J2EE) component platform and Java Pet Store, a samplecomponent-based e-commerce application.Our results present strong experimental evidence thatcomponent-based applications can be efficiently distributedin wide-area environments using a small set of generally-applicabledesign rules for orchestrating interactions andmanaging component state. We additionally discuss enforcementof these rules, and their automated implementationby container frameworks.
Distributed detection of generalized deadlocks
Authors: A. D. Kshemkalyani, M. Singhal
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Fast and efficient detection of deadlocks remains an important problem in distributed operating systems. We present a distributed algorithm to detect generalized deadlocks in distributed systems. The algorithm performs reduction of a distributed wait-for-graph (WFG) to determine a deadlock. If sufficient information to decide the reducibility of a node is not available at that node, the algorithm attempts reduction later in a lazy manner. We prove the correctness of the algorithm. The algorithm has a message complexity of 2e messages and a worst case time complexity of 2d hops, where e is the number of edges and d is the diameter of the WFG. The algorithm is shown to perform better in both time and message complexity than the best known distributed algorithms to detect distributed generalized deadlocks. We conjecture that the algorithm is optimal in the number of messages and time delay, among distributed algorithms to detect generalized deadlocks.
Fabrication Technologies for Three-Dimensional Integrated Circuits
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The MIT approach to 3-D VLSI integration is based on low-temperature Cu-Cu wafer bonding. Device wafers are bonded in a face-to-back manner, with short vertical vias and Cu-Cu pads as the inter-wafer throughway. In our scheme, there are several reliability criteria, which include: a) Structural integrity of the Cu-Cu bond, b) Cu-Cu contact electrical characteristics, and c) Process flow efficiency and repeatability. In addition, CAD tools are needed to aid in design and layout of 3DICs. This paper will discuss recent results in all these areas.
System Dependability Assessment Tool
Authors: Eric W. Brehm
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The System Dependability Assessment Tool (SDAT) is an automated tool for analysis of mission critical computer system dependability characteristics. SDAT automatically generates mathematical dependability models based on simple parametric representations of system component characteristics, maintenance and logistics capabilities, subsystem redundancy structures, and critical mission functionality. Detailed mathematical models of various aspects of system dependability behavior can also be constructed, if desired, by the user. SDAT's suite of dependability evaluation capabilities includes a variety of exact and approximate solution techniques that are used to obtain quantitative estimates of component, subsystem, and mission level reliability, maintainability, and availability relative to candidate system designs.
An Algorithm for Inferring Quasi-Static Types
Authors: Alberto Oliart
Venue:  (1994)

Abstract This report presents an algorithm, and its implementation, for doing type inference in the context of Quasi-Static Typing (QST) ["Quasy-static Typing." Satish Thatte Proc. ACM Symp. om Principles of Programming Languages, 1988]. The package infers types a la ``QST'''' for the simply typed lambda-calculus.