Projeto de estrutura variante de um edifício de habitação na zona de Lisboa

Trabalho de Projeto para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização de Estruturas

Verificação da segurança sísmica de um edifício existente em betão armado

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização de Estruturas

Models and tools for value systems analysis in collaborative environments

Dissertation to obtain the degree of Doctor in Electrical and Computer Engineering, specialization of Collaborative Networks

Physicians' estimates of the 10 year cardiovascular risk in hypertensive patients: an evaluation in primary care physicians in training.

To evaluate how young physicians in training perceive their patients' cardiovascular risk based on the medical charts and their clinical judgment. Cross sectional observational study. University outpatient clinic, Lausanne, Switzerland. Two hundred hypertensive patients and 50 non-hypertensive patients with at least one cardiovascular risk factor. Comparison of the absolute 10-year cardiovascular risk calculated by a computer program based on the Framingham score and adapted for physicians by the WHO/ISH with the perceived risk as assessed clinically by the physicians. Physicians underestimated the 10-year cardiovascular risk of their patients compared to that calculated with the Framingham score. Concordance between methods was 39% for hypertensive patients and 30% for non-hypertensive patients. Underestimation of cardiovascular risks for hypertensive patients was related to the fact they had a stabilized systolic blood pressure under 140 mm Hg (OR = 2.1 [1.1; 4.1]). These data show that young physicians in training often have an incorrect perception of the cardiovascular risk of their patients with a tendency to underestimate the risk. However, the calculated risk could also be slightly overestimated when applying the Framingham Heart Study model to a Swiss population. To implement a systematic evaluation of risk factors in primary care a greater emphasis should be placed on the teaching of cardiovascular risk evaluation and on the implementation of quality improvement programs.

Design, development and assessment of the Java Intelligent Tutoring System

The "Java Intelligent Tutoring System" (JITS) research project focused on designing, constructing, and determining the effectiveness of an Intelligent Tutoring System for beginner Java programming students at the postsecondary level. The participants in this research were students in the School of Applied Computing and Engineering Sciences at Sheridan College. This research involved consistently gathering input from students and instructors using JITS as it developed. The cyclic process involving designing, developing, testing, and refinement was used for the construction of JITS to ensure that it adequately meets the needs of students and instructors. The second objective in this dissertation determined the effectiveness of learning within this environment. The main findings indicate that JITS is a richly interactive ITS that engages students on Java programming problems. JITS is equipped with a sophisticated personalized feedback mechanism that models and supports each student in his/her learning style. The assessment component involved 2 main quantitative experiments to determine the effectiveness of JITS in terms of student performance. In both experiments it was determined that a statistically significant difference was achieved between the control group and the experimental group (i.e., JITS group). The main effect for Test (i.e., pre- and postiest), F( l , 35) == 119.43,p < .001, was qualified by a Test by Group interaction, F( l , 35) == 4.98,p < .05, and a Test by Time interaction, F( l , 35) == 43.82, p < .001. Similar findings were found for the second experiment; Test by Group interaction revealed F( 1 , 92) == 5.36, p < .025. In both experiments the JITS groups outperformed the corresponding control groups at posttest.

Exchange energy calculation of He-He with supermolecular one-matrix

Exch~nge energy of the He-He system is calculated using the one-density matrix which has been modified according to the supermolecular density formula quoted by Kolos. The exchange energy integrals are computed analytically and by the Monte Carlo method. The results obtained from both ways compared favourably,with the results obtained from the SCF program HONDO

Winâ Foy : functional object-oriented programming language

This thesis will introduce a new strongly typed programming language utilizing Self types, named Win--*Foy, along with a suitable user interface designed specifically to highlight language features. The need for such a programming language is based on deficiencies found in programming languages that support both Self types and subtyping. Subtyping is a concept that is taken for granted by most software engineers programming in object-oriented languages. Subtyping supports subsumption but it does not support the inheritance of binary methods. Binary methods contain an argument of type Self, the same type as the object itself, in a contravariant position, i.e. as a parameter. There are several arguments in favour of introducing Self types into a programming language (11. This rationale led to the development of a relation that has become known as matching [4, 5). The matching relation does not support subsumption, however, it does support the inheritance of binary methods. Two forms of matching have been proposed (lJ. Specifically, these relations are known as higher-order matching and I-bound matching. Previous research on these relations indicates that the higher-order matching relation is both reflexive and transitive whereas the f-bound matching is reflexive but not transitive (7]. The higher-order matching relation provides significant flexibility regarding inheritance of methods that utilize or return values of the same type. This flexibility, in certain situations, can restrict the programmer from defining specific classes and methods which are based on constant values [21J. For this reason, the type This is used as a second reference to the type of the object that cannot, contrary to Self, be specialized in subclasses. F-bound matching allows a programmer to define a function that will work for all types of A', a subtype of an upper bound function of type A, with the result type being dependent on A'. The use of parametric polymorphism in f-bound matching provides a connection to subtyping in object-oriented languages. This thesis will contain two main sections. Firstly, significant details concerning deficiencies of the subtype relation and the need to introduce higher-order and f-bound matching relations into programming languages will be explored. Secondly, a new programming language named Win--*Foy Functional Object-Oriented Programming Language has been created, along with a suitable user interface, in order to facilitate experimentation by programmers regarding the matching relation. The construction of the programming language and the user interface will be explained in detail.

An Interactive Theorem Prover for First-Order Dynamic Logic

Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.

Using HeadSprout Early Reading with a child with Autism Spectrum Disorder: An examination of phonological awareness, participant engagement, and participant enjoyment

This study examined the effectiveness of a 9-week reading program in improving the phonological awareness (PA) skills of a seven year old boy with Autism Spectrum Disorder (ASD), Attention Deficit Hyperactivity Disorder (ADHD), and Oppositional Defiant Disorder (ODD). The study’s secondary goal was to describe how the participant engaged with and enjoyed the HeadSprout computer program. The participant attended a one hour reading program incorporating 30 minutes of HeadSprout Early Reading three days a week for 9 weeks. Results demonstrated that the participant’s PA scores increased from the 16th percentile at pre-test to the 35th percentile post program. Four of five measures of PA increased, segmenting nonwords decreased to the 2nd percentile post program. Momentary time sampling procedures revealed the participant was engaged with the computer program 94.5% of the time. Perceived ratings of enjoyment indicated the participant enjoyed using the program. Specific components of the program which may have influenced participant enjoyment and engagement are discussed. Study limitations and implications of these findings are discussed in reference to future research.

Development of the Physical Activity Interactive Recall (PAIR) for Aboriginal children

Affiliation: Margaret Cargo : Département de médecine sociale et préventive, Faculté de médecine, Université de Montréal

Temporalité et surveillance dans l'art de David Rokeby

Pour respecter les droits d'auteur, la version électronique de ce mémoire à été dépouillée de ses documents visuels et audio-visuels. La version intégrale du mémoire a été déposée au Service de la gestion des documents et des archives de l'Université de Montréal.

Réseaux de neurones à relaxation entraînés par critère d'autoencodeur débruitant

L’apprentissage machine est un vaste domaine où l’on cherche à apprendre les paramètres de modèles à partir de données concrètes. Ce sera pour effectuer des tâches demandant des aptitudes attribuées à l’intelligence humaine, comme la capacité à traiter des don- nées de haute dimensionnalité présentant beaucoup de variations. Les réseaux de neu- rones artificiels sont un exemple de tels modèles. Dans certains réseaux de neurones dits profonds, des concepts "abstraits" sont appris automatiquement. Les travaux présentés ici prennent leur inspiration de réseaux de neurones profonds, de réseaux récurrents et de neuroscience du système visuel. Nos tâches de test sont la classification et le débruitement d’images quasi binaires. On permettra une rétroac- tion où des représentations de haut niveau (plus "abstraites") influencent des représentations à bas niveau. Cette influence s’effectuera au cours de ce qu’on nomme relaxation, des itérations où les différents niveaux (ou couches) du modèle s’interinfluencent. Nous présentons deux familles d’architectures, l’une, l’architecture complètement connectée, pouvant en principe traiter des données générales et une autre, l’architecture convolutionnelle, plus spécifiquement adaptée aux images. Dans tous les cas, les données utilisées sont des images, principalement des images de chiffres manuscrits. Dans un type d’expérience, nous cherchons à reconstruire des données qui ont été corrompues. On a pu y observer le phénomène d’influence décrit précédemment en comparant le résultat avec et sans la relaxation. On note aussi certains gains numériques et visuels en terme de performance de reconstruction en ajoutant l’influence des couches supérieures. Dans un autre type de tâche, la classification, peu de gains ont été observés. On a tout de même pu constater que dans certains cas la relaxation aiderait à apprendre des représentations utiles pour classifier des images corrompues. L’architecture convolutionnelle développée, plus incertaine au départ, permet malgré tout d’obtenir des reconstructions numériquement et visuellement semblables à celles obtenues avec l’autre architecture, même si sa connectivité est contrainte.

Circulation in the indian ocean in relation to the monsoon circulation of the atmosphere

The present thesis is an attempt by the researcher to Investigate the surface circulation of the Indian Ocean, north of 2095 in relation to the atmospheric circulation over the ocean. The aim is achieved by working out the circu1ation pattern and correlating it with the computed wind stress and its vorticity. The month wise surface circulation is arrived by drawing the streamlines, using freshand method with superimposed isotache. The zonal ad meridional componance of the wind stress and the curl of the wind stress are computed for each month over 2° latitude longitude quadrangle from the bulk aerodynamic formula, using a computer program. The data for drawing the surface circu1ation and for computing the wind stress and its curl have come from the Dutch Atlas.

A Theory of Quantitative Inference Applied to a Mechanical Design Compiler

This thesis presents the ideas underlying a computer program that takes as input a schematic of a mechanical or hydraulic power transmission system, plus specifications and a utility function, and returns catalog numbers from predefined catalogs for the optimal selection of components implementing the design. Unlike programs for designing single components or systems, the program provides the designer with a high level "language" in which to compose new designs. It then performs some of the detailed design process. The process of "compilation" is based on a formalization of quantitative inferences about hierarchically organized sets of artifacts and operating conditions. This allows the design compilation without the exhaustive enumeration of alternatives.

KAM: Automatic Planning and Interpretation of Numerical Experiments Using Geometrical Methods

KAM is a computer program that can automatically plan, monitor, and interpret numerical experiments with Hamiltonian systems with two degrees of freedom. The program has recently helped solve an open problem in hydrodynamics. Unlike other approaches to qualitative reasoning about physical system dynamics, KAM embodies a significant amount of knowledge about nonlinear dynamics. KAM's ability to control numerical experiments arises from the fact that it not only produces pictures for us to see, but also looks at (sic---in its mind's eye) the pictures it draws to guide its own actions. KAM is organized in three semantic levels: orbit recognition, phase space searching, and parameter space searching. Within each level spatial properties and relationships that are not explicitly represented in the initial representation are extracted by applying three operations ---(1) aggregation, (2) partition, and (3) classification--- iteratively.