ppxscal/embedding_network huggingface dataset:
Discrete optimization of two-dimensional laminated composite plate and shell structures
Authors: A. Muc, W. Gurba, T. Fugiel, P. Kedziora
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The overall concept of this work is to describe the concepts of the use of probabilistic optimization algorithms in the conjunction with the finite element (FE) package providing the objective functions for arbitrary boundary and loading conditions. Two optimization problems are discussed in details: stacking sequence optimization and shape optimization. The presented examples show the effectiveness of the proposed method.
ISIS: A Semantic Mediation Model and an Agent Based Architecture for GIS Interoperability
Authors: Eric Leclercq, Djamal Benslimane, Kokou Yétongnon
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

The diversity of spatial information systems promotes the need to integrate heterogeneous spatial or geographic information systems (GIS) in a cooperative environment. This paper describes the research project ISIS (Interoperable Spatial Information System) which is a semantic mediation approach to support GIS interoperability. Its key characteristic is a dynamic resolution of semantic conflicts which is adequate for achieving autonomy, flexibility and extensibility. We propose a spatial OO data model and a mediation architecture based on multi-agent paradigm to support GIS interoperability.
Protection domain extensions in Mungi
Authors: J. Vochteloo, K. Elphinstone, S. Russell, G. Heiser
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

The Mungi single address space operating system provides a protected procedure call mechanism named protection domain extension (PDX). The PDX call executes in a protection domain which is the union of (a subset of) the caller's domain, and a fixed domain associated with the procedure. On return, the caller's original protection domain is re-established. Extensive caching of validation data allows amortisation of setup costs over a possibly large number of invocations. The PDX mechanism forms the basis for object support in Mungi, particularly encapsulation. It is also used for accessing devices, and to implement user-level page fault handlers and other services.
An Aggregation Multigrid Solver for convection-diffusion problems onunstructured meshes.
Authors: Herve Guillard, Petr Vanek
Venue:  (1998)

We study an extension of the concept of smoothed aggregation to convection-diffusion equations. Since the approximation of the hyperbolic part of the equations yields unsymmetric matrices, the use of symmetric prolongator smoother is not efficient for the construction of the coarse convection matrices. This leads us to extend the concept of smoothed aggregation to the use of non-symmetric one-sided prolongator smoothers. In this paper, we also clarify the relationship that must exist between the degree of the prolongator polynomial smoother and the aggregation strategy. This work concludes by some numerical experiments illustrating the performance of the proposed method.
iwmeter: A Real-Time and Interactive Parallel Software Monitor for iWarp
Authors: Ming Chan, Eka N. Ginting
Venue:  (1994)

Performance measurement and monitoring tools are indispensable for research and application developments on a parallel system. To be effective, such tools must be accurate, nonintrusive, efficient, and easy to understand. Private-memory MIMD machines present special challenges, especially due to the amount of data that must be gathered and analyzed, as well as the communication support required to manage these data. This paper describes the iwmeter, a real-time and interactive parallel software monitor for MFLOPS performance. Implemented for the iWarp system, a private-memory multicomputer, the iwmeter is composed of three independent units: the sampling units, the collection unit, and the reporting unit. Each sampling unit samples the user''s program in each processor in a random fashion. The collection unit collects the data gathered by each individual sampling unit, and the reporting unit processes nd reports the data to the user. We conclude the paper with an evaluation of the iwmeter''s accuracy.
An Aspect Ratio Bound for Triangulating a d-grid Cut by a Hyperplane
Authors: Scott A. Mitchell, Stephen A. Vavasis
Venue:  (1995)

We consider the problem of triangulating a d-dimensional uniform grid of d-cubes that is cut by a k-dimensional affine subspace. The goal is to obtain a triangulation with bounded aspect ratio. To achieve this goal, we allow some of the box faces near the affine subspace to be displaced. This problem has applications to finite element mesh generation. For general d and k, the bound on aspect ratio that we attain is double-exponential in d. For the important special case of d = 3, the aspect ratio bound is small enough that the technique is useful in practice.
Multiple-View Meta-Modeling of Software Product Lines
Authors: Hassan Gomaa, Michael Eonsuk Shin
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

This paper describes a multiple-view meta-modelingapproach for software product lines using the UnifiedModeling Language notation (UML). A multiple-viewmodel for a software product line is an object-orienteddomain model which defines the different aspects of asoftware product line, namely the use case model, staticmodel, collaboration model, statechart model, andfeature model, including the commonality and variability.The meta-model depicts life cycle phases, views withineach phase, and meta-classes within each view. Therelationships between the different views are described.Consistency checking rules are defined based on therelationships among meta-classes in the meta-model.Finally, tool support for the approach is described.
Deriving individual obligations from collective obligations
Authors: Laurence Cholvy, Christophe Garion
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A collective obligation is an obligation directed to a group of agents so that the group, as a whole, is obliged to achieve a given task. The problem investigated here is the impact of collective obligations on individual obligations, i.e. obligations directed to single agents of the group. In this case, we claim that the derivation of individual obligations from collective obligations depends on several parameters among which the ability of the agents (i.e. what they can do) and their own personal commitments (i.e. what they are determined to do). As for checking if these obligations are fulfilled or not, we need to know what are the actual actions performed by the agents.
Abstract Interpretation of Prolog Based on OLDT Resolution
Authors: Pascal Van Hentenryck, Oliver Degimbe, Baudouin L Charlier, Laurent Michel
Venue:  (1993)

OLDT resolution as a basis for abstract interpretation is a recurring theme in logic programming and was proposed by many authors because of its completeness properties for various classes of programs. In addition, an interesting property of OLDT resolution for abstract interpretation is the very fine granularity it provides for the analysis. This comes from the fact that OLDT resolution associates with each input pair a set of output abstract substitutions, unlike most algorithms which store a single abstract substitution per input pair by using, say, least-upper-bound operation. However, despite its popularity, no experimental results are available on the accuracy and efficiency of OLDT resolution for abstract interpretation. This paper is a systematic study of OLDT resolution for abstract interpretation from the semantic framework to an efficient fixpoint algorithm and its experimental evaluation. The semantic framework demonstrates that pure OLDT resolution is not an appropriate setting for abstract interpretation and proposes an appropriate foundation using the idea of output subsumption. The algorithmic framework presents an efficient fixpoint algorithm by successive refinements. The algorithm includes optimizations such as the caching of abstract operations, output subsumption, and the use of sophisticated dependencies to avoid redundant computations. Comprehensive experimental results on the accuracy and efficiency of the algorithm are presented, using a finite and infinite abstract domain. The algorithm is also compared to other algorithms, working at a coarser granularity. Choices and variations of the algorithm are also carefully studied, including the impact of caching, dependencies, output subsumption, widening, and generalization. The results shed new light on the usefulness of OLDT resolution for abstract interpretation and the impact of granularity in abstract interpretation of logic programs.
Quantifying the reliability of software: statistical testing based on a usage model
Authors: C. Trammell
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

When a population is too large for study, as is the case for all possible uses of a software system, a statistically correct sample must be drawn as a basis for inferences about the population. In statistical testing of software based on a Markov chain usage model, the rich body of analytical results available for Markov chains provides numerous insights that can be used in test planning. Further, the connection between Markov chains and operations research techniques permits a Markov usage model to be expressed as a system of constraints, with mathematical programming used to generate the optimal model for a particular objective function. Since a software usage model is based on the specification, all analyses may be performed early in the development cycle and used as a quantitative basis for management decisions. These techniques have been reduced to engineering practice and used in large projects by IBM, Ericsson, all branches of the US military, and others. In this paper, statistical experiments, Markov models, and optimization techniques are shown to provide a sound theoretical and practical basis far quantifying the reliability of software.
A coordination language for mobile components
Authors: Farhad Arbab, Marcello M. Bonsangue, Frank S. Boer
Venue:  (1999)

Abstract In this paper we present the sigmapi coordination language, a core language for specifying dynamic networks of components. The language is inspired by the Manifold coordination language and by the pi-calculus. The main concepts of the language are components, classes, objects and channels. A program in sigmapi consists of a number of components, where each component is a collection of classes separable from its original context and re-usable in any other context. An object is an instance of a class that executes in parallel with the other objects active in the system. The sigmapi language differs from other models of object-oriented systems mainly in its treatment of communication and mobility: communication is anonymous via synchronous or asynchronous channels, while mobility is obtained by moving channels in the virtual space of linked objects. Thus, a channel is a transferable capability of communication, and objects are mobile in the sense that their communication possibilities may change during a computation. The language sigmapi itself does not impose exogenous coordination, meaning that the coordination primitives affecting each object can be executed within the computation of the object itself. However, only simple restrictions on the class-definitions of a sigmapi program suffice to enforce a separation between computation and coordination. Interaction typically occurs anonymously and under the full control of the objects involved. This make it easier to deal with Internet application where security policies must be enforced in view of the possibilities of attacks.
Usage of Fibonacci Numbers While Organizing the Procedure of Adaptive Testing
Authors: Sergey V. Astanin, Anton A. Gritsanov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

An approach to the organization of adaptive testing is considered. The feature of the approach is an opportunity to purposefully interrogate a student and to minimize a time ofknowledge level detection of the student during computer testing.
Term rewriting with traversal functions
Authors: Mark Brand, Paul Klint, Jurgen J. Vinju
Venue:  (2001)

Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. We extend many-sorted, first-order term rewriting with \emph{traversal functions} that automate tree traversal in a simple and type safe way. Traversal functions can be bottom-up or top-down traversals. They can be either sort preserving transformations, or mappings to a fixed sort. We give examples and describe the semantics and implementation of traversal functions.
Dynamic host routing for production use of developmental networks
Authors: J. Touch, T. Faber
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Many high-speed networks are in a development stage, compared to established technologies like Ethernet. Use of these networks for production service provides substantial benefits to the developers, e.g., for large-scale testing. However, most users are not tolerant of pre-production network outages, even in exchange for the higher bandwidth these networks afford. This paper describes ISI's experience in deploying such a network, Myricom's Myrinet, for production service. A configuration is described that encourages participation in advanced deployment, and provides dynamic backup to a conventional, production-quality network. Each machine individually and transparently reverts to a stable backup network in the event that the prototype network fails. The system is composed of existing tools, and requires no operating system modifications. Alternate configurations are discussed, and recommendations presented to support such deployment more easily in the future.
Relevance Assessments and Retrieval System Evaluation
Authors: Gerard Salton
Venue:  (1968)

Two widely used criteria for evaluating the effectiveness of information retrieval systems are, respectively, the recall and the precision. Since the determination of these measures is dependent on a distinction between documents which are relevant on the one hand, and documents which are not relevant on the other to a given query set, it has sometimes been claimed that an accurate, generally valid evaluation cannot be based on recall and precision. A study was made to determine the effect of variations in relevance assessments on the average recall and precision values used to measure retrieval effectiveness. Using a collection of 1200 documents in information science for test purposes, it is found that large scale differences in the relevance assessments do not produce significant variations in average recall and precision. It thus appears that properly computed recall and precision data may represent effectiveness indicators which are generally valid for many distinct user classes.
An Approach to Solving Large Reliability Models
Authors: A M Boyd, Malathi Veeraraghavan, B J Dugan, S K Trivedi
Venue:  (1988)

This paper describes a unified approach to the problem of solving large realistic reliability models. The methodology integrates behavioral decomposition, state truncation, and efficient sparse matrix-based numerical methods. We propose the use of fault trees together with ancillary information regarding dependencies to automatically generate the underlying Markov model state space. The effectiveness of this approach is illustrated by modeling a state-of-the-art flight control system and a multiprocessor system. Non-exponential distributions for times to failure of components are assumed in the latter example. The modeling tool used for most of this analysis is HARP (The Hybrid Automated Reliability Predictor).
Modifications and Implementation of the Shor-Khachian Algorithm for Linear Programming
Authors: Donald Goldfarb, Michael J. Todd
Venue:  (1980)

We give some modifications of the recent Shor-Khachian algorithm for linear programming and describe a numerically stable implementation. We are concerned with practical problems where user-supplied bounds can usually be provided. Our implementation allows constraint dropping and updates bounds on the optimal value, and should be able to terminate with an indication of infeasibility or with a provably good feasible solution in a moderate number of iterations.
Agent-Based Configuration Management of Distributed Applications
Authors: Juergen Berghoff, Oswald Drobnik, Anselm Lingnau, Christian Moench
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Mobile agents provide a new paradigm for distributed computation. Their unique properties appear well suited to the configuration management of large and complex distributed applications. After outlining our concept of configuration management, we describe a basic agent infra- structure and its extensions for configuration management of distributed applications. Then we consider aspects of concurrent agents and discuss the advantages of the agent based approach through an example.
Expressiveness Bounds for Completeness in Trace-Based Network Proof Systems
Authors: Jennifer Widom, Prakash Panangaden
Venue:  (1987)

Network proof systems based on first-order specifications over channel traces are incomplete unless reasoning over the interleaving of communication events is permitted. Relatively complete trace-based proof systems using temporal logic have been described, but full temporal logic is more powerful than necessary. Using the interleaving approach, we isolate the expressiveness required of a relatively complete trace logic. A hierarchy of temporal logic subsets is then defined; a certain subset is shown to have necessary and sufficient expressive power for relative completeness.
A Dynamic Distributed Video on Demand Service
Authors: Christos Bouras, Vaggelis Kapoulas, Agisilaos Konidaris, Afroditi Sevasti
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

In our days, the use of Internet services has become a part of every day life. The need for more advanced applications is increasing and solutions have to be provided in order to meet it. Multimedia information is constantly getting more popular. The connections' bandwidth though is not ready yet to cope with the rising expectations of applications such as Video on Demand (VoD), which are very consuming in terms of bandwidth.We propose a way to implement such a service over a limited bandwidth/best effort Internet based network. Our proposal consists of the implementation of algorithms and the attempt to introduce Quality of Service features on a network such as the Internet that inherently does not support such features.In this paper we propose two techniques that can serve in the implementation of an Internet based Video on Demand service. The first deals with the distribution of video titles on the several Video Servers and is called Disk Manipulation Algorithm (DMA). The second gives a dynamic nature to the service, imposes a virtual routing procedure to the system and is called Virtual Routing Algorithm (VRA).
Awareness Modeling and Its Application in Cooperative Network Management
Authors: Farhad Daneshgar, Pradeep Ray
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Although communication among the collaborating workers in business processes has always been an important issue to business organizations, there is no measure for the effectiveness of collaboration. This paper presents a model based on ¿Awareness Levels¿ to measure the level of cooperation amongst different human roles in a business process. The hypothesis is that collaboration among various roles within an enterprise environment is improved by maintaining the awareness levels of individuals at its desired level. This paper illustrates the awareness model through its application in a large telecommunication service provider organization. According to this study, the awareness model seems to be able to explain some problems of cooperation in this business environment. Since the model is abstract in nature, it can be applied in different organizations and businesses.
Parallel Best-First Branch-and-Bound in Discrete Optimization
Authors: Ricardo Correa, Afonso Ferreira
Venue:  (1995)

In this report, parallelism is used as a way to solve {\em discrete optimization problems}. We search for an {\em optimal solution} $x^{*}\in S^{*}$, where $S^{*}$ is the set of all best solutions in a {\em % domain} $S$, defined as the discrete set of all vectors $x$ in the solution space that satisfy a set of constraints. Improving the search efficiency is of considerable importance since exhaustive search is often impracticable. The method called {\em % branch-and-bound} (noted B\&B) is a tree search algorithm often used as an intelligent search in this context. Its principle lies in successive decompositions of the original problem in smaller disjoint subproblems until an optimal solution is found. The algorithm consists of a heuristic itn this context. Its principle lies in successive decompositions of the original problem in smaller disjoint subproblems until an optimal solution is found. The algorithm consists of a heuristic iterative search that avoids visiting some subproblems which are known not to contain an optimal solution. Parallel processing has been widely studied as an additional source of improvement in search efficiency in discrete optimization. We review in this report the literature pertinent to {\em parallel branch-and-bound algorithms}. The focus is on {\em distributed memory} parallel systems, which are composed of a set of processors connected by a physical network, each one with its own local memory. The communications between two different processors are implemented through the exchange of messages over links of the network connecting the two processors. Given that an attractive feature is that disjoint subproblems can be decomposed simultaneously and independently, the challenge is how to use the set of processors to improve the search efficiency of B\&B algorithms, concurrently decomposing several subproblems at each iteration. In general terms, the potential to be explored consists of a linear -- on the number of processors -- reduction on the number of iterations. However, the reduction on the number of iterations can deviate considerably from linear due to possible {\em % speedup anomalies}. Parallel B\&B is traditionally considered as an irregular parallel algorithm due to the fact that the structure of the search tree is not known beforehand. It may result in unnecessary work if a subproblem that does not contain an optimal solution is chosen and assigned to a processor to be decomposed. Therefore, the use of a distributed memory parallel system incurs a number of overheads, including communication overheads and idle time due to workload imbalance and contention on common data structures. Several special techniques have been developed to address these problems, essentially related to the amount of ``necessary'''' work assigned to each processor. This report reviews these techniques, attempting to tie the area of parallel B\&B under a common, uniform terminology. It can be profitable both to the parallel processing