ppxscal/embedding_network huggingface dataset:
ZOMA: A Preemptive Deadlock Recovery Mechanism for Fully Adaptive Routing in Wormhole Networks
Authors: Z. H. Al-Awwami, M. S. Obaidat, M. Al-Mulhem
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Deadlock is the most formidable obstacle that adaptive routing algorithms in wormhole switched interconnection networks must address and overcome. The class of True Fully Adaptive Routing algorithms represents an efficient routing technique with favorable performance and operational characteristics. These algorithms route packets without imposing any routing restrictions. This paper proposes a true fully adaptive routing algorithm with a new deadlock-recovery mechanism. Our proposed deadlock-recovery mechanism, ZOMA, is efficient and takes advantage of the concept of wormhole switching in terms of low hardware resource requirements. The performance of the new mechanism can match that of other more expensive deadlock-recovery mechanisms, while requiring lower hardware resources that are not on the critical path of the switching process. The proposed mechanism creates a new category of deadlock recovery techniques that we refer to as preemptive as opposed to the existing progressive and regressive categories. Performance evaluation of the proposedmechanism against other routing algorithms is accomplished via simulation.
Efficient Error Recovery For Reliable Multicast
Authors: Zhen Xiao
Venue:  (2001)

Multicast is an efficient mechanism for distributing data from one sender to multiple receivers. Many applications need a reliable multicast service which is not provided by the existing IP multicast protocol. Providing such a service on a large scale requires efficient algorithms for error recovery. This dissertation presents a randomized reliable multicast protocol called RRMP which has demonstrably achieved several good properties. The protocol eliminates message implosion by diffusing the responsibility of error recovery among all members in the group and improves the robustness of the system against process failures. It provides good local recovery by dynamically organizing members into an error recovery hierarchy according to their geographic locations. It optimizes buffer management through an innovative two-phase buffering algorithm that explicitly addresses the variances in delivery latency for large multicast groups. The algorithm reduces buffer requirements by adaptively allocating buffer space to messages most needed in the system and by spreading the load of buffering among all members in the group. The key idea of RRMP is to use randomization as a powerful technique to achieve high robustness and efficiency in reliable multicast communications. The RRMP protocol works well within the existing IP multicast framework and does not require additional support from network routers. Both analysis and experimental results show that the performance penalty due to randomization is low and can be tuned according to application requirements.
The Verilog Procedural Interface for the Verilog Hardware Description Language
Authors: C. Dawson, S. K. Pattanam, D. Roberts
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The Verilog Procedural Interface is a new C programming interface for the Verilog Hardware Description Language. Different Verilog HDL based tools such as simulators, synthesizers, timing analyzers, and parsers could support this interface for applications which extend the tool's functionality. VPI is part of the IEEE 1364 Programming Language Interface standard. VPI is considered to be the third generation procedural interface to Verilog HDL. The first two generations evolved in conjunction with Verilog-XL and the Verilog HDL. This process resulted in interfaces which lacked consistency and functionality for applications. VPI provides a consistent object-oriented access to the complete Verilog HDL language as described in the IEEE 2364 Language Reference Manual. VPI also provides a well defined interface for supporting Verilog-HDL based simulation. It is believed that this interface can be easily extended to meet future needs. A major portion of the VPI functionality is available in the Verilog-XL 2.2 simulator released in 9502. The complete VPI functionality will be available in the Verilog-XL 2.3 simulator to be released in 9504. The paper briefly discusses the evolution of the Verilog HDL programming language interfaces features of the VPI interface, and a set of possible powerful applications.
A Model of Shared Data References in Parallel Programs
Authors: A M Holliday
Venue:  (1989)

The reference pattern to shared data has a major effect on the performance of large-scale shared memory machines with distributed memory. We propose a technique for characterizing this pattern which is systematic and application domain-independent. In particular, each process''s trace is viewed as the sample path of a semi-Markov process. We experimentally evaluate the effectiveness of the proposed approach on a range of realistic parallel programs with encouraging results. This technique may be useful for quantitatively comparing ``typical'''' parallel computations and for systematically studying the effect on performance of variations in a particular computation.
Image warping based on elastic body spline transformation: application for facial animations
Authors: H. Aboul-Ella, M. Nakajima
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The warping of scattered data points is a problem that is appearing in science and engineering. The basic problem involves the construction of a reasonable interpolation function that goes through some of the data points. In this paper, we propose a new spatial image warping algorithm which uses an elastic body spline to generate a warp function that interpolates scattered data points. The spline is based on a partial differential equation of Naiver that describes the equilibrium displacement of the elastic body when subjected to certain forces. The spline maps can be expressed as the linear combination of an affine transformation and a Naiver interpolation spline. The proposed algorithm generates a smooth warp that reflects the feature correspondence points. The in-between facial animation from given true facial images could be defined by interpolating the positions of correspondence features and their shapes and colors.
Simulation of thermoplastic composite forming using shells with pinching elements
Authors: A. Cheruet, D. Soulat, P. Boisse, M. Touratier, E. Soccard, S. Maison-Le Poec, S. Guinard
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Forming at high temperature composites with continuous fibers and thermoplastic matrix permits to obtain structures with high mechanical properties in a single and fast manufacturing operation. An experimental study is presented that shows that porosities appears at the beginning of the process and that the re-compaction stage is very important in order to obtain a final state without defects. In order to simulate the forming process including the compaction, a shell with pinching element is developed. This element permits to account for the through the thickness loads and stresses that are essential for the consolidation of the material. It is shown that the formulation of the element can lead to a locking and how it can be avoid.
Can Metrics Help to Bridge the Gap Between the Improvement of OO Design Quality and Its Automation?
Authors: Houari A. Sahraoui, Robert Godin, Thierry Miceli
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

During the evolution of object-oriented systems, the preservation of correct design should be a permanent quest. However, for systems involving a large number of classes and subject to frequent modifications, detection and correction of design flaws may be a complex and resource-consuming task. The use of automatic detection and correction tools can be helpful for this task. Various works propose transformations that improve the quality of an object-oriented system while preserving its behavior. In this paper, we propose to investigate whether some object-oriented metrics can be used as indicators for automatically detecting situations where a particular transformation can be applied to improve the quality of a system. The detection process is based on analyzing the impact of various transformations on these object-oriented metrics using quality estimation models.
Searchers' criteria For assessing web pages
Authors: Anastasios Tombros, Ian Ruthven, Joemon M. Jose
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We investigate the criteria used by online searchers when assessing the relevance of web pages to information-seeking tasks. Twenty four searchers were given three tasks each, and indicated the features of web pages which they employed when deciding about the usefulness of the pages. These tasks were presented within the context of a simulated work-task situation. The results of this study provide a set of criteria used by searchers to decide about the utility of web pages. Such criteria have implications for the design of systems that use or recommend web pages, as well as to authors of web pages.
Experiments with Parallel Algorithms for Combinatorial Problems
Authors: G. A.P. Kindervater, H. W.J.M. Trienekens
Venue:  (1985)

In the last decade many models for parallel computation have been proposed and many parallel algorithms have been developed. However, few of these models have been realized and most of these algorithms are supposed to run on idealized, unrealistic parallel machines. The parallel machines constructed so far all use a simple model of parallel computation. Therefore, not every existing parallel machine is equally well suited for each type of algorithm. The adaptation of a certain algorithm to a specific parallel archi- tecture may severely increase the complexity of the algorithm or severely obscure its essence. Little is known about the performance of some standard combinatorial algorithms on existing parallel machines. In this paper we present computational results concerning the solution of knapsack, shortest paths and change-making problems by branch and bound, dynamic programming, and divide and conquer algorithms on the ICL-DAP (an SIMD computer), the Manchester dataflow machine and the CDC-CYBER-205 (a pipeline computer). 1980 Mathematics Subject Classification: 90C27, 68Q10, 68R05. This paper appeared in European Journal of Operational Research, Vol. 33, pp 65-81, 1988.
Local problems on stars: a posteriori error estimators, convergence, and performance
Authors: Pedro Morin, Ricardo H. Nochetto, Kunibert G. Siebert
Venue: Mathematics of Computation (2003)

A new computable a posteriori error estimator is introduced, which relies on the solution of small discrete problems on stars. It exhibits built-in flux equilibration and is equivalent to the energy error up to data oscillation without any saturation assumption. A simple adaptive strategy is designed, which simultaneously reduces error and data oscillation, and is shown to converge without mesh pre-adaptation nor explicit knowledge of constants. Numerical experiments reveal a competitive performance, show extremely good effectivity indices, and yield quasi-optimal meshes.
An OODBMS graphical development environment
Authors: B. C. Desai, K. A. Jababo
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

A software development environment is a collection of tools that support various phases of its development. The environment wherein an application is developed may have a larger effect on the programming process than does the language used for the application. As such, tools are very important; Graphical Development Environment for Postgres (GDEP) is such a tool which enables OODB developers to be more efficient and productive. It allows Postgres users to create, edit, view, import and export classes to and from the database without knowing the syntax of Postquel, the query language for Postgres. Also, GDEP provides developers with an interface window allowing them to issue direct Postquel commands. We discuss the functionalities of GDEP, as well as the enhancements GDEP adds to Postgres. In addition, GDEP has the ability to show properties as a flat class as well as a regular class with inheritance properties.
Uniform Bounds on the Limiting and Marginal Derivatives of the Analytic Center Solution over a Set of Normalized Weights
Authors: A. G. Holder, R. J. Caron
Venue:  (1998)

While properties of the weighted central path for linear and non-linear programs have been studied for years, the effect that weighting the central path has on its limiting derivatives has not been fully explored. We show that when there is a unique dual solution, the limiting derivatives of the central path for a linear program are uniformly bounded over a set of normalized weights. Consequently, this allows a similar bound for the marginal derivatives of the analytic center solution with respect to changes in the right-hand side.
Collapsible Cylindrical Trees: A Fast Hierarchical Navigation Technique
Authors: Raimund Dachselt, Jürgen Ebert
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

This paper proposes a new visualization and interaction technique for medium-sized trees, called Collapsible Cylindrical Trees (CCT). Child nodes are mapped on rotating cylinders, which will be dynamically displayed or hidden to achieve a useful balance of detail and context. Besides a comprehensible three-dimensional visualization of trees, the main feature of CCT is a very fast and intuitive interaction with the displayed nodes. Only a single click is needed to reach every node and perform an action on it, such as displaying a web page. The CCT browsing technique was developed for interaction with web hierarchies but is not limited to this domain. We also present sample implementations of CCT using VRML, which show the usefulness of this intuitive tree navigation technique.
Asymptotically Optimal Tree--Pacings in Regular Graphs
Authors: Kelmans Alexander, Mubayi Dhruv, Sudakov Benny
Venue:  (2000)

Let $T$ be a tree with $t$ vertices. Clearly, an $n$ vertex graph contains at most $n/t$ vertex disjoint trees isomorphic to $T$. In this paper we show that for every $\ep<0$, there exists a $D(\ep,t)<0$ such that, if $d<D(\ep,t)$ and $G$ is a simple $d$-regular graph on $n$ vertices, then $G$ contains at least $(1-\ep)n/t$ vertex disjoint trees isomorphic to $T$. Keywords: graph, hypergraphs, packing, trees, matchings
Mathematics for a fundamental problem of biological information processing
Authors: W. R. Stark, J. F. Pedersen
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

The grand challenge of distributed processes is to bridge the chasm separating local...from global.... How does cellular behavior determine structure and behavior at the tissue level? How do the switching characteristics of transistors determine the behavior of a computer chip? The first of these questions is made difficult by the amorphous nature of communication between components. In both theory and simulations, the authors use large irregular networks of automata with asynchronous activity as models. The local structure is seen in the automaton's state-transition diagram. The global structure is seen in the global computation space. THEME: In entropy-reducing processes, the global attractors are homomorphic to the local slate-transition graph. The authors' investigations focus on systems of oscillators, on Turing's leopards' spot problem, and on networks of finite state automata. To the extent that global structure corresponds to global behavior, the authors' results provide a way of reducing the behavior of a tissue to that of its cells (a fundamental problem of biology).
Leading to a Kind Description Language: Thoughts on Component Specification
Authors: Joseph R. Kiniry
Venue:  (1999)

The Kind Description Language (KDL) is a language used for describing the interface and behavior of software components. KDL is an extension of the Object Management Group''s Object Constraint Language (OCL). While OCL is only able to describe safety properties of a component and its features, KDL can also describe progress properties with temporal operators like leads-to. KDL also introduces several new "convenience" constructs that help simplify and clarify complex component descriptions. KDL can be used to specify a component''s simple behavioral interface, as in Meyer''s Design by Contract, the more complex temporal properties that distributed objects and components exhibit, and more.
Regular Expression Pocket Reference, 1 edition
Authors: Tony Stubblebine
Venue:  (2003)

Ideal as an introduction for beginners and a quick reference for advanced programmers, Regular Expression Pocket Reference is a comprehensive guide to regular expression APIs for C, Perl, PHP, Java, .NET, Python, vi, and the POSIX regular expression libraries. This handy book offers programmers a complete overview of the syntax and semantics of regular expressions, which are at the heart of every text-processing application. When you've reached a sticking point and need to get to a solution quickly, the new Regular Expression Pocket Reference is the book you'll want to have.
Dimensioning large call centers
Authors: Simon C. Borst, A. Mandelbaum, M. I. Reiman
Venue:  (2000)

We develop a framework for asymptotic optimization of a queueing system. The motivation is the staffing problem of call centers with 100''s of agents (or more). Such a call center is modeled as an M/M/N queue, where the number of agents~$N$ is large. Within our framework, we determine the asymptotically optimal staffing level~$N^*$ that trades off agents'' costs with service quality: the higher the latter, the more expensive is the former. As an alternative to this optimization, we also develop a constraint satisfaction approach where one chooses the least~$N^*$ that adheres to a given constraint on waiting cost. Either way, the analysis gives rise to three regimes of operation: quality-driven, where the focus is on service quality; efficiency-driven, which emphasizes agents'' costs; and a rationalized regime that balances, and in fact unifies, the other two. Numerical experiments reveal remarkable accuracy of our asymptotic approximations: over a wide range of parameters, from the very small to the extremely large, $N^*$ is {\em exactly\/} optimal, or it is accurate to within a single agent. We demonstrate the utility of our approach by revisiting the square-root safety staffing principle, which is a long-existing rule-of-thumb for staffing the M/M/N queue. In its simplest form, our rule is as follows: if $c$ is the hourly cost of an agent, and $a$ is the hourly cost of customers'' delay, then $N^* = R + y^*({a \over c}) \sqrt R$, where $R$ is the offered load, and $y^*(\cdot)$ is a function that is easily computable.
Incremental Computation for Transformational Software Development
Authors: Yanhong A. Liu, Tim Teitelbaum
Venue:  (1995)

Given a program $f$ and an input change $\oplus$, we wish to obtain an incremental program that computes $f(x\oplus y)$ efficiently by making use of the value of $f(x)$, the intermediate results computed in computing $f(x)$, and auxiliary information about $x$ that can be inexpensively maintained. Obtaining such incremental programs is an essential part of the transformational-programming approach to software development and enhancement. This paper presents a systematic approach that discovers a general class of useful auxiliary information, combines it with useful intermediate results, and obtains an efficient incremental program that uses and maintains these intermediate results and auxiliary information. We give a number of examples from list processing, VLSI circuit design, image processing, {\it etc}.
On the Number of Dependent Variables for Incompletely Specified Multiple-Valued Functions
Authors: Tsutomu Sasao
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper considers the minimization of dependent variables in functions with many does not cares. It also derives the conditions for almost all randomly generated function to be redundant in at least one variable. Experimental results support the validity of the approach.
Reliable Matching and Scheduling of Precedence-Constrained Tasks in Heterogeneous Distributed Computing
Authors: Atakan Dogan, Füsun Özgüner
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

In this paper, two cost functions that can be incorporated into a matching and scheduling algorithm for tasks with precedence constraints are introduced to enable the algorithm to consider the reliability of different resources in the system while making decisions. The cost functions introduced are unique in the sense that they are not restricted to tree-based networks and a specific matching and scheduling algorithm. As an example, cost functions are applied to a compile time, static list scheduling heuristic. The simulation results confirm that the proposed cost functions can be exploited to produce task assignments where the effect of failures of machines and network resources on the execution of the application is reduced.
On transformation of authorization policies
Authors: Yun Bai, Vijay Varadharajan
Venue: Data Knowledge Engineering (2003)

In this paper, we propose a logic based approach to specify and to reason about transformation of authorization policies. The authorization policy is specified using a policy base which comprises a finite set of facts and access constraints. We define the structure of the policy transformation and employ a model-based semantics to perform the transformation under the principle of minimal change. Furthermore, we extend model-based semantics by introducing preference ordering to resolve possible conflicts during transformation of policies. We also discuss the implementation of the model-based transformation approach and analyse the complexity of the algorithms introduced. Our system is able to represent both implicit and incomplete authorization requirements and reason about nonmonotonic properties.
Scaling Bayesian network discovery through incremental recovery
Authors: J. R Castelo Valdueza, Arno P.J.M. Siebes
Venue:  (1999)

Bayesian networks are a type of graphical models that, e.g., allow one to analyze the interaction among the variables in a database. A well-known problem with the discovery of such models from a database is the ``problem of high-dimensionality''''. That is, the discovery of a network from a database with a moderate to large number of variables quickly becomes intractable. Most solutions towards this problem have relied on prior knowledge on the structure of the network, e.g., through the definition of an order on the variables. With a growing number of variables, however, this becomes a considerable burden on the data miner. Moreover, mistakes in such prior knowledge have large effects on the final network. Another approach is rather than asking the expert insight in the structure of the final network, asking the database. Our work fits in this approach. More in particular, before we start recovering the network, we first cluster the variables based on a chi-squared measure of association. Then we use an incremental algorithm to discover the network. This algorithm uses the small networks discovered for the individual clusters of variables as its starting point. We illustrate the feasibility of our approach with some experiments. More in particular, we show that in the case where one knows the network, and thus the order, our algorithm yields almost the same network which is, moreover, still an I-map.