ppxscal/embedding_network huggingface dataset:
Design and verification of fault tolerant systems with CSP
Authors: Jan Peleska
Venue: Distributed Computing (1991)

By means of an example, we present a formal method based on CSP to design fault tolerant systems. This method combines algebraic and assertional techniques to achieve complete formal verification of the fault tolerant system's correctness properties. Verification steps are executed in parallel with top-down design, so that correctness proofs can be clearly structured and their completeness easily checked. In this way formal verification is applicable not only to small examples but to reasonably large systems.
Region-of-Interest Coding of 3D Mesh Based on Wavelet Transform
Authors: Hongjuan Zheng, Bo Liu, Hongbin Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

A scheme for the region of interest (ROI) coding of 3D meshes is proposed for the first time. The ROI is encoded with higher fidelity than the rest region, and the "priority" of ROI relative to the rest region (background, BG) can be specified by encoder or decoder (user). Wavelet transform is used on 3D mesh and zerotrees are adopted to organize the coefficients. The wavelet coefficients of ROI are scaled up and encoded with a modified set partitioning in hierarchical trees (SPIHT) algorithm. In additional, a fast algorithm is proposed for creating the ROI mask. Once the quality of reconstructed ROI becomes high enough, the transmission can be intermitted and much transmission bandwidth and storage space will be saved consequently.
The DataTAG transatlantic testbed
Authors: O. Martin, J. P. Martin-Flatin, E. Martelli, P. Moroni, H. Newman, S. Ravot, D. Nae
Venue: Future Generation Computer Systems (2005)

Wide area network testbeds allow researchers and engineers to test out new equipment, protocols and services in real-life situations, without jeopardizing the stability and reliability of production networks. The Data TransAtlantic Grid (DataTAG) testbed, deployed in 2002 between CERN, Geneva, Switzerland and StarLight, Chicago, IL, USA, is probably the largest testbed built to date. Jointly managed by CERN and Caltech, it is funded by the European Commission, the U.S. Department of Energy and the U.S. National Science Foundation. The main objectives of this testbed are to improve the Grid community's understanding of the networking issues posed by data-intensive Grid applications over transoceanic gigabit networks, design and develop new Grid middleware services, and improve the interoperability of European and U.S. Grid applications in High-Energy and Nuclear Physics. In this paper, we give an overview of this testbed, describe its various topologies over time, and summarize the main lessons learned after two years of operation.
Defective Behaviours of Resistive Opens in Interconnect Lines
Authors: Daniel Arumi, Rosa Rodriguez-Montanes, Joan Figueras
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Defective interconnect lines affected by open defects have been intentionally designed and introduced on a CMOS digital test circuit. A simple bus structure with a scan register followed by a hold register and two buffers is used to investigate the influence of the crosstalk capacitances of the adjacent lines to the open defect. The strength of the open defect has been varied within a realistic range of resistances going from a full (complete) open up to a weak (low-resistive) open. The static and dynamic behavior of the defective lines have been electrically characterized taking into account the location of the defect as well as its resistive value. This characterization allows the extraction of general information useful for the prediction and detection of the faulty behavior caused by the defect. Testability conditions of this defect in interconnect lines are discussed.
Geometric Broadcast Protocol for Sensor and Actor Networks
Authors: Arjan Durresi, Vamsi Paruchuri
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

We present Geometric Broadcast for Sensor and Actor Networks (GBSA), a novel broadcasting protocol for heterogeneous wireless sensor and actor networks. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. GBSA is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. GBSA does not need any neighborhood information and imposes very low communication overhead. GBSA is scalable to the change in network size, node type, node density and topology. GBSA accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed GBSA takes advantage of actor nodes, and uses their resources when possible, thus reducing the energy consumption by sensor nodes. Through simulation evaluations, we show that GBSA is very scalable and its performance is improved by the presence of actors. At best of our knowledge, GBSA is the first broadcast protocol designed specifically for heterogeneous sensor and actor networks.
A Process-Based Semantics for Message Sequence Charts with Data
Authors: Chien-An Chen, Sara Kalvala, Jane Sinclair
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Message Sequence Charts (MSCs) are a graphical language for scenarios of communicating components exchanging messages in a distributed environment. The language has been standardised by the International Telecommunication Union (ITU) and given a formal semantics by means of a process algebra. Nevertheless, little attention has been given to MSCs where a message with data is a building block. In this paper, we investigate the impact that the concept of data flow brings to the conventional semantics, and propose a CCS-like process calculus as an alternative formal framework. The proposed semantics captures the data flow properties while maintaining the expressiveness of the conventional semantics. Equivalence of MSCs is also discussed from the perspective of the corresponding process equivalence.
Solving a multiresponse simulation-optimization problem with discrete variables using a multiple-attribute decision-making method
Authors: Taho Yang, Pohung Chou
Venue: Mathematics and Computers in Simulation (2005)

The simulation model is a proven tool in solving nonlinear and stochastic problems and allows examination of the likely behavior of a proposed manufacturing system under selected conditions. However, it does not provide a method for optimization. A practical problem often embodies many characteristics of a multiresponse optimization problem. The present paper proposes to solve the multiresponse simulation-optimization problem by a multiple-attribute decision-making method-a technique for order preference by similarity to ideal solution (TOPSIS). The method assumes that the control factors have discrete values and that each control factor has exactly three control levels. Taguchi quality-loss functions are adapted to model the factor mean and variance effects. TOPSIS is then used to find the surrogate objective function for the multiple responses. The present paper predicts the system performances for any combination of levels of the control factors by using the main effects of the control factors according to the principles of a robust design method. The optimal design can then be obtained. A practical case study from an integrated-circuit packaging company illustrates the efficiency and effectiveness of the proposed method. Finally, constraints of the proposed method are addressed.
Evaluation of the solution of an integral-functional equation
Authors: Wolfgang Volk
Venue: Journal of Computational and Applied Mathematics (2005)

Algorithms are developed for evaluating an arbitrarily often differentiable, compactly supported function, which is the solution of a homogeneous integral-functional equation. In the literature this function is called σ. These algorithms are based on some properties of this function, which are derived first. The function itself is also of interest in other fields in mathematics due to its special properties.
mPL6: a robust multilevel mixed-size placement engine
Authors: Tony F. Chan, Jason Cong, Michalis Romesis, Joseph R. Shinnerl, Kenton Sze, Min Xie
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

The most recent version of the mPL multilevel placement algorithm, mPL6, is reviewed. This version is derived from the mPL5 placer (ISPD05) and the Patoma floorplanner (ASPDAC05). It is also augmented by new techniques for detailed placement. As a result, it can handle mixed-size placement very effectively. First-choice clustering is used to construct a hierarchy of problem formulations. Generalized force-directed placement guides global placement at each level of the cluster hierarchy. Prior to interpolation of each coarse-level solution to its adjacent finer level, however, recursive, top-down displacement-minimizing floorplanning optimizes block orientations and checks that overlap can be removed at the current level. Where necessary, the floor-planner perturbs coarse-level solutions enough that legalization of the given placement can be assured. The resulting flow is scalable and robust, and it produces very low-wirelength solutions for known benchmark circuits.
Can semantic web be made to flourish?
Authors: David Wood, Zavisa Bjelogrlic, Bernadette Hyland, Jim Hendler, Kanzaki Masahide
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This panel's objective will be to discuss whether the Semantic Web can be made to grow in a "viral" manner, like the World Wide Web did in the early 1990s. The scope of the discussion will include efforts by the World Wide Web Consortium's Semantic Web Best Practices & Deployment Working Group to identify and publish best practices of Semantic Web practitioners, and the barriers to adoption of those practices by a wider community. The concept of "best practices" as it applies to a distributed, diverse and partially-defined Semantic Web will be discussed and its relevance debated. Specifically, panelists will discuss the capability of standards bodies, commercial companies and early adopters to create a viral technology.
An empirical investigation into the dimensions of run-time coupling in Java programs
Authors: Áine Mitchell, James F. Power
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Software quality is an important external software attribute that is difficult to measure objectively. Several studies have identified a clear empirical relationship between static coupling metrics and software quality. However due to the nature of object-oriented programs, static metrics fail to quantify all the underlying dimensions of coupling, as program behaviour is a function of its operational environment as well as the complexity of the source code. In this paper a set of run-time object-oriented coupling metrics are described. A method of collecting such metrics which utilises the Java Platform Debug Architecture is described and a collection of Java programs from the SPECjvm98 benchmark suite are evaluated. A number of statistical techniques including descriptive statistics, a correlation study and principal component analysis are used to assess the fundamental properties of the measures and investigate whether they are redundant with respect to the Chidamber and Kemerer static CBO metric. Results to date indicate that run-time coupling metrics can provide an interesting and informative qualitative analysis of a program and complement existing static coupling metrics.
Introducing Security Aspects with Model Transformations
Authors: Jorge Fox, Jan Jurjens
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Aspect Oriented Programming and subsequently Aspect Oriented Software Development have received great attention recently and constitutes an interesting field of research in computer science. The goal of this paper is to propose a more precise understanding of aspects based on the idea of crosscutting concerns in view of model transformation. This proposal considers security aspects as an example of a behavior applied over a desired software product. This implies improving the actual definition of aspects. The work introduces the main current concepts of aspect, defines aspects as behavioral entities, presents examples, and outlines a method for model transformation based on the proposed definition.
Dynamic susceptibility computations for thin magnetic films
Authors: Olivier Vacus, Nicolas Vukadinovic
Venue: Journal of Computational and Applied Mathematics (2005)

This paper deals with the dynamic modelling of thin ferromagnetic layers, based on the coupling of Maxwell's equations with the nonlinear Landau-Lifschitz-Gilbert law. A 2-D micromagnetic model is described which involves a FDTD code to determine equilibrium configurations and a finite element method to compute magnetostatic fields. Finally, after linearization, the susceptibility spectra of films supporting a weak-stripe-domain structure are computed and successfully compared to existing measurements without introducing any fitting parameter.
Performance study on implementation of VCR functionality in staggered broadcast video-on-demand systems
Authors: Wing-Fai Poon, Kwok-Tung Lo, J. Feng
Venue: Journal of Systems and Software (2005)

Data sharing is a feasible solution to support a large-scale video-on-demand (VoD) system, however, it is still an open issue to provide a full set of continuous interactive functions in such an environment that a single channel is used to serve a group of customers. In this paper, we first investigate the performance of client buffer management and its hybrid use with contingency channels for providing VCR functionality in a staggered broadcast VoD system. Results show that directly combining the two methods may not gain any advantages since the resources are not fully utilized. To tackle this problem, a greedy algorithm is proposed to efficiently manage the contingency channels such that the system performance can be significantly improved by exploiting the property of the staggered broadcast scheme and the use of multiple loaders in the receiver. Simulation results show that the proposed greedy system can efficiently provide a full set of VCR functions with satisfied user performance in a broadcast VoD system.
Inviscid and incompressible fluid simulation on triangle meshes: Research Articles
Authors: Lin Shi, Yizhou Yu
Venue: Computer Animation and Virtual Worlds (2004)

Simulating fluid motion on manifold surfaces is an interesting but rarely explored area because of the difficulty of establishing plausible physical models. In this paper, we introduce a novel method for inviscid fluid simulation over meshes. It can enforce incompressibility on closed surfaces by utilizing a discrete vector field decomposition algorithm. It also includes effective implementations of semi-Lagrangian tracing and velocity interpolation schemes. Different from previous work, our method performs simulations directly on triangle meshes and thus eliminates parametrization distortions. Our implementation can produce convincing fluid motion on surfaces and has interactive performance for meshes with tens of thousands of faces. Copyright &copy; 2004 John Wiley & Sons, Ltd.
High quality parametric visual product configuration systems over the web
Authors: Alvaro Segura, Iosu Arizkuren, Iñaki Aranburu, Iñaki Telleria
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

Visual product configuration systems over the Web promise to significantly improve the core business processes of product and service companies. Such systems allow clients to remotely configure products by interactively selecting a set of options and instantly visualizing their resulting 3D representations on-line. This type of functionality is still very rare on the Web and the few provided solutions are typically far from being satisfying for highly competitive companies. The main limitations of current solutions are mainly due to typical constraints imposed by the interactive exploration of 3D models in a web browser.In this paper we propose an advanced graphical system for visual configuration of 3D products for the Web. We mainly focused on reducing the perceived difference between the 3D representation of the product and the physical product. The viewer performance was increased, supporting new visual features and effects --scenes containing multiple mirrors are supported--, and new levels of methods of interaction added. We demonstrate our approach in a real-world example with the implementation of a complete Web-based visual configuration for a manufacturer of lift cabins.
Shaping new health services landscapes: the case of DocMorris.com
Authors: Hans P. Borgman, Hauke Heier, Andreas Kemper
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

The recent literature investigating the European health care market's efficiency has repeatedly pointed at chronic underperformance and wastefulness. Our analysis goes beyond this critic and investigates the opportunities and limitations of e-Pharmacies as an innovative, technology-based approach to the development of new services landscapes in order to restructure the German health care market. The new prospects are analyzed based on a case study of DocMorris.com. Results of the analysis indicate that the European health care system is in flux and provides lucrative business options for Internet-based services. Key implications of the evolving environment concern academics and managers as well since the recent trends indicate a fundamental shift towards a new service paradigm.
A hierarchical shadow volume algorithm
Authors: Timo Aila, Tomas Akenine-Möller
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2004)

The shadow volume algorithm is a popular technique for real-time shadow generation using graphics hardware. Its major disadvantage is that it is inherently fillrate-limited, as the performance is inversely proportional to the area of the projected shadow volumes. We present a new algorithm that reduces the shadow volume rasterization work significantly. With our algorithm, the amount of per-pixel processing becomes proportional to the screen-space length of the visible shadow boundary instead of the projected area. The first stage of the algorithm finds 8 x 8 pixel tiles, whose 3D bounding boxes are either completely inside or outside the shadow volume. After that, the second stage performs per-pixel computations only for the potential shadow boundary tiles. We outline a two-pass implementation, and also describe an efficient single-pass hardware architecture, in which the two stages are separated using a delay stream. The only modification required in applications is a new pair of calls for marking the beginning and end of a shadow volume. In our test scenes, the algorithm processes up to 11.5 times fewer pixels compared to current state-of-the-art methods, while reducing the external video memory bandwidth by a factor of up to 17.1.
A modeling approach to federated identity and access management
Authors: Martin Gaedke, Johannes Meinecke, Martin Nussbaumer
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

As the Web is increasingly used as a platform for heterogeneous applications, we are faced with new requirements to authentication, authorization and identity management. Modern architectures have to control access not only to single, isolated systems, but to whole business-spanning federations of applications and services. This task is complicated by the diversity of today's specifications concerning e.g. privacy, system integrity and distribution in the web. As an approach to such problems, in this paper, we introduce a solution catalogue of reusable building blocks for Identity and Access Management (IAM). The concepts of these blocks have been realized in a configurable system that supports IAM solutions for Web-based applications.
Adaptive tracking control of flexible-joint manipulators without overparametrization
Authors: Min S. Kim, Jin S. Lee
Venue: Journal of Robotic Systems (2004)

In this paper, an adaptive controller is designed for rigid-link flexible-joint robot manipulators based on link and actuator position measurements only. It is based on the adaptive integrator backstepping method and the link and actuator velocity filters are used to estimate the unknown velocity terms. Moreover, the proposed controller exploits the estimate of the joint stiffness matrix inverse to overcome the overparametrization problem, which has been a significant drawback in adaptive partial state feedback controllers. It achieves asymptotic tracking of link positions while keeping all states and signals bounded. The tracking capability of the presented method is shown through simulation results of one- and two-link flexible joint manipulators. &copy; 2004 Wiley Periodicals, Inc.
Preventing information leakage within workflows that execute among competing organizations
Authors: Shih-Chien Chou, An-Feng Liu, Chien-Jung Wu
Venue: Journal of Systems and Software (2005)

This paper proposes a model for access control within workflows. It is based on access control lists (ACLs) and is named WfACL ACL-based access control model for workflows). WfACL prevents information leakage within workflows that may execute among competing organizations. Its objective is threefold. First, it prevents an organization that executes a workflow from leaking its information to other organizations. Second, it prevents information leakage among competing organizations. Third, it prevents information leakage within an organization. In addition to achieving the objective, WfACL offers the following features: (a) managing dynamic role association change, (b) managing dynamic role change, (c) avoiding indirect information leakage, (d) detailing the control granularity to roles, and (e) controlling both read and write access. We embedded WfACL in a rule-based workflow language WfACLL and implemented a prototype environment WfACLE. We evaluated WfACL using WfACLL and WfACLE. The evaluation result is also shown in this paper.
RObust Header Compression (ROHC) Performance for Multimedia Transmission over 3G/4G Wireless Networks
Authors: Frank H. Fitzek, Stephan Rein, Patrick Seeling, Martin Reisslein
Venue: Wireless Personal Communications: An International Journal (2005)

RObust Header Compression (ROHC) has recently been proposed to reduce the large protocol header overhead when transmitting voice and other continuous media over IP based protocol stacks in wireless networks. In this paper we evaluate the real-time transmission of GSM encoded voice and H.26L encoded video with ROHC over a wireless link. For the voice transmission we examine the impact of ROHC on the consumed bandwidth, the voice quality, and the delay jitter in the voice signal. We find that for a wide range of error probabilities on the wireless link, ROHC roughly cuts the bandwidth required for the transmission of GSM encoded voice in half. In addition, ROHC improves the voice quality compared to transmissions without ROHC, especially for large bit error probabilities on the wireless link. The improvement reaches 0.26 on the 5-point Mean Opinion Score for a bit error probability of 10¿3. For the video transmission we examine the impact of ROHC on the consumed bandwidth. We find that the bandwidth savings with ROHC depend on the quantization scale used for the video encoding and the video content and ranges between 5--40% for typical scenarios.