Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Towards Direct Policy Search Reinforcement Learning for Robot Control

This paper proposes a high-level reinforcement learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, when using RL, has been to apply value function based algorithms, the system here detailed is characterized by the use of direct policy search methods. Rather than approximating a value function, these methodologies approximate a policy using an independent function approximator with its own parameters, trying to maximize the future expected reward. The policy based algorithm presented in this paper is used for learning the internal state/action mapping of a behavior. In this preliminary work, we demonstrate its feasibility with simulated experiments using the underwater robot GARBI in a target reaching task

EURECCA colorectal: multidisciplinary mission statement on better care for patients with colon and rectal cancer in Europe

Background: Care for patients with colon and rectal cancer has improved in the last twenty years however still considerable variation exists in cancer management and outcome between European countries. Therefore, EURECCA, which is the acronym of European Registration of cancer care, is aiming at defining core treatment strategies and developing a European audit structure in order to improve the quality of care for all patients with colon and rectal cancer. In December 2012 the first multidisciplinary consensus conference about colon and rectum was held looking for multidisciplinary consensus. The expert panel consisted of representatives of European scientific organisations involved in cancer care of patients with colon and rectal cancer and representatives of national colorectal registries. Methods: The expert panel had delegates of the European Society of Surgical Oncology (ESSO), European Society for Radiotherapy & Oncology (ESTRO), European Society of Pathology (ESP), European Society for Medical Oncology (ESMO), European Society of Radiology (ESR), European Society of Coloproctology (ESCP), European CanCer Organisation (ECCO), European Oncology Nursing Society (EONS) and the European Colorectal Cancer Patient Organisation (EuropaColon), as well as delegates from national registries or audits. Experts commented and voted on the two web-based online voting rounds before the meeting (between 4th and 25th October and between the 20th November and 3rd December 2012) as well as one online round after the meeting (4th20th March 2013) and were invited to lecture on the subjects during the meeting (13th15th December 2012). The sentences in the consensus document were available during the meeting and a televoting round during the conference by all participants was performed. All sentences that were voted on are available on the EURECCA website www.canceraudit.eu. The consensus document was divided in sections describing evidence based algorithms of diagnostics, pathology, surgery, medical oncology, radiotherapy, and follow-up where applicable for treatment of colon cancer, rectal cancer and stage IV separately. Consensus was achieved using the Delphi method. Results: The total number of the voted sentences was 465. All chapters were voted on by at least 75% of the experts. Of the 465 sentences, 84% achieved large consensus, 6% achieved moderate consensus, and 7% resulted in minimum consensus. Only 3% was disagreed by more than 50% of the members. Conclusions: It is feasible to achieve European Consensus on key diagnostic and treatment issues using the Delphi method. This consensus embodies the expertise of professionals from all disciplines involved in the care for patients with colon and rectal cancer. Diagnostic and treatment algorithms were developed to implement the current evidence and to define core treatment guidance for multidisciplinary team management of colon and rectal cancer throughout Europe.

Wigner higher-order spectra: definition, properties, computation and application to transient signal analysis

The Wigner higher order moment spectra (WHOS)are defined as extensions of the Wigner-Ville distribution (WD)to higher order moment spectra domains. A general class oftime-frequency higher order moment spectra is also defined interms of arbitrary higher order moments of the signal as generalizations of the Cohen’s general class of time-frequency representations. The properties of the general class of time-frequency higher order moment spectra can be related to theproperties of WHOS which are, in fact, extensions of the properties of the WD. Discrete time and frequency Wigner higherorder moment spectra (DTF-WHOS) distributions are introduced for signal processing applications and are shown to beimplemented with two FFT-based algorithms. One applicationis presented where the Wigner bispectrum (WB), which is aWHOS in the third-order moment domain, is utilized for thedetection of transient signals embedded in noise. The WB iscompared with the WD in terms of simulation examples andanalysis of real sonar data. It is shown that better detectionschemes can be derived, in low signal-to-noise ratio, when theWB is applied.

EURECCA colorectal: multidisciplinary mission statement on better care for patients with colon and rectal cancer in Europe

Background: Care for patients with colon and rectal cancer has improved in the last twenty years however still considerable variation exists in cancer management and outcome between European countries. Therefore, EURECCA, which is the acronym of European Registration of cancer care, is aiming at defining core treatment strategies and developing a European audit structure in order to improve the quality of care for all patients with colon and rectal cancer. In December 2012 the first multidisciplinary consensus conference about colon and rectum was held looking for multidisciplinary consensus. The expert panel consisted of representatives of European scientific organisations involved in cancer care of patients with colon and rectal cancer and representatives of national colorectal registries. Methods: The expert panel had delegates of the European Society of Surgical Oncology (ESSO), European Society for Radiotherapy & Oncology (ESTRO), European Society of Pathology (ESP), European Society for Medical Oncology (ESMO), European Society of Radiology (ESR), European Society of Coloproctology (ESCP), European CanCer Organisation (ECCO), European Oncology Nursing Society (EONS) and the European Colorectal Cancer Patient Organisation (EuropaColon), as well as delegates from national registries or audits. Experts commented and voted on the two web-based online voting rounds before the meeting (between 4th and 25th October and between the 20th November and 3rd December 2012) as well as one online round after the meeting (4th-20th March 2013) and were invited to lecture on the subjects during the meeting (13th-15th December 2012). The sentences in the consensus document were available during the meeting and a televoting round during the conference by all participants was performed. All sentences that were voted on are available on the EURECCA website www.canceraudit.eu. The consensus document was divided in sections describing evidence based algorithms of diagnostics, pathology, surgery, medical oncology, radiotherapy, and follow-up where applicable for treatment of colon cancer, rectal cancer and stage IV separately. Consensus was achieved using the Delphi method. Results: The total number of the voted sentences was 465. All chapters were voted on by at least 75% of the experts. Of the 465 sentences, 84% achieved large consensus, 6% achieved moderate consensus, and 7% resulted in minimum consensus. Only 3% was disagreed by more than 50% of the members. Conclusions: It is feasible to achieve European Consensus on key diagnostic and treatment issues using the Delphi method. This consensus embodies the expertise of professionals from all disciplines involved in the care for patients with colon and rectal cancer. Diagnostic and treatment algorithms were developed to implement the current evidence and to define core treatment guidance for multidisciplinary team management of colon and rectal cancer throughout Europe.

A Model-to-model analysis of the repeated Prisoners' Dilemma: genetic algorithms vs. evolutionary dynamics

We study the properties of the well known Replicator Dynamics when applied to a finitely repeated version of the Prisoners' Dilemma game. We characterize the behavior of such dynamics under strongly simplifying assumptions (i.e. only 3 strategies are available) and show that the basin of attraction of defection shrinks as the number of repetitions increases. After discussing the difficulties involved in trying to relax the 'strongly simplifying assumptions' above, we approach the same model by means of simulations based on genetic algorithms. The resulting simulations describe a behavior of the system very close to the one predicted by the replicator dynamics without imposing any of the assumptions of the analytical model. Our main conclusion is that analytical and computational models are good complements for research in social sciences. Indeed, while on the one hand computational models are extremely useful to extend the scope of the analysis to complex scenar

Fast numerical algorithms for the computation of invariant tori in Hamiltonian systems

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.

Evaluating the probability and the impact of a failure in GMPLS based networks

In this paper, we define a new scheme to develop and evaluate protection strategies for building reliable GMPLS networks. This is based on what we have called the network protection degree (NPD). The NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability, and an a posteriori evaluation, the failure impact degree (FID), which determines the impact on the network in case of failure, in terms of packet loss and recovery time. Having mathematical formulated these components, experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms in order to offer a certain degree of protection

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

A behavior-based scheme using reinforcement learning for autonomous underwater vehicles

This paper presents a hybrid behavior-based scheme using reinforcement learning for high-level control of autonomous underwater vehicles (AUVs). Two main features of the presented approach are hybrid behavior coordination and semi on-line neural-Q_learning (SONQL). Hybrid behavior coordination takes advantages of robustness and modularity in the competitive approach as well as efficient trajectories in the cooperative approach. SONQL, a new continuous approach of the Q_learning algorithm with a multilayer neural network is used to learn behavior state/action mapping online. Experimental results show the feasibility of the presented approach for AUVs

An approach to vision-based station keeping for an unmanned underwater vehicle

This paper presents an automatic vision-based system for UUV station keeping. The vehicle is equipped with a down-looking camera, which provides images of the sea-floor. The station keeping system is based on a feature-based motion detection algorithm, which exploits standard correlation and explicit textural analysis to solve the correspondence problem. A visual map of the area surveyed by the vehicle is constructed to increase the flexibility of the system, allowing the vehicle to position itself when it has lost the reference image. The testing platform is the URIS underwater vehicle. Experimental results demonstrating the behavior of the system on a real environment are presented

Policy gradient based Reinforcement Learning for real autonomous underwater cable tracking

This paper proposes a field application of a high-level reinforcement learning (RL) control system for solving the action selection problem of an autonomous robot in cable tracking task. The learning system is characterized by using a direct policy search method for learning the internal state/action mapping. Policy only algorithms may suffer from long convergence times when dealing with real robotics. In order to speed up the process, the learning phase has been carried out in a simulated environment and, in a second step, the policy has been transferred and tested successfully on a real robot. Future steps plan to continue the learning process on-line while on the real robot while performing the mentioned task. We demonstrate its feasibility with real experiments on the underwater robot ICTINEU AUV

Perspectives of auto-correcting lens distortions in mosaic-based underwater navigation

When unmanned underwater vehicles (UUVs) perform missions near the ocean floor, optical sensors can be used to improve local navigation. Video mosaics allow to efficiently process the images acquired by the vehicle, and also to obtain position estimates. We discuss in this paper the role of lens distortions in this context, proving that degenerate mosaics have their origin not only in the selected motion model or in registration errors, but also in the cumulative effect of radial distortion residuals. Additionally, we present results on the accuracy of different feature-based approaches for self-correction of lens distortions that may guide the choice of appropriate techniques for correcting distortions

Availability analysis of GMPLS connections based on physical network topology

This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics