Avaluació de nous algorismes per a la creació de camins entre nodes de la xarxa TOR

En este proyecto se presenta un estudio y una implementación sobre estrategias de selección de nodos de la red TOR. Para esto en una primera parte teorica se da a conocer todo lo que comportan las redes anónimas y su implementación en diferentes entornos. A continuación se estudian los requerimientos y la viabilidad del proyecto. Finalmente exponemos el diseño y desarrollo de los distintos algoritmos propuestos juntamente con las pruebas realizadas y las conclusiones a las que se ha llegado.

Uncorrelatedness in growing networks with preferential survival of nodes

The emergence of uncorrelated growing networks is proved when nodes are removed either uniformly or under the preferential survival rule recently observed in the World Wide Web evolution. To this aim, the rate equation for the joint probability of degrees is derived, and stationary symmetrical solutions are obtained, by passing to the continuum limit. When a uniformly random removal of extant nodes and linear preferential attachment of new nodes are at work, we prove that the only stationary solution corresponds to uncorrelated networks for any removal rate r ∈ (0,1). In the more general case of preferential survival of nodes, uncorrelated solutions are also obtained. These results generalize the uncorrelatedness displayed by the (undirected) Barab´asi-Albert network model to models with uniformly random and selective (against low degrees) removal of nodes

Continuum formalism for modeling growing networks with deletion of nodes

We present a continuum formalism for modeling growing random networks under addition and deletion of nodes based on a differential mass balance equation. As examples of its applicability, we obtain new results on the degree distribution for growing networks with a uniform attachment and deletion of nodes, and complete some recent results on growing networks with preferential attachment and uniform removal

Gene expression profiles in rat mesenteric lymph nodes upon supplementation with Conjugated Linoleic Acid during gestation and suckling

Background Diet plays a role on the development of the immune system, and polyunsaturated fatty acids can modulate the expression of a variety of genes. Human milk contains conjugated linoleic acid (CLA), a fatty acid that seems to contribute to immune development. Indeed, recent studies carried out in our group in suckling animals have shown that the immune function is enhanced after feeding them with an 80:20 isomer mix composed of c9,t11 and t10,c12 CLA. However, little work has been done on the effects of CLA on gene expression, and even less regarding immune system development in early life. Results The expression profile of mesenteric lymph nodes from animals supplemented with CLA during gestation and suckling through dam's milk (Group A) or by oral gavage (Group B), supplemented just during suckling (Group C) and control animals (Group D) was determined with the aid of the specific GeneChip® Rat Genome 230 2.0 (Affymettrix). Bioinformatics analyses were performed using the GeneSpring GX software package v10.0.2 and lead to the identification of 89 genes differentially expressed in all three dietary approaches. Generation of a biological association network evidenced several genes, such as connective tissue growth factor (Ctgf), tissue inhibitor of metalloproteinase 1 (Timp1), galanin (Gal), synaptotagmin 1 (Syt1), growth factor receptor bound protein 2 (Grb2), actin gamma 2 (Actg2) and smooth muscle alpha actin (Acta2), as highly interconnected nodes of the resulting network. Gene underexpression was confirmed by Real-Time RT-PCR. Conclusions Ctgf, Timp1, Gal and Syt1, among others, are genes modulated by CLA supplementation that may have a role on mucosal immune responses in early life.

Gene expression profiles in rat mesenteric lymph nodes upon supplementation with Conjugated Linoleic Acid during gestation and suckling

Background Diet plays a role on the development of the immune system, and polyunsaturated fatty acids can modulate the expression of a variety of genes. Human milk contains conjugated linoleic acid (CLA), a fatty acid that seems to contribute to immune development. Indeed, recent studies carried out in our group in suckling animals have shown that the immune function is enhanced after feeding them with an 80:20 isomer mix composed of c9,t11 and t10,c12 CLA. However, little work has been done on the effects of CLA on gene expression, and even less regarding immune system development in early life. Results The expression profile of mesenteric lymph nodes from animals supplemented with CLA during gestation and suckling through dam's milk (Group A) or by oral gavage (Group B), supplemented just during suckling (Group C) and control animals (Group D) was determined with the aid of the specific GeneChip® Rat Genome 230 2.0 (Affymettrix). Bioinformatics analyses were performed using the GeneSpring GX software package v10.0.2 and lead to the identification of 89 genes differentially expressed in all three dietary approaches. Generation of a biological association network evidenced several genes, such as connective tissue growth factor (Ctgf), tissue inhibitor of metalloproteinase 1 (Timp1), galanin (Gal), synaptotagmin 1 (Syt1), growth factor receptor bound protein 2 (Grb2), actin gamma 2 (Actg2) and smooth muscle alpha actin (Acta2), as highly interconnected nodes of the resulting network. Gene underexpression was confirmed by Real-Time RT-PCR. Conclusions Ctgf, Timp1, Gal and Syt1, among others, are genes modulated by CLA supplementation that may have a role on mucosal immune responses in early life.

Traducción comentada de «Management of the Clinically Positive Axilla» y «Management of the Internal Mammary Lymph Nodes», Essentials of Breast Surgery

La transmisión de conocimiento científico constituye una de las necesidades de traducción más importantes; es preciso realizar un estudio sobre la traducción del inglés médico. Este trabajo presenta una traducción inédita de fragmentos de Essentials of Breast Surgery y un análisis de esta jerga mediante un glosario y problemas de traducción.

Bounding right-arm rotation distances

Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson's group F with respect to different generating sets, including both finite and infinite generating sets.

Creating and using a non-dedicated HPC cluster with ParallelKnoppix

This note describes ParallelKnoppix, a bootable CD that allows econometricians with average knowledge of computers to create and begin using a high performance computing cluster for parallel computing in very little time. The computers used may be heterogeneous machines, and clusters of up to 200 nodes are supported. When the cluster is shut down, all machines are in their original state, so their temporary use in the cluster does not interfere with their normal uses. An example shows how a Monte Carlo study of a bootstrap test procedure may be done in parallel. Using a cluster of 20 nodes, the example runs approximately 20 times faster than it does on a single computer.

Learning from errors

We present a model of learning in which agents learn from errors. If an action turns out to be an error, the agent rejects not only that action but also neighboring actions. We find that, keepng memory of his errors, under mild assumptions an acceptable solution is asymptotically reached. Moreover, one can take advantage of big errors for a faster learning.

Minimal lenght elements of Thompson's groups F(p)

We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.

Preliminary study of cooperation in hybrid ad-hoc networks

In this paper, we present a first approach to evolve a cooperative behavior in ad hoc networks. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios are unfavorable to the interests of a user. In this paper we deal with the issue of user cooperation in ad hoc networks by developing the algorithm called Generous Tit-For-Tat. We assume that nodes are rational, i.e., their actions are strictly determined by self-interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we study the added behavior of the network.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

Estudio e implementación de una autoridad de certificación distribuida

Aquest projecte presenta, en primer lloc, un estudi dels protocols de generació de claus criptogràfiques i autoritats de certificació distribuïdes més destacables desenvolupades fins a l'actualitat. Posteriorment, implementem un protocol, que toleri les errades, de generació distribuïda de claus RSA sense servidor de confiança, orientat a xarxes ad-hoc. El protocol necessita la participació conjunta de n nodes per generar un mòdul RSA (N = pq), un exponent d'encriptació públic i les particions de l'exponent privat d, seguint un esquema llindar (t, n).

Label Space Reduction in All-Optical Label Switchiing Networks

Report for the scientific sojourn at the Department of Information Technology (INTEC) at the Ghent University, Belgium, from january to june 2007. All-Optical Label Swapping (AOLS) forms a key technology towards the implementation of All-Optical Packet Switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the wayin which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This project studies and proposes All-Optical Label Stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this project, an Integer Lineal Program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more.

Políticas de encaminamiento tolerantes a fallos

El uso intensivo y prolongado de computadores de altas prestaciones para ejecutar aplicaciones computacionalmente intensivas, sumado al elevado número de elementos que los componen, incrementan drásticamente la probabilidad de ocurrencia de fallos durante su funcionamiento. El objetivo del trabajo es resolver el problema de tolerancia a fallos para redes de interconexión de altas prestaciones, partiendo del diseño de polí­ticas de encaminamiento tolerantes a fallos. Buscamos resolver una determinada cantidad de fallos de enlaces y nodos, considerando sus factores de impacto y probabilidad de aparición. Para ello aprovechamos la redundancia de caminos de comunicación existentes, partiendo desde enfoques de encaminamiento adaptativos capaces de cumplir con las cuatro fases de la tolerancia a fallos: detección del error, contención del daño, recuperación del error, y tratamiento del fallo y continuidad del servicio. La experimentación muestra una degradación de prestaciones menor al 5%. En el futuro, se tratará la pérdida de información en tránsito.