Study of linkage between miniature and singed genes in Drosophila melanogaster

We have developed a practical exercise for undergraduate students whose main aim is to identify, using genetic crosses, a pair of D. melanogaster mutations (miniature and singed). Each student receives a vial with the problem strain containing two unknown mutations. The first step is to observe and describe both mutations. Then, the students carry out genetic crosses between mutant and normal strains: (P) ♀ mutant strain × ♂ normal strain (P) ♀ normal strain × ♂ mutant strain A different offspring is expected in these crosses: in the first one we will obtain normal females and m sn males, whereas in the second all individuals will present normal phenotype. It is possible to deduce that both are sex linked mutations. With this information and to simplify the amount of work, only F1 individuals from the first cross will be used (m+sn+ / m sn × m sn / Y chrom.) to obtain the F2 generation. By counting the number of miniature (recombinant type), singed (recombinant type), miniature-singed (parental type) and normal (parental type) flies it is possible to estimate the recombination frequency between both genes. Knowing the phenotype, their chromosomal location (X chromosome) and the genetic distance between both mutations, it is possible to identify them by finding all this information in a Drosophila melanogaster genetic map. Additionally, a statistical analysis can be carried out to compare the number of expected F2 individuals with those observed in the experiment. As the distance between both genes is 15.1 m.u., then the expected percentages for each phenotype would be: normal (42.45%), miniature-signed (42.45%), miniature (7.55%) and singed (7.55%). Multiplying the frequency of each class by the total number of individuals obtained in the F2 it is possible to estimate the expected number of flies for each class. Finally, a χ2 test can be computed to ascertain whether there are significant differences between expected and observed number of individuals.

Genetic and genomic analysis modeling of germline c-MYC overexpression and cancer susceptibility

Background: Germline genetic variation is associated with the differential expression of many human genes. The phenotypic effects of this type of variation may be important when considering susceptibility to common genetic diseases. Three regions at 8q24 have recently been identified to independently confer risk of prostate cancer. Variation at 8q24 has also recently been associated with risk of breast and colorectal cancer. However, none of the risk variants map at or relatively close to known genes, with c-MYC mapping a few hundred kilobases distally. Results: This study identifies cis-regulators of germline c-MYC expression in immortalized lymphocytes of HapMap individuals. Quantitative analysis of c-MYC expression in normal prostate tissues suggests an association between overexpression and variants in Region 1 of prostate cancer risk. Somatic c-MYC overexpression correlates with prostate cancer progression and more aggressive tumor forms, which was also a pathological variable associated with Region 1. Expression profiling analysis and modeling of transcriptional regulatory networks predicts a functional association between MYC and the prostate tumor suppressor KLF6. Analysis of MYC/Myc-driven cell transformation and tumorigenesis substantiates a model in which MYC overexpression promotes transformation by down-regulating KLF6. In this model, a feedback loop through E-cadherin down-regulation causes further transactivation of c-MYC.Conclusion: This study proposes that variation at putative 8q24 cis-regulator(s) of transcription can significantly alter germline c-MYC expression levels and, thus, contribute to prostate cancer susceptibility by down-regulating the prostate tumor suppressor KLF6 gene.

The Brauer group and the second Abel-Jacobi map for 0-cycles on algebraic varieties

This paper focuses on the connection between the Brauer group and the 0-cycles of an algebraic variety. We give an alternative construction of the second l-adic Abel-Jacobi map for such cycles, linked to the algebraic geometry of Severi-Brauer varieties on X. This allows us then to relate this Abel-Jacobi map to the standard pairing between 0-cycles and Brauer groups (see [M], [L]), completing results from [M] in this direction. Second, for surfaces, it allows us to present this map according to the more geometrical approach devised by M. Green in the framework of (arithmetic) mixed Hodge structures (see [G]). Needless to say, this paper owes much to the work of U. Jannsen and, especially, to his recently published older letter [J4] to B. Gross.

Can genetic algorithms explain experimental anomalies? An application to common property resources

It is common to find in experimental data persistent oscillations in the aggregate outcomes and high levels of heterogeneity in individual behavior. Furthermore, it is not unusual to find significant deviations from aggregate Nash equilibrium predictions. In this paper, we employ an evolutionary model with boundedly rational agents to explain these findings. We use data from common property resource experiments (Casari and Plott, 2003). Instead of positing individual-specific utility functions, we model decision makers as selfish and identical. Agent interaction is simulated using an individual learning genetic algorithm, where agents have constraints in their working memory, a limited ability to maximize, and experiment with new strategies. We show that the model replicates most of the patterns that can be found in common property resource experiments.

Television and the construction of identity: Barcelona, Olympic host

This document, originally published as part of the book The Keys of success: the social, sporting, economic and communications impact of Barcelona’92, comes from a larger study that looked at all aspects of television in the Olympics and can be found in its original version, in Miquel de Moragas Spà, Nancy K. Rivenburgh and James F. Larson (1996). Television in the Olympics. London: John Libbey.

Systematic Construction of Goal-Oriented COTS Taxonomies

Informe de investigación realizado a partir de una estancia en el Department of Computer and Information Science de la Norwegian University of Science and Technology (NTNU), Noruega, entre setiembre i diciembre de 2006. El uso de componentes de software llamados Commercial-Off-The-Shelf (COTS) en el desarrollo de sistemas basados en componentes implica varios retos. Uno de ellos es la falta de información disponible y adecuada para dar soporte al proceso de selección de componentes a ser integrados. Para lidiar con estos problemas, se esta desarrollando un trabajo de tesis que propone un método llamado GOThIC (Goal-Oriented Taxonomy and reuse Infrastructure Construction). El método está orientado a construir una infrastructura de reuse para facilitar la búsqueda y reuse de componentes COTS. La estancia en la NTNU, reportada en este documento, tuvo como objetivo primordial las mejora del método y la obtención de datos empíricos para darle soporte. Algunos de los principales resultados fueron la obtención de datos empíricos fundamentando la utilización del método en ámbitos industriales de selección de componentes COTS, así como una nueva estrategia para conseguir de forma factible e incremental, la federación y reuso de los diferentes esfuerzos existentes para encontrar, seleccionar y mantener componentes COTS y Open Source (OSS) -comúnmente llamados componentes Off-The-Shelf (OTS) - en forma estructurada.

A general construction of internal sheaves in algebraic set theory

We present a solution to the problem of defining a counterpart in Algebraic Set Theory of the construction of internal sheaves in Topos Theory. Our approach is general in that we consider sheaves as determined by Lawvere-Tierney coverages, rather than by Grothen-dieck coverages, and assume only a weakening of the axioms for small maps originally introduced by Joyal and Moerdijk, thus subsuming the existing topos-theoretic results.

A Model-to-model analysis of the repeated Prisoners' Dilemma: genetic algorithms vs. evolutionary dynamics

We study the properties of the well known Replicator Dynamics when applied to a finitely repeated version of the Prisoners' Dilemma game. We characterize the behavior of such dynamics under strongly simplifying assumptions (i.e. only 3 strategies are available) and show that the basin of attraction of defection shrinks as the number of repetitions increases. After discussing the difficulties involved in trying to relax the 'strongly simplifying assumptions' above, we approach the same model by means of simulations based on genetic algorithms. The resulting simulations describe a behavior of the system very close to the one predicted by the replicator dynamics without imposing any of the assumptions of the analytical model. Our main conclusion is that analytical and computational models are good complements for research in social sciences. Indeed, while on the one hand computational models are extremely useful to extend the scope of the analysis to complex scenar

The new role of the mass media in the construction of sport and Olympic values

This paper was presented in the International Symposium on Toward the Creation of New-Sport Cultures, undertaken in Osaka, Japan, in January 28, 1996. The main purpose is to make an interpretation of the cultural values of sport and Olympism in contemporary society, considering the enormous influence that the media have on them.

The loop group and the cobar construction

"Vegeu el resum a l'inici del document del fitxer adjunt."

Conjugacy of piecewise linear Lorenz map that expand on average

For piecewise linear Lorenz map that expand on average, we show that it admits a dichotomy: it is either periodic renormalizable or prime. As a result, such a map is conjugate to a ß-transformation.

Development of a tool for the construction of "ground truth" for complex color images with text

Aquesta memoria resumeix el treball de final de carrera d’Enginyeria Superior d’Informàtica. Explicarà les principals raons que han motivat el projecte així com exemples que il·lustren l’aplicació resultant. En aquest cas el software intentarà resoldre la actual necessitat que hi ha de tenir dades de Ground Truth per als algoritmes de segmentació de text per imatges de color complexes. Tots els procesos seran explicats en els diferents capítols partint de la definició del problema, la planificació, els requeriments i el disseny fins a completar la il·lustració dels resultats del programa i les dades de Ground Truth resultants.