4 resultados para new program
em AMS Tesi di Dottorato - Alm@DL - Università di Bologna
Resumo:
Il primo studio ha verificato l'affidabilità del software Polimedicus e gli effetti indotti d'allenamento arobico all’intensità del FatMax. 16 soggetti sovrappeso, di circa 40-55anni, sono stati arruolati e sottoposti a un test incrementale fino a raggiungere un RER di 0,95, e da quel momento il carico è stato aumentato di 1 km/ h ogni minuto fino a esaurimento. Successivamente, è stato verificato se i valori estrapolati dal programma erano quelli che si possono verificare durante a un test a carico costante di 1ora. I soggetti dopo 8 settimane di allenamento hanno fatto un altro test incrementale. Il dati hanno mostrato che Polimedicus non è molto affidabile, soprattutto l'HR. Nel secondo studio è stato sviluppato un nuovo programma, Inca, ed i risultati sono stati confrontati con i dati ottenuti dal primo studio con Polimedicus. I risultati finali hanno mostrato che Inca è più affidabile. Nel terzo studio, abbiamo voluto verificare l'esattezza del calcolo del FatMax con Inca e il test FATmaxwork. 25 soggetti in sovrappeso, tra 40-55 anni, sono stati arruolati e sottoposti al FATmaxwork test. Successivamente, è stato verificato se i valori estrapolati da INCA erano quelli che possono verificarsi durante un carico di prova costante di un'ora. L'analisi ha mostrato una precisione del calcolo della FatMax durante il carico di lavoro. Conclusione: E’ emersa una certa difficoltà nel determinare questo parametro, sia per la variabilità inter-individuale che intra-individuale. In futuro bisognerà migliorare INCA per ottenere protocolli di allenamento ancora più validi.
Resumo:
This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the declarative languages family. It was initially designed for writing constraint solvers but it has recently also proven to be a general purpose language, being as it is Turing equivalent [SSD05a]. Compositionality is the first CHR aspect to be considered. A trace based compositional semantics for CHR was previously defined in [DGM05]. The reference operational semantics for such a compositional model was the original operational semantics for CHR which, due to the propagation rule, admits trivial non-termination. In this thesis we extend the work of [DGM05] by introducing a more refined trace based compositional semantics which also includes the history. The use of history is a well-known technique in CHR which permits us to trace the application of propagation rules and consequently it permits trivial non-termination avoidance [Abd97, DSGdlBH04]. Naturally, the reference operational semantics, of our new compositional one, uses history to avoid trivial non-termination too. Program transformation is the second CHR aspect to be considered, with particular regard to the unfolding technique. Said technique is an appealing approach which allows us to optimize a given program and in more detail to improve run-time efficiency or spaceconsumption. Essentially it consists of a sequence of syntactic program manipulations which preserve a kind of semantic equivalence called qualified answer [Frü98], between the original program and the transformed ones. The unfolding technique is one of the basic operations which is used by most program transformation systems. It consists in the replacement of a procedure-call by its definition. In CHR every conjunction of constraints can be considered as a procedure-call, every CHR rule can be considered as a procedure and the body of said rule represents the definition of the call. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. We define an unfolding rule, show its correctness and discuss some conditions in which it can be used to delete an unfolded rule while preserving the meaning of the original program. Finally, confluence and termination maintenance between the original and transformed programs are shown. This thesis is organized in the following manner. Chapter 1 gives some general notion about CHR. Section 1.1 outlines the history of programming languages with particular attention to CHR and related languages. Then, Section 1.2 introduces CHR using examples. Section 1.3 gives some preliminaries which will be used during the thesis. Subsequentely, Section 1.4 introduces the syntax and the operational and declarative semantics for the first CHR language proposed. Finally, the methodologies to solve the problem of trivial non-termination related to propagation rules are discussed in Section 1.5. Chapter 2 introduces a compositional semantics for CHR where the propagation rules are considered. In particular, Section 2.1 contains the definition of the semantics. Hence, Section 2.2 presents the compositionality results. Afterwards Section 2.3 expounds upon the correctness results. Chapter 3 presents a particular program transformation known as unfolding. This transformation needs a particular syntax called annotated which is introduced in Section 3.1 and its related modified operational semantics !0t is presented in Section 3.2. Subsequently, Section 3.3 defines the unfolding rule and prove its correctness. Then, in Section 3.4 the problems related to the replacement of a rule by its unfolded version are discussed and this in turn gives a correctness condition which holds for a specific class of rules. Section 3.5 proves that confluence and termination are preserved by the program modifications introduced. Finally, Chapter 4 concludes by discussing related works and directions for future work.
Resumo:
MYCN amplification is a genetic hallmark of the childhood tumour neuroblastoma. MYCN-MAX dimers activate the expression of genes promoting cell proliferation. Moreover, MYCN seems to transcriptionally repress cell differentiation even in absence of MAX. We adopted the Drosophila eye as model to investigate the effect of high MYC to MAX expression ratio on cells. We found that dMyc overexpression in eye cell precursors inhibits cell differentiation and induces the ectopic expression of Antennapedia (the wing Hox gene). The further increase of MYC/MAX ratio results in an eye-to-wing homeotic transformation. Notably, dMyc overexpression phenotype is suppressed by low levels of transcriptional co-repressors and MYCN associates to the promoter of Deformed (the eye Hox gene) in proximity to repressive sites. Hence, we envisage that, in presence of high MYC/MAX ratio, the “free MYC” might inhibit Deformed expression, leading in turn to the ectopic expression of Antennapedia. This suggests that MYCN might reinforce its oncogenic role by affecting the physiological homeotic program. Furthermore, poor neuroblastoma outcome associates with a high level of the MRP1 protein, encoded by the ABCC1 gene and known to promote drug efflux in cancer cells. Intriguingly, this correlation persists regardless of chemotherapy and ABCC1 overexpression enhances neuroblastoma cell motility. We found that Drosophila dMRP contributes to the adhesion between the dorsal and ventral epithelia of the wing by inhibiting the function of integrin receptors, well known regulators of cell adhesion and migration. Besides, integrins play a crucial role during synaptogenesis and ABCC1 locus is included in a copy number variable region of the human genome (16p13.11) involved in neuropsychiatric diseases. Interestingly, we found that the altered dMRP/MRP1 level affects nervous system development in Drosophila embryos. These preliminary findings point out novel ABCC1 functions possibly defining ABCC1 contribution to neuroblastoma and to the pathogenicity of 16p13.11 deletion/duplication
Resumo:
This final thesis is aimed at summarizing the research program I have carried out during my PhD studies, that has been dealing with the design, the preparation, characterization and applications of new Re(I), Ru(II), and Ir(III) metal complexes containing anionic ligands such as 5-aryl tetrazolates [R-CN4]- or their neutral analogues, N-alkyltetrazoles [R-CN4-R1]. Chapter 1 consists of a brief introduction on tetrazoles and metal-tetrazolato complexes, and on the photophysical properties of d6 transition metal complexes. In chapter 2, the synthesis, characterization and study of the photophysical properties of new luminescent Ir(III)-tetrazolate complexes are discussed. Moreover, the application of one of the new Ir(III)-CN complexes as emissive core in the fabrication of an OLED device is reported. In chapter 3, the study of the antimicrobial activity of new Ru(II)-alkyltetrazole complexes is reported. When the pentatomic ring was substituted with a long alkyl residue, antimicrobial activity toward Deinococcus radiodurans was observed. In chapter 4, a new family of luminescent Re(I)-tetrazolate complexes is reported. In this study, different N-alkyl tetrazoles play the role of diimine (diim) ligands in the preparation of new Re(I) tricarbonyl complexes. In addition, absorption and emission titration experiments were performed to study their interaction with Bovine Serum Albumin (BSA). In chapter 5, the synthesis and characterization of new luminescent Re(I)-tetrazolate complexes are discussed. The use of sulfonated diimine ligands in the preparation of new Re(I) tricarbonyl complexes led to the first example Re(I) complexes for the luminescent staining of proteins. In chapter 6, the synthesis, a new family of Ir(III)-NO2 tetrazole complexes displaying unexpected photophysical properties are discussed. Moreover, the possibility to tune the luminescent output of such systems upon chemical modification of the pending nitro group was verified by performing reduction tests with sodium dithionite; this represents encouraging evidence for their possible application as hypoxia-responsive luminescent probes in bioimaging.