ppxscal/embedding_network huggingface dataset:
A New Fault Detection and Diagnosis Method for Oil Pipeline Based on Rough Set and Neural Network
Authors: Liu Jinhai, Zhang Huaguang, Feng Jian, Yue Heng
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper proposed a new fault-detection method based on the combination of Rough Set (RS) and Artificial Neural Network (ANN), called hybrid fault-detection method based on RS and ANN (HFDMRSNN), which uses RS to reduce parameters of a pipeline system and then uses ANN (three-layer neural network) to form a detection model. This method could detect fault of pipeline not only in stationary status but also in non-stationary status. The efficiency of the HFDMRSNN in detecting fault in real pipeline system is evaluated by an experiment in a long product oil pipeline in Shandong China. From the results, it is observed that the proposed HFDMRSNN is able to identify the status of complex pipeline effectively.
Immunising CBC Mode Against Padding Oracle Attacks: A Formal Security Treatment
Authors: Kenneth G. Paterson, Gaven J. Watson
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

Padding oracle attacks against CBC mode encryption were introduced by Vaudenay. They are a powerful class of side-channel, plaintext recovering attacks which have been shown to work in practice against CBC mode when it is implemented in specific ways in software. In particular, padding oracle attacks have been demonstrated for certain implementations of SSL/TLS and IPsec. In this paper, we extend the theory of provable security for symmetric encryption to incorporate padding oracle attacks. We develop new security models and proofs for CBC mode (with padding) in the chosen-plaintext setting. These models show how to select padding schemes which provably provide a strong security notion (indistinguishability of encryptions) in the face of padding oracle attacks. We also show that an existing padding method, OZ-PAD, that is recommended for use with CBC mode in ISO/IEC 10116:2006, provably resists Vaudenay's original attack, even though it does not attain our indistinguishability notion.
Estimating Flow Length Distributions Using Least Square Method and Maximum Likelihood Estimation
Authors: Weijiang Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Traffic sampling technology has been widely deployed in front of many high-speed network applications to alleviate the great pressure on packet capturing. However, knowing the number and length of the original flows is necessary for some applications. This paper provides a novel method that uses flow statistics formed from sampled packet stream to infer the absolute frequencies of lengths of flows in the unsampled stream. First, flows are classified as small (S) or large (L) based on their probability that no packet is sampled. For large flows we use maximum likelihood estimation to infer their length distribution, and for short flows we apply least square method. The theoretical analysis shows that the computational complexity of this method is well under control, and the experiment results demonstrate the inferred distributions are as accurate as EM algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Effects of Hangul Font and Character Size on the Readability in PDA
Authors: Keun-Sang Park, Sin Hee Ann, Chang-Han Kim, Milda Park, Seoung-Soo Lee
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

As the use of mobile devices increases these days, it is necessary to study the user interface of those devices. In this study, experiments were carried out using different Hangul fonts and character sizes to enable better readability in PDA. As evaluation indicators on readability, subject performance measured with reading speed and error rate, fatigue measured with the count of eye-blinking, and subjective preference were used. As a result, there was significant difference in reading speed depending on the character sizes. Among three different levels, 8 pt and 10 pt showed better readability. In terms of error and fatigue rate, there was no significant difference depending on different Hangul fonts and character sizes. In the subjective preference, there was significant difference depending on Hangul fonts. According to our posterior evaluation on the subjective preference, subjects showed most efficient reading performance with Gulim style. In conclusion, the readability was best with Gulim style and with 8 pt and 10 pt of character sizes.
Animated Cladograms: Interpreting Evolution from Diagrams
Authors: Camillia Matuk
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Misconceptions of evolution are well-documented and may be attributed to features of its diagrammatic representations. For example, embodied space, the tendency to structure experiences through narrative, and base perceptual processes interact in people's interpretation of cladograms, a diagram used to reason about species' evolutionary relationships. Clinical interviews with students indicate an effect of animation on the interpretation of the depicted narrative of evolution. Implications are in the design of diagrams for teaching evolution.
A key-recovery attack on authentication watermarking by li and yuan
Authors: Hans Georg Schaathun
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

We present a key-recovery attack on a watermarking scheme for authentication and localisation due to Li and Yuan. The attack exploits a lack of diffusion in the system. Each bit of the key affects only a small region of the watermarked image. Even though a brute-force attack is intractible, an exhaustive search is possible by considering one region at a time, and thereby recover the key.
On Trade-Offs in External-Memory Diameter-Approximation
Authors: Ulrich Meyer
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

Computing diameters of huge graphs is a key challenge in complex network analysis. However, since exact diameter computation is computationally too costly, one typically relies on approximations. In fact, already a single BFS run rooted at an arbitrary vertex yields a factor two approximation. Unfortunately, in external-memory, even a simple graph traversal like BFS may cause an unacceptable amount of I/O-operations. Therefore, we investigate alternative approaches with worst-case guarantees on both I/O-complexity and approximation factor.
Monte Carlo simulation with the GATE software using grid computing
Authors: R. Reuillon, D. R. C Hill, C. Gouinaud, Z. El Bitar, V. Breton, I. Buvat
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Monte Carlo simulations needing many replicates to obtain good statistical results can be easily executed in parallel using the "Multiple Replications In Parallel" approach. However, several precautions have to be taken in the generation of the parallel streams of pseudo-random numbers. In this paper, we present the distribution of Monte Carlo simulations performed with the GATE software using local clusters and grid computing. We obtained very convincing results with this large medical application, thanks to the EGEE Grid (Enabling Grid for E-sciencE), achieving in one week computations that could have taken more than 3 years of processing on a single computer. This work has been achieved thanks to a generic object-oriented toolbox called DistMe which we designed to automate this kind of parallelization for Monte Carlo simulations. This toolbox, written in Java is freely available on SourceForge and helped to ensure a rigorous distribution of pseudo-random number streams. It is based on the use of a documented XML format for random numbers generators statuses.
View-OS: A New Unifying Approach Against the Global View Assumption
Authors: Ludovico Gardenghi, Michael Goldweber, Renzo Davoli
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

One traditional characteristic of operating systems is that all the processes share the same view of the environment. This global view assumption (GVA) means that for processes running on the same computer, the same pathname points to the same file, the processes share the same network stack and therefore the same IP addresses, the routing characteristics are identical, etc. There have been many proposals for "bending" the GVA for either individual processes or for the system as a whole. Some of these proposals include microkernels or specialized virtual machines. Most proposals are for system administrators, others are tailored to specific applications.A View-OS is our unifying solution for altering the GVA. It allows a user to partially or completely redefine the behavior of an arbitrary subset of the system calls called from his processes, thus altering his view of the environment in terms of file system, communication, devices, access control etc. We have implemented it with a system-call, partial, modular virtual machine called *MView. Each divergence from the standard view may be implemented in a specific module.Hence instead of always having to load a complete kernel (e.g. User-mode Linux), the overhead of a per-process definition of the environment depends on the degree of divergence from the standard global view.
Parallel and Sequential Independence for Borrowed Contexts
Authors: Filippo Bonchi, Fabio Gadducci, Tobias Heindel
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were missing for dpo rewriting extended with borrowed contexts (dpobc), a formalism used for equipping dpo derivations with labels and introduced for modeling open systems that interact with the environment.In this work we propose the definition of parallel and sequential independence for dpobc rewriting, and we prove that these novel notions allow generalizing the Church-Rosser and parallelism theorems holding for dpo rewriting. Most importantly, we show that the dpobc version of these theorems still guarantees the local confluence and the parallel execution of pairs of independent dpobc derivations.
Use of Agent Prompts to Support Reflective Interaction in a Learning-by-Teaching Environment
Authors: Longkai Wu, Chee-Kit Looi
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

A learning-by-teaching environment (Biswas, Schwarz, Bransford et al., 2001), can be used to create a context in which student can play the role of tutor through teaching the agent tutee. Without meaningful feedback from the agent, there is no reason to expect student's engagement with the teaching interaction and growth in learning. This study tries to investigate the design of student-agent reflective interaction triggered by the agent prompts in a learning-by-teaching agent environment, Betty's Brain. A pilot study in using the prompts within the agent environment is undertaken. The result gives us some preliminary evidence that the agent prompt support on reflective interaction can be positive in enhancing student's learning when pursuing learning-by-teaching activities.
Fusing DL Reasoning with HTN Planning
Authors: Ronny Hartanto, Joachim Hertzberg
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

We describe a method for cascading Description Logic (DL) representation and reasoning on the one hand, and HTN action planning on the other. The planning domain description as well as the fundamental HTN planning concepts are represented in DL and can therefore be subject to DL reasoning; from these representations, concise planning problems are generated for HTN planning. We show that this method yields significantly smaller planning problem descriptions than regular representations do in HTN planning. The method is presented by example of a robot navigation domain.
Modelling Concurrency with Quotient Monoids
Authors: Ryszard Janicki, Dai Tri Lê
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

Four quotient monoids over step sequences and one with compound generators are introduced and discussed. They all can be regarded as extensions (of various degrees) of Mazurkiewicz traces [14] and comtraces of [10].
Playscript for use cases
Authors: Richard Riehle
Venue: ACM SIGSOFT Software Engineering Notes (2008)

The concept of use case has become popular in developing requirements for software systems. It is even recommended as an inherent part of the Unified Modeling Language (UML). An early predecessor of the use case for systems and procedures practice in the 1960's was the Playscript procedure. This article describes how Playscript can contribute to better use cases.
Approximating Behaviors in Embedded System Design
Authors: Roberto Passerone, Alberto L. Sangiovanni-Vincentelli
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Embedded systems are electronic devices that function in the context of a physical environment, by sensing and reacting to a set of stimuli. To simplify the design of embedded systems, different parts are best described using different notations and analyze with different techniques, i.e., the system is said to be heterogeneous. We informally refer to the notation and the rules that are used to specify and verify the elements of heterogeneous systems and their collective behavior as a model of computation. In this paper, the use of conservative approximations (recently introduced by the authors) is reviewed to establish relationships between different models of computation in a design. After presenting the basic definitions, we propose three different models at different levels of abstraction for describing a system and the progression towards its implementation. Then, we derive associated conservative approximations starting from simple homomorphisms between sets of behaviors of the different models.
Robust Phase Tracking for High Capacity Wireless Multimedia Data Communication Networks
Authors: Taehyun Jeon
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

This paper proposes an algorithm for tracking of the residual phase errors incurred by carrier and sampling frequency offset in the OFDM transmission systems which is suitable for high speed and high capacity wireless multimedia communication networks. The proposed scheme utilizes the degree of the channel fading in the frequency domain in the offset tracking procedure which improves the error estimation accuracy and the tracking performances. This scheme also contributes to the increase of the throughput and the network capacity by reduction of the packet error rate or equivalently probability of re-transmission events which are critical QoS requirements for multimedia data transmissions.
CoCoTA --- Common Component Task
Authors: Raffaela Mirandola, František Plášil
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

This chapter overviews the scope, goals and timeline of the modeling contest CoCoME. It also describes the input the competing teams received and, furthermore, explains how the peer reviewing process went ahead, and how the evaluation criteria were set with the aim to balance the inherently heterogeneous modeling and expressive power of different component models.
Quadrilateral remeshing and efficient surface parameterization
Authors: Michael Garland
Venue:  (2007)

Surface remeshing is a fundamental problem in computer graphics, and can be found in most digital geometry processing systems. The majority of work in this area has focused on remeshing with triangle elements, yet quadrilateral meshes are best suited for many occasions, such as physical simulation and defining Catmull-Clark subdivision surfaces. In the first part of this work, we propose a quad-dominant remeshing method based on the use of a smooth harmonic scalar function defined over the surface. Given such a field, we compute its gradient field and a second vector field that is everywhere orthogonal to the gradient. The two nets of integral lines of these vector fields are used to form the polygons of the output mesh. Curvature-sensitive spacing of the integral lines provides for anisotropic meshes that adapt to the local shape. Our scalar field construction allows users to exercise extensive control over the structure of the final mesh. The entire process is performed without computing an explicit parameterization of the surface, and is thus applicable to manifolds of any genus without, the need for cutting the surface into patches. In the next part, we present a new approach to the quadrangulation of manifold polygon meshes using Laplacian eigenfunctions, the natural harmonics of the surface. These surface functions distribute their extrema evenly across a mesh, which we connect via gradient flow into a quadrangular base mesh. An iterative relaxation algorithm simultaneously refines this initial complex to produce a globally smooth parameterization of the surface. From this, we can construct a well-shaped pure quadrilateral mesh with very few extraordinary vertices. Our method is robust in handling surfaces with arbitrary topology, and generates output with high element quality. In the third part, we deal explicitly with the problem of surface parameterization. We present two complementary methods for automatically improving mesh parameterization, and demonstrate that they provide a desirable combination of efficiency and quality. First, we describe a new iterative method for constructing quasi-conformal parameterizations with free boundaries. We formulate the problem as fitting the coordinate gradients to two guidance vector fields of equal magnitude that are everywhere orthogonal. In only one linear step, our method efficiently generates parameterization with natural boundaries from those with convex boundaries. Next, we introduce a new non-linear optimization framework that, can rapidly reduce interior distortion under a variety of metrics. By iteratively solving linear systems, our algorithm converges to a high quality, low distortion parameterization in very few iterations.
A Discrete Parameter-Driven Time Series Model for Traffic Flow in ITS
Authors: Yow-Jen Jou, Yan-Chu Huang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The traffic condition information is critical to signal control and traffic queue management for intelligent transportation systems (ITSs). This work formulates the dynamic traffic flows by a parameter-driven discrete time series model. A modified Expectation-Maximization (EM) algorithm is proposed to estimate the parameters of the model. The conditional expectation given y in the E step of the EM algorithm is replaced by the marginal expectation. Applications of the model and the algorithm are illustrated by analyzing the traffic flow data. Through the data collected by the detectors, the traffic condition about the network can be estimated, smoothed and predicted. This model can be embedded in a chip for signal control and queue management procedures of ITSs.
FPGA Implementation of Evolvable Characters Recognizer with Self-adaptive Mutation Rates
Authors: Jin Wang, Chang Hao Piao, Chong Ho Lee
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

As an alternative to traditional artificial neural network approaches to pattern recognition, a hardware-implemented evolvable characters recognizer is presented in this paper. The main feature of the proposed evolvable system is that all the components including the evolutionary algorithm (EA), fitness calculation, and virtual reconfigurable circuit are implemented in a Xilinx Virtex xcv2000E FPGA. This allows for a completely pipelined hardware implementation and yields a significant speedup in the system evolution. In order to optimize the performance of the evolutionary algorithm and release the users from the time-consuming process of mutation parameters tuning, a self-adaptive mutation rate control scheme is also introduced. An analysis of experimental results demonstrates that the proposed evolvable system using self-adaptive mutation rates is superior to traditional fixed mutation rate-based approaches.
A Case Study on Programming Intelligent Swarm Robots Using Pyro Environment and Player/Stage Simulator
Authors: Byung-Jun Lee, Jeong-Hoon Ji, Gyun Woo
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

A set of robots which shows an intelligent behavior as a whole is called swarm robots. Programming real swarm robots needs a lot of financial cost because many robot hardware systems should be purchased to test the implemented swarm intelligence. In this paper, we report a case study on programming swarm intelligence to control a set of robots using Pyro. Pyro (Python Robotics) is a Pythonbased programming environment to provide a common platform for controlling robots. In practice, Pyro is normally operates on top of a simulator such as Player/Stage. This paper reports the experience on programming swarm robots searching for target objects in a maze. The swarm robots implemented can successfully move the target objects in a maze to the home location, where the robots started from.
Compilation as Rewriting in Higher Order Logic
Authors: Guodong Li, Konrad Slind
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

We present an approach based on the use of deductive rewriting to construct a trusted compiler for a subset of the native functions of higher order logic. Program transformations are specified by equality theorems that characterize the transformations; and the mechanical application of these rules is directed by programs written in the meta-language of the logical framework. Each application of a rule ensures that the transformed code is equivalent to the original one, thus warranting the correctness of the entire compiler.
Cognitive Radio Based Bandwidth Sharing Among Heterogeneous OFDM Access Systems
Authors: Mee-Ran Kim, Eun-Ju Kim, Yeon-Joo Kang, Nak-Myeong Kim
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

Cognitive radio (CR) has been proposed as an effective technology for flexible use of the radio spectrum. The interference among primary users and CR users, however, becomes a critical problem when they are operating nearby using adjacent frequency channels with different transmission powers. In this paper, a CR-based bandwidth sharing architecture is proposed, which can effectively suppress adjacent channel interference (ACI) between them. This new approach is characterized by the adaptive frequency spreading, and the adaptive time spreading with power control for the subcarriers near the borders of the CR user's spectrum. The frequency spreading scheme provides with extra power gain against ACI, whereas the time spreading with power control guarantees the minimal interference to primary users from CR users. By computer simulation, it has been proved that the proposed system outperforms the conventional OFDM systems in both throughput and BER performance.