ppxscal/embedding_network huggingface dataset:
On-line routing for permanent virtual circuits
Authors: R. Gawlick, C. Kalmanek, K. G. Ramakrishnan
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions is not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, the paper evaluates several different strategies for on-line permanent virtual circuit routing. The authors find that a strategy based on results in competitive analysis and ideas from combinatorial optimization consistently provides the best performance. The problem of admission control is closely related to the problem of routing. The paper also provides a theoretical lower bound that suggests that non-greedy admission control is a fundamental component of an efficient on-line permanent virtual circuit routing algorithm.
Refinement of Parallel and Reactive Programs
Authors: R. J.R. Back
Venue:  (1992)

We show how to apply the refinement calculus to stepwise refinement of parallel and reactive programs. We use action systems as our basic program model. Action systems are sequential programs which can be implemented in a parallel fashion. Hence refinement calculus methods, originally developed for sequential programs, carry over to the derivation of parallel programs. Refinement of reactive programs is handled by data refinement techniques originally developed for the sequential refinement calculus. We exemplify the approach by a derivation of a mutual exclusion algorithm.
The Identification and Self-organization Problems in Dynamic Semantic Networks
Authors: S. V. Smolentsev
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This article introduces a new theory of knowledge representation in Artificial Intellect (AI)-Dynamical Semantic Network (DSN).It is given the basic concepts and it is shown some ways of solving identification and self-organization problems in DSN. 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
A new variable production scheduling strategy for deteriorating items with time-varying demand and partial lost sale
Authors: Yong-Wu Zhou, Hon-Shiang Lau, Shan-Lin Yang
Venue: Computers and Operations Research (2003)

Recently, Wee and Wang (Comput. Oper. Res. 26 (1999) 237) modeled a production-inventory system for deteriorating items with time-varying demands and completely backlogged shortages; we now present an extended cost model that relaxes the assumption of completely backlogged shortages by permitting part of the backlogged shortages to turn into lost sales--which is assumed to be a function of currently backlogged amount. Wee and Wang (Comput. Oper. Res. 26 (1999) 237) constructed production schedules for this system using the traditional scheduling strategy in which each cycle starts with replenishment and ends with shortages. We now consider an alternative scheduling strategy in which each cycle of a schedule starts with a period of shortages, then followed by continuous replenishment. By examining the profit performance of the two scheduling strategies (i.e., "start with replenishment" versus "start with shortages"), we show that our alternative strategy produces schedules with superior cost and profit values.
Notch concentrations under combined tension-compression
Authors: D. W. A. Rees, H. Bahai, S. Taylor
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The photo-elastic method has been employed to determine stress concentrations (SC) in notched plates subjected to in-plane tension combined with compression. Validation and interpretation of the fringe pattern exploits the known solution to the stress raiser in a small circular hole in equi-biaxial tension. These results also compare well with an FE prediction. This has enabled SC's to be determined experimentally for a biaxial stress ratio ≈-4 in plates containing a long, thin slot arranged to be in alignment with each stress axis. The two, principal stresses lying along axes of symmetry in the region surrounding the notch are separated from within each isochromatic fringe by the Kuske method [1]. FE provides a comparable full-field view in which contours of maximum shear stress are identified with the isochromatic fringe pattern. The principal stress distributions show maximum concentrations at the notch boundary with up to a fourfold magnification in the greater of the two applied stresses. Consequently, it is of particular importance to establish the tangential stress distributions around the slot boundary. It is shown that this can easily be achieved from the isochromatic pattern to reveal positions of maximum tension and compression.
Securing the Network from Malicious Code: A Complete Guide to Defending Against Viruses, Worms, and Trojans, 1 edition
Authors: Douglas Schweitzer
Venue:  (2002)

:Inoculate your network against the viruses, worms, and Trojans of today -and tomorrowVirus writers are becoming craftier and more numerous every year, resulting in huge losses-in revenue, data, productivity, and reputation-for companies and organizations around the world. Going beyond the partial fxes of today's off-the-shelf security solutions, this book delivers the hands-on strategies and tactics you need to foil malicious code-and protect the integrity of your network. Drawing on his day-to-day networking experience, security expert Douglas Schweitzer describes the threats-both current and projected-and offers detailed, practical advice for securing BIOS, boot sequences, e-mail, instant messaging, Web servers, and more. It's all you need to lock out viruses-and lock down security for your network.You'll learn how to:Understand the threat virus writers and hackers poseGet a handle on various types of malicious codeProtect BIOS, booting, fle systems, memory, and other basicsSecure e-mail, browsers, and fle sharingEliminate virus threats to instant messagingMobilize staff against the threat of viruses and social engineeringStrengthen frewalls, intrusion detection, and data recoveryDefend against server-side exploitsPrepare for cyberterrorism and the viruses of the futureThe companion Web site contains multiple links to security software solutions.
Understanding the Message Logging Paradigm for Masking Process Crashes
Authors: Lorenzo Alvisi
Venue:  (1996)

Message logging is a popular technique for building systems that can tolerate process crashes and transient channel failures. The technique, which was first developed in the mid-80s, is popular because message-logging protocols are relatively simple and require process replication only when a process fails. Surprisingly, however, very little attention has been given to the formal specification of the consistency property that these protocols implement in order to be able to recover failed processes to a consistent state. This dissertation presents the first such formal specification. From this specification, the two major classes of message-logging protocols, namely {\em optimistic} and {\em pessimistic}, are characterized. A third and new class of message-logging protocols, called {\em causal}, is introduced. A notion of optimality, based on three important performance metrics, is proposed, and it is shown that optimal implementations of causal message-logging protocols exist. In particular, it is shown that causal message-logging protocols combine the positive aspects of optimistic and pessimistic message logging. A subclass of causal message-logging protocols, called {\em family-based logging}, is developed. Family-based logging protocols are optimal and have the additional attractive characteristic that the smaller the maximum number of concurrent failures, the lower their overhead. Furthermore, several compression techniques can be used to reduce this overhead. Finally, it is shown that family-based logging protocols can be implemented in order to take advantage of the different patterns of communication that systems exhibit.
Fireworks MX Fundamentals
Authors: Abigail Rudner, Mary Rich, Steven Grosvenor, Lori Denning, Lise Latorre
Venue:  (2002)

:Inside Fireworks MX is an insider's look at the bet practices for using and integrating Fireworks MX effectively and efficiently. Get advice from an expert Fireworks user, Abigail Rudner who is a 17year graphics veteran and has been using Fireworks since its inception. Fireworks is becoming much more important to web professionals because it is now being packaged along with Dreamweaver and Dreamweaver UltraDev, which makes it much easier to use with the web. Inside Fireworks MX has real-world examples supplied by step-by-step tutorials to build useful sites.
A Study of the Effects of Transient Fault Injection into the VHDL Model of a Fault-Tolerant Microcomputer System
Authors: D. Gil, J. Gracia, J. C. Baraza, P. J. Gil
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This work presents a campaign of fault injection to validate the Dependability of a fault tolerant microcomputer system. The system is duplex with cold stand-by sparing, parity detection and a watchdog timer. The faults have been injected on a chip-level VHDL model, using an injection tool designed for this purpose. We have carried out a set of injection experiments (with 3000 injections each), injecting transient faults of types stuck-at, bit-flip, indetermination and delay on both the signals and variables of the system, running two different workloads. We have analyzed the pathology of the propagated errors, measured their latency, and calculated both detection and recovery coverage. For instance, system detection cover-ages (including non-effective errors) up to 98%, and sys-tem recovery coverage up to 94% have been obtained for short transient faults.
Elimination of Crucial Faults by a New Selective Testing Method
Authors: Masayuki Hirayama, Tetsuya Yamamoto, Jiro Okayasu, Osamu Mizuno, Tohru Kikuno
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

Recent software systems contain a lot of functions to provide various services. According to this tendency, software testing becomes more dicult than before and cost of testing increases so much, since many test items are required. In this paper, we propose and discuss such a new selective software testing method that is constructed from previous testing method by simplifying testing specification.We have presented, in the previous work, a selective testing method to perform highly ecient software testing. The selective testing method has introduced an idea of functionalpriority testing and generated test items according to their functional priorities. Important functions with high priorities are tested in detail, and functions with low priorities are tested less intensively. As a result, additional cost for generating testing instructions becomes relatively high. In this paper, in order to reduce its cost, we change the way of giving information with respect to priorities. The new method gives the priority only rather than generating testing instructions to each test item, which makes the testing method quite simple and results in cost reduction. Except for this change, the new method is essentially the same as the previous method. We applied this new method to actual development of software tool and evaluated its effectiveness. From the result of the application experiment, we confirmed that many crucialfaults can be detected by using the proposed method.
{\bf (Revised to CS-1992-19.)} The Near-Horn Approach to Disjunctive Logic Programming
Authors: W D Reed, W D Loveland, T B Smith
Venue:  (1991)

\indent This paper presents an overview of the near-Horn Prolog project at Duke University. The basic goal behind this project has been to extend Prolog to disjunctive logic programs (and thus full first-order expressibility) while retaining as much of the clarity and procedural simplicity of Prolog as possible. The approach taken to achieve this goal has been to combine Prolog with case analysis reasoning. The research work within the project can roughly be divided into three areas: procedure design, semantics, and implementation. Three different variants of Near-Horn Prolog have been devised, of which the most recent, Inheritance near-Horn Prolog (InH-Prolog), is the variant currently being favored. The semantics for the near-Horn Prologs, specifically for InH-Prolog, have been investigated, resulting in a case-analysis based fixpoint semantics which mimics the procedural behavior of InH-Prolog. Also, both classical and default negation have been incorporated into the near-Horn Prolog systems. Finally, an interpreter for the original near-Horn Prolog variant has been implemented, and a compiler for the InH-Prolog variant is currently nearing completion.
Combining Finite State Automata and a Greedy Learning Algorithm to Determine the Syntactic Roles of Commas
Authors: Sebastian van Delden, Fernando Gomez
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

A method has been developed and implemented that assigns syntactic roles to commas1 . Text that has been tagged using a part-of-speech tagger serves as the input to the system. A set of Finite State Automata first assigns temporary syntactic roles to each comma in the sentence. A greedy learning algorithm is then used to determine the final syntactic roles of the commas. The system requires no training and is not domain specific.The performance of the system on numerous corpora is given.
Deadline Assignment in Distributed Hard Real-Time Systems with Relaxed Locality Constraints
Authors: Jan Jonsson, Kang G. Shin
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

In a real-time system, tasks are constrained by global end-to-end deadlines. In order to cater for high task schedulability, these deadlines must be distributed over component subtasks in an intelligent way. Existing methods for automatic distribution of end-to-end deadlines are all based on the assumption that task assignments are entirely known beforehand. This assumption is not necessarily valid for large real-time systems. Furthermore, most task assignment strategies require information on deadlines in order to make good assignments, thus forming a circular dependency between deadline distribution and task assignment. We present a heuristic approach that performs deadline distribution prior to task assignment. The deadline distribution problem is presented in the context of large distributed hard real-time systems with relaxed locality constraints, where schedulability analysis must be performed off-line, and only a subset of the tasks are constrained by predetermined assignments to specific processors. Using experimental results we identify drawbacks of previously-proposed techniques, and then show that our solution provides significantly better performance for a large variety of system configurations.
From Generic MAS to C 2 D 2 -Agents: A Software Architecture for CSCW
Authors: Xiaosu Zhan, Zongkai Lin, Guang Xu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In order to accommodate the new change brought by theCSCW application system, a new CSCW Systemintegration platform Based on Multi C2 D2-Agent isrequired. In this paper, a method in the form of MAS-basedmodel for designing CSCW system and C2 D2-Agentconcepts are proposed. The architectural propertyof this type CSCW system is studied.We show the importance to construct C2D2 agents andexplore an architecture model for multi-agent basedCSCW system. We illustrate the structure of C2 D2 agents,especially autonomous interface agents, and discusssome design principles for such agents. In CSCW system,autonomous interface agents can expediently supportsynchronous applications.
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Authors: J. J.M.M. Rutten
Venue:  (2000)

Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive definitions take the shape of what we have called behavioural differential equations, after Brzozowski''s notion of input derivative. A calculus is developed for coinductive reasoning about all of the afore mentioned structures, closely resembling (and at times generalising) calculus from classical analysis.
B Model Animation for External Verification
Authors: Helene Waeselynck, Salimeh Behnia
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

The B method is a model-based approach covering all the software development process, from the specification to the code. External verification of B models aims to determine whether they correctly capture the informal requirements. It is argued that verification techniques like B model animation or code testing should accompany the formal development process and give a feedback of the system that is actually being specified. A uniform testing framework, irrespective of whether the input cases are executed on the final code or on the formal models, is presented. A B development process is considered as a series of stages where concrete models are built gradually based on the more abstract ones, the final code being just a compiled version of the most concrete model. A definition of test correctness, related to the one of refinement, is introduced. The consequences in terms of required animation facilities are discussed
Measuring Bottleneck Bandwidth of Targeted Path Segments
Authors: Khaled Harfoush, Azer Bestavros, John Byers
Venue:  (2001)

Abstract Accurate measurement of network bandwidth is crucial for flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. These applications must do so to perform tasks such as distributing and delivering high-bandwidth media, scheduling service requests and performing admission control. Extensive work has focused on two approaches to measuring bandwidth: measuring it hop-by-hop, and measuring it end-to-end along a path. Unfortunately, best-practice techniques for the former are inefficient and techniques for the latter are only able to observe bottlenecks visible at end-to-end scope. In this paper, we develop and simulate end-to-end probing methods which can measure bottleneck bandwidth along arbitrary, targeted subpaths of a path in the network, including subpaths shared by a set of flows. As another important contribution, we describe a number of practical applications which we foresee as standing to benefit from solutions to this problem, especially in emerging, flexible network architectures such as overlay networks, ad-hoc networks, peer-to-peer architectures and massively accessed content servers.
Deriving Incremental Programs
Authors: Yanhong A. Liu, Tim Teitelbaum
Venue:  (1993)

A systematic transformational approach is given for deriving incremental programs from non-incremental programs. We exploit partial evaluation, other static analysis and transformation techniques, and domain-specific knowledge in order to provide a degree of incrementality not otherwise achievable by a generic incremental evaluator. Illustrative examples using the transformation approach are given.
Predicting Fill for Sparse Orthogonal Factorization
Authors: Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert
Venue:  (1983)

In solving large sparse linear least squares problems $Ax \cong b$, several different numeric methods involve computing the same upper triangular factor $R$ of $A$. It is of interest to be able to compute the nonzero structure of $R$, given only the structure of $A$. The solution to this problem comes from the theory of matchings in bipartite graphs. The structure of $A$ is modeled with a bipartite graph and it is shown how the rows and columns of $A$ can be rearranged into a structure from which the structure of its upper triangular factor can be correctly computed. Also, a new method for solving sparse least squares problems, called block back-substitution, is presented. This method assures that no unnecessary space is allocated for fill, and that no space is needed for intermediate fill.
Model fermion Monte Carlo with correlated pairs II
Authors: M. H. Kalos, K. E. Schmidt
Venue:  (1996)

Correlated dynamics can produce stable algorithms for excited states of quantum many-body problems. We study a variety of harmonic oscillator problems to demonstrate the kinds of correlations needed. We show that marginally correct dynamics that produce a stable overlap with an antisymmetric trial function give the correct fermion ground state.
3D Illustrative Effects for Animating Line Drawings
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Most illustrative techniques used in non-photorealistic rendering to date apply a rendering style to objects or a scene and alter the appearance of this style by employing illumination or depth cueing. However, for generating high quality illustrations this approach relies almost entirely on smart placement of light sources. In this paper, we introduce the concept of illustrative effects to describe the workings of illustrative techniques that rely on spatial location rather than just illumination or depth. Although the rendering style is still object-dependent, this technique allows us to visualize or emphasize parts of objects or the whole scene without being limited by the scene's object decomposition. The approach also enforces the decoupling of the model and its animation from the visualization task. We demonstrate our approach using a sample collection of illustrative effects applied to line drawings. A uniform set of tools to manipulate these effects is provided.
Restructuring Legacy C Code into C++
Authors: R. Fanta, V. Rajlich
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

In this paper, we describe restructuring of C code into new C++ classes. Such restructuring is done to facilitate both software reuse and software evolution. The restructuring is accomplished by restructuring tools and scenarios. We discuss the transformation tool-set and the design of the individual tools. The approach is demonstrated on a case study. We also discuss how this tool-set could be enhanced in the future.