On the k-anonymization of time-varying and multi-layer social graphs

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users’ privacy. In order to deal with malicious attacks, k -anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes’ identity. In this paper, we study the problem of ensuring k anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.

Symbolic Solving of Partial Differential Equation Systems and Compatibility Conditions

An algorithm is produced for the symbolic solving of systems of partial differential equations by means of multivariate Laplace–Carson transform. A system of K equations with M as the greatest order of partial derivatives and right-hand parts of a special type is considered. Initial conditions are input. As a result of a Laplace–Carson transform of the system according to initial condition we obtain an algebraic system of equations. A method to obtain compatibility conditions is discussed.

An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks

We develop a simplified implementation of the Hoshen-Kopelman cluster counting algorithm adapted for honeycomb networks. In our implementation of the algorithm we assume that all nodes in the network are occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determines which nodes belong to each cluster. The network information is stored into two sets of data. The first one is related to the connectivity of the nodes and the second one to the state of links. The algorithm finds all clusters in only one scan across the network and thereafter cluster relabeling operates on a vector whose size is much smaller than the size of the network. Counting the number of clusters of each size, the algorithm determines the cluster size probability distribution from which the mean cluster size parameter can be estimated. Although our implementation of the Hoshen-Kopelman algorithm works only for networks with a honeycomb (hexagonal) structure, it can be easily changed to be applied for networks with arbitrary connectivity between the nodes (triangular, square, etc.). The proposed adaptation of the Hoshen-Kopelman cluster counting algorithm is applied to studying the thermal degradation of a graphene-like honeycomb membrane by means of Molecular Dynamics simulation with a Langevin thermostat. ACM Computing Classification System (1998): F.2.2, I.5.3.

A Characterization Theorem for the K-functional Associated with the Algebraic Version of Trigonometric Jackson Integrals

2000 Mathematics Subject Classification: 41A25, 41A36.

A New Characterization of Weighted Peetre K-Functionals (II)

2000 Mathematics Subject Classification: 46B70, 41A25, 41A17, 26D10. ∗Part of the results were reported at the Conference “Pioneers of Bulgarian Mathematics”, Sofia, 2006.

Equivalence Between K-functionals Based on Continuous Linear Transforms

2000 Mathematics Subject Classification: 46B70, 41A10, 41A25, 41A27, 41A35, 41A36, 42A10.

MACVIA clinical decision algorithm in adolescents and adults with allergic rhinitis

Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

BRAF mutation testing algorithm for vemurafenib treatment in melanoma: recommendations from an expert panel.

The incidence of melanoma has increased rapidly over the past 30 years, and the disease is now the sixth most common cancer among men and women in the U.K. Many patients are diagnosed with or develop metastatic disease, and survival is substantially reduced in these patients. Mutations in the BRAF gene have been identified as key drivers of melanoma cells and are found in around 50% of cutaneous melanomas. Vemurafenib (Zelboraf(®) ; Roche Molecular Systems Inc., Pleasanton, CA, U.S.A.) is the first licensed inhibitor of mutated BRAF, and offers a new first-line option for patients with unresectable or metastatic melanoma who harbour BRAF mutations. Vemurafenib was developed in conjunction with a companion diagnostic, the cobas(®) 4800 BRAF V600 Mutation Test. The purpose of this paper is to make evidence-based recommendations to facilitate the implementation of BRAF mutation testing and targeted therapy in patients with metastatic melanoma in the U.K. The recommendations are the result of a meeting of an expert panel and have been reviewed by melanoma specialists and representatives of the National Cancer Research Network Clinical Study Group on behalf of the wider melanoma community. This article is intended to be a starting point for practical advice and recommendations, which will no doubt be updated as we gain further experience in personalizing therapy for patients with melanoma.

"Lavinia" de Úrsula K. Le Guin, una novela virgiliana

Análisis de las dependencias y novedades que, respecto al argumento de la Eneida de Virgilio, ofrece la reciente novela Lavinia (2009), de la escritora norteamericana Úrsula K. Le Guin.

A domain decomposition based algorithm for non-linear 2D inverse heat conduction problems

Inverse heat conduction problems (IHCPs) appear in many important scientific and technological fields. Hence analysis, design, implementation and testing of inverse algorithms are also of great scientific and technological interest. The numerical simulation of 2-D and –D inverse (or even direct) problems involves a considerable amount of computation. Therefore, the investigation and exploitation of parallel properties of such algorithms are equally becoming very important. Domain decomposition (DD) methods are widely used to solve large scale engineering problems and to exploit their inherent ability for the solution of such problems.

Coupled CFD Shape Optimization for aerodynamic profiles

The present document deals with the optimization of shape of aerodynamic profiles -- The objective is to reduce the drag coefficient on a given profile without penalising the lift coefficient -- A set of control points defining the geometry are passed and parameterized as a B-Spline curve -- These points are modified automatically by means of CFD analysis -- A given shape is defined by an user and a valid volumetric CFD domain is constructed from this planar data and a set of user-defined parameters -- The construction process involves the usage of 2D and 3D meshing algorithms that were coupled into own- code -- The volume of air surrounding the airfoil and mesh quality are also parametrically defined -- Some standard NACA profiles were used by obtaining first its control points in order to test the algorithm -- Navier-Stokes equations were solved for turbulent, steady-state ow of compressible uids using the k-epsilon model and SIMPLE algorithm -- In order to obtain data for the optimization process an utility to extract drag and lift data from the CFD simulation was added -- After a simulation is run drag and lift data are passed to the optimization process -- A gradient-based method using the steepest descent was implemented in order to define the magnitude and direction of the displacement of each control point -- The control points and other parameters defined as the design variables are iteratively modified in order to achieve an optimum -- Preliminary results on conceptual examples show a decrease in drag and a change in geometry that obeys to aerodynamic behavior principles

Bayesian Optimisation Algorithm for Nurse Scheduling, Scalable Optimization via Probabilistic Modeling

Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurse’s assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

Kinetic Analysis of Gill (Na+,K+)-ATPase Activity in Selected Ontogenetic Stages of the Amazon River Shrimp, (Decapoda, Palaemonidae): Interactions at ATP- and Cation-Binding Sites

We investigated modulation by ATP, Mg2+, Na+, K+ and NH4 (+) and inhibition by ouabain of (Na+,K+)-ATPase activity in microsomal homogenates of whole zoeae I and decapodid III (formerly zoea IX) and whole-body and gill homogenates of juvenile and adult Amazon River shrimps, . (Na+,K+)-ATPase-specific activity was increased twofold in decapodid III compared to zoea I, juveniles and adults, suggesting an important role in this ontogenetic stage. The apparent affinity for ATP ( (M) = 0.09 +/- A 0.01 mmol L-1) of the decapodid III (Na+,K+)-ATPase, about twofold greater than the other stages, further highlights this relevance. Modulation of (Na+,K+)-ATPase activity by K+ also revealed a threefold greater affinity for K+ ( (0.5) = 0.91 +/- A 0.04 mmol L-1) in decapodid III than in other stages; NH4 (+) had no modulatory effect. The affinity for Na+ ( (0.5) = 13.2 +/- A 0.6 mmol L-1) of zoea I (Na+,K+)-ATPase was fourfold less than other stages. Modulation by Na+, Mg2+ and NH4 (+) obeyed cooperative kinetics, while K+ modulation exhibited Michaelis-Menten behavior. Rates of maximal Mg2+ stimulation of ouabain-insensitive ATPase activity differed in each ontogenetic stage, suggesting that Mg2+-stimulated ATPases other than (Na+,K+)-ATPase are present. Ouabain inhibition suggests that, among the various ATPase activities present in the different stages, Na+-ATPase may be involved in the ontogeny of osmoregulation in larval The NH4 (+)-stimulated, ouabain-insensitive ATPase activity seen in zoea I and decapodid III may reflect a stage-specific means of ammonia excretion since functional gills are absent in the early larval stages.