The relationship between stem-form, stand-closure and site -conditions : the influence of environmental conditions on tree allometry and forest structure in west-central Alberta

Changes in the configuration of a tree stern result insignificant differences in its total volume and in the proportion of that volume that is merchantable timber. Tree allometry, as represented by stem-fo~, is the result of the vertical force of gravity and the horizontal force of wind. The effect of wind force is demonstrated in the relationship between stem-form, standclosure and site-conditions. An increase in wind force on the individual tree due to a decrease in stand density should produce a more tapered tree. The density of the stand is determined by the conditions that the trees are growing under. The ability of the tree to respond to increased wind force may also be a function of these conditions . This stem-form/stand-closure/site-conditions relationship was examined using a pre-existing database from westcentral Alberta. This database consisted of environmental, vegetation, soils and timber data covering a wide range of sites. There were 653 sample trees with 82 variables that formed the basis of the analysis. There were eight tree species consisting of Pinus contorta, Picea mariana, Picea engelmannii x glauca, Abies lasiocarpa, Larix laricina, Populus tremuloides, Betula papyrifera and Populus balsamifera plus a comprehensive all-species data set. As the actual conformation of the stern is very individual, stem-fo~was represented by the diameter at breast height to total height r~tio. The four stand-closure variables, crown closure, total basal area, total volume and total number of stems were reduced to total basal area and total number of stems utilizing a bivariate correlation matrix by species. Site-conditions were subdivided into macro, meso and micro variables and reduced in number 3 using cross-tabulations, bivariate correlation and principal components analysis as screening tools. The stem-fo~/stand-closure relationship was examined using bivariate correlation coefficients for stem-fo~ with total number of stems and stem-fo~ with total basal area. The stem-fo~/site-conditions and the stand-closure/site- conditions relationships were examined using multiple correlation coefficients. The stem-form/stand-closure/site-conditions relationship was examined using multiple correlation coefficients in separate analyses for both total number of stems and total basal area. An increase in stand-closure produced a decrease in stem-form for both total number of stems and total basal area for most species. There was a significant relationship between stem-form and site-conditions and between stand-closure and site-conditions for both total number of stems and total basal area for most species. There was a significant relationship between the stemform and site-conditions, including the stand-closure, for most species; total number of stems was involved independently of the site-conditions in the prediction of stem-form and total basal area was not. Larix laricina and Betula papyrifera were the exceptions to the trends observed with most species. The influence of both stand-closure (total number of stems in particular) and site-conditions (elevation in particular) suggest that forest management practices should include these- ecological parameters in determining appropriate restocking levels.

Joyce Chapman posing by an orange tree, 1998

Joyce Chapman posing by an orange tree, West Covina, California, 1998.

Excavating a fossilized tree that is now in front of Hashinger Hall

Excavating a fossilized tree, which was later placed in front of Hashinger Hall, Chapman University, 346 N. Center Street, Orange, California. The late Dr. Edward H. Hashinger, former trustee and past chairman of the board is the man whose name has graced the walls of this building since 1969. The Hashinger Science Center (3 floors, 65,364 sq.ft.) houses all science departments including biology, natural and applied sciences, environmental and chemical sciences, food science and nutrition, kinesiology and physical therapy.

Placing a fossilized tree in front of Hashinger Hall, Chapman College, Orange, California

Placing a fossilized tree in front of Hashinger Hall, Chapman College, 346 N. Center Street, Orange, California. The late Dr. Edward H. Hashinger, former trustee and past chairman of the board is the man whose name has graced the walls of this building since 1969. The Hashinger Science Center (3 floors, 65,364 sq.ft.) houses all science departments including biology, natural and applied sciences, environmental and chemical sciences, food science and nutrition, kinesiology and physical therapy.

Extending relAPS to first order logic

RelAPS is an interactive system assisting in proving relation-algebraic theorems. The aim of the system is to provide an environment where a user can perform a relation-algebraic proof similar to doing it using pencil and paper. The previous version of RelAPS accepts only Horn-formulas. To extend the system to first order logic, we have defined and implemented a new language based on theory of allegories as well as a new calculus. The language has two different kinds of terms; object terms and relational terms, where object terms are built from object constant symbols and object variables, and relational terms from typed relational constant symbols, typed relational variables, typed operation symbols and the regular operations available in any allegory. The calculus is a mixture of natural deduction and the sequent calculus. It is formulated in a sequent style but with exactly one formula on the right-hand side. We have shown soundness and completeness of this new logic which verifies that the underlying proof system of RelAPS is working correctly.

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.

Tree Fruit (peach) Nursery - Report done for the University of Guelph

A report done by Donald Ziraldo on the topic of Tree Fruit, specifically peach, in nurseries. The report was likely done while he was a student of the University of Guelph in the 1970s.

Photograph - Percy Band standing by a tree

A photograph of Percy Band wearing a suit as he stands in front of a large tree. A house can be seen just behind the tree.

Photograph - Woman Standing by a Large Tree Trunk

A woman wearing a hat and holding a small purse. She is standing next to a large tree trunk and there are benches behind her.

The tree of knowledge ; a document by a woman

UANL

Methodology in Economics: the Logic of Appraisal

This Paper Intends to Develop a Coherent Methodological Framework Concerned with the Appraisal of Scientific Theories in Economics, and Which Is Based on a Postulated Aim of Science. We First Define the Scope of a Methodological Inquiry (Precise Definition of What Is Meant by the Logic of Appraisal of Scientific Theories) and Review the Work of Popper and Lakatos in the Philosophy of Science. We Then Use Their Results to Develop a Rational Structure of Scientific Activity. We Identify and Analyse Both a Micro and Macro Framework for the Process of Appraisal and Single Out the Importance of So-Called 'Fundamental Assumptions' in Creating Externalities in the Appraisal Process Which Forces Us to Adop a Multi-Level Analysis. Special Attention Is Given to the Role and Significance of the Abstraction Process and the Use of Assumptions in General. the Proposed Structure of Scientific Activity Is Illustrated with Examples From Economics.

Computation and Analysis of Multiple Structural-Change Models

In a recent paper, Bai and Perron (1998) considered theoretical issues related to the limiting distribution of estimators and test statistics in the linear model with multiple structural changes. In this companion paper, we consider practical issues for the empirical applications of the procedures. We first address the problem of estimation of the break dates and present an efficient algorithm to obtain global minimizers of the sum of squared residuals. This algorithm is based on the principle of dynamic programming and requires at most least-squares operations of order O(T 2) for any number of breaks. Our method can be applied to both pure and partial structural-change models. Secondly, we consider the problem of forming confidence intervals for the break dates under various hypotheses about the structure of the data and the errors across segments. Third, we address the issue of testing for structural changes under very general conditions on the data and the errors. Fourth, we address the issue of estimating the number of breaks. We present simulation results pertaining to the behavior of the estimators and tests in finite samples. Finally, a few empirical applications are presented to illustrate the usefulness of the procedures. All methods discussed are implemented in a GAUSS program available upon request for non-profit academic use.

Algorithmes pour la réconciliation d’un arbre de gènes avec un arbre d’espèces

Une réconciliation entre un arbre de gènes et un arbre d’espèces décrit une histoire d’évolution des gènes homologues en termes de duplications et pertes de gènes. Pour inférer une réconciliation pour un arbre de gènes et un arbre d’espèces, la parcimonie est généralement utilisée selon le nombre de duplications et/ou de pertes. Les modèles de réconciliation sont basés sur des critères probabilistes ou combinatoires. Le premier article définit un modèle combinatoire simple et général où les duplications et les pertes sont clairement identifiées et la réconciliation parcimonieuse n’est pas la seule considérée. Une architecture de toutes les réconciliations est définie et des algorithmes efficaces (soit de dénombrement, de génération aléatoire et d’exploration) sont développés pour étudier les propriétés combinatoires de l’espace de toutes les réconciliations ou seulement les plus parcimonieuses. Basée sur le processus classique nommé naissance-et-mort, un algorithme qui calcule la vraisemblance d’une réconciliation a récemment été proposé. Le deuxième article utilise cet algorithme avec les outils combinatoires décrits ci-haut pour calculer efficacement (soit approximativement ou exactement) les probabilités postérieures des réconciliations localisées dans le sous-espace considéré. Basé sur des taux réalistes (selon un modèle probabiliste) de duplication et de perte et sur des données réelles/simulées de familles de champignons, nos résultats suggèrent que la masse probabiliste de toute l’espace des réconciliations est principalement localisée autour des réconciliations parcimonieuses. Dans un contexte d’approximation de la probabilité d’une réconciliation, notre approche est une alternative intéressante face aux méthodes MCMC et peut être meilleure qu’une approche sophistiquée, efficace et exacte pour calculer la probabilité d’une réconciliation donnée. Le problème nommé Gene Tree Parsimony (GTP) est d’inférer un arbre d’espèces qui minimise le nombre de duplications et/ou de pertes pour un ensemble d’arbres de gènes. Basé sur une approche qui explore tout l’espace des arbres d’espèces pour les génomes considérés et un calcul efficace des coûts de réconciliation, le troisième article décrit un algorithme de Branch-and-Bound pour résoudre de façon exacte le problème GTP. Lorsque le nombre de taxa est trop grand, notre algorithme peut facilement considérer des relations prédéfinies entre ensembles de taxa. Nous avons testé notre algorithme sur des familles de gènes de 29 eucaryotes.

Categorical quantum computation

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Reliable computation for geometric models

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal