The motivation of vocational students in a college setting /

This qualitative study explores the motivation of College Vocational Program (CVP) students at one campus of a large College of Applied Arts and Technology (CAAT a) in urban southern Ontario. The study is in response to my close involvement with the CVP students as an instructor for five years, and my observation that a greater understanding of the motivational influences affecting the students' involvement in the program would strengthen teaching and learning, and enhance the CVP educational experience for students and instructors. This study was limited to one CVP program, and a small sample of convenience of 9 CVP male and female students and 6 instructors selected from two classes. The students were chosen based on their verbal abilities to communicate their thoughts, feelings, and experiences in regard to answering the research questions posed. Through interviews with students, instructors, and ajob coach, this study addressed four main questions relevant to college vocational students and motivation: defining student success, encouragement, discouragement, and perceptions about academic and vocationalleaming. The interview questions for both students and instructors were designed by me and were based on themes derived from the literature and from my experience in the program. The findings identify that the students and instructors see success in the program in a slightly different way, the importance of relationships and structure, the hindering effect of disabilities and the importance of accommodation, and the strong aspiration of the students wanting to learn in a supportive accepting environment. The study concludes with implications for further research and theory development.

Étude numérique des origines hémodynamiques des oscillations dans des réseaux de capillaires

En simulant l’écoulement du sang dans un réseau de capillaires (en l’absence de contrôle biologique), il est possible d’observer la présence d’oscillations de certains paramètres comme le débit volumique, la pression et l’hématocrite (volume des globules rouges par rapport au volume du sang total). Ce comportement semble être en concordance avec certaines expériences in vivo. Malgré cet accord, il faut se demander si les fluctuations observées lors des simulations de l’écoulement sont physiques, numériques ou un artefact de modèles irréalistes puisqu’il existe toujours des différences entre des modélisations et des expériences in vivo. Pour répondre à cette question de façon satisfaisante, nous étudierons et analyserons l’écoulement du sang ainsi que la nature des oscillations observées dans quelques réseaux de capillaires utilisant un modèle convectif et un modèle moyenné pour décrire les équations de conservation de masse des globules rouges. Ces modèles tiennent compte de deux effets rhéologiques importants : l’effet Fåhraeus-Lindqvist décrivant la viscosité apparente dans un vaisseau et l’effet de séparation de phase schématisant la distribution des globules rouges aux points de bifurcation. Pour décrire ce dernier effet, deux lois de séparation de phase (les lois de Pries et al. et de Fenton et al.) seront étudiées et comparées. Dans ce mémoire, nous présenterons une description du problème physiologique (rhéologie du sang). Nous montrerons les modèles mathématiques employés (moyenné et convectif) ainsi que les lois de séparation de phase (Pries et al. et Fenton et al.) accompagnés d’une analyse des schémas numériques implémentés. Pour le modèle moyenné, nous employons le schéma numérique explicite traditionnel d’Euler ainsi qu’un nouveau schéma implicite qui permet de résoudre ce problème d’une manière efficace. Ceci est fait en utilisant une méthode de Newton- Krylov avec gradient conjugué préconditionné et la méthode de GMRES pour les itérations intérieures ainsi qu’une méthode quasi-Newton (la méthode de Broyden). Cette méthode inclura le schéma implicite d’Euler et la méthode des trapèzes. Pour le schéma convectif, la méthode explicite de Kiani et al. sera implémentée ainsi qu’une nouvelle approche implicite. La stabilité des deux modèles sera également explorée. À l’aide de trois différentes topologies, nous comparerons les résultats de ces deux modèles mathématiques ainsi que les lois de séparation de phase afin de déterminer dans quelle mesure les oscillations observées peuvent être attribuables au choix des modèles mathématiques ou au choix des méthodes numériques.

Application of a novel optimal control algorithm to a benchmark fed-batch fermentation process

A novel algorithm for solving nonlinear discrete time optimal control problems with model-reality differences is presented. The technique uses Dynamic Integrated System Optimisation and Parameter Estimation (DISOPE) which has been designed to achieve the correct optimal solution in spite of deficiencies in the mathematical model employed in the optimisation procedure. A method based on Broyden's ideas is used for approximating some derivative trajectories required. Ways for handling con straints on both manipulated and state variables are described. Further, a method for coping with batch-to- batch dynamic variations in the process, which are common in practice, is introduced. It is shown that the iterative procedure associated with the algorithm naturally suits applications to batch processes. The algorithm is success fully applied to a benchmark problem consisting of the input profile optimisation of a fed-batch fermentation process.

The application of a domains based analysis to family processes: implications for assessment and therapy

Social domains are classes of interpersonal processes each with distinct procedural rules underpinning mutual understanding, emotion regulation and action. We describe the features of three domains of family life – safety, attachment and discipline/expectation – and contrast them with exploratory processes in terms of the emotions expressed, the role of certainty versus uncertainty, and the degree of hierarchy in an interaction. We argue that everything that people say and do in family life carries information about the type of interaction they are engaged in – that is, the domain. However, sometimes what they say or how they behave does not make the domain clear, or participants in the social interactions are not in the same domain (there is a domain mismatch). This may result in misunderstandings, irresolvable arguments or distress. We describe how it is possible to identify domains and judge whether they are clear and unclear, and matched and mismatched, in observed family interactions and in accounts of family processes. This then provides a focus for treatment and helps to define criteria for evaluating outcomes.

Anger, preoccupied attachment and domain disorganisation in borderline personality disorder

Emotional dysregulation and attachment insecurity have been reported in borderline personality disorder (BPD). Domain disorganization, evidenced in poor regulation of emotions and behaviors in relation to the demands of different social domains, may be a distinguishing feature of BPD. Understanding the interplay between these factors may be critical for identifying interacting processes in BPD and potential subtypes of BPD. Therefore, we examined the joint and interactive effects of anger, preoccupied attachment, and domain disorganization on BPD traits in a clinical sample of 128 psychiatric patients. The results suggest that these factors contribute to BPD both independently and in interaction, even when controlling for other personality disorder traits and Axis I symptoms. In regression analyses, the interaction between anger and domain disorganization predicted BPD traits. In recursive partitioning analyses, two possible paths to BPD were identified: high anger combined with high domain disorganization and low anger combined with preoccupied attachment. These results may suggest possible subtypes of BPD or possible mechanisms by which BPD traits are established and maintained.

Black-box decomposition approach for computational hemodynamics: One-dimensional models

Increasing efforts exist in integrating different levels of detail in models of the cardiovascular system. For instance, one-dimensional representations are employed to model the systemic circulation. In this context, effective and black-box-type decomposition strategies for one-dimensional networks are needed, so as to: (i) employ domain decomposition strategies for large systemic models (1D-1D coupling) and (ii) provide the conceptual basis for dimensionally-heterogeneous representations (1D-3D coupling, among various possibilities). The strategy proposed in this article works for both of these two scenarios, though the several applications shown to illustrate its performance focus on the 1D-1D coupling case. A one-dimensional network is decomposed in such a way that each coupling point connects two (and not more) of the sub-networks. At each of the M connection points two unknowns are defined: the flow rate and pressure. These 2M unknowns are determined by 2M equations, since each sub-network provides one (non-linear) equation per coupling point. It is shown how to build the 2M x 2M non-linear system with arbitrary and independent choice of boundary conditions for each of the sub-networks. The idea is then to solve this non-linear system until convergence, which guarantees strong coupling of the complete network. In other words, if the non-linear solver converges at each time step, the solution coincides with what would be obtained by monolithically modeling the whole network. The decomposition thus imposes no stability restriction on the choice of the time step size. Effective iterative strategies for the non-linear system that preserve the black-box character of the decomposition are then explored. Several variants of matrix-free Broyden`s and Newton-GMRES algorithms are assessed as numerical solvers by comparing their performance on sub-critical wave propagation problems which range from academic test cases to realistic cardiovascular applications. A specific variant of Broyden`s algorithm is identified and recommended on the basis of its computer cost and reliability. (C) 2010 Elsevier B.V. All rights reserved.

New contributions to the determination of resonance frequencies of rectangular microstrip antennas by neural networks

This paper uses artificial neural networks (ANN) to compute the resonance frequencies of rectangular microstrip antennas (MSA), used in mobile communications. Perceptron Multi-layers (PML) networks were used, with the Quasi-Newton method proposed by Broyden, Fletcher, Goldfarb and Shanno (BFGS). Due to the nature of the problem, two hundred and fifty networks were trained, and the resonance frequency for each test antenna was calculated by statistical methods. The estimate resonance frequencies for six test antennas were compared with others results obtained by deterministic and ANN based empirical models from the literature, and presented a better agreement with the experimental values.

Il metodo di Newton e le sue varianti per sistemi di equazioni non lineari

In questa tesi sono stati descritti i principali metodi numerici per la risoluzione di sistemi non lineari. Tali metodi sono stati analizzati sia dal punto di vista teorico (analisi di convergenza locale) che pratico (algoritmo e implementazione).

Local convergence of quasi-Newton methods under metric regularity

We consider quasi-Newton methods for generalized equations in Banach spaces under metric regularity and give a sufficient condition for q-linear convergence. Then we show that the well-known Broyden update satisfies this sufficient condition in Hilbert spaces. We also establish various modes of q-superlinear convergence of the Broyden update under strong metric subregularity, metric regularity and strong metric regularity. In particular, we show that the Broyden update applied to a generalized equation in Hilbert spaces satisfies the Dennis–Moré condition for q-superlinear convergence. Simple numerical examples illustrate the results.

Joint Information and Jamming Beamforming for Secrecy Rate Maximization in Cognitive Radio Networks

In this paper, we consider the secure beamforming design for an underlay cognitive radio multiple-input singleoutput broadcast channel in the presence of multiple passive eavesdroppers. Our goal is to design a jamming noise (JN) transmit strategy to maximize the secrecy rate of the secondary system. By utilizing the zero-forcing method to eliminate the interference caused by JN to the secondary user, we study the joint optimization of the information and JN beamforming for secrecy rate maximization of the secondary system while satisfying all the interference power constraints at the primary users, as well as the per-antenna power constraint at the secondary transmitter. For an optimal beamforming design, the original problem is a nonconvex program, which can be reformulated as a convex program by applying the rank relaxation method. To this end, we prove that the rank relaxation is tight and propose a barrier interior-point method to solve the resulting saddle point problem based on a duality result. To find the global optimal solution, we transform the considered problem into an unconstrained optimization problem. We then employ Broyden-Fletcher-Goldfarb-Shanno (BFGS) method to solve the resulting unconstrained problem which helps reduce the complexity significantly, compared to conventional methods. Simulation results show the fast convergence of the proposed algorithm and substantial performance improvements over existing approaches.