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.

Demand-based structural change and balanced economic growth

[eng] We analyze the equilibrium of a multi-sector exogenous growth model where the introduction of minimum consumption requirements drives structural change. We show that equilibrium dynamics simultaneously exhibt structural change and balanced growth of aggregate variables as is observed in US when the initial intensity of minimum consumption requirements is sufficiently small. This intensity is measured by the ratio between the aggregate value of the minimum consumption requirements and GDP and, therefore, it is inversely related with the level of economic development. Initially rich economies benefit from an initially low intensity of the minimum consumption requirements and, as a consequence, these economies end up exhibiting balanced growth of aggregate variables, while there is structural change. In contrast, initially poor economies suffer from an initially large intensity of the minimum consumption requirements, which makes the growth of the aggregate variables unbalanced during a very large period. These economies may never exhibit simultaneously balanced growth of aggregate variables and structural change.

Models of social networks based on social distance attachment

We propose a class of models of social network formation based on a mathematical abstraction of the concept of social distance. Social distance attachment is represented by the tendency of peers to establish acquaintances via a decreasing function of the relative distance in a representative social space. We derive analytical results (corroborated by extensive numerical simulations), showing that the model reproduces the main statistical characteristics of real social networks: large clustering coefficient, positive degree correlations, and the emergence of a hierarchy of communities. The model is confronted with the social network formed by people that shares confidential information using the Pretty Good Privacy (PGP) encryption algorithm, the so-called web of trust of PGP.

Marketing education, distance learning and hypermedia : teaching 'current issues in marketing' in a virtual campus

This article reports on a project at the Universitat Oberta de Catalunya (UOC: The Open University of Catalonia, Barcelona) to develop an innovative package of hypermedia-based learning materials for a new course entitled 'Current Issues in Marketing'. The UOC is a distance university entirely based on a virtual campus. The learning materials project was undertaken in order to benefit from the advantages which new communication technologies offer to the teaching of marketing in distance education. The article reviews the main issues involved in incorporating new technologies in learning materials, the development of the learning materials, and their functioning within the hypermedia based virtual campus of the UOC. An empirical study is then carried out in order to evaluate the attitudes of students to the project. Finally, suggestions for improving similar projects in the future are put forward.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

An open source browser-based software tool for graph drawing and visualisation

In this research work we searched for open source libraries which supports graph drawing and visualisation and can run in a browser. Subsequent these libraries were evaluated to find out which one is the best for this task. The result was the d3.js is that library which has the greatest functionality, flexibility and customisability. Afterwards we developed an open source software tool where d3.js was included and which was written in JavaScript so that it can run browser-based.

WebGraphEd, an open source graph drawing editor for the web

WebGraphEd is an open source software for graph visualization and manipulation. It is especially designed to work for the web platform through a web browser. The web application has been written in JavaScript and compacted later, which makes it a very lightweight software. There is no need of additional software, and the only requirement is to have an HTML5 compliant browser. WebGraphEd works with scalable vector graphics (SVG), which it makes possible to create lossless graph drawings.

A note on the periodic orbits and topological entropy of graph maps

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits.

Demand-based structural change and balanced economic growth

[eng] We analyze the equilibrium of a multi-sector exogenous growth model where the introduction of minimum consumption requirements drives structural change. We show that equilibrium dynamics simultaneously exhibt structural change and balanced growth of aggregate variables as is observed in US when the initial intensity of minimum consumption requirements is sufficiently small. This intensity is measured by the ratio between the aggregate value of the minimum consumption requirements and GDP and, therefore, it is inversely related with the level of economic development. Initially rich economies benefit from an initially low intensity of the minimum consumption requirements and, as a consequence, these economies end up exhibiting balanced growth of aggregate variables, while there is structural change. In contrast, initially poor economies suffer from an initially large intensity of the minimum consumption requirements, which makes the growth of the aggregate variables unbalanced during a very large period. These economies may never exhibit simultaneously balanced growth of aggregate variables and structural change.

Demand-based structural change and balanced economic growth

[eng] We analyze the equilibrium of a multi-sector exogenous growth model where the introduction of minimum consumption requirements drives structural change. We show that equilibrium dynamics simultaneously exhibt structural change and balanced growth of aggregate variables as is observed in US when the initial intensity of minimum consumption requirements is sufficiently small. This intensity is measured by the ratio between the aggregate value of the minimum consumption requirements and GDP and, therefore, it is inversely related with the level of economic development. Initially rich economies benefit from an initially low intensity of the minimum consumption requirements and, as a consequence, these economies end up exhibiting balanced growth of aggregate variables, while there is structural change. In contrast, initially poor economies suffer from an initially large intensity of the minimum consumption requirements, which makes the growth of the aggregate variables unbalanced during a very large period. These economies may never exhibit simultaneously balanced growth of aggregate variables and structural change.

Genetic markers of the Va/Ba balanced lethal strain of Drosophila subobscura

The Va/Ba strain, constructed by Sperlich et al. (1977), is the only balanced lethal strain in D. subobscura. It allows the production of homozygous O chromosomes and has been a useful tool not only to analyse chromosomal viabilities but also to obtain homokaryotypic lines (Mestres and Serra, 2008). Besides the morphological dominant mutations Va (Varicose) and Ba (Bare), other genetic markers have been characterized in this strain, some of them by our group and not described previously. Here we present a list of these markers.

A Note on the periodic orbits and topological entropy of graph maps

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits