ppxscal/embedding_network huggingface dataset:
Low Cost Convolutional Code Based Concurrent Error Detection in FSMs
Authors: Konstantinos Rokas, Yiorgos Makris, Dimitris Gizopoulos
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

We discuss the use of convolutional codes to perform concurrent error detection (CED) in finite state machines (FSMs). We examine a previously proposed methodology, we identify its limitations, and we outline two improvements that reduce its cost and enhance its effectiveness. More specifically, we demonstrate how the existing FSM hardware can be reused for computing the convolutional code keys and we formulate the optimization problem of maximizing hardware reusability. Additionally, we extend the proposed methodology to detect errors that only affect the output logic but not the next state of the FSM, which are not detected by the previously proposed methodology.
A framework of cooperating agents hierarchies for local-area mobility support
Authors: Ayman Adel Abdel Hamid
Venue:  (2003)

Host mobility creates a routing problem in the Internet, where an IP address reflects the network's point of attachment. Mobile IP, relying on a mapping between a home address and a care-of address, and a home registration process, is widely accepted as a solution for the host mobility problem in wide-area mobility scenarios. However, its home registration requirement, upon each change of point of attachment, makes it unsuitable to handle local-area mobility, resulting in large handoff latencies, increased packet loss, and disrupted services. In this dissertation, we introduce a local-area mobility support framework for IPv4 based on the deployment of multiple cooperating mobility agents hierarchies in the foreign domain. First, we introduce a hierarchy model offering a backward compatible mode to service legacy mobile hosts, unaware of local-area mobility extensions. Second, for intra-hierarchy handoffs, we identify several design deficiencies within the current Mobile IP hierarchy extension proposal, and present an enhanced regional registration framework for local handoffs that encompasses a replay protection identification value dissemination mechanism. In addition, we present two novel registration frameworks for home registrations involving local handoffs, in which we identify the dual nature of such registrations, and attempt to emphasize the local handoff aspect. One technique, maintains tunneling of data packets to the MH (Mobile Host) through an old path until a home registration reply is received to set up the new path. In contrast, the other technique adopts a more proactive bold approach in switching immediately to the new path resulting in a reduction of the handoff latency. Third, for inter-hierarchy handoffs, we present a scalable, configurable, and cooperation based framework between mobility agents hierarchies to reduce the handoffs latencies. An attempt is made to exploit the expected network proximity between hierarchies within the foreign domain, and maintain a mobile host's home-registered care-of address unchanged while within the same foreign domain. In addition, the involved registration signaling design requires a reduced number of security associations between mobility agents belonging to different hierarchies, and copes with the fact that the mobile host's home-registered care-of address might not be reachable. (Abstract shortened by UMI.)
Semidiscrete Finite Element Approximations of a Linear Fluid-Structure Interaction Problem
Authors: Q. Du, M. D. Gunzburger, L. S. Hou, J. Lee
Venue: SIAM Journal on Numerical Analysis (2004)

Semidiscrete finite element approximations of a linear fluid-structure interaction problem are studied. First, results concerning a divergence-free weak formulation of the interaction problem are reviewed. Next, semidiscrete finite element approximations are defined, and the existence of finite element solutions is proved with the help of an auxiliary, discretely divergence-free formulation. A discrete inf-sup condition is verified, and the existence of a finite element pressure is established. Strong a priori estimates for the finite element solutions are also derived. Then, by passing to the limit in the finite element approximations, the existence of a strong solution is demonstrated and semidiscrete error estimates are obtained.
Saving Power by Mapping Finite-State Machines into Embedded Memory Blocks in FPGAs
Authors: Anurag Tiwari, Karen A. Tomko
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Modern FPGAs contain on-chip synchronous embedded memory blocks (SEMBs), these memory blocks can be used to implement control units, when not used as on-chip memory. In this paper, we explore the mapping of Finite State Machines (FSMs) into the SEMBs for power and area minimization. We have shown the SEMB based implementation of the FSMs and compared it with conventional Flip-Flop (FF) based implementation. The proposed implementation of the FSMs consumes less power and has lower area and routing overhead than the FF based approach and it can be clocked at the maximum clock frequency supported by the SEMBs. Experimental results show that the SEMB based FSM consumes 4% to 26% less power than the conventional implementation. In addition it is observed that the power consumption can be further reduced by stopping the clock to the SEMBs during the idle states.
Using usability heuristics to evaluate patient safety of medical devices
Authors: Jiajie Zhang, Todd R. Johnson, Vimla L. Patel, Danielle L. Paige, Tate Kubose
Venue: Journal of Biomedical Informatics (2003)

Objective. To modify the traditional heuristic evaluation method of assessing software usability so that it can be applied to medical devices and used to evaluate the patient safety of those devices through the identification and assessment of usability problems.Design. Heuristic evaluation, a usability inspection method commonly used for software usability evaluation, was modified and extended for medical devices. The modified method was used to evaluate and compare the patient safety of two 1-channel volumetric infusion pumps.Results. The modified heuristic evaluation method was successfully applied to medical devices. One hundred and ninety-two heuristic violations were categorized for 89 usability problems identified for Pump 1, and 121 heuristic violations were categorized for the 52 usability problems identified for Pump 2. Pump 1 had more usability problems with high severity ratings than Pump 2. In general, Pump 1 was found to have more usability issues that are likely to induce more medical errors.Conclusions. Heuristic evaluation, when modified for medical devices, is a useful, efficient, and low cost method for evaluating patient safety features of medical devices through the identification of usability problems and their severities.
Bottleneck analysis for network flow model
Authors: Yong-Heng Jiang, Ling Wang, Yi-Hui Jin
Venue: Advances in Engineering Software (2003)

It is very important to develop effective strategies for process industry to implement feasible scheduling while the process bottlenecks work optimally. However, the bottlenecks adopted by the existed scheduling strategies are often partial bottlenecks, local bottlenecks, or even deceptive bottlenecks, which are basically not key constraints to achieve optimal objective, so that the corresponding scheduling strategies are not perfect, and the further improvement and evaluation can hardly be proposed. So, it is a valuable issue to analyze the bottlenecks both in academic and engineering fields. This paper aims at the minimum cost problem of generalized network flow model to define and analyse three classes of bottlenecks based on generalized network simplex algorithm, and the corresponding search algorithms are proposed in this paper. The obtained bottlenecks cannot only be used to determine whether the object cost will be increased or decreased, but also be used to propose the corresponding strategy to evaluate the improvement on the network flow model for scheduling. Finally, a typical example is discussed.
A New Approach to the Lur'e Problem in the Theory of Absolute Stability
Authors: A. A. Zevin, M. A. Pinsky
Venue: SIAM Journal on Control and Optimization (2003)

The classical Lur'e problem consists of finding conditions for absolute stability of a linear system with a nonlinear feedback contained within a prescribed sector. Most of the results obtained on this problem are based on the frequency domain or Lyapunov functions methods which are applied to systems with a time-invariant or periodic linear block. This paper develops a new approach providing a sufficient stability criterion for systems with time-variable coefficients, which is expressed in the transfer function of the linear block and the sector margins of the nonlinear block. The systems for which this criterion is precise are found. It is shown that stability of a system with a sign-constant transfer function is guaranteed by stability of the system with a limit linear feedback (so that, for such systems, the famous Aizerman conjecture is true). This, in particular, is the case for systems with a linear block consisting of an arbitrary number of first order time-dependent links. As an example, the stability criterion is applied to a second order system for which the obtained results are contrasted with ones delivered by the Popov criterion.
Three-dimensional reconstruction from serial non-contiguous sections using variational implicit techniques
Authors: Michel Baudry
Venue:  (2002)

Variational implicit surfaces have been widely used in computer graphics and animation and generally provide appropriate solutions for uniformly distributed sparse data. The fields of medicine and biology increasingly rely on accurate three-dimensional reconstructions for data visualization and registration. Despite the fact that biological structures fit perfectly within the scope of variational implicit interpolation (smooth closed surfaces), the structures to model in these fields constitute a computational challenge due to the non-homogeneity of the initial dataset that usually consists in serial distant sections, as well as the presence of local high curvatures in the shapes to reconstruct. This thesis proposes different approaches that address these issues. Solutions based on the utilization of isotropic/anisotropic compactly supported radial basis function and surface regularization are presented. Probabilistic contours are introduced as a direct and useful application of the use of implicit functions in the reconstruction paradigm. Further constraints to the reconstruction are presented in the form of a section-to-section registration, shape transformation and its incorporation as shape of influence within the global interpolation scheme. However optimized for serial non-contiguous sections, this work can be easily generalized to the reconstruction of any biological structure from a non-uniform initial dataset.
Elimination of First Order Errors in Time Dependent Shock Calculations
Authors: Malin Siklosi, Gunilla Kreiss
Venue: SIAM Journal on Numerical Analysis (2003)

First order errors downstream of shocks have been detected in computations with higher order shock-capturing schemes in one and two dimensions. We use matched asymptotic expansions to analyze the phenomenon for one dimensional time dependent hyperbolic systems and show how to design the artificial viscosity term in order to avoid the first order error. Numerical computations verify that second order accurate solutions are obtained.
Guidelines for interdomain traffic engineering
Authors: Nick Feamster, Jay Borkenhagen, Jennifer Rexford
Venue: ACM SIGCOMM Computer Communication Review (2003)

Network operators must have control over the flow of traffic into, out of, and across their networks. However, the Border Gateway Protocol (BGP) does not facilitate common traffic engineering tasks, such as balancing load across multiple links to a neighboring AS or directing traffic to a different neighbor. Solving these problems is difficult because the number of possible changes to routing policies is too large to exhaustively test all possibilities, some changes in routing policy can have an unpredictable effect on the flow of traffic, and the BGP decision process implemented by router vendors limits an operator's control over path selection.We propose fundamental objectives for interdomain traffic engineering and specific guidelines for achieving these objectives within the context of BGP. Using routing and traffic data from the AT&T backbone we show how certain BGP policy changes can move traffic in a predictable fashion, despite limited knowledge about the routing policies in neighboring AS's. Then, we show how operators can gain greater flexibility by relaxing some steps in the BGP decision process and ensuring that neighboring AS's send consistent advertisements at each peering location. Finally, we show that an operator can manipulate traffic efficiently by changing the routes for a small number of prefixes (or groups of related prefixes) that consistently receive a large amount of traffic.
Measuring economic well-being and governance: some methodological tools
Authors: Sudip Ranjan Basu
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Over the last decade, there has been a continuos attempt to provide some suitable methodologies for the measurement of 'Human Development', 'Human Poverty', 'Gender Developoment', 'Governance', 'Corruption', 'Happiness', etc., among the International Organisations (e.g., UNDP, World Bank), and in the academic profession (e.g., ICRG, BERI, FH etc.). In all these studies the single most important element is to quantify some of the subjective or abstract variables/elements into a single quantitative value, so that the countries or the regions could be placed in the rank ordering on the basis of the values of such indices.In this paper we attempt to provide a new method to compute the economic well being (a measure of over all economic development) and governance (a measure of institutional quality) in the economy/society.
Deriving Software Statistical Testing Model from UML Model
Authors: Yan Jiong, Wang Ji, Chen Huowang
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Software statistical testing is concerned with testingthe entire software systems based on their usagemodels. In the context of UML-based development, it isdesired that usage models can be derived from UMLanalysis artifacts. This paper presents a method thatderives the software usage models from reasonablyconstrained UML artifacts. The method utilizes use casediagrams, sequence diagrams and the executionprobability of each sequence diagram in its associateduse case. By projecting the messages in sequencediagrams onto the objects under test, the method elicitsmessages and their occurrence probabilities forgenerating the usage model of each use case for theobjects under test. Then the usage models of use casesare integrated into the system usage model. Theintegration procedure will utilize the executionsequential relations between use cases.
Simultaneously searching for planning goals, operators, and effectors
Authors: Daniel M. Gaines
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

In this work, we describe an approach to automated manufacturing feature extraction and operations planning that combines the two processes to benefit both. When viewed in planning terms, if feature extraction is the process of identifying planning goals, and operations planning is the the process of selecting and sequencing planning operators, then what we are doing can be viewed as combining the normally separate processes of finding goals and developing instantiated operators to satisfy them. Thus, we call this approach Ebgoc (Effector-Based Goal and Operator Construction), and we have implemented it in a computer program called Mediator. Effectors are the physical equipment, such as tools and machines, that are used to transform the initial materials into the desired end product (goal). We say that this approach is effector-based (rather than feature-based) because we do not recognize a fixed set of features, but instead we geometrically derive the set of shapes that can be machined with the currently available set of effectors. Thus, each shop can customize Mediator so that it identifies machinable volumes appropriate for the resource in that specific shop. This approach gives Mediator several important properties. It can 1) effectively handle feature interactions (e.g., volumetric intersections), 2) be customized to produce features appropriate to specific shop resources, 3) identify areas that the current resources cannot machine, and 4) handle nonstandard, user-defined tooling.
An iterative Riemann solver for systems of hyperbolic conservation laws, with application to hyperelastic solid mechanics
Authors: G. H. Miller
Venue: Journal of Computational Physics (2004)

In this paper, we present a general iterative method for the solution of the Riemann problem for hyperbolic systems of PDEs. The method is based on the multiple shooting method for free boundary value problems. We demonstrate the method by solving one-dimensional Riemann problems for hyperelastic solid mechanics. Even for conditions representative of routine laboratory conditions and military ballistics, dramatic differences are seen between the exact and approximate Riemann solution. The greatest discrepancy arises from misallocation of energy between compressional and thermal modes by the approximate solver, resulting in nonphysical entropy and temperature estimates. Several pathological conditions arise in common practice and modifications to the method to handle these are discussed. These include points where genuine nonlinearity is lost, degeneracies, and eigenvector deficiencies that occur upon melting.
Storing RDF as a Graph
Authors: Valerie Bönström, Annika Hinze, Heinz Schweppe
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

RDF is the first W3C standard for enriching information resources of the Web with detailed meta data. The semantics of RDF data is defined using a RDF schema. The most expressive language for querying RDF is RQL, which enables querying of semantics. In order to support RQL, a RDF storage system has to map the RDF graph model onto its storage structure. Several storage systems for RDF data have been developed, which store the RDF data as triples in a relational database. To evaluate an RQL query on those triple structures, the graph model has to be rebuilt from the triples.In this paper, we presented a new approach to store RDF data as a graph in a object-oriented database. Our approach avoids the costly rebuilding of the graph and efficiently queries the storage structure directly. The advantages of our approach have been shown by performance test on our prototype implementation OO-Store.
Understanding meteor burst communications technologies
Authors: B. Craig Cumberland Joseph S. Valacich, Leonard M. Jessup
Venue: Communications of the ACM (2004)

Seeking to realize the potential of a reemergent communications capability.
Organizing Libraries of DFG Patterns
Authors: Gero Dittmann
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We propose to arrange a library of tree patterns into a hierarchy by means of identity operations. Compared with current unstructured approaches, our new method reduces the computational complexity of searching a pattern from O(n ¿ p) to only O(d), d ¿ p. Furthermore, the organization reveals synergies between patterns for ASIP instruction-set synthesis, data-path sharing, and code generation.
Multiple zooming in geographic maps
Authors: Daniele Frigioni, Laura Tarantino
Venue: Data Knowledge Engineering (2003)

We present a zooming model, based on a level-of-detail (LOD) approach, aimed at visualizing sequences of gradually simplified representations of a given geographic map. We first describe a set of basic zooming primitives as transitions between maps at different LOD. We then define a new multiple zooming primitive on top of the basic ones, and show theoretical results concerning this new primitive with practical implications. Finally, we put the proposed theoretical model into practice, and suggest an implementation of maps and zooming primitives in terms of PLA-structures, a topological invariant suitable for the inclusion in a visual interaction environment based on a focus + context approach.
Embedding web-based statistical translation models in cross-language information retrieval
Authors: Wessel Kraaij, Jian-Yun Nie, Michel Simard
Venue: Computational Linguistics (2003)

Although more and more language pairs are covered by machine translation (MT) services, there are still many pairs that lack translation resources. Cross-language information retrieval (CLIR) is an application that needs translation functionality of a relatively low level of sophistication, since current models for information retrieval (IR) are still based on a bag of words. The Web provides a vast resource for the automatic construction of parallel corpora that can be used to train statistical translation models automatically. The resulting translation models can be embedded in several ways in a retrieval model. In this article, we will investigate the problem of automatically mining parallel texts from the Web and different ways of integrating the translation models within the retrieval process. Our experiments on standard test collections for CLIR show that the Web-based translation models can surpass commercial MT systems in CLIR tasks. These results open the perspective of constructing a fully automatic query translation device for CLIR at a very low cost.
Information technology project management to achieve efficiency in Brazilian companies
Authors: Marly Monteiro de Carvalho, Fernando José Barbin Laurindo, Marcelo Schneck de Paula Pessôa
Venue: Managing globally with information technology (2003)

This chapter focuses on applying the best practices in Information Technology (IT) project management in Brazil. The theoretical models adopted to discuss this issue are the Capability Maturity Model - CMM (Humphrey, 1989; Paulk et al, 1995), Project Management Maturity Model-PMMM (Kerzner, 2000 and 2001); the Project Management Body of Knowledge - PMBoK (PMI, 2000), and Quality Systems for software - IS09000- 3 (2001) and ISO 12207 (1995).Several problems have been discussed regarding the efficiency of IT projects. Evaluation of efficiency is a controversial issue, and meeting project efficiency goals involves balancing scope expectations and the available resources.This chapter presents IT project cases in Brazilian companies and a comparative analysis of their IT projects management models. The study is based on multiple cases: financial services, telecommunications and building materials companies. Interviews with the main actors from different levels of the organisational hierarchy have been done.
Representing and Computing Some Configuration Properties for the n-Dimensional Orthogonal Pseudo-Polytopes
Authors: Antonio Aguilera, Ricardo Pérez-Aguila
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

In this paper we present a set of formulations thatdescribe some properties of the configurations that canrepresent the n-Dimensional Orthogonal Pseudo-Polytopes.Moreover, we developed a useful representationfor these configurations from which it is possibleto obtain and to manage some specific geometric information:the application of geometric transformationsand the comparison of configurations. Through suchdevelopments, we have a better performance, in termsof memory and time complexity, compared withtraditional procedures.