ppxscal/embedding_network huggingface dataset:
Performance Analysis of GRID Middleware Using Process Mining
Authors: Anastas Misev, Emanouil Atanassov
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Performance analysis of the GRID middleware used in a production setting can give valuable information to both GRID users and developers. A new approach to this issue is to use the process mining techniques. Analyzing logs of the middleware activities, performed on the SEE-GRID pilot production Grid infrastructure, objective qualitative and quantitative information on what actually happens can be obtained. Using the appropriate tools like ProM to apply the process mining algorithms, many interesting findings and conclusions can be drawn. In this paper we describe our approach and show some of our conclusions.
Transmitting and gathering streaming data in wireless multimedia sensor networks within expected network lifetime
Authors: Lei Shu, Yan Zhang, Zhangbing Zhou, Manfred Hauswirth, Zhiwen Yu, Gearoid Hynes
Venue: Mobile Networks and Applications (2008)

Using multimedia sensor nodes in wireless sensor networks (WSNs) can significantly enhance the capability of WSNs for event description. Different kinds of holes can easily appear in WSNs. How to efficiently transmit multi-media streaming data and bypass all kinds of holes is a challenging issue. Moreover, some applications do not need WSNs to work for a long lifetime, e.g. monitoring an erupting volcano. These applications generally expect that WSNs can provide continuous streaming data during a relatively short expected network lifetime. Two basic problems are: (1) gathering as much data as possible within an expected network lifetime; (2) minimizing transmission delay within an expected network lifetime. In this paper, we proposed a cross-layer approach to facilitate the continuous one shot event recording in WSNs. We first propose the maximum streaming data gathering (MSDG) algorithm and the minimum transmission delay (MTD) algorithm to adjust the transmission radius of sensor nodes in the physical layer. Following that the two-phase geographical greedy forwarding (TPGF) routing algorithm is proposed in the network layer for exploring one/multiple optimized hole-bypassing paths. Simulation results show that our algorithms can effectively solve the identified problems.
Qos support for multi-user sessions in IP-based next generation networks
Authors: Eduardo Cerqueira, Luis Veloso, Augusto Neto, Marilia Curado, Edmundo Monteiro, Paulo Mendes
Venue: Mobile Networks and Applications (2008)

A combined control of multimedia quality level, mobility and allocation of network resources is essential for the success of next generation mobile networks. In this context, this article presents the Multi-user Session Control (MUSC) solution to control the quality level of multimedia sessions shared by multiple-users, providing Quality of Service (QoS) mapping and QoS adaptation for those sessions over heterogeneous and mobile networks. MUSC uses the self-organized principle to coordinate QoS mapping and QoS adaptation mechanisms with mobility and resource allocation controllers, allowing the adaptation of a session to the current network conditions and the dynamic selection of the suitable network service class to map the session. MUSC minimizes the blocking probability, optimizes the usage of network resources and keeps sessions with an acceptable quality of experience. MUSC was evaluated in a simulation and in an experimental environment to analyze its convergence time, percentage of session blocking as well as delay, throughput, Peak Signal-to-Noise Ratio (PSNR), Mean Option Scores (MOS) and Structural Similarity Index (SSIM) of sessions in QoS-aware mobile scenarios.
Lock-Free Asynchronous Rendezvous Design for MPI Point-to-Point Communication
Authors: Rahul Kumar, Amith R. Mamidala, Matthew J. Koop, Gopal Santhanaraman, Dhabaleswar K. Panda
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Message Passing Interface (MPI) is the most commonly used method for programming distributed-memory systems. Most MPI implementations use a rendezvous protocol for transmitting large messages. One of the features desired in a MPI implementation is the ability to asynchronously progress the rendezvous protocol. This is important to provide potential for good computation and communication overlap to applications. There are several designs that have been proposed in previous work to provide asynchronous progress. These designs typically use progress helper threads with support from the network hardware to make progress on the communication. However, most of these designs use locking to protect the shared data structures in the critical communication path. Secondly, multiple interrupts may be necessary to make progress. Further, there is no mechanism to selectively ignore the events generated during communication. In this paper, we propose an enhanced asynchronous rendezvous protocol which overcomes these limitations. Specifically, our design does not require locks in the communication path. In our approach, the main application thread makes progress on the rendezvous transfer with the help of an additional thread. The communication between the two threads occurs via system signals. The new design can achieve near total overlap of communication with computation. Further, our design does not degrade the performance of non-overlapped communication. We have also experimented with different thread scheduling policies of Linux kernel and found out that the round robin policy provides the best performance. With the new design we have been able to achieve 20% reduction in time for a matrix multiplication kernel with MPI+OpenMP paradigm on 256 cores.
A Hierarchy of Equivalences for Probabilistic Processes
Authors: Manuel Núñez, Luis Llana
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

We study several process equivalences on a probabilistic process algebra. First, we define an operational semantics. Afterwards we introduce the notion of passing a test with a probability. We consider three families of tests according to the intended behavior of an external observer: Reactive (sequential tests), generative (branching tests), and limited generative (equitable branching tests). For each of these families we define three predicates over processes and tests (may-pass, must-pass, pass p ) which induce three equivalences. Finally, we relate these nine equivalences and provide either alternative characterizations or fully abstract denotational semantics. These semantic frameworks cover from simple traces to probabilistic acceptance trees.
Dynamically Reorganising Vascular Networks Modelled Using Cellular Automata Approach
Authors: Paweł Topa
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

We present the model of tumour induced angiogenesis that apart from predominating phenomena, as influence of VEGF, includes newly discovered factors such as Dll4/Notch signalling and remodelling processes. The Cellular Automata approach is employed to model cellular and intracellular processes that occur in cancer tissue and surroundings. Vascular system is modelled by using the Graph of Cellular Automata, which combines graph theory with the Cellular Automata paradigm. Additionally, an outline of model verification method which uses graph descriptors is presented and exemplified.
Failure analysis and reliability-aware resource allocation of parallel applications in high performance computing systems
Authors: Narasimha Raju Gottumukkala
Venue:  (2008)

The demand for more computational power to solve complex scientific problems has been driving the physical size of High Performance Computing (HPC) systems to hundreds and thousands of nodes. Uninterrupted execution of large scale parallel applications naturally becomes a major challenge because a single node failure interrupts the entire application, and the reliability of a job completion decreases with increasing the number of nodes. Accurate reliability knowledge of a HPC system enables runtime systems such as resource management and applications to minimize performance loss due to random failures while also providing better Quality Of Service (QOS) for computational users. This dissertation makes three major contributions for reliability evaluation and resource management in HPC systems. First we study the failure properties of HPC systems and observe that Times To Failure (TTF's) of individual compute nodes follow a time-varying failure rate based distribution like Weibull distribution. We then propose a model for the TTF distribution of a system of k independent nodes when individual nodes exhibit time varying failure rates. Based on the reliability of the proposed TTF model, we develop reliability-aware resource allocation algorithms and evaluated them on actual parallel workloads and failure data of a HPC system. Our observations indicate that applying time varying failure rate-based reliability function combined with some heuristics reduce the performance loss due to unexpected failures by as much as 30 to 53 percent. Finally, we also study the effect of reliability with respect to the number of nodes and propose reliability-aware optimal k node allocation algorithm for large scale parallel applications. Our simulation results of comparing the optimal k node algorithm indicate that choosing the number of nodes for large scale parallel applications based on the reliability of compute nodes can reduce the overall completion time and waste time when the k may be smaller than the total number of nodes in the system.
Meme Media and Knowledge Federation
Authors: Yuzuru Tanaka, Jun Fujima, Micke Kuwahara
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

This paper first clarifies two major difficulties that prevents our maximum utilization of web resources; the difficulty to find appropriate ones, and the difficulty to make them work together. It focuses on the latter problem, and proposes ad hoc knowledge federation technologies as key technologies for its solution. Then it reviews our group's 15 year research on meme media, as well as his 6 year research on their application to ad hoc knowledge federation of web resources. Then it proposes an extension of the Web to the memetic Web. This extension is brought by the recent significant revision of the 2D meme media architecture. Finally it shows some new applications of these technologies.
Discrimination of Varieties of Red Wines Based on Independent Component Analysis and BP Neural Network
Authors: Guifang Wu, Yong He, Yanyan Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Abstract A new method of using Vis/NIR spectroscopy technique to identify the varieties of red wines was studied. Through comparing modeling performance built by different amounts of independent components, 20 independent components (ICs) extracted by independent components analysis (ICA) were employed as the inputs of the BP neural networks and were consider to be important parameter for calibration and validation, a three layers of BP neural network was built, category analysis was performed as well as the work of building mathematics model and optimizing the algorithm was completed. 5 samples from each variety and a total of 25 samples were selected randomly as the prediction sets. The remaining 150 samples were used as the training sets to build the training model which is validated by the samples of the prediction sets. The recognition rate of 100%, in addition, based on the independent component analysis, we selected two characteristic wavebands of red wines in reference to vector loading map of mixed matrix. So the pattern recognition methods developed in this paper not only played a good role in the classification and discrimination, but had a capability to extract the finger feature of red wine, and offered a new way to detecting and product developing in red wines.
Topic 11: Distributed and High-Performance Multimedia
Authors: Frank Seinstra, Nicolás Guil, Zoltan Juhasz, Simon Wilson
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

In recent years, the world has seen a tremendous increase in the capability to create, share and store multimedia items, i.e. a combination of pictorial, textual, and auditory data. Moreover, in emerging multimedia applications, generation, processing, storage, indexing, querying, retrieval, delivery, shielding, and visualization of multimedia content are integrated issues, all taking place at the same time and - potentially - at different administrative domains.As a result of these trends, a number of novel and hard research questions arise, which can be answered only by applying techniques of parallel, distributed, and Grid computing. The scope of this topic embraces issues from highperformance processing, coding, indexing, and retrieval of multimedia data over parallel architectures for multimedia servers, databases and information systems, up to highly distributed architectures in heterogeneous, wired and wireless networks.
Social Layers in Agents' Behavior Evaluation System
Authors: Krzysztof Cetnarowicz, Renata Cięciwa, Gabriel Rojek
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Behavior evaluation is an approach to a security problem in a multi-agent system that reflects security mechanisms in a human society. The main idea of this approach is behavior evaluation of all agents existing in society that is done autonomously by every agent belonging to that society. All autonomous behavior evaluations have to be collected and processed in order to create a collective decision of a society of agents. This approach reflects security mechanisms existing in a small society in which every human being has enough possibilities to observe and evaluate all other members of the society. This results in large computational complexity. In this paper a modification to behavior evaluation is presented which involves two simple social layers. Social layers are characteristic for more complex and larger societies and could be a means of lower computational complexity.
Acceptable Dialogue Start Supporting Agent for Avatar-Mediated Multi-tasking Online Communication
Authors: Takahiro Tanaka, Kyouhei Matsumura, Kinya Fujita
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In recent years, the instant messaging tools have become popular for daily online communication. The feature of the communication style with these tools is multi-tasking online communication. The users of these tools have a problem in recognizing the status of interaction partners. The start of dialogue has a risk of unintended interruption of the partner. The automatic status estimation and ambient display of the status is expected to assist the avoidance of the interruption. Therefore, we prototyped an acceptable dialogue start supporting (ADSS) agent system, for assisting pleasantly-acceptable dialogue start in avatar-mediated multi-tasking communication (AMMCS). The ADSS agent estimates and expresses the user uninterruptibility, and appeals the dialogue request by the communication partner. Fig. 1 shows the overview of ADSS agent and screenshot of the user desktop while using the agent. Each communication partner is displayed as an avatar in a small individual window.
Epidemic Modeling with Discrete Space Scheduled Walkers
Authors: M. Borkowski, R. D. McLeod
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This exploratory paper outlines an epidemic simulator built on data-driven modeling of the spread of a disease. The intent of the model is to provide insight into how a disease may reach a tipping point, spreading to epidemic and uncontrollable proportions. In contrast to analytical methods, simulation is arguably an effective means of gaining a better understanding of how a disease may spread within a population. There are a large number of theoretical models that can be applied to epidemics, all attempting to capture the basic phenomenon of disease dynamics. Our conjecture is to use data-driven models that are reasonable, realistic, and practical in an attempt to demonstrate their efficacy in studying the epidemic phenomenon.
Optimization of Queries over Interval Probabilistic Data
Authors: Matteo Magnani, Danilo Montesi
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

In this paper we deal with the logical and physical optimization of select-from-where queries over interval probabilistic data. We present a data model with algebraic equivalences, to be used to verify the equivalence of alternative query plans, and propose and compare different join algorithms over uncertain relations. We also provide a preliminary experimental evaluation of our contributions.
Taking a RaSP to Enterprise Stakeholder Dissonance
Authors: Richard Taylor, Chris Tofts
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

We present a model based approach to the resolution of conflict between the many stakeholders involved in large scale information system deployment and use. The work is based on the authors experience of more than $20B of outsourcing contracts. The approach, Rapid Scenario Planning (RaSP) yields concrete evidence of the underlying assumptions that drive design and deployment, as well as critical insights into systems and business dynamics. Social and long term management and governance benefits are also obvious. Our implementation of the methodology is supported by specific tools, however equivalent general purpose tools can be used to support this methodology.
QoS-Based Decision Services in Grids
Authors: Dimosthenis Kyriazis, Peer Hasselmeyer, Konstantinos Tserpes, Andreas Menychtas, Theodora Varvarigou
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Complex and mission-critical applications require the use of distributed environments, which will allow their execution in a reliable and cost-efficient way. Grid environments made this case feasible by providing heterogeneous resources. Nevertheless, Quality of Service (QoS) aspects are regarded as fundamental for enabling the execution of business applications in Grids. In that frame, we introduce decision services that establish QoS guarantees and fulfill the applications' requirement on becoming QoS-aware. A workflow mapping component is presented here that allows the mapping of workflow processes to Grid provided services, assuring at the same time end-to-end provision of QoS based on user-defined parameters and preferences; and a resource brokering service that reconciles the interests of providers and consumers based on Service Level Agreements (SLAs), which are negotiated between service providers and the resource broker. We also present a comparison of these decision services.
Model-driven architecture for embedded software: A synopsis and an example
Authors: Gabor Karsai, Sandeep Neema, David Sharp
Venue: Science of Computer Programming (2008)

MDA proposes a new paradigm for software development in general. We claim that MDA could be beneficial for embedded software development, especially if it is extended to address the special needs of embedded systems. The paper consists of two sections: the first is a brief synopsis on how MDA ought to be extended to handle embedded software development, while the second illustrates the concepts in practice using a prototype modeling language and tool chain designed for developing mission computing software.
Relative Entropy Method for Regional Allocation of Water Pollution Loading
Authors: Ju-Liang Jin, Yi-Ming Wei, Lin-Yan Jing, Yan Guo
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Regional allocation of water pollution loading is an important measure for achieving general quality and quantity control, which key problem is allocating right weights to sub-regions. Information entropy method (IEM) is proposed to mine the objective variation information of sub-regions and experience information of decision makers during the allocation process. The research results show that IEM is concise and universal, so it can be widely applied to theory and practice of various systems engineering applications.
Bio-inspired Optimization Techniques for SVM Parameter Tuning
Authors: André Luis Debiaso Rossi, André C. P. L. F. de Carvalho
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

Machine learning techniques have been successfully applied to a large number of classification problems. Among these techniques, Support Vector Machines (SVMs) are well know for the good classification accuracies reported in several studies. However, like many machine learning techniques, the classification performance obtained by SVMs is influenced by the choice of proper values for their free parameters. In this paper, we investigate what is the influence of different optimization techniques inspired by Biology when they are used to optimize the free parameters of SVMs. This comparative study also included the default values suggested in the literature for the free parameters and a grid algorithm used for parameter tuning. The results obtained suggest that, although SVMs work well with the default values, they can benefit from the use of an optimization technique for parameter tuning.
Remarks on Automated Ontology Merging Algorithm
Authors: Monika Koprowska
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The paper introduces general information about the ontology merging. An ontology provides avocabulary describing particular domain along with the meaning of the used terms. The precision of the ontology specification is usually various for different cases and depends on a practical application. A semantic and structural heterogenity of domain models causes problems with ontologies management. The first part of the paper shortly describes the origin of an idea of web ontologies. The second part provides the methods of merging and aligning OWL-coded ontologies.
Network Forensic Analysis Using Visualization Effect
Authors: Seung-hoon Kang, Juho Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

A numerous property and information are transferred to electronic and computerized while internet and networks are expanded. Behind the convenience, problems such as cyber terror, computer crime, and privacy trespassers are growing constantly. There are a number of evidences showing that damaged computers and the related systems are used for tracking the criminal or proving the crime. In the part of computer forensics, there have been many efforts to find the evidences in the network. A new efficient network forensic analysis using visualization, that supports panoramical views and human centralized analysis is proposed in this paper. In this work, the emphasis on maximizing the visualization effect related to network components is made to build more efficient forensic system. The experimental results show that visualized network forensic analysis utilizes resource and time more efficiently compared to the traditional methods.