The Anonymous subgraph problem.

Many problems can be modeled as the search for a subgraph S- A with specifi�c properties, given a graph G = (V;A). There are applications in which it is desirable to ensure also S to be anonymous. In this work we formalize an anonymity property for a generic family of subgraphs and the corresponding decision problem. We devise an algorithm to solve a particular case of the problem and we show that, under certain conditions, its computational complexity is polynomial. We also examine in details several specifi�c family of subgraphs

The anonymous subgraph problem

In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to decide whether a directed graph contains anonymous subgraphs of a given family. This problem has a number of practical applications and here we describe three of them (Secret Santa Problem, anonymous routing, robust paths) that can be formulated as ASPs. Our main contributions are (i) a formalization of the anonymity property for a generic family of subgraphs, (ii) an algorithm to solve the ASP in time polynomial in the size of the graph under a set of conditions, and (iii) a thorough evaluation of our algorithms using various tests based both on randomly generated graphs and on real-world instances

Analysis and verification of ECA rules in intelligent environments

Intelligent Environments (IEs) are physical spaces where Information Technology (IT) and other pervasive computing technologies are combined in order to achieve specific goals for the users and the environment. IEs have the goal of enriching user experience, increasing awareness of the environment. A number of applications are currently being deployed in domains ranging from smart homes to e-health and autonomous vehicles. Quite often IE support human activities, thus essential requirements to be ensured are correctness, reliability, safety and security. In this paper we present how a set of techniques and tools that have been developed for the verification of software can be employed in the verification of IE described by means of event-condition-action rules. More precisely, we reduce the problem of verifying key properties of these rules to satisfiability and termination problems that can be addressed using state-of-the-art Satisfiability Modulo Theory (SMT) solvers and program analysers. Our approach has been implemented in a tool called vIRONy. Our approach has been validated on a number of case studies from the literature

Beam Based Alignment of Interaction Region Magnets

In conventional beam based alignment (BBA) procedures, the relative alignment of a quadrupole to a nearby beam position monitor is determined by finding a beam position in the quadrupole at which the closed orbit does not change when the quadrupole field is varied. The final focus magnets of the interaction regions (IR) of circular colliders often have some specialized properties that make it difficult to perform conventional beam based alignment procedures. At the HERA interaction points, for example, these properties are: (a) The quadrupoles are quite strong and long. Therefore a thin lens approximation is quite imprecise. (b) The effects of angular magnet offsets become significant. (c) The possibilities to steer the beam are limited as long as the alignment is not within specifications. (d) The beam orbit has design offsets and design angles with respect to the axis of the low-beta quadrupoles. (e) Often quadrupoles do not have a beam position monitor in their vicinity. Here we present a beam based alignment procedure that determines the relative offset of the closed orbit from a quadrupole center without requiring large orbit changes or monitors next to the quadrupole. Taking into account the alignment angle allows us to reduce the sensitivity to optical errors by one to two orders of magnitude. We also show how the BBA measurements of all IR quadrupoles can be used to determine the global position of the magnets. The sensitivity to errors of this method is evaluated and its applicability to HERA is shown

3-iodothyronamine affects thermogenic substrates’ mobilization in brown adipocytes

We investigated the effect of 3-iodothyronamine (T1AM) on thermogenic substrates in brown adipocytes (BAs). BAs isolated from the stromal fraction of rat brown adipose tissue were exposed to an adipogenic medium containing insulin in the absence (M) or in the presence of 20 nM T1AM (M+T1AM) for 6 days. At the end of the treatment, the expression of p-PKA/PKA, p-AKT/AKT, p-AMPK/AMPK, p-CREB/CREB, p-P38/P38, type 1 and 3 beta adrenergic receptors (β1–β3AR), GLUT4, type 2 deiodinase (DIO2), and uncoupling protein 1 (UCP-1) were evaluated. The effects of cell conditioning with T1AM on fatty acid mobilization (basal and adrenergic-mediated), glucose uptake (basal and insulin-mediated), and ATP cell content were also analyzed in both cell populations. When compared to cells not exposed, M+T1AM cells showed increased p-PKA/PKA, p-AKT/AKT, p-CREB/CREB, p-P38/P38, and p-AMPK/AMPK, downregulation of DIO2 and β1AR, and upregulation of glycosylated β3AR, GLUT4, and adiponectin. At basal conditions, glycerol release was higher for M+T1AM cells than M cells, without any significant differences in basal glucose uptake. Notably, in M+T1AM cells, adrenergic agonists failed to activate PKA and lipolysis and to increase ATP level, but the glucose uptake in response to insulin exposure was more pronounced than in M cells. In conclusion, our results suggest that BAs conditioning with T1AM promote a catabolic condition promising to fight obesity and insulin resistance

Symbolic verification of event–condition–action rules in intelligent environments

In this paper we show how state-of-the art SMT-based techniques for software verification can be employed in the verification of event–condition–action rules in intelligent environments. Moreover, we exploit the specific features of intelligent environments to optimise the verification process. We compare our approach with previous work in a detailed evaluation section, showing how it improves both performance and expressivity of the language for event–condition–action rules