The Experts below are selected from a list of 51696 Experts worldwide ranked by ideXlab platform
Eugene A. Vaganov - One of the best experts on this subject based on the ideXlab platform.
-
an Interpreted Language implementation of the vaganov shashkin tree ring proxy system model
Dendrochronologia, 2020Co-Authors: Kevin J. Anchukaitis, Michael N. Evans, Malcolm K. Hughes, Eugene A. VaganovAbstract:Abstract We describe the implementation of the Vaganov–Shashkin tree-ring growth model (VSM) in MATLAB. VSM, originally written in Fortran, mimics subdaily and daily resolution processes of cambial growth as a function of soil moisture, air temperature, and insolation, with environmental forcing modeled as the principle of limiting factors. The re-implementation in a high level Interpreted Language, while sacrificing speed, provides opportunities to systematically evaluate model parameters, generate large ensembles of simulated tree-ring chronologies, and embed proxy system modeling within data assimilation approaches to climate reconstruction. We provide a versioned code repository and examples of model applications which permit process-level understanding of tree ring width variations in response to environmental variations and boundary conditions.
-
An Interpreted Language implementation of the Vaganov–Shashkin tree-ring proxy system model
Dendrochronologia, 2020Co-Authors: Kevin J. Anchukaitis, Michael N. Evans, Malcolm K. Hughes, Eugene A. VaganovAbstract:Abstract We describe the implementation of the Vaganov–Shashkin tree-ring growth model (VSM) in MATLAB. VSM, originally written in Fortran, mimics subdaily and daily resolution processes of cambial growth as a function of soil moisture, air temperature, and insolation, with environmental forcing modeled as the principle of limiting factors. The re-implementation in a high level Interpreted Language, while sacrificing speed, provides opportunities to systematically evaluate model parameters, generate large ensembles of simulated tree-ring chronologies, and embed proxy system modeling within data assimilation approaches to climate reconstruction. We provide a versioned code repository and examples of model applications which permit process-level understanding of tree ring width variations in response to environmental variations and boundary conditions.
Kevin J. Anchukaitis - One of the best experts on this subject based on the ideXlab platform.
-
an Interpreted Language implementation of the vaganov shashkin tree ring proxy system model
Dendrochronologia, 2020Co-Authors: Kevin J. Anchukaitis, Michael N. Evans, Malcolm K. Hughes, Eugene A. VaganovAbstract:Abstract We describe the implementation of the Vaganov–Shashkin tree-ring growth model (VSM) in MATLAB. VSM, originally written in Fortran, mimics subdaily and daily resolution processes of cambial growth as a function of soil moisture, air temperature, and insolation, with environmental forcing modeled as the principle of limiting factors. The re-implementation in a high level Interpreted Language, while sacrificing speed, provides opportunities to systematically evaluate model parameters, generate large ensembles of simulated tree-ring chronologies, and embed proxy system modeling within data assimilation approaches to climate reconstruction. We provide a versioned code repository and examples of model applications which permit process-level understanding of tree ring width variations in response to environmental variations and boundary conditions.
-
An Interpreted Language implementation of the Vaganov–Shashkin tree-ring proxy system model
Dendrochronologia, 2020Co-Authors: Kevin J. Anchukaitis, Michael N. Evans, Malcolm K. Hughes, Eugene A. VaganovAbstract:Abstract We describe the implementation of the Vaganov–Shashkin tree-ring growth model (VSM) in MATLAB. VSM, originally written in Fortran, mimics subdaily and daily resolution processes of cambial growth as a function of soil moisture, air temperature, and insolation, with environmental forcing modeled as the principle of limiting factors. The re-implementation in a high level Interpreted Language, while sacrificing speed, provides opportunities to systematically evaluate model parameters, generate large ensembles of simulated tree-ring chronologies, and embed proxy system modeling within data assimilation approaches to climate reconstruction. We provide a versioned code repository and examples of model applications which permit process-level understanding of tree ring width variations in response to environmental variations and boundary conditions.
Denis Paperno - One of the best experts on this subject based on the ideXlab platform.
-
limitations in learning an Interpreted Language with recurrent models
Empirical Methods in Natural Language Processing, 2018Co-Authors: Denis PapernoAbstract:In this submission I report work in progress on learning simplified Interpreted Languages by means of recurrent models. The data is constructed to reflect core properties of natural Language as modeled in formal syntax and semantics. Preliminary results suggest that LSTM networks do generalise to compositional interpretation, albeit only in the most favorable learning setting.
-
Limitations in learning an Interpreted Language with recurrent models
arXiv: Computation and Language, 2018Co-Authors: Denis PapernoAbstract:In this submission I report work in progress on learning simplified Interpreted Languages by means of recurrent models. The data is constructed to reflect core properties of natural Language as modeled in formal syntax and semantics: recursive syntactic structure and compositionality. Preliminary results suggest that LSTM networks do generalise to compositional interpretation, albeit only in the most favorable learning setting, with a well-paced curriculum, extensive training data, and left-to-right (but not right-to-left) composition.
-
BlackboxNLP@EMNLP - Limitations in learning an Interpreted Language with recurrent models
Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP, 2018Co-Authors: Denis PapernoAbstract:In this submission I report work in progress on learning simplified Interpreted Languages by means of recurrent models. The data is constructed to reflect core properties of natural Language as modeled in formal syntax and semantics. Preliminary results suggest that LSTM networks do generalise to compositional interpretation, albeit only in the most favorable learning setting.
Hannes Leitgeb - One of the best experts on this subject based on the ideXlab platform.
-
Truth as Translation – Part B
Journal of Philosophical Logic, 2001Co-Authors: Hannes LeitgebAbstract:This is the second part of a paper dealing with truth and translation. In Part A a revised version of Tarski's Convention T has been presented, which explicitly refers to a translation mapping from the object Language to the metaLanguage; the vague notion of a translation has been replaced by a precise definition. At the end of Part A it has been shown that Interpreted Languages exist, which allow for vicious self-reference but which nevertheless contain their own truth predicate – this is possible if truth is based on a nonstandard translation mapping. However, this result has only been proved for Languages without quantifiers. In Part B we now extend the result to first-order Languages, and we show that this can be done in three different ways. In each case, the addition of a truth predicate to an Interpreted Language with a high degree of expressiveness leads to changes in the ontology of the Language.
-
Truth as Translation – Part A
Journal of Philosophical Logic, 2001Co-Authors: Hannes LeitgebAbstract:According to Tarski's Convention T, the adequacy of a truth definition is (implicitly) defined relatively to a translation mapping from the object Language to the metaLanguage; the translation mapping itself is left unspecified. This paper restates Convention T in a form in which the relativity to translation is made explicit. The notion of an Interpreted Language is introduced, and a corresponding notion of a translation between Interpreted Languages is defined. The latter definition is stated both in an algebraic version, and in an equivalent possible worlds version. It is a consequence of our definition that translation is indeterminate in certain cases. Finally, we give an application of our revised version of Convention T and show that Interpreted Languages exist, which allow for vicious self-reference but which nevertheless contain their own truth predicate. This is possible if only truth is based on a nonstandard translation mapping by which, e.g., the Liar sentence is translated to its own negation. In this part of the paper this existence result is proved only for Languages without quantifiers; in Part B the result will be extended to first-order Languages.
-
Truth as translation : Part A and part B
Journal of Philosophical Logic, 2001Co-Authors: Hannes LeitgebAbstract:According to Tarski's Convention T, the adequacy of a truth definition is (implicitly) defined relatively to a translation mapping from the object Language to the metaLanguage; the translation mapping itself is left unspecified. This paper restates Convention T in a form in which the relativity to translation is made explicit. The notion of an Interpreted Language is introduced, and a corresponding notion of a translation between Interpreted Languages is defined. The latter definition is stated both in an algebraic version, and in an equivalent possible worlds version. It is a consequence of our definition that translation is indeterminate in certain cases. Finally, we give an application of our revised version of Convention T and show that Interpreted Languages exist, which allow for vicious self-reference but which nevertheless contain their own truth predicate. This is possible if only truth is based on a nonstandard translation mapping by which, e.g., the Liar sentence is translated to its own negation. In this part of the paper this existence result is proved only for Languages without quantifiers; in Part B the result will be extended to first-order Languages.
Michael N. Evans - One of the best experts on this subject based on the ideXlab platform.
-
an Interpreted Language implementation of the vaganov shashkin tree ring proxy system model
Dendrochronologia, 2020Co-Authors: Kevin J. Anchukaitis, Michael N. Evans, Malcolm K. Hughes, Eugene A. VaganovAbstract:Abstract We describe the implementation of the Vaganov–Shashkin tree-ring growth model (VSM) in MATLAB. VSM, originally written in Fortran, mimics subdaily and daily resolution processes of cambial growth as a function of soil moisture, air temperature, and insolation, with environmental forcing modeled as the principle of limiting factors. The re-implementation in a high level Interpreted Language, while sacrificing speed, provides opportunities to systematically evaluate model parameters, generate large ensembles of simulated tree-ring chronologies, and embed proxy system modeling within data assimilation approaches to climate reconstruction. We provide a versioned code repository and examples of model applications which permit process-level understanding of tree ring width variations in response to environmental variations and boundary conditions.
-
An Interpreted Language implementation of the Vaganov–Shashkin tree-ring proxy system model
Dendrochronologia, 2020Co-Authors: Kevin J. Anchukaitis, Michael N. Evans, Malcolm K. Hughes, Eugene A. VaganovAbstract:Abstract We describe the implementation of the Vaganov–Shashkin tree-ring growth model (VSM) in MATLAB. VSM, originally written in Fortran, mimics subdaily and daily resolution processes of cambial growth as a function of soil moisture, air temperature, and insolation, with environmental forcing modeled as the principle of limiting factors. The re-implementation in a high level Interpreted Language, while sacrificing speed, provides opportunities to systematically evaluate model parameters, generate large ensembles of simulated tree-ring chronologies, and embed proxy system modeling within data assimilation approaches to climate reconstruction. We provide a versioned code repository and examples of model applications which permit process-level understanding of tree ring width variations in response to environmental variations and boundary conditions.
