ppxscal/embedding_network huggingface dataset:
Modeling ATM traffic using stochastic Petri net
Authors: Chang Lin, Bo Li, Jianping Wu
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper describes a general framework for modeling and analyzing ATM traffic control using the stochastic high level Petri net (SHLPN). The reasons SHLPN is chosen are two fold: it can handle concurrent, asynchronous, nondeterministic and stochastic events; and it provides an intuitive yet efficient mechanism that can decompose a complex model into submodels. In addition, there exists a set of well-developed performance analysis techniques for SHLPN. In order to cope with the well known state space explosion problem, we proposed a novel reduction method which incorporates the bursty characteristic of ATM networks. We show how to apply the SHLPN techniques in modeling and analyzing various ATM mechanisms such as: bursty traffic source and traffic rate control.
SALT - An Integrated Environment to Automate Generation of Function Tests for APIs
Authors: Amit Paradkar
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Automation of test design during function testing phase is essential both to reduce the substantial cost of testing and to improve the delivered software reliability. We argue for a model-based approach specifically designed from test perspective to automate test design. We describe features of Specification and Abstraction Language for Testing (SALT) environment, which embodies this perspective. SALT allows testers to capture relationships among partitions of input and output variables for a function under test. Tester can also specify (potential) up dates to context, which result from the function invocation. This context enables generation of sequences of function invocations with expected outputs. These test specification along with a fault model allow generation of an optimized set of test variations. We describe an example to illustrate SALT usage and report results of our pilot study using SALT.
A Bibliography of Parallel Debuggers
Authors: Paula S Utter, Cherri M. Pancake
Venue:  (1989)

A bibliography of over three hundred technical reports, journal and conference papers, and Ph.D. dissertations dealing with parallel and distributed debuggers. Treatments of programming environments, debugging methodology, and techniques for program analysis are included when a significant portion of the publication is devoted to factors influencing the design or implementation of debugging tools.
Discovering and exploiting synergy between hierarchical planning agents
Authors: Jeffrey S. Cox, Edmund H. Durfee
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

It is critical for agents in a multiagent environment to avoid interfering with each other when carrying out their tasks. However, to avoid execution inefficiencies, they also should capitalize on cooperative opportunities. In state oriented domains [14], identifying overlapping effects between agents' plans enables some agents to leave some tasks to others, thereby reducing the cost of execution and improving the overall efficiency of the multiagent system. This is what we term synergy. In this paper, we define criteria for finding a certain type of synergy involving agents with overlapping goals. We also develop algorithms for discovering this synergy between planning agents that exploit hierarchical plan representations. Our results show that our approach not only can reduce the costs of finding synergies compared to non-hierarchical strategies, but can also find synergies that might otherwise be missed.
Evaluating the Accessor Classification Approach to Detect Abstract Data Types
Authors: Jean-Francois Girard, Martin Würthner
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

This article presents an approach to identify abstract data types (ADTs) in source code. For each structured type defined in a system, this approach assigns a role to functions related to this type. Then, using various heuristics, it associates these functions with types to form ADTs.A prototype tool has been implemented to support this approach. It has been applied to three C systems (each between 30-38 Kloc). The ADTs identified by the approach are compared to those identified by software engineers who did not know the proposed approach. In a case study, this approach has been shown to identify, in most cases, ADTs more accurately than four published techniques applied on the same systems. At the same time, the number of false positives produced by the approach is equal to or lower than that of any compared technique. This article also proposes refinements to the evaluation scheme used in earlier articles.
Context-Sensitive Semantic Query Expansion
Authors: Giorgos Akrivas, Manolis Wallace, Giorgos Andreou, Giorgos Stamou, Stefanos Kollias
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Modern Information Retrieval Systems match the terms included in a user's query with available documents, through the use of an index. A fuzzy thesaurus is used to enrich the query with associated terms. In this work, we use semantic entities, rather than terms; this allows us to use knowledge stored in a semantic encyclopedia, specifically the ordering relations, in order to perform a semantic expansion of the query. The process of query expansion takes into account the query context,which is defined as a fuzzy set of semantic entities. Furthermore, we integrate our approach with the user's profile.
Solution of the Advection-Dispersion Equation in Two Dimensions by a Finite-Volume Eularian-Lagrangian Localized Adjoint Method
Authors: Richard W. Healy, Thomas F. Russell
Venue:  (1996)

We extend the finite-volume Eulerian-Lagrangian localized adjoint method (FVELLAM) for solution of the advection-dispersion equation to two dimensions. The method conserves mass globally and is not limited by restrictions on the size of the grid Peclet or Courant number. Therefore, it is well suited for solution of advection-dominated ground-water solute transport problems. In test problem comparisons with standard finite differences, FVELLAM is able to attain accurate solutions on much coarser space and time grids. On fine grids, the accuracy of the two methods is comparable. A critical aspect of FVELLAM (and all other ELLAMs) is evaluation of the mass storage integral from the preceding time level. In FVELLAM this may be accomplished with either a forward or backtracking approach. The backtracking approach is less computationally intensive, but is not globally mass conservative. Boundary terms are systematically represented as integrals in space and time which are evaluated by a common integration scheme in conjunction with forward tracking through time. Unlike the 1-dimensional case, we cannot guarantee local mass conservation, so slight oscillations in concentration can develop, particularly in the vicinity of inflow or outflow boundaries. These oscillations are stable in time and are generally less than 1% of the magnitude of the concentration.
Recognition of Handwritten Month Words on Bank Cheques
Authors: Qizhi Xu, Jin Ho Kim, Louisa Lam, C. Y. Suen
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper describes an off-line system which recognizes unconstrained handwritten month words extracted from Canadian bank cheques. A segmentation based grapheme level HMM (Hidden Markov Model) classifier, and two MLP (Multi-Layer Perceptron) classifiers with different architectures and different features have been developed in CENPARMI for the recognition of month words. In this paper, a combination method with an effective conditionaltopology is presented, and the most widely used combination rules including Vote, Sum and Product are experimented. A new modified Product rule is also proposed, which has produced the best recognition rate of 85.36% when tested on a real-life standard Canadian bank cheque database.
Efficient Multicast in Heterogeneous Networks of Workstations
Authors: Ran Libeskind-Hadas, Jeffrey Hartline
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

This paper studies the problem of efficient multicast in heterogeneous networks of workstations (HNOWs) using a parameterized communication model [3]. This model associates a sending overhead and a receiving overhead with each node as well as a network latency parameter. The problem of finding optimal multicasts in this model is known to be NP-complete in the strong sense. Nevertheless, we show that for two different properties that arise in typical HNOWs, provably near-optimal and optimal solutions, respectively, can be found in polynomial time. Specific ally, we show the following two results: When the ratios of receiving overhead to sending overhead among the nodes is bounded by constants, solutions within a bounded ratio of optimal can be found in time O(n log n). Secondly, if the number of distinct types of workstations is fixed then optimal solutions can be found in polynomial time. These results provide a practical means of finding optimal and provably near-optimal multicast schedules in a large class of frequently occurring heterogeneous networks of workstations.
Partitioning for Parallelization Using Graph Parsing
Authors: C. L. McCreary
Venue:  (1991)

Programming parallel systems for efficient execution is a difficult challenge that currently consumes a great deal of effort and time. Current programming practices and tools are almost entirely architecture specific, and the efficiency of a program is primarily dependent on how compatible the program is with the hardware. The software investment is wasted when transition to a new architecture or configuration is required. Programming tools are needed to reduce the labor-intensive task of programming and re-programming parallel systems. This paper presents a graph-theoretic partitioning scheme for partitioning and scheduling a computation for efficient parallel execution. The technique parses a graph into a hierarchy of subgraphs known as clans that can be identified as able or unable to support parallel execution. The technique is known as clan-based graph decomposition and will be referred to as CGD. Unlike standard graph partitioning techniques, CGD considers the structure of the entire graph and bases parallelization decisions on this structure. Other partitioning techniques generally focus on only a section of the graph like the critical path or a group of tightly connected neighbors to find local optimizations.
On a list-coloring problem
Authors: Sylvain Gravier, Frédéric Maffray, Bojan Mohar
Venue: Discrete Mathematics (2003)

We study the function f(G) defined for a graph G as the smallest integer k such that the join of G with a stable set of size k is not |V(G)|-choosable. This function was introduced recently in order to describe extremal graphs for a list-coloring version of a famous inequality due to Nordhaus and Gaddum (Dantas et al., Research Report 18, Laboratoire Leibniz-IMAG, Grenoble, 2000). Some bounds and some exact values for f(G) are determined.
Synchronization model for multimedia communication and presentation in distributed systems
Authors: Lung-Hsiung Wang, Jan-Min Chen
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The integration of time dependent media in applications requires the synchronization of media streams. The problem of synchronization is more important if we consider multimedia data presented in distributed systems. The specification of synchronization is supported by the synchronization editor, the creation and the transport of synchronization objects are managed by the synchronization coordinator, and the execution of multimedia presentations is performed by the synchronizer. We use a Petri nets model for the specification of synchronization, and propose a method using by the Normalized Relative Time Stamps (NRTS) to synchronize multimedia objects. We also use two policies, aggressive and conservative, for execution of synchronization presentations. We believe that a best synchronization scheme must be adaptive to various applications, i.e., the performance of synchronization among various media streams is dependent on the applications. On the view of resources utilization, we try to propose a scheme that can tune the accuracy of detecting the asynchrony. Thus, we can get the balance on the tradeoff between the performance of presentation and utilization of resources.
A decommitment strategy in a competitive multi-agent transportation setting
Authors: P. J. 't Hoen, J. A. La Poutre
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Decommitment is the action of foregoing a contract for another (superior) offer. It has been shown that, using decommitment, agents can reach higher utility levels in case of negotiations with uncertainty about future prospects. In this paper, we study the decommitment concept for a novel large-scale setting in logistics where companies compete for cargo in online auctions.We find significant increases in profit when agents can decommit. Furthermore, we analyze the circumstances for which decommitment has a positive impact if agents are capable of handling multiple contracts simultaneously.
Theoretical Studies of Inorganic and Organometallic Reaction Mechanisms. 3. The Origin of the Difference in the Barrier for the Kinetic and Thermodynamic Products for the Oxidative Addition of Dihydrogen to a Square-Planar Iridium Complex
Authors: Andrew L. Sargent, Michael B. Hall, Martyn F. Guest
Venue:  (1991)

The stereoselective oxidative addition of H2 to IrCl(CO)(dppe) was examined with ab initio theoretical techniques. Reaction coordinates for the two pathways to addition which lead to the formation of the two isomers were constructed from geometry optimization calculations and were augmented by significant portions of the potential energy surfaces near the transition states. The analysis of the Laplacian of the total charge densities revealed that as the complexes evolve from four-coordinate to six-coordinate species, the ligands in the plane of addition move past regions of charge concentration around the metal center. Electron withdrawing ligands in the plan of addition reduce this repulsive interaction by delocalizing a portion of the electronic charge. Electron-donor ligands are unable to function in this capacity and therefore contribute to the repulsive interaction of the five-coordinate transition state to a greater extent. The influence of electron correlation on the reaction coordinates was examined and found not to significantly alter the conclusions based on the single-determinant calculations.
Software reliability models: an approach to early reliability prediction
Authors: C. Smidts, R. W. Stoddard, M. Stutzke
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Software reliability prediction models are of paramount importance since they provide early identification of cost overruns, software development process issues, optimal development strategies, etc. Existing prediction models were developed mostly during the past 5 to 10 years and, hence, have become obsolete. Furthermore, they are not based on a deep knowledge and understanding of the software development process. This limits their predictive power. This paper presents an approach to the prediction of software reliability based on a systematic identification of software process failure modes and their likelihoods. A direct consequence of the approach and its supporting data collection efforts is the identification of weak areas in the software development process. A Bayesian framework for the quantification of software process failure mode probabilities is recommended since it allows usage of historical data that are only partially relevant to the software at hand. The approach is applied to the requirements analysis phase.
Filter objects for Java
Authors: Rushikesh K. Joshi, Maureen Mascarenhas, Yogesh Murarka
Venue: Software&mdash;Practice Experience (2003)

Filtering is an emerging abstraction in object-oriented systems. Filtering can be characterized by an ability to filter messages in transit and perform intermediate actions. Filters can be used for carrying out intermediate tasks such as encryption, load balancing, caching, security checks and add-on computations. A few filtering approaches have been proposed earlier and some commercial implementations with specialized filtering capabilities are available. This paper discusses a model for transparent and dynamically pluggable first class filter objects for object-oriented systems based on the Java programming language. The filter object model is based on an interclass filter relationship. The model is realized through extensions to the Java programming language. Filter objects can be injected into message paths during execution time and they are transparent to both clients and servers. The properties of filter objects enable them to be employed as a mechanism for evolution promoting reuse of existing code. A method of evolution through filter objects is discussed. A translator for Java filters (TJF) has been designed and implemented. TJF translates an extended Java program involving filter constructs into an equivalent Java code. The translation scheme is presented and the performance of the translated code is analyzed. A brief survey of existing approaches related to filtering in object-oriented systems has also been presented.
Building "Computational Intuition" in Freshman Scientists and Engineers
Authors: Charles F. Van Loan
Venue:  (1995)

Undergraduate programs in science and engineering should foster the development of intuition in computational science courses taken during the freshman year, says the author in the first of a two-part series. The second part, to be published in the October issue of SIAM News, will examine the important role of examples in building intuition and communicating the excitement of computational science.
Distributed Connection Management for Real-Time Communication over Wormhole-Routed Networks
Authors: Sharad Sundaresan, Riccardo Bettati
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Wormhole networks provide a very-high-speed communication medium that is well suited for a large number of bandwidth demanding applications. Unfortunately, the lack of buffering in the switches causes blocked packets to transiently monopolize arbitrary large portions of the network, thus making it difficult to give real-time guarantees when connections contend for communication links. We present an efficient, fully distributed admission control scheme for time-critical connections over wormhole networks. In comparison to a corresponding centralized scheme, such a distributed scheme offers advantages in terms of scalability and easy integration into hybrid networks. We compare this scheme to a centralized algorithm in a suite of simulation experiments and show that its performance is encouraging.
Video-Based Camera Registration for Augmented Reality
Venue: Proceedings of the International Conference on Information Visualisation (2000)

In this paper, a video-based approach for camera scene registration in augmented reality systems is presented. The presented technique relies on the definition of a model, which is derived from an appropriate parametric linear optimization problem. The optimal parameters are sought in the solution space defined by physical meaningful constraints. Solving the underlying regularized linear problem we expect to overcome the major shortcoming observed in image-based augmented reality and tele-presence systems: the extreme lack of robustness due to the ill-posed nature of the calibration problem. Several computer experiments have been conducted in order to assess the performance of the introduced technique.
Programming the FPS T-Series
Authors: Donna Bergmark
Venue:  (1987)

A major problem in programming parallel systems is finding a language suitable for the expression of parallel algorithms. At present, most parallel programming relies on using a standard programming language extended with subroutine calls to operating system primitives. These primitives implement message passing, task queuing, master-slave scheduling, etc. While these languages are the most flexible and express more applications, they are error-prone and may be inefficient. We wish to find languages in which parallelism, inter-processor communication, and scheduling are implicit. In such languages, the compiler enforces correct synchronization by relieving the user of this task. Parallel Pascal is a high level language for parallel computers. The initial parallel implementation of the language was on NASA''s Massively Parallel Processor. At Cornell, it has been retargeted to generate code (occam 1) for the FPS T-Series hypercube. The advantages and disadvantages of implementing an SIMD language on an MIMD machine are discussed.
Dynamic Price Competition with Consumption Externalities
Authors: Toker Doganoglu
Venue: Netnomics (2003)

The dynamic price competition in a horizontally differentiated duopoly when consumers value previous market shares is analyzed. The conditions for the existence of stable Markov-Perfect Equilibrium (MPE) in linear strategies are established. When they exist, the optimal pricing policies suggest that a firm with a higher previous market share charges a higher price, all else equal. It is possible to observe pricing below cost for some periods. In the steady state, the MPE leads to a more competitive outcome (lower prices) than the case where there are no consumption externalities. The model can produce outcomes where the steady state is reached very slowly which provides an alternative explanation for slow emergence of competition when entrants face an established incumbent: It may be due to persistence in consumer tastes.
Co-existence of TMN and CORBA for Service Management
Authors: Andreas Dittrich, Sonny Rasmussen, Declan O'Sullivan
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

There are many driving forces which have compelled telecommunication operators and vendors to seek new solutions in telecommunications management. Increased competition has led to an increased focus on how traditional operators can do their business better through the use of integrated service and network management systems. Moreover, there is a need to integrate legacy applications and new applications, all of which could be written in different languages, running perhaps on different platforms, and almost be certainly distributed over a network. CORBA has been recognized as a key technology solution.Based on the case studies performed for the ACTS project PROSPECT this paper discusses the advantages and disadvantages of TMN and CORBA regarding network and service management and proposes a phased approach for TMN-CORBA co-existence in the telecommunications management arena based on the Management Systems Framework of the Network Management Forum. Moreover, it presents some initial ideas concerning required basic management functionality that. The initial ideas serve as a background for the CORBA/CMIP gateway functionality to be implemented within the PROSPECT trial network.