ppxscal/embedding_network huggingface dataset:
Symbolic Reliability Analysis of Self-healing Networked Embedded Systems
Authors: Michael Glaß, Martin Lukasiewycz, Felix Reimann, Christian Haubelt, Jürgen Teich
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

In recent years, several network online algorithms have been studied that exhibit self-x properties such as self-healing or self-adaption. These properties are used to improve systems characteristics like, e.g., fault-tolerance, reliability, or load-balancing.In this paper, a symbolic reliability analysis of self-healing networked embedded systems that rely on self-reconfiguration and self-routing is presented. The proposed analysis technique respects resource constraints such as the maximum computational load or the maximum memory size, and calculates the achievable reliability of a given system. This analytical approach considers the topology of the system, the properties of the resources, and the executed applications. Moreover, it is independent of the used online algorithms that implement the self-healing properties, but determines the achievable upper bound for the systems reliability. Since this analysis is not tailored to a specific online algorithm, it allows a reasonable decision making on the used algorithm by enabling a rating of different self-healing strategies. Experimental results show the effectiveness of the introduced technique even for large networked embedded systems.
How to Inform People with Reduced Mobility about Public Transport
Authors: Christian Bühler, Helmut Heck, Josef Becker
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The German project BAIM supports the active and indepen dent participation of people with reduced mobility in public transport. It focuses on the provision of accessible and adaptable information services with target group oriented information about suitable travelling options or potential barriers, before and during the journey. The information is provided via internet and via an interactive telephone service with speech-recognition. The system has been implemented and tested in two integrated public transport systems, Rhein-Main-Verkehrsverbund and Verkehrsverbund Berlin-Branden burg, covering a population of 11 Mio. people, with a strong emphasis on user participation in all project phases. Main parts of the system went public in January 2008.
Spieldose: An Interactive Genetic Software for Assisting to Music Composition Tasks
Authors: Ángel Sánchez, Juan José Pantrigo, Jesús Virseda, Gabriela Pérez
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

We describe a new software tool, called Spieldose (in English, musical box), suited to the automatic music composition task. Our system is based on the paradigm of Interactive Genetic Algorithms (abbreviated as Interactive GA) where the parent selection stage in a typical GA is made by the user according to his/her subjective criteria. The tool permits to integrate the interaction between the system and the potential users when they create their melodies. One important contribution of this work is the proposal of specific musical genetic operators (different types of crossover, mutation and improvement operators) which ensure that the generated melodies are in concordance with Music Theory and they are also nice to listening. Moreover, our software tool can be customized to a particular musical style by including the specific musical knowledge domain in the system. For validation purposes, we used Spieldose to compose different pieces corresponding to the classicism.
Bit-Pattern Based Integral Attack
Authors: Muhammad Reza Z'Aba, Håvard Raddum, Matt Henricksen, Ed Dawson
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

Integral attacks are well-known to be effective against byte-based block ciphers. In this document, we outline how to launch integral attacks against bit-based block ciphers. This new type of integral attack traces the propagation of the plaintext structure at bit-level by incorporating bit-pattern based notations. The new notation gives the attacker more details about the properties of a structure of cipher blocks. The main difference from ordinary integral attacks is that we look at the pattern the bits in a specific position in the cipher block has through the structure. The bit-pattern based integral attack is applied to Noekeon, Serpent and present reduced up to 5, 6 and 7 rounds, respectively. This includes the first attacks on Noekeon and present using integral cryptanalysis. All attacks manage to recover the full subkey of the final round.
Parallel exact inference on the cell broadband engine processor
Authors: Yinglong Xia, Viktor K. Prasanna
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilistic graphical models. In such a model, the computation complexity increases dramatically with the network structure and clique size. In this paper, we exploit parallelism at multiple levels. We present an efficient scheduler to dynamically partition large tasks and allocate synergistic processing elements (SPEs). We explore potential table representation and data layout to optimize DMA transfer between the local store and main memory. We also optimized the computation kernels. We achieved linear speedup and superior performance, compared with state-of-the-art processors such as the AMD Opteron, Intel Xeon and Pentium 4. The methodology proposed in this paper can be used for online scheduling of directed acyclic graph (DAG) structured computations.
A sequential Monte Carlo/Quantum Mechanics study of the dipole polarizability of liquid benzene
Authors: Eudes E. Fileti, Sylvio Canuto
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

Metropolis Monte Carlo classical simulation and quantum mechanical calculations are performed to obtain the dipole polarizability of liquid benzene. Super-molecular configurations are sampled from NVT Monte Carlo simulation of liquid benzene at room temperature and are used for subsequent quantum mechanical calculations. The auto-correlation function of the energy is used to analyze the statistical correlation between the configurations. Finite-field INDO and DFT calculations are performed in the statistically uncorrelated super-molecular clusters obtained in the simulation. The quantum mechanical results are shown to represent statistically converged values. The final results corroborate the recent contention that the dipole polarizability of liquid benzene suffers only a small change in the condensed phase.
On-Line Handwriting Recognition System for Tamil Handwritten Characters
Authors: Alejandro H. Toselli, Moisés Pastor, Enrique Vidal
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

We describe the recognition system we used for the "On-Line Tamil Handwritten Character Recognition Competition", hosted by the "International Workshop on Frontiers in Handwriting Recognition". The system is based on continuous density Hidden Markov Models and characterized by feature extraction based on time and frequency-domain features. In that contest we have obtained the third best score in character classification accuracy.
Technical communique: Robust H2 optimal filtering for continuous-time stochastic systems with polytopic parameter uncertainty
Authors: Kwan Ho Lee, Biao Huang
Venue: Automatica (Journal of IFAC) (2008)

In this paper, robust H"2 optimal filtering is addressed for continuous-time stochastic systems with polytopic parameter uncertainty. A new robust stability condition is presented. A continuous-time robust H"2 optimal filter is obtained by solving a sufficient linear matrix inequality condition characterizing a solution of a robust minimum variance filtering problem which takes into account the polytopic type of model uncertainties. The proposed approach is demonstrated through numerical examples.
Dynamic Adaptation of Workflow Based Service Compositions
Authors: Heiko Pfeffer, David Linner, Stephan Steglich
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Service composition mechanisms successfully enable 'programming in the large' within business oriented computing systems. Here, the composability of single software components provides dynamicity and flexibility in the design of large-scale applications. However, this dynamicity is restricted to the late binding of services to service interface descriptions; the workflow, i.e. the execution order of the single services, remains static.Within this paper, we present the modification of abstract service composition plans, extending service compositions' dynamicity from late binding of service implementations to a dynamic reconfiguration of the service composition structure itself. As a proof of concept, we demonstrate the adaptability of the service composition plan by applying genetic operators on the workflow graph of the service composition. Finally, an evaluation mechanism is presented to estimate the degree of similarity between the resulting composition plan and present ones.
Extended Multi Bottom-Up Tree Transducers
Authors: Joost Engelfriet, Eric Lilin, Andreas Maletti
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

Extended multi bottom-up tree transducers are defined and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute any transformation that is computed by a linear extended top-down tree transducer. Moreover, the classical composition results for bottom-up tree transducers are generalized to extended multi bottom-up tree transducers. Finally, a characterization in terms of extended top-down tree transducers is presented.
Model-Driven Programming
Authors: Jens Bennedsen, Michael Caspersen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

Conceptual modelling is the defining characteristic of object-orientation and provides a unifying perspective and a pedagogical approach focusing upon the modelling aspects of object-orientation. Reinforcing conceptual modelling as a basis for CS1 provides a course structure to integrate the core elements from a conceptual framework for object-orientation and a systematic approach to programming. Both of these are helpful to newcomers. The progression of the course is defined by the growing complexity of the conceptual model, which is to be implemented. The focus is not on conceptual modelling per se, but on the use of conceptual models as a structuring mechanism and a guide for the implementation. In this article we discuss different ways to structure an introductory programming course and give concrete examples on how a course where the complexity of the conceptual model is defining the structure.
Performance Enhancement of Multimedia Data Transmission by Adjusting Compression Rate
Authors: Eung Ju Lee, Kyu Seol Lee, Hee Yong Youn
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The rapid growth of wireless communication technology has spurred various mobile applications. In this paper we propose a scheme which can improve the PSNR of multimedia data transmission using the RTP/RTCP. It is achieved by adjusting the compression rate according to the packet loss rate, delay, or jitter in the network. The NS-2 simulation reveals that the proposed approach shows a significant improvement over the conventional scheme of fixed compression rate. Particularly, it turns out that adjusting based on jitter is more effective than with the other two factors.
Mathematical model of pollution compounds calculus in function of traffic capacity from urban areas
Authors: Stelian Tarulescu, Radu Tarulescu, Adrian Soica
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

The Brasov city is one of the biggest towns in Romania. In the central area of the Brasov city can be found the biggest concentration of the carbon monoxide, nitrogen oxides, the ozone and the volatile organic compounds. For intersection's analysis there were collected data about the road traffic and data about the chemical pollution in the neighborhood of the road. In order to realize the model there were made tables with the traffic values and the values of the three pollutants, in function of the intersections of the analyzed route. For calculus were used the equations corresponding to the determined polynomial curves, for each pollutant, using the values obtained experimentally. The working page of the mathematical model was made grouping the four analyzed situations.
Methodological Review: HCLS 2.0/3.0: Health care and life sciences data mashup using Web 2.0/3.0
Authors: Kei-Hoi Cheung, Kevin Y. Yip, Jeffrey P. Townsend, Matthew Scotch
Venue: Journal of Biomedical Informatics (2008)

We describe the potential of current Web 2.0 technologies to achieve data mashup in the health care and life sciences (HCLS) domains, and compare that potential to the nascent trend of performing semantic mashup. After providing an overview of Web 2.0, we demonstrate two scenarios of data mashup, facilitated by the following Web 2.0 tools and sites: Yahoo! Pipes, Dapper, Google Maps and GeoCommons. In the first scenario, we exploited Dapper and Yahoo! Pipes to implement a challenging data integration task in the context of DNA microarray research. In the second scenario, we exploited Yahoo! Pipes, Google Maps, and GeoCommons to create a geographic information system (GIS) interface that allows visualization and integration of diverse categories of public health data, including cancer incidence and pollution prevalence data. Based on these two scenarios, we discuss the strengths and weaknesses of these Web 2.0 mashup technologies. We then describe Semantic Web, the mainstream Web 3.0 technology that enables more powerful data integration over the Web. We discuss the areas of intersection of Web 2.0 and Semantic Web, and describe the potential benefits that can be brought to HCLS research by combining these two sets of technologies.
Complete Mapping Polynomials over Finite Field F16
Authors: Yuan Yuan, Yan Tong, Huanguo Zhang
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

A polynomial f(x) over F q , the finite field with q elements, is called a complete mapping polynomial if the two mappings F q ¿F q respectively defined by f(x) and f(x) + x are one-to-one. In this correspondence, complete mapping polynomials over F 16 are considered. The nonexistence of the complete mapping polynomial of degree 9 and the existence of the ones of degree 8 and 11 are proved; the result that the reduced degree of complete mapping polynomials over F 16 are 1, 4, 8, 10, 11, 12, 13 is presented; and by searching with computer, the degree distribution of complete mapping polynomials over the field is given.
Location-Based Variability for Mobile Information Systems
Authors: Raian Ali, Fabiano Dalpiaz, Paolo Giorgini
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Advances in size, power, and ubiquity of computing, sensors, and communication technology make possible the development of mobile or nomadic information systems. Variability of location and system behavior is a central issue in mobile information systems, where software behavior has to change and re-adapt to the different location settings. In this paper, we motivate the need for integration of variable location and variable software behavior. We adapt the goal-oriented framework i*/Tropos to model and analyze the alternative goal satisfaction strategies and the location where each alternative can be adopted. We introduce analysis techniques for the proposed location-based models.
Spectral Properties of Adjacency and Distance Matrices for Various Networks
Authors: Krzysztof Malarz
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert---Barabási) and classical random ones (Erdős---Rényi) are evaluated. The graph spectra for dense graph in the Erdős---Rényi model are derived analytically.
Modeling the internet is fun!: but can you make a living?
Authors: Don Towsley
Venue: ACM SIGCOMM Computer Communication Review (2008)

This talk overviews some of the highlights and success stories in the mathematical modeling and analysis of the Internet (and other networks). We will begin with Kleinrock's seminal work on modeling store and forward networks and its extensions, and end with the successful development of fluid models for the current Internet. The rest of the talk will focus on lessons learned from these endeavors and how modeling and analysis can and will play a role in the development of new networks (e.g., wireless networks, application-level networks). Finally, we conclude that one can have fun modeling networks while at the same time make a living.
Algorithms for Minimum m-Connected k-Dominating Set Problem
Authors: Weiping Shang, Frances Yao, Pengjun Wan, Xiaodong Hu
Venue: Proceedings of the 1st international conference on Combinatorial Optimization and Applications (2007)

In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consider how to establish a small virtual backbone to balance efficiency and fault tolerance. This problem can be formalized as the minimum m-connected k-dominating set problem, which is a general version of minimum CDS problem with m = 1 and k = 1. In this paper we will propose some approximation algorithms for this problem that beat the current best performance ratios.
Comparing Robustness of AIS-Based Middleware Implementations
Authors: Zoltán Micskei, István Majzik, Francis Tam
Venue: Proceedings of the 4th international symposium on Service Availability (2007)

To enable the interoperability of high availability (HA) middleware systems the Service Availability Forum has released a set of open specifications. The benefit of having open specifications is the choice of implementations available from different vendors. When one chooses a product, one of the selection criteria (besides performance) is the robustness of the implementation, as the crashing or hanging of such a HA middleware causes the failure of the whole system. The challenge is to develop the appropriate technology for measuring and comparing robustness of HA middleware implementations. Based on our earlier results, we present a set of automatic testing tools and a benchmark suite constructed using these tools. We demonstrate the robustness testing approach by comparing the results of benchmarking carried out on three HA middleware implementations.
NN-Based Multiagent Platform for Testing Investing Strategies
Authors: Darius Plikynas
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

The proposed framework constructs an intelligent agent composed of a few trained neural networks, each specialized to make investment decisions according to the assigned investment strategies. The artificial investing agents are not only forecasting but also managing their portfolios. A novel simulation platform designs a multi-agent system, which is composed from those intelligent agents. Agents are trained to follow different investing strategies in order to optimize their portfolios. The proposed multi-agent portfolio simulation platform gives us an opportunity to display the multi-agent competitive system, and find the best profit-risk performing agents, i.e. investing strategies. In sum, simulations have shown that the proposed NN-based multi-agent system produces similar results in terms of e.g. wealth distribution compared with empirical evidence from the actual investment markets' behavior.
Resolve Overlapping Voltammetric Peaks by Artificial Neural Networks with Maximum Likelihood Principal Component Analysis
Authors: Ling Gao, Xiaoping Li, Shouxin Ren
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The multilayer feedforward networks based on the back propagation with maximum likelihood principal component analysis (MLPCA-BP-MLFN) preprocessor were developed to analyze overlapping Osteryoung square wave voltammograms. The principal component analysis back propagation multilayer feed forward networks (PCA-BP-MLFN) and the Kernel Partial Least Squares (KPLS) method were also applied in this paper for comparison. Three programs called PKPLS, PPCABPMLFN and PMLPCABPMLFN were designed to perform the calculations. A comparative study of the prediction capabilities of the three approaches showed the three methods provided satisfactory results. MLPCA-BP-MLFN is a valuable tool in solving the local minimum problem and improving the convergence rate. Comparing with KPLS and PCA-BP-MLFN, MLPCA-BP-MLFN was showed to be improved significantly in the case.
Single-Pass Grinding -- An Effective Manufacturing Method for Finishing
Authors: Krzysztof Nadolny, Jaroslaw Plichta, Daniela Herman, Bronislaw Slowinski
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The paper presents the essence of the single-pass internal cylindrical grinding process. There is a descriptive presentation of the grinding wheels of zonally diversified structure and the attachment for precise forming the conical chamfer on the active surface of abrasive tools applied to this process. The experimental results enabled the effects of the structural diversification of grinding wheels on the process and results of the single-pass internal cylindrical grinding to be evaluated. The results of zonally diversified grinding were related to the effects of grinding using only the wheels made from grains of the same size. The mathematical models of changes in the grinding power and the roughness of the workpiece surface machined with the grinding wheels being tested were developed for the material removal rate fluctuating within Qw≈9-24 mm3/s.
Counter-Example Generation-Based One-Class Classification
Authors: András Bánhalmi, András Kocsor, Róbert Busa-Fekete
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

For One-Class Classification problems several methods have been proposed in the literature. These methods all have the common feature that the decision boundary is learnt by just using a set of the positive examples. Here we propose a method that extends the training set with a counter-example set, which is generated directly using the set of positive examples. Using the extended training set, a binary classifier (here ¿-SVM) is applied to separate the positive and the negative points. The results of this novel technique are compared with those of One-Class SVM and the Gaussian Mixture Model on several One-Class Classification tasks.