Testing the effects of genetic crossing distance on embryo survival within a metapopulation of brown trout (Salmo trutta)

Predicting progeny performance from parental genetic divergence can potentially enhance the efficiency of supportive breeding programmes and facilitate risk assessment. Yet, experimental testing of the effects of breeding distance on offspring performance remains rare, especially in wild populations of vertebrates. Recent studies have demonstrated that embryos of salmonid fish are sensitive indicators of additive genetic variance for viability traits. We therefore used gametes of wild brown trout (Salmo trutta) from five genetically distinct populations of a river catchment in Switzerland, and used a full factorial design to produce over 2,000 embryos in 100 different crosses with varying genetic distances (FST range 0.005-0.035). Customized egg capsules allowed recording the survival of individual embryos until hatching under natural field conditions. Our breeding design enabled us to evaluate the role of the environment, of genetic and nongenetic parental contributions, and of interactions between these factors, on embryo viability. We found that embryo survival was strongly affected by maternal environmental (i.e. non-genetic) effects and by the microenvironment, i.e. by the location within the gravel. However, embryo survival was not predicted by population divergence, parental allelic dissimilarity, or heterozygosity, neither in the field nor under laboratory conditions. Our findings suggest that the genetic effects of inter-population hybridization within a genetically differentiated meta-population can be minor in comparison to environmental effects.

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.

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.

Comparison of plantar pressure distribution in adolescent runners at low vs. high running velocity

This study aimed to compare foot plantar pressure distribution while jogging and running in highly trained adolescent runners. Eleven participants performed two constant-velocity running trials either at jogging (11.2 ± 0.9 km/h) or running (17.8 ± 1.4 km/h) pace on a treadmill. Contact area (CA in cm(2)), maximum force (F(max) in N), peak pressure (PP in kPa), contact time (CT in ms), and relative load (force time integral in each individual region divided by the force time integral for the total plantar foot surface, in %) were measured in nine regions of the right foot using an in-shoe plantar pressure device. Under the whole foot, CA, F(max) and PP were lower in jogging than in running (-1.2% [p<0.05], -12.3% [p<0.001] and -15.1% [p<0.01] respectively) whereas CT was higher (+20.1%; p<0.001). Interestingly, we found an increase in relative load under the medial and central forefoot regions while jogging (+6.7% and +3.7%, respectively; [p<0.05]), while the relative load under the lesser toes (-8.4%; p<0.05) was reduced. In order to prevent overloading of the metatarsals in adolescent runners, excessive mileage at jogging pace should be avoided.

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.

A pilot study on quantification of training load: The use of HRV in training practice.

Recent laboratory studies have suggested that heart rate variability (HRV) may be an appropriate criterion for training load (TL) quantification. The aim of this study was to validate a novel HRV index that may be used to assess TL in field conditions. Eleven well-trained long-distance male runners performed four exercises of different duration and intensity. TL was evaluated using Foster and Banister methods. In addition, HRV measurements were performed 5 minutes before exercise and 5 and 30 minutes after exercise. We calculated HRV index (TLHRV) based on the ratio between HRV decrease during exercise and HRV increase during recovery. HRV decrease during exercise was strongly correlated with exercise intensity (R = -0.70; p < 0.01) but not with exercise duration or training volume. TLHRV index was correlated with Foster (R = 0.61; p = 0.01) and Banister (R = 0.57; p = 0.01) methods. This study confirms that HRV changes during exercise and recovery phase are affected by both intensity and physiological impact of the exercise. Since the TLHRV formula takes into account the disturbance and the return to homeostatic balance induced by exercise, this new method provides an objective and rational TL index. However, some simplification of the protocol measurement could be envisaged for field use.

New Distance Transforms for Gray Level Image Compression

This thesis deals with distance transforms which are a fundamental issue in image processing and computer vision. In this thesis, two new distance transforms for gray level images are presented. As a new application for distance transforms, they are applied to gray level image compression. The new distance transforms are both new extensions of the well known distance transform algorithm developed by Rosenfeld, Pfaltz and Lay. With some modification their algorithm which calculates a distance transform on binary images with a chosen kernel has been made to calculate a chessboard like distance transform with integer numbers (DTOCS) and a real value distance transform (EDTOCS) on gray level images. Both distance transforms, the DTOCS and EDTOCS, require only two passes over the graylevel image and are extremely simple to implement. Only two image buffers are needed: The original gray level image and the binary image which defines the region(s) of calculation. No other image buffers are needed even if more than one iteration round is performed. For large neighborhoods and complicated images the two pass distance algorithm has to be applied to the image more than once, typically 3 10 times. Different types of kernels can be adopted. It is important to notice that no other existing transform calculates the same kind of distance map as the DTOCS. All the other gray weighted distance function, GRAYMAT etc. algorithms find the minimum path joining two points by the smallest sum of gray levels or weighting the distance values directly by the gray levels in some manner. The DTOCS does not weight them that way. The DTOCS gives a weighted version of the chessboard distance map. The weights are not constant, but gray value differences of the original image. The difference between the DTOCS map and other distance transforms for gray level images is shown. The difference between the DTOCS and EDTOCS is that the EDTOCS calculates these gray level differences in a different way. It propagates local Euclidean distances inside a kernel. Analytical derivations of some results concerning the DTOCS and the EDTOCS are presented. Commonly distance transforms are used for feature extraction in pattern recognition and learning. Their use in image compression is very rare. This thesis introduces a new application area for distance transforms. Three new image compression algorithms based on the DTOCS and one based on the EDTOCS are presented. Control points, i.e. points that are considered fundamental for the reconstruction of the image, are selected from the gray level image using the DTOCS and the EDTOCS. The first group of methods select the maximas of the distance image to new control points and the second group of methods compare the DTOCS distance to binary image chessboard distance. The effect of applying threshold masks of different sizes along the threshold boundaries is studied. The time complexity of the compression algorithms is analyzed both analytically and experimentally. It is shown that the time complexity of the algorithms is independent of the number of control points, i.e. the compression ratio. Also a new morphological image decompression scheme is presented, the 8 kernels' method. Several decompressed images are presented. The best results are obtained using the Delaunay triangulation. The obtained image quality equals that of the DCT images with a 4 x 4

PREDICTING THE BOILING POINT OF PCDD/Fs BY THE QSPR METHOD BASED ON THE MOLECULAR DISTANCE-EDGE VECTOR INDEX

The quantitative structure property relationship (QSPR) for the boiling point (Tb) of polychlorinated dibenzo-p-dioxins and polychlorinated dibenzofurans (PCDD/Fs) was investigated. The molecular distance-edge vector (MDEV) index was used as the structural descriptor. The quantitative relationship between the MDEV index and Tb was modeled by using multivariate linear regression (MLR) and artificial neural network (ANN), respectively. Leave-one-out cross validation and external validation were carried out to assess the prediction performance of the models developed. For the MLR method, the prediction root mean square relative error (RMSRE) of leave-one-out cross validation and external validation was 1.77 and 1.23, respectively. For the ANN method, the prediction RMSRE of leave-one-out cross validation and external validation was 1.65 and 1.16, respectively. A quantitative relationship between the MDEV index and Tb of PCDD/Fs was demonstrated. Both MLR and ANN are practicable for modeling this relationship. The MLR model and ANN model developed can be used to predict the Tb of PCDD/Fs. Thus, the Tb of each PCDD/F was predicted by the developed models.