Betweenness estimation in OLSR-based multi-hop networks for distributed filtering

In traditional networks special efforts are put to secure the perimeter with firewalls: particular routers that analyze and filter the traffic to separate zones with different levels of trust. In wireless multi-hop networks the perimeter is a concept extremely hard to identify, thus, it is much more effective to enforce control on the nodes that will route more traffic. But traffic filtering and traffic analysis are costly activities for the limited resources of mesh nodes, so a trade-off must be reached limiting the number of nodes that enforce them. This work shows how, using the OLSR protocol, the centrality of groups of nodes with reference to traffic can be estimated with high accuracy independently of the network topology or size. We also show how this approach greatly limits the impact of an attack to the network using a number of firewalls that is only a fraction of the available nodes.     

Introduction to the special issue of the 19th International Conference on Runtime Verification

International Journal on Software Tools for Technology Transfer -     

A platform for P2P agent-based collaborative applications

The operational environment can be a valuable source of information about the behavior of software applications and their usage context. Although a single instance of an application has limited evidence of the range of the possible behaviors and situations that might be experienced in the field, the collective knowledge composed by the evidence gathered by the many instances of a same application running in several diverse user environments (eg, a browser) might be an invaluable source of information. This information can be exploited by applications able to autonomously analyze how they behave in the field and adjust their behavior accordingly. Augmenting applications with the capability to collaborate and directly share information about their behavior is challenging because it requires the definition of a fully decentralized and dependable networked infrastructure whose nodes are the user machines. The nodes of the infrastructure must be collaborative, to share information, and autonomous, to exploit the available information to change their behavior, for instance, to better accommodate the needs of the users to prevent known problems. This paper describes the initial results that we obtained with the design and the development of an infrastructure that can enable the execution of collaborative scenarios in a fully decentralized way. Our idea is to combine the agent-based paradigm, which is well suited to design collaborative and autonomous nodes, and the peer-to-peer paradigm, which is well suited to design distributed and dynamic network infrastructures. To demonstrate our idea, we augmented the popular JADE agent-based platform with a software layer that supports both the creation of a fully decentralized peer-to-peer network of JADE platforms and the execution of services within that network, thus enabling JADE multiagent systems (MASs) to behave as peer-to-peer networks. The resulting platform can be used to study the design of collaborative applications running in the field.     

A selective conductive polymer-based sensor for volatile halogenated organic compounds (VHOC)

A novel poly(p-xylylene), PPX, derivative bearing alkoxyphenyl side groups was electrochemically synthesized in 87% yield. The polymer, poly(4′-hexyloxy-2,5-biphenyleneethylene) (PHBPE), presented a fraction (92%) soluble in common organic solvents. It showed to be thermally resistant up to 185 °C. UV–vis analysis revealed an E_gap of 3.5 eV. Gas sensors made from thin films of 10-camphorsulfonic acid-doped PHBPE deposited on interdigitated electrodes exhibited significant changes in electrical conductance upon exposure to five VHOCs: 1,2-dichloroethane, bromochloromethane, trichloromethane, dichloromethane and tetrachloromethane. The conductance decreased after exposure to tetrachloromethane and increased after exposure to all the other VHOCs. Three-dimensional plots of relative response versus time of half response versus time of half recovery showed good discrimination between the five VHOCs tested.     

Learning extended FSA from software: An empirical assessment

A number of techniques that infer finite state automata from execution traces have been used to support test and analysis activities. Some of these techniques can produce automata that integrate information about the data-flow, that is, they also represent how data values affect the operations executed by programs.The integration of information about operation sequences and data values into a unique model is indeed conceptually useful to accurately represent the behavior of a program. However, it is still unclear whether handling heterogeneous types of information, such as operation sequences and data values, necessarily produces higher quality models or not.In this paper, we present an empirical comparative study between techniques that infer simple automata and techniques that infer automata extended with information about data-flow. We investigate the effectiveness of these techniques when applied to traces with different levels of sparseness, produced by different software systems. To the best of our knowledge this is the first work that quantifies both the effect of adding data-flow information within automata and the effectiveness of the techniques when varying sparseness of traces.     

To lock, or not to lock: That is the question

Mechanisms to control concurrent access over project artefacts are needed to execute the software development process in an organized way. These mechanisms are implemented by concurrency control policies in version control systems that may inhibit (i.e. ‘to lock’) or allow (i.e., ‘not to lock’) parallel development. This work presents a novel approach named Orion that analyzes the project's historical changes and suggests the most appropriate concurrency control policy for each software element. This suggestion aims at minimizing conflict situations and thus improving the productivity of the development team. In addition, it identifies critical elements that do not work well with any of these policies and are candidates to refactoring. We evaluated Orion through two experimental studies and the results, which indicated it was effective, led us to a prototype implementation. Apart from the Orion approach this paper also presents the planning, execution, and analysis stages of the evaluation, and details of prototype internals.     

CPSDebug: Automatic failure explanation in CPS models

International Journal on Software Tools for Technology Transfer - Debugging cyber-physical system (CPS) models is a cumbersome and costly activity. CPS models combine continuous and discrete...     

Anti-BlUFf: towards counterfeit mitigation in IC supply chains using blockchain and PUF

International Journal of Information Security - The complexity of today’s integrated circuit (IC) supply chain, organised in several tiers and including many companies located in different...     

A combinatorial approach to the generalized Baker–Campbell–Hausdorff–Dynkin formula

The aim of this paper is to obtain an explicit expression, instead of using a recursive method, for the nth term coefficient of the generalized Baker–Campbell–Hausdorff–Dynkin (gBCHD) formula. The gBCHD formula has been applied to control theory, specially to nonholonomic motion planning.     

Supporting structured parallel program design,development and tuning in FastFlow

The Journal of Supercomputing - The design and tuning of parallel programs is known to be a hard and error-prone process. Structured parallel programming helps overcoming part of the related...