Simulação do processo de transferência de calor não linear condução-radiação por meio de um esquema linear em diferenças finitas.

Neste trabalho o processo não linear de transmissão de calor condução-radiação é abordado num contexto bidimensional plano e simulado com o uso de um esquema linear em diferenças finitas. O problema original é tratado como o limite de uma sequencia de problemas lineares, do tipo condução-convecção. Este limite, cuja existência é comprovada, é facilmente obtido a partir de procedimentos básicos, accessíveis a qualquer estudante de engenharia, permitindo assim o emprego de hipóteses mais realistas, já que não se tem o limitante matemático para a abordagem numérica de uma equação diferencial parcial elíptica. Neste trabalho foi resolvido o problema de condução de calor em regime permanente em uma placa com condições de contorno convectivas e radioativas utilizando-se o software MatLab, vale ressaltar, que a mesma metodologia é aplicável para geometrias mais complexas.

Mechanical constraint and loading on ferroelectric memory capacitors

The influence of mechanical constraint imposed by device geometry upon the switching response of a ferroelectric thin film memory capacitor is investigated. The memory capacitor was represented by two-dimensional ferroelectric islands of different aspect ratio, mechanically constrained by surrounding materials. Its ferroelectric non-linear behaviour was modeled by a crystal plasticity constitutive law and calculated using the finite element method. The switching response of the device, in terms of remnant charge storage, was determined as a function of geometry and constraint. The switching response under applied in-plane tensile stress and hydrostatic pressure was also studied experimentally. Our results showed that (1) the capacitor's aspect ratio could significantly affect the clamping behaviour and thus the remnant polarization, (2) it was possible to maximise the switching charge through the optimisation of the device geometry, and (3) it is possible to find a critical switching stress at zero electric field and a critical coercive field at zero residual stress. © 2009 Materials Research Society.

Optimal constraint tightening policies for robust variable horizon model predictive control

This paper develops a technique for improving the region of attraction of a robust variable horizon model predictive controller. It considers a constrained discrete-time linear system acted upon by a bounded, but unknown time-varying state disturbance. Using constraint tightening for robustness, it is shown how the tightening policy, parameterised as direct feedback on the disturbance, can be optimised to increase the volume of an inner approximation to the controller's true region of attraction. Numerical examples demonstrate the benefits of the policy in increasing region of attraction volume and decreasing the maximum prediction horizon length. © 2012 IEEE.

a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

Safe Compositional Specification of Network Systems With Polymorphic, Constrained Types

In the framework of iBench research project, our previous work created a domain specific language TRAFFIC [6] that facilitates specification, programming, and maintenance of distributed applications over a network. It allows safety property to be formalized in terms of types and subtyping relations. Extending upon our previous work, we add Hindley-Milner style polymorphism [8] with constraints [9] to the type system of TRAFFIC. This allows a programmer to use for-all quantifier to describe types of network components, escalating power and expressiveness of types to a new level that was not possible before with propositional subtyping relations. Furthermore, we design our type system with a pluggable constraint system, so it can adapt to different application needs while maintaining soundness. In this paper, we show the soundness of the type system, which is not syntax-directed but is easier to do typing derivation. We show that there is an equivalent syntax-directed type system, which is what a type checker program would implement to verify the safety of a network flow. This is followed by discussion on several constraint systems: polymorphism with subtyping constraints, Linear Programming, and Constraint Handling Rules (CHR) [3]. Finally, we provide some examples to illustrate workings of these constraint systems.

Hydroisomerisation of n-alkanes over partially reduced MoO3: Promotion by CoAlPO-11 and relations to reaction mechanism and rate-determining step

The reaction mechanism and the rate-determining step (RDS) of the isomerisation of n-alkanes (C-4-C-6) over partially reduced MoO3 catalysts were studied through the effects of the addition of an alkene isomerisation catalyst (i.e. CoAlPO- 11). When an acidic CoAlPO- 11 sample was mechanically mixed with the MoO3, a decrease of the induction period and an increase of the steady-state conversion of n-butane to isobutane were observed. These data support previous assumptions that a bifunctional mechanism occurred over the partially reduced MoO3 (a complex nanoscale mixture of oxide-based phases) during n-butane isomerisation and that the RDS was the skeletal isomerisation of the linear butene intermediates. The only promotional effect of CoAlPO-11 on the activity of partially reduced MoO3 for C-5-C-6 alkane hydroisomerisation was a reduction of the induction period, as the RDS at steady-state conditions appeared to be dehydrogenation of the alkane in this case. However, lower yields of branched isomers were observed in this case, the reason of which is yet unclear. (c) 2005 Elsevier B.V. All rights reserved.

Stock-recruitment relations controlled by feeding interactions alone

Stock-recruitment (S-R) relationships are the centrepiece of fisheries management aimed at achieving maximum sustainable yield (MSY). Here we consider the possibility that the density dependence evident in S-R relations is controlled by feeding interactions alone. We simulate a food-web model with dynamic representations of intra- and interspecific size structure and a linear relation between food intake and hatchling production of adults. Population sizes of individual stocks are modified by imposing additional mortality. The predominant functional forms and the steepness of resulting S-R relationships agree well with observations. We conclude that recruitment is plausibly regulated by feeding interactions alone.

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.

Relations entre le programme de promotion des habiletés d’adaptation pour les enfants de 6-7 ans "Les amis de Zippy" et le climat de classe

Le programme d’enseignement des habiletés d’adaptation Les amis de Zippy vise la promotion de la santé mentale des élèves du premier cycle du primaire. La présente étude est une analyse secondaire réalisée à partir des données d’évaluation des effets du programme. L’objectif général vérifie si l’appartenance au groupe d’intervention est associée à une meilleure qualité du climat relationnel de classe à la fin de l’année scolaire, tel que perçu par les enseignants, tout en contrôlant pour la qualité du climat avant la réalisation du programme. La qualité du climat correspond aux relations entre les élèves et aux relations entre les élèves et l’enseignant. L’effet modérateur de la gestion de comportements et les pratiques pédagogiques est aussi analysé. L’échantillon est constitué de 35 enseignants auto-sélectionnés, répartis entre deux groupes non aléatoires. Les échelles suivantes du QES pour le primaire, version enseignant, sont utilisées : relations entre les élèves, relations entre les élèves et les enseignants, gestion des comportements et pratiques pédagogiques. Les résultats, obtenus grâce à des régressions linéaires multiples, montrent que généralement, l’appartenance au groupe n’explique pas significativement la qualité du climat de classe. Cependant, un effet d’interaction entre le climat de classe et la gestion de comportements est identifié. Lorsque les enseignants gèrent plus difficilement leur classe, le programme Les amis de Zippy est associé à un climat relationnel entre les élèves et l’enseignant moins favorable que dans le groupe témoin. Puisque ces résultats préliminaires peuvent être attribuables à des variables externes non contrôlées, ils devront être approfondis par des études subséquentes.

L'évolution des comportements d'agressivité physique de la petite enfance à l'âge scolaire : le rôle des relations d'amitié en début de scolarisation

Cette thèse avait pour objectif d’examiner les liens longitudinaux entre les relations d’amitié et l’évolution des comportements d’agressivité physique en début de scolarisation. Guidé par les principes énoncés par les théoriciens de l’apprentissage social, de l’attachement, du développement de la personnalité et de la théorie du jugement moral, le rôle principal et modérateur de certaines dimensions spécifiques à la qualité de la relation d’amitié, ainsi que des attributs comportementaux des amis et des caractéristiques personnelles de l’enfant a été évalué. Des données provenant de l’Étude Longitudinale du Développement des Enfants du Québec (ELDEQ), de l’Étude des Jumeaux nouveau-nés du Québec (EJNQ) et de l’évaluation des effets d’un programme d’intervention dyadique ont été analysées. Les mesures utilisées dans cette thèse ont été collectées entre la maternelle et la 2e année du primaire, soit de 5 à 8 ans, directement auprès des enfants, de leurs amis, leurs pairs, leurs parents et leurs enseignants par le biais de questionnaires, d’entrevues sociométriques et de mises en situation hypothétiques. En lien avec la perspective de l’apprentissage social, les résultats ont montré que l’association à des amis agressifs en maternelle est liée à une augmentation des comportements d’agressivité physique chez l’enfant. Cependant, en lien avec les théories du développement de la personnalité et la perspective de l’attachement, le fait d’établir une relation d’amitié de bonne qualité est reliée à une diminution des comportements agressifs à travers le temps. De plus, une interaction entre la qualité de la relation et les attributs comportementaux des amis a indiqué que le risque lié à l’association à des amis agressifs est atténué dans le contexte d’une relation d’amitié de bonne qualité. Les résultats indiquent également que chez les garçons, la présence de conflits entre amis à la maternelle est associée de façon linéaire à de plus hauts niveaux de comportements agressifs, indépendamment du risque génétique de l’enfant face à cette problématique. Une interaction triple a par ailleurs révélé que le conflit n’était pas lié à une augmentation de l’agressivité physique dans le contexte d’une relation d’amitié caractérisée par l’affect positif et une bonne capacité à régler les conflits. Enfin, les résultats ont montré un effet indirect d’une intervention dyadique sur la diminution des comportements d’agressivité physique, qui opère à travers l’amélioration de la capacité des amis à régler leurs conflits. Ces résultats appuient le rôle bénéfique de la qualité de la relation d’amitié sur l’évolution des manifestations de comportements d’agressivité physique et suggèrent que cet aspect relationnel soit pris en compte dans les programmes de prévention des conduites agressives. En somme, la mise en évidence d’associations et d’interactions significatives entre la qualité des relations d’amitié, les attributs comportementaux des amis et les manifestations de comportements d’agressivité physique en début de scolarisation suggère que certains aspects et dimensions relationnelles positives peuvent être bénéfiques au développement des enfants agressifs. La prévention du maintien et de l’aggravation des conduites agressives par l’entremise de l’amélioration de la qualité des relations d’amitié représente une avenue prometteuse.

Diversified query expansion

La diversification des résultats de recherche (DRR) vise à sélectionner divers documents à partir des résultats de recherche afin de couvrir autant d’intentions que possible. Dans les approches existantes, on suppose que les résultats initiaux sont suffisamment diversifiés et couvrent bien les aspects de la requête. Or, on observe souvent que les résultats initiaux n’arrivent pas à couvrir certains aspects. Dans cette thèse, nous proposons une nouvelle approche de DRR qui consiste à diversifier l’expansion de requête (DER) afin d’avoir une meilleure couverture des aspects. Les termes d’expansion sont sélectionnés à partir d’une ou de plusieurs ressource(s) suivant le principe de pertinence marginale maximale. Dans notre première contribution, nous proposons une méthode pour DER au niveau des termes où la similarité entre les termes est mesurée superficiellement à l’aide des ressources. Quand plusieurs ressources sont utilisées pour DER, elles ont été uniformément combinées dans la littérature, ce qui permet d’ignorer la contribution individuelle de chaque ressource par rapport à la requête. Dans la seconde contribution de cette thèse, nous proposons une nouvelle méthode de pondération de ressources selon la requête. Notre méthode utilise un ensemble de caractéristiques qui sont intégrées à un modèle de régression linéaire, et génère à partir de chaque ressource un nombre de termes d’expansion proportionnellement au poids de cette ressource. Les méthodes proposées pour DER se concentrent sur l’élimination de la redondance entre les termes d’expansion sans se soucier si les termes sélectionnés couvrent effectivement les différents aspects de la requête. Pour pallier à cet inconvénient, nous introduisons dans la troisième contribution de cette thèse une nouvelle méthode pour DER au niveau des aspects. Notre méthode est entraînée de façon supervisée selon le principe que les termes reliés doivent correspondre au même aspect. Cette méthode permet de sélectionner des termes d’expansion à un niveau sémantique latent afin de couvrir autant que possible différents aspects de la requête. De plus, cette méthode autorise l’intégration de plusieurs ressources afin de suggérer des termes d’expansion, et supporte l’intégration de plusieurs contraintes telles que la contrainte de dispersion. Nous évaluons nos méthodes à l’aide des données de ClueWeb09B et de trois collections de requêtes de TRECWeb track et montrons l’utilité de nos approches par rapport aux méthodes existantes.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.