Genetic distance estimated by RAPD markers and its relationship with hybrid performance in maize

The objective of this work was to evaluate the genetic diversity of 16 maize inbred lines, and to determine the correlation between genetic distance and hybrid performance, using random amplified polymorphic DNA (RAPD) molecular markers. Twenty-two different random primers were used, which resulted in the amplification of 265 fragments, 237 (84.44%) of them being polymorphic. A genetic similarity matrix was created from the RAPD data, using Jaccard coefficient, and a dendrogram was constructed. Hybrid analyses were carried out using random block design and Griffing method VI for diallel crossings. The genetic associations showed five distinct heterotic groups. Correlations between genetic divergences detected by RAPD, as well as the means observed in the diallel crossings were positive and significant for plant height, ear height, prolificacy, and grain weight. The correlation of genetic divergences, detected by RAPD, and the specific combining ability between heterotic group associations, showed significance in all characteristics under study, except prolificacy. A direct relationship between genetic divergence and productivity was found in 79.2% of the 120 hybrids confirming the hypothesis that genetic divergence is directly related to the performance of hybrids and is efficient in predicting it.

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.

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.

Distance Transforms on Gray-Level Surfaces

This thesis studies gray-level distance transforms, particularly the Distance Transform on Curved Space (DTOCS). The transform is produced by calculating distances on a gray-level surface. The DTOCS is improved by definingmore accurate local distances, and developing a faster transformation algorithm. The Optimal DTOCS enhances the locally Euclidean Weighted DTOCS (WDTOCS) with local distance coefficients, which minimize the maximum error from the Euclideandistance in the image plane, and produce more accurate global distance values.Convergence properties of the traditional mask operation, or sequential localtransformation, and the ordered propagation approach are analyzed, and compared to the new efficient priority pixel queue algorithm. The Route DTOCS algorithmdeveloped in this work can be used to find and visualize shortest routes between two points, or two point sets, along a varying height surface. In a digital image, there can be several paths sharing the same minimal length, and the Route DTOCS visualizes them all. A single optimal path can be extracted from the route set using a simple backtracking algorithm. A new extension of the priority pixel queue algorithm produces the nearest neighbor transform, or Voronoi or Dirichlet tessellation, simultaneously with the distance map. The transformation divides the image into regions so that each pixel belongs to the region surrounding the reference point, which is nearest according to the distance definition used. Applications and application ideas for the DTOCS and its extensions are presented, including obstacle avoidance, image compression and surface roughness evaluation.

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.