IBD sharing around the PPARG locus is not increased in dizygotic twins or their mothers

We observe no evidence of linkage to the region around the PPARG locus in several samples of DZ twins who have been genotyped at multiple markers on chromosome 3 (Fig. 1). Among 199 Australian DZ twins ascertained for a history of wheezing2, mean identity by descent (IBD) sharing at the position of PPARG is 0.463 (99% bootstrapped confidence interval=0.412−0.516). We obtained a similar result with 232 pairs of Australian adolescent DZ twins taking part in a longitudinal study of naevus development3 (0.444, 0.390−0.499), and a set of 125 Australian adult DZ twin pairs assessed for anxiety4 (0.508, 0.435−0.580). A Dutch scan of 160 DZ twin pairs5 obtained slightly more encouraging results (0.553, 0.482−0.587, peak maximum lod score (MLS)=0.57). Pooling all these samples gives 0.477 (0.454−0.512) at the position of PPARG. The test for heterogeneity of sharing between studies was not significant (P=0.10). In the combined dataset, the peak IBD sharing (MLS=0.70) is 50 cM closer to the centromere than PPARG. Finally, in a sample of 203 Australian and New Zealand sister pairs where each had given birth to DZ twins6, sharing across the region is also not increased (0.433). We do not replicate linkage in the populations we study to survival of a twin pregnancy or polyovulation.

Proactive interference and complexity

C. L. Isaac and A. R. Mayes (1999a, 1999b) compared forgetting rates in amnesic patients and normal participants across a range of memory tasks. Although the results are complex, many of them appear to be replicable and there are several commendable features to the design and analysis. Nevertheless, the authors largely ignored 2 relevant literatures: the traditional literature on proactive inhibition/interference and the formal analyses of the complexity of the bindings (associations) required for memory tasks. It is shown how the empirical results and conceptual analyses in these literatures are needed to guide the choice of task, the design of experiments, and the interpretation of results for amnesic patients and normal participants.

Reverse transcriptase activity and untranslated region sharing of a new RTE-like, non-long terminal repeat retrotransposon from the human blood fluke, Schistosoma japonicum

A new RTE-like, non-long terminal repeat retrotransposon, termed SjR2, from the human blood fluke, Schistosoma japonicum, is described. SjR2 is similar to3.9 kb in length and is constituted of a single open reading frame encoding a polyprotein with apurinic/apyrimidinic endonuclease and reverse transcriptase domains. The open reading frame is bounded by 5'- and 3'-terininal untranslated regions and, at its 3-terminus, SjR2 bears a short (TGAC)(3) repeat. Phylogenetic analyses based on conserved domains of reverse transcriptase or endonuclease revealed that SjR2 belonged to the RTE clade of non-long terminal repeat retrotransposons. Further, SjR2 was homologous, but probably not orthologous, to SR2 front the African blood fluke, Schistosoma mansoni; this RTE-like family of non-long terminal repeat retrotransposons appears to have arisen before the divergence of the extant schistosome species. Hybridisation analyses indicated that similar to 10,000 copies of SjR2 were dispersed throughout the S. japonicum chromosomes, accounting for up to 14% of the nuclear genome. Messenger RNAs encoding the reverse transcriptase and endonuclease domains of SjR2 were detected in several developmental stages of the schistosome, indicating that the retrotransposon was actively replicating within the genome of the parasite. Exploration of the coding and non-coding regions of SjR2 revealed two notable characteristics. First, the recombinant reverse transcriptase domain of SjR2 expressed in insect cells primed reverse transcription of SjR2 mRNA in vitro. By contrast, recombinant SjR2-endonuclease did not appear to cleave schistosome or plasmid DNA. Second, the 5'-untranslated region of SjR2 was >80% identical to the 3-untranslated region of a schistosome heat shock protein-70 gene (hsp-70) in the antisense orientation, indicating that SjR2-like elements were probably inserted into the non-coding regions of ancestral S. japonicum HSP-70, probably after the species diverged from S. mansoni. (C) 2002 Australian Society for Parasitology Inc. Published by Elsevier Science Ltd. All rights reserved.

Knowledge sharing and learning processes: case study of portuguese technological schools and higher education institutions

Paper to be presented at the ESREA Conference Learning to Change? The Role of Identity and Learning Careers in Adult Education, 7-8 December, 2006, Université Catholique Louvain, Louvain–la-Neuve, Belgium

New Technique for Uniform Voltage Sharing in Series Stacked Semiconductors

This paper describes the operation of a solid-state series stacked topology used as a serial and parallel switch in pulsed power applications. The proposed circuit, developed from the Marx generator concept, balances the voltage stress on each series stacked semiconductor, distributing the total voltage evenly. Experimental results from a 10 kV laboratory series stacked switch, using 1200 V semiconductors in a ten stages solid-state series stacked circuit, are reported and discussed, considering resistive, capacitive and inductive type loads for high and low duty factor voltage pulse operation.

Advances in smart grids - benefits on sharing background experiences from Portugal, Central Europe and Brazil

This paper presents ELECON - Electricity Consumption Analysis to Promote Energy Efficiency Considering Demand Response and Non-technical Losses, an international research project that involves European and Brazilian partners. ELECON focuses on energy efficiency increasing through consumer´s active participation which is a key area for Europe and Brazil cooperation. The project aims at significantly contributing towards the successful implementation of smart grids, focussing on the use of new methods that allow the efficient use of distributed energy resources, namely distributed generation, storage and demand response. ELECON puts together researchers from seven European and Brazilian partners, with consolidated research background and evidencing complementary competences. ELECON involves institutions of 3 European countries (Portugal, Germany, and France) and 4 Brazilian institutions. The complementary background and experience of the European and Brazilian partners is of main relevance to ensure the capacities required to achieve the proposed goals. In fact, the European Union (EU) and Brazil have very different resources and approaches in what concerns this area. Having huge hydro and fossil resources, Brazil has not been putting emphasis on distributed renewable based electricity generation. On the contrary, EU has been doing huge investments in this area, taking into account environmental concerns and also the economic EU external dependence dictated by huge requirements of energy related products imports. Sharing these different backgrounds allows the project team to propose new methodologies able to efficiently address the new challenges of smart grids.

Sequencing of a 9.9 kb segment on the right arm of yeast chromosome VII reveals four open reading frames, including PFK1, the gene coding for succinyl-CoA synthetase (beta-chain) and two ORFs sharing homology with ORFs of the yeast chromosome VIII

A 9.9 kb DNA fragment from the right arm of chromosome VII of Saccharomyces cerevisiae has been sequenced and analysed. The sequence contains four open reading frames (ORFs) longer than 100 amino acids. One gene, PFK1, has already been cloned and sequenced and the other one is the probable yeast gene coding for the beta-subunit of the succinyl-CoA synthetase. The two remaining ORFs share homology with the deduced amino acid sequence (and their physical arrangement is similar to that) of the YHR161c and YHR162w ORFs from chromosome VIII.

E-sharing: development and use of learning objects repository

— In the new learning environments, built width digital technologies, the need to promote quality of education resources, commonly known as Learning Objects, which can support formal and informal distance learning, emerge as one of the biggest challenge that educational institutions will have to face. Due to the fact that is expensive, the reuse and sharing became very important issue. This article presents a Learning Object Repository which aims to store, to disseminate and maintain accessible Learning Objects.

Capacity sharing and stealing in serverbased real-time systems

A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed. Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.