ppxscal/embedding_network huggingface dataset:
A Model-Based Design Process for the SegBus Distributed Architecture
Authors: Dragos Truscan, Tiberiu Seceleanu, Johan Lilius, Hannu Tenhunen
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

We discuss a design process for a custom distributed platform, namely the SegBus segmented bus architecture. The main emphasis of this work is on how different steps of the process are interconnected and how they are supported by the associated tool chain. We place the SegBus design process in the context of the Model-driven Architecture(MDA) paradigm, in order to provide graphical editors that allow the editing of the specification at different abstraction levels and automated transformations that define the specification towards implementation. We customize the Unified Modeling Language (UML) to graphically specify different artifacts produced in the process and we employ UML-based tools to implement transformations between these artifacts. In addition, we adopt as application model the Packet SDF (PSDF), an extension of the Synchronous Data Flow (SDF) diagrams. By modeling the operational semantics for the SegBus architecture, the PSDF facilitates the mapping of the application on the architecture. From the mapping process we obtain the requirements for the structural VHDL code of the application-platform instance realization and the control code for the arbiters of the architecture.
The zero interval limit spectrum of a truncated fluctuation matrix on a univariate function type multiplicative algebraic operator over the relevant Hilbert space
Authors: Irem Yaman, Metin Demiralp
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

This paper focuses on the spectral behavior of the fluctuation matrices as their construction interval varies. The fluctuation matrix definition's base operator in this work is taken an algebraic one which multiplies its operand with a univariate function remaining continous over an interval where the elements of the base Hilbert space are square integrable univariate functions. We work in the vicinity of the interval's zero limit case and obtain universal results for certain spectral properties of these types of fluctuation matrices.
On the fault tolerance of some popular bounded-degree networks
Authors: T. Leighton
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors analyze the fault-tolerance properties of several bounded-degree networks that are commonly used for parallel computation. Among other things, they show that an N-node butterfly containing N/sup 1- epsilon / worst-case faults (for any constant epsilon >0) can emulate a fault-free butterfly of the same size with only constant slowdown. Similar results are proved for the shuffle-exchange graph. Hence, these networks become the first connected bounded-degree networks known to be able to sustain more than a constant number of worst-case faults without suffering more than a constant-factor slowdown in performance. They also show that an N-node butterfly whose nodes fail with some constant probability p can emulate a fault-free version of itself with a slowdown of 2/sup O(log* N)/, which is a very slowly increasing function of N. The proofs of these results combine the technique of redundant computation with new algorithms for routing packets around faults in hypercubic networks. Techniques for reconfiguring hypercubic networks around faults that do not rely on redundant computation are also presented. These techniques tolerate fewer faults but are more widely applicable since they can be used with other networks such as binary trees and meshes of trees.
Effectiveness of Q-learning as a tool for calibrating agent-based supply network models
Authors: Y. Zhang, S. Bhattacharyya
Venue: Enterprise Information Systems (2007)

This paper examines effectiveness of Q-learning as a tool for specifying agent attributes and behaviours in agent-based supply network models. Agent-based modelling (ABM) has been increasingly employed to study supply chain and supply network problems. A challenging task in building agent-based supply network models is to properly specify agent attributes and behaviours. Machine learning techniques, such as Q-learning, can be a useful tool for this purpose. Q-learning is a reinforcement learning technique that has been shown to be an effective adaptation and searching mechanism in distributed settings. In this study, Q-learning is employed by supply network agents to search for 'optimal' values for a parameter in their operating policies simultaneously and independently. Methods are designed to identify the 'optimal' parameter values against which effectiveness of the learning is evaluated. Robustness of the learning's effectiveness is also examined through consideration of different model settings and scenarios. Results show that Q-learning is very effective in finding the 'optimal' parameter values in all model settings and scenarios considered.
Adaptive dynamic probabilistic networks for distributed uncertainty processing
Authors: Dongyu Shi, Jinyuan You
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

Uncertainty processing is a core task in many applications of distributed systems. Typical distributed systems have local processing nodes to collect information, which usually contain uncertainties, and do computational work. The nodes can interact with each other, and they evolve with time. A promising way of modelling and processing uncertainties in these systems is to use graphical models to form beliefs about the required information. Dynamic probabilistic networks for distributed uncertainty processing are presented in this paper. Two approaches are given, and comparison shows that the model with the more state-of-art approach performs better. Since it is not possible to obtain enough knowledge to construct an exact model at the beginning, the model needs to adjust itself when evolving. Therefore we have developed a parameter update algorithm to make the model adapt to the changing environment. Experiments are presented to show the effectiveness of the models and the algorithms.
Using Mobile Internet Gateways in Wireless Mesh Networks
Authors: Mieso K. Denko
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Wireless Mesh Networks (WMNs) have recently received tremendous research attention in industry and academia. The application domain of WMN is expanding from experimental settings in academic research to practical implementations in community networking, public safety, transportation services, healthcare systems and other similar applications. While these applications are evolving, there are still key challenges in terms of network performance, flexibility and resource management. In this paper we study wireless mesh networks with mobile internet gateways. We employ a multi-path routing scheme with a routing metric based on load balancing to reduce packet loss and delay. Unlike most existing multipath routing protocols, our approach supports the maintenance of parallel multiple paths. Simulation experiments are carried out to assess network performance in the presence of mobile gateways. Simulation results show that the use of mobile gateways with concurrent multipath routing can result in good performance at lower speed and multiple mobile gateways.
How to recycle random bits
Authors: R. Impagliazzo
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

It is shown that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. More precisely, if r random bits are needed for a BPP algorithm to be correct with probability at least 2/3, then O(r+k/sup 2/) bits are needed to improve this probability to 1-2/sup -k/. A different pseudorandom generator that is optimal, up to a constant factor, in this regard is also presented. It uses only O(r+k) bits to improve the probability to 1-2/sup -k/. This generator is based on random walks on expanders. The results do not depend on any unproven assumptions. It is shown that the modified versions of the shift register and linear congruential generators can be used to sample from distributions using, in the limit, the information-theoretic lower bound on random bits.
A Method Combining Review and Testing for Verifying Software Systems
Authors: Yuting Chen, Shaoying Liu, W. Eric Wong
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The application of specification-based program verification techniques (e.g., black-box testing, formal proof) faces strong challenges in practice when the gap between the structure of a specification and that of its program is large. This paper describes a method combining program review and testing to address these challenges. The essential idea of the combination is first to use a view-based program review approach to maintain consistency between the specification structure and the program structure, and then to use a view-based testing approach to dynamically check whether the program satisfies the functional requirements defined in the specification. Views are used to serve as the basis for reviewing structural consistency and for testing functional consistency.
XQuery in the browser
Authors: Ghislain Fourny, Donald Kossmann, Tim Kraska, Markus Pilman, Daniela Florescu
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Over the years, the browser has become a complete runtime environment for client-side programs. The main scripting language used towards this purpose is JavaScript, which was designed so as to program the browser. A lot of extensions and new layers have been built on top of it to allow e.g. DOM navigation and manipulation. However, JavaScript has become a victim of its own success and is used way beyond its possibilities, leading to increased code complexity. We suggest to reduce programming complexity by proposing XQuery as a client-side programming language. We wrote an extension for Microsoft Internet Explorer, based on the Zorba XQuery engine, which allows execution of XQuery scripts in the browser. An extension for Firefox is on the way as well. This paper demonstrates how client-side applications in XQuery look like and what they can do within a very small amount of code.
A personal content ranking approach based on user experience
Authors: Taketoshi Ushiama, Toyohide Watanabe
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper introduces a ranking technique for searching personal contents based on user experiences in the real world. Recently years, according to the increment of the amount of personal contents, such as e-mail messages, digital photographs and so on, it is expected to develop effective search techniques for large amount of personal contents. Our ranking technique treats personal contents as representations of personal experiences in the real world, and it is assumed that a user requests to obtain various kinds of information about personal experiences instead of personal contents on personal content search. This is because that one of the characteristic features of personal contents is that many of personal contents are closely related to personal experiences. Our technique uses explicit links and implicit links among personal contents for organizing personal contents under user experience.
A Technique for Lock-Less Mirroring in Parallel File Systems
Authors: Bradley W. Settlemyer, Walter B. Ligon III
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

As parallel file systems span larger and larger numbers of nodes in order to provide the performance and scalability necessary for modern cluster applications, the need for fault-tolerance and high data availability file systems has arisen. Modern parallel file systems spanning tens, hundreds, or even thousands of servers will require fault tolerance to avoid job failure and catastrophic data loss due to a single disk failure or server loss. Effective fault tolerance in parallel file systems must provide a high degree of data resiliency, consistency, and scalable performance. In this paper, we describe a data replication technique that meets the resiliency and consistency requirements of parallel file systems and provides scalable performance. We measure the performance of our proposed mechanism by implementing it in a popular parallel file system, PVFS.
Saner: Composing Static and Dynamic Analysis to Validate Sanitization in Web Applications
Authors: Davide Balzarotti, Marco Cova, Vika Felmetsger, Nenad Jovanovic, Engin Kirda, Christopher Kruegel, Giovanni Vigna
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Web applications are ubiquitous, perform mission-critical tasks, and handle sensitive user data. Unfortunately, web applications are often implemented by developers with limited security skills, and, as a result, they contain vulnerabilities. Most of these vulnerabilities stem from the lack of input validation. That is, web applications use malicious input as part of a sensitive operation, without having properly checked or sanitized the input values prior to their use.Past research on vulnerability analysis has mostly focused on identifying cases in which a web application directly uses external input in critical operations. However, little research has been performed to analyze the correctness of the sanitization process. Thus, whenever a web application applies some sanitization routine to potentially malicious input, the vulnerability analysis assumes that the result is innocuous. Unfortunately, this might not be the case, as the sanitization process itself could be incorrect or incomplete.In this paper, we present a novel approach to the analysis of the sanitization process. More precisely, we combine static and dynamic analysis techniques to identify faultysanitization procedures that can be bypassed by an attacker. We implemented our approach in a tool, called Saner, and we applied it to a number of real-world applications. Our results demonstrate that we were able to identify several novel vulnerabilities that stem from erroneous sanitization procedures.
Standardized bio-opto-fluidic chip technology using channel only process
Authors: Lai-Fun Ho, Franck Chollet
Venue: Microelectronic Engineering (2008)

The integration of optical waveguides within biological assay chips seems to be an interesting solution to increase their functionality as it will allow local optical probing of the samples. However, the techniques proposed to build such chips are generally complex requiring multiple steps to fabricate waveguides and channels, and at the same time losing the capacity to use cost-effective fabrication technique like injection moulding. We propose a techniques where the waveguides are actually built as empty channel in the optical chip and later filled with special liquid to be used as waveguide. In this way, the chip only necessitates the fabrication of channels, some carrying the biological samples and others used as waveguides. To simplify further the fabrication, we developed a standard holder that allows to address the issue of filling the waveguide channel with the special liquid and at the same time provide connection for the sample testing. The chip was fabricated in PDMS and it was tested together with the standard holder using different liquids. Although the optical loss is still high due to scattering, this type of system was able to easily detect the bubbles appearing in a bi-phasic flow, opening the way for further improvements in the technology.
The use of Timoshenko's exact solution for a cantilever beam in adaptive analysis
Authors: Charles E. Augarde, Andrew J. Deeks
Venue: Finite Elements in Analysis and Design (2008)

The exact solution for the deflection and stresses in an end-loaded cantilever is widely used to demonstrate the capabilities of adaptive procedures, in finite elements, meshless methods and other numerical techniques. In many cases, however, the boundary conditions necessary to match the exact solution are not followed. Attempts to draw conclusions as to the effectivity of adaptive procedures is therefore compromised. In fact, the exact solution is unsuitable as a test problem for adaptive procedures as the perfect refined mesh is uniform. In this paper we discuss this problem, highlighting some errors that arise if boundary conditions are not matched exactly to the exact solution, and make comparisons with a more realistic model of a cantilever. Implications for code verification are also discussed.
A knowledge-based videotheodolite measurement system for object representation/monitoring
Authors: Alexander Reiterer, Uwe Egly, Thomas Eiter, Heribert Kahmen
Venue: Advances in Engineering Software (2008)

High-precision online 3D-measurement systems can perform their measurements with and without targeting. Systems which are able to measure without artificial targets use the texture on the surface of the object to find 'interesting points'. However, well-trained 'measurement experts' are required to operate such a measurement system. In order to make such systems easy to use even for non-experts, we extend it by a knowledge-based component which supports the operator. We report on the architecture and functionality of the respective knowledge-based system, its development stage and the promising results obtained in experimentation.
Noisy manifold learning using neighborhood smoothing embedding
Authors: Junsong Yin, Dewen Hu, Zongtan Zhou
Venue: Pattern Recognition Letters (2008)

Manifold learning is an important dimensionality reduction tool that discovers the structure of high dimensional data and provides understanding of multidimensional patterns in data mining, pattern recognition, and machine learning. Several manifold learning algorithms are applied to extract the intrinsic features of different prototypes in high dimensional space by preserving the local geometric characteristics. However, due to the locality geometry preservation, these manifold learning methods, including locally linear embedding (LLE), are sensitive to noise. To solve the noisy manifold learning problem, this paper proposes a Neighbor Smoothing Embedding (NSE) for noisy points sampled from a nonlinear manifold. Based on LLE and local linear surface estimator, the NSE smoothes the neighbors of each manifold data and then computes the reconstruction matrix of the projections on the principal surface. Experiments on synthetic data as well as real world patterns demonstrate that the suggested algorithm can efficiently maintain an accurate low-dimensional representation of the noisy manifold data with less distortion, and give higher average classification rates compared to others.
Formal Verification of Consistency in Model-Driven Development of Distributed Communicating Systems and Communication Protocols
Authors: Dubravka Ilic, Elena Troubitsyna, Linas Laibinis, Sari Leppänen
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Currently UML2 is widely used for modelling software-intensive systems. Model driven development of complex software typically starts from abstract, high-level UML2 models which specify the system from several different viewpoints. Abstract models are further refined into more detailed design models in successive development stages. While specifying various aspects and abstraction levels of such systems, we create a set of different models, which should be inter- and intra-consistent. In this paper we propose an approach to ensuring consistency in Lyra - a rigorous, service-oriented and model-based method for developing industrial telecommunication systems and communication protocols. We derive informal requirements to ensuring intra- and inter-consistency and then formalize them in the B Method. The formalization in B allows us to structure complex informal requirements and formally ensure intra- and inter-consistency of models created at various stages of the Lyra development.
On the form and stability of seafloor stratigraphy and shelf profiles: A mathematical model and solution method
Authors: S. D. Peckham
Venue: Computers Geosciences (2008)

There are a variety of different marine sediment transport processes that affect the evolution of continental shelf profiles. Physically based numerical models make it possible to simulate the evolution of the continental shelf in response to these processes, which may be combined with different magnitudes, frequencies and durations. The basic model that is employed in most numerical simulations is based on conservation of mass and is a moving boundary problem since the river mouth progrades into the receiving basin. The general form of these stratigraphic or seafloor evolution models is a first-order, Exner-type differential equation that is forced by a sediment deposition/erosion function. This latter function depends on which sediment transport processes are modeled and how they are modeled, so it is desirable to have a solution method that works for any such function. This paper presents a general solution method to this type of evolution equation that works for any initial bathymetry and sediment deposition function given as 1D functions of seaward distance. It is based on the Laplace transform. Numerical results often exhibit ''equilibrium profile'' solutions for a wide variety of different model scenarios. These profiles may be viewed as travelling waves, such that the rate of progradation gives the speed of this wave as it advances into the receiving basin. When realistic initial and boundary conditions are used, profiles are often seen to evolve toward forms that are independent of the initial bathymetry. Although episodic perturbations such as turbidities disrupt these forms, they still serve as attractors for the system dynamics. An application of the solution method presented in this paper also allows the shape of equilibrium profiles and the progradation rate to be determined from a specification of the initial bathymetry and the sediment deposition function. Several illustrative examples are given in closed form. Results are also presented that make it possible to compute the amount of time required for an equilibrium profile to be re-established after a perturbation.
Novel microsystems for concentration gradient generation through computer optimization with validation using optical instrumentation
Authors: Hayat Abdulla Yusuf, Sara J. Baldock, Robert W. Barber, Peter R. Fielden, Nick J. Goddard, Bernard J. Treves Brown
Venue: Microelectronic Engineering (2008)

Novel microfluidic resistive network designs have been evaluated theoretically and experimentally. Such networks are an important component of microreactor technology and are used in analytical and biomedical applications for precisely controlled and evenly stepped dilution. A detailed model and a simplification algorithm have been devised for these networks. Their combination produces novel simplified network designs that exhibit less hierarchical branching over existing network designs. Rapid prediction and optimization of a layout that meets an arbitrary outlet profile is also possible. High levels of linearity were achieved on three microdevice fluidic networks. Good agreement of the experimental results from tested devices with the model was obtained. In addition, CFD simulation of one of the designs gave good agreement with results from the model presented, a good linear outlet profile being obtained.