Transgenerational Inheritance of Paternal Neurobehavioral Phenotypes: Stress, Addiction, Ageing and Metabolism

Epigenetic modulation is found to get involved in multiple neurobehavioral processes. It is believed that different types of environmental stimuli could alter the epigenome of the whole brain or related neural circuits, subsequently contributing to the long-lasting neural plasticity of certain behavioral phenotypes. While the maternal influence on the health of offsprings has been long recognized, recent findings highlight an alternative way for neurobehavioral phenotypes to be passed on to the next generation, i.e., through the male germ line. In this review, we focus specifically on the transgenerational modulation induced by environmental stress, drugs of abuse, and other physical or mental changes (e.g., ageing, metabolism, fear) in fathers, and recapitulate the underlying mechanisms potentially mediating the alterations in epigenome or gene expression of offsprings. Together, these findings suggest that the inheritance of phenotypic traits through male germ-line epigenome may represent the unique manner of adaptation during evolution. Hence, more attention should be paid to the paternal health, given its equivalently important role in affecting neurobehaviors of descendants.

Identificação de compostos que modulam a patogénese da doença de Machado-Joseph em C.elegans: autofagia como alvo terapêutico: identification of small compounds that modulate pathogenesis of Machado-Joseph disease in a C.elegans model: targeting autophagy

A doença de Machado-Joseph (DMJ) ou ataxia espinocerebelosa do tipo 3 (SCA3), conhecida por ser a mais comum das ataxias hereditárias dominantes em todo o mundo, é uma doença neurodegenerativa autossómica dominante que leva a uma grande incapacidade motora, embora sem alterar o intelecto, culminando com a morte do doente. Atualmente não existe nenhum tratamento eficaz para esta doença. A DMJ é resultado de uma alteração genética causada pela expansão de uma sequência poliglutamínica (poliQ), na região C-terminal do gene que codifica a proteína ataxina-3 (ATXN3). Os mecanismos celulares das doenças de poliglutaminas que provocam toxicidade, bem como a função da ATXN3, não são ainda totalmente conhecidos. Neste trabalho, usamos, pela sua simplicidade e potencial genético, um pequeno animal invertebrado, o nemátode C. elegans, com o objetivo de identificar fármacos eficazes para o combate contra a patogénese da DMJ, analisando simultaneamente o seu efeito na agregação da ATXN3 mutante nas células neuronais in vivo e o seu impacto no comportamento motor dos animais. Este pequeno invertebrado proporciona grandes vantagens no estudo dos efeitos tóxicos de proteínas poliQ nos neurónios, uma vez que a transparência das suas 959 células (das quais 302 são neurónios) facilita a deteção de proteínas fluorescentes in vivo. Para além disso, esta espécie tem um ciclo de vida curto, é económica e de fácil manutenção. Neste trabalho testámos no nosso modelo transgénico da DMJ com 130Qs em C.elegans dois compostos potencialmente moduladores da agregação da ATXN3 mutante e da resultante disfunção neurológica, atuando pela via da autofagia. De modo a validar a possível importância terapêutica da ativação da autofagia os compostos candidatos escolhidos foram o Litío e o análogo da Rapamicina CCI-779, testados independentemente e em combinação. A neuroproteção conferida pelo Litío e pelo CCI-779 independentemente sugere que o uso destes fármacos possa ser considerado uma boa estratégia como terapia para a DMJ, a testar em organismos evolutivamente mais próximos do humano. A manipulação da autofagia, segundo vários autores, parece ser benéfica e pode ser a chave para o desenvolvimento de novos tratamentos para várias doenças relacionadas com a agregação proteica e o envelhecimento.

Alianças estratégicas: análise do sector exportador de produtos português

Dissertação de Mestrado em Finanças Empresariais

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

A capacity sharing and stealing strategy for open real-time systems

This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.

Handling shared resources and precedence constraints in open systems

There is an increasing demand for highly dynamic realtime systems where several independently developed applications with different timing requirements can coexist. This paper proposes a protocol to integrate shared resources and precedence constraints among tasks in such systems assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among needed tasks, minimising the cost of blocking.

The capacity exchange protocol

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among tasks to minimise the degree of deviation from the ideal system’s behaviour caused by inter-application blocking. The proposed Capacity Exchange Protocol (CXP) is simpler than other proposed solutions for sharing resources in open real-time systems since it does not attempt to return the inherited capacity in the same exact amount to blocked servers. This loss of optimality is worth the reduced complexity as the protocol’s behaviour nevertheless tends to be fair and outperforms the previous solutions in highly dynamic scenarios as demonstrated by extensive simulations. A formal analysis of CXP is presented and the conditions under which it is possible to guarantee hard real-time tasks are discussed.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.