No description available.

A regular paving (RP) is a finite succession of bisections that partitions a multidimensional box into sub-boxes using a binary tree-based data structure, with the restriction that an existing sub-box in the partition may only be bisected on its first widest side. Mapping a real value to each element of the partition gives a real-mapped regular paving (RMRP) that can be used to represent a piecewise-constant function density estimate on a multidimensional domain. The RP structure allows real arithmetic to be extended to density estimates represented as RMRPs. Other operations such as computing marginal and conditional functions can also be carried out very efficiently by exploiting these arithmetical properties and the binary tree structure. The purpose of this thesis is to explore the potential for density estimation using RPs. The thesis is structured in three parts. The first part formalises the operational properties of RP-structured density estimates. The next part considers methods for creating a suitable RP partition for an RMRP-structured density estimate. The advantages and disadvantages of a Markov chain Monte Carlo algorithm, already developed, are investigated and this is extended to include a semi-automatic method for heuristic diagnosis of convergence of the chain. An alternative method is also proposed that uses an RMRP to approximate a kernel density estimate. RMRP density estimates are not differentiable and have slower convergence rates than good multivariate kernel density estimators. The advantages of an RMRP density estimate relate to its operational properties. The final part of this thesis describes a new approach to Bayesian inference for complex models with intractable likelihood functions that exploits these operational properties.

This literature-based thesis studies the phenomenon of the regular plural inside compounds according to Giegerich’s (1999) stratal model of English morphology. The strata of his model are defined by their bases: stratum 1 is root-based and stratum 2 is word-based. The model overcomes the failings associated with earlier stratal models defined by their affixes (e.g., Kiparsky, 1982). However, assigning compounding and the regular plural to the same word stratum following Giegerich’s (1999) model leaves an open question in terms of what restricts the interaction between both rules to prevent the generation of ill-formed compounds such as *toys box and *trucks driver. Another question emerges: Should the regular plural inflection be assigned to stratum 2? This question is important because the answer affects how we discuss the interaction between the regular plural and compounding. For example, how do we account for the interaction between a stratum-2 rule and a syntactic rule if we are not dealing with an interaction of two lexical rules at the same stratum? This thesis challenges the theory that inflectional morphology is separate from the lexicon (Anderson, 1988, 1982; Perlmutter, 1988) with supporting evidence from the properties of the possessive inflection. This research contributes significantly to the literature in its analysis of a number of compounds within texts extracted from books, which demonstrates that the internal regular plural morpheme has an evident semantic function that restricts it from appearing inside compounds (that is, on stratum 2 of the base-driven stratification model). The study thereby challenges Lieber and Štekauer’s (2009) view that the internal regular plural morpheme is purposeless and therefore should be regarded as a linking element. I also argue that the possessive inflection is assigned to stratum 2 and can interact with compounding to form possessive compounds, but is restricted by the semantic feature of the non-head element.

Etant donné trois entiers k, s et a, nous prouvons dans le premier chapitre qu'il existe un graphe k-régulier fini (resp. un graphe k-régulier connexe fini) dont le groupe d'automorphismes a exactement s orbites sur l'ensemble des sommets et a orbites sur l'ensemble des arêtes si et seulement si (s,a)=(1,0) si k=0, (s,a)=(1,1) si k=1, s=a>0 si k=2, 0< s <= 2a <= 2ks si k>2. (resp. (s,a)=(1,0) si k=0, (s,a)=(1,1) si k=1 ou 2, s-1<=a<=(k-1)s+1 et s,a>0 si k>2.) Nous étudions les polyèdres convexes de R³ dans le second chapitre. Pour tout polyèdre convexe P, nous notons Isom(P) l'ensemble des isométries de R³ laissant P invariant. Si G est un sous-groupe de Isom(P), le f_G-vecteur de P est le triple d'entiers (s,a,f) tel que G ait exactement s orbites sur l'ensemble sommets de P, a orbites sur l'ensemble des arêtes de P et f orbites sur l'ensemble des faces de P. Remarquons que (s,a,f) est le f_{id}-vecteur (appelé f-vecteur dans la littérature) d'un polyèdre si ce dernier possède exactement s sommets, a arêtes et f faces. Nous généralisons un théorème de Steinitz décrivant tous les f-vecteurs possibles. Pour tout groupe fini G d'isométries de R³, nous déterminons l'ensemble des triples (s,a,f) pour lesquels il existe un polyèdre convexe ayant (s,a,f) comme f_G-vecteur. Ces résultats nous permettent de caractériser les triples (s,a,f) pour lesquels il existe un polyèdre convexe tel que Isom(P) a s orbites sur l'ensemble des sommets, a orbites sur l'ensemble des arêtes et f orbites sur l'ensemble des faces. La structure d'incidence I(P) associée à un polyèdre P consiste en la donnée de l'ensemble des sommets de P, l'ensemble des arêtes de P, l'ensemble des faces de P et de l'inclusion entre ces différents éléments (la notion de distance ne se trouve pas dans I(P)). Nous déterminons également l'ensemble des triples d'entiers (s,a,f) pour lesquels il existe une structure d'incidence I(P) associée à un polyèdre P dont le groupe d'automorphismes a exactement s orbites de sommets, a orbites d'arêtes et f orbites de sommets.

<p>Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. DFAs take strings of symbols (words) as input, and produce a binary classification as output, indicating whether the word belongs to the language or not. There are two types of learning algorithms for DFAs: passive and active learning algorithms. In passive learning, the set of positive and negative examples is given and not chosen by inference algorithm. In contrast, in active learning, the learning algorithm chooses examples from which a model is constructed.</p><p>Active learning was introduced in 1987 by Dana Angluin. She presented the L* algorithm for learning DFAs by asking membership and equivalence queries to a teacher who knows the regular language accepted by DFA to be learned. A membership query checks whether a word belongs to the language or not. An equivalence query checks whether a hypothesized model is equivalent to the DFA to be learned.The L* algorithm has been found to be useful in different areas, including black box checking, compositional verification and integration testing. There are also other algorithms similar to L* for regular inference. However, the learning of timed systems has not been studied before. This thesis presents algorithms for learning timed systems in an active learning framework.</p><p>As a model of timed system we choose event-recording automata (ERAs), a determinizable subclass of the widely used timed automata. The advantages of ERA in comparison with timed automata, is that it is known priori the set of clocks of an ERA and when clocks are reset. The contribution of this thesis is four algorithms for learning deterministic event-recording automaton (DERA). Two algorithms learn a subclass of DERA, called event-deterministic ERA (EDERA) and two algorithms learn general DERA.</p><p>The problem with DERAs that they do not have canonical form. Therefore we focus on subclass of DERAs that have canonical representation, EDERA, and apply the L* algorithm to learn EDERAs. The L* algorithm in timed setting requires a procedure that learns clock guards of DERAs. This approach constructs EDERAs which are exponentially bigger than automaton to be learned. Another procedure can be used to lean smaller EDERAs, but it requires to solve NP-hard problem.</p><p>We also use the L* algorithm to learn general DERA. One drawback of this approach that inferred DERAs have a form of region graph and there is blow-up in the number of transitions. Therefore we introduce an algorithm for learning DERA which uses a new data structure for organising results of queries, called a timed decision tree, and avoids region graph construction. Theoretically this algorithm can construct bigger DERA than the L* algorithm, but in the average case we expect better performance.</p>

The Augustinian canons have never enjoyed the level of scholarly attention afforded to the monastic and mendicant movements of the central middle ages. This disparity has been particularly acute in the British Isles, despite being its most prolific religious movement. Scholars working in England, Ireland, and Wales have begun to correct this historiographical lacuna. In Scotland, the regular canons have also received comparatively scant attention, and, indeed, have largely been understood on the basis of imported paradigms. Therefore, the purpose of this study is to address a deficiency in Scottish historiography and make a contribution to the growing scholarship on the regular canons in the British Isles. The regular canonical movement is examined within the kingdom of Scotland over the course of roughly a century. Eleven non-congregational houses of regular canons are considered, namely Scone, Holyrood, Jedburgh, St. Andrews, Cambuskenneth, and Inchcolm and the dependencies of Loch Tay, Loch Leven, Restenneth, Canonbie, and St. Mary’s Isle. The kingdom of Scotland provides both a common context, and a diverse milieu, in which to consider the foundation and development of these institutions and the movement as a whole. The chronological parameters have been determined by the foundation of the first house of regular canons in Scotland in c. 1120 and the Fourth Lateran Council in 1215, which had the effect of artificially creating the Order of St Augustine. By examining individual houses separately, as well as in unison, this study seeks to present an integrated picture of the regular canonical movement in the kingdom of Scotland during the period of its organic development from c. 1120 to 1215. The fundamental question concerning the regular canons is the nature of their vocation and their societal function. It has increasingly been recognised that a spectrum of different interpretations of canonical life existed ranging from the active – pastoral, practical, and outward looking – to the contemplative – ascetic, quasi-eremitical, and inward looking – which were all part of the same decentralised religious movement. This thesis attempts to situate the Scottish Augustinians, as far as possible, within this spectrum. It argues that a unique manifestation of the regular canonical movement emerged in the kingdom of Scotland as the result of a range of factors – including shared patrons, leadership, and episcopal support – which had the effect of creating a group identity, and, thereby, a collective understanding of their vocation and role in society. The subject institutions have been particularly fortunate in terms of the quality and variety of the surviving source material. The evidence is comprised principally of charter material, but also includes chronicles and foundation narratives produced by Scottish Augustinians, and these provide an essential supplement. This thesis sheds light on an important group of religious houses in Scotland and on a complex religious movement that is only beginning to be fully understood, and, thus, it is hoped that this study will lay the groundwork for future research.

Methods to automatically extract and validate data from the chemical literature in legacy formats to machine-understandable forms are examined. The work focuses of three types of data: analytical data reported in articles, computational chemistry output files and crystallographic information files (CIFs). It is shown that machines are capable of reading and extracting analytical data from the current legacy formats with high recall and precision. Regular expressions cannot identify chemical names with high precision or recall but non-deterministic methods perform significantly better. The lack of machine-understandable connection tables in the literature has been identified as the major issue preventing molecule-based data-driven science being performed in the area. The extraction of data from computational chemistry output files using parser-like approaches is shown to be not generally possible although such methods work well for input files. A hierarchical regular expression based approach can parse > 99.9% of the output files correctly although significant human input is required to prepare the templates. CIFs may be parsed with extremely high recall and precision, contain connection tables and the data is of high quality. The comparison of bond lengths calculated by two computational chemistry programs show good agreement in general but structures containing specific moieties cause discrepancies. An initial protocol for the high-throughput geometry optimisation of molecules extracted from the CIFs is presented and the refinement of this protocol is discussed. Differences in bond length between calculated and experimentally determined values from the CIFs of less than 0.03 Angstrom are shown to be expected by random error. The final protocol is used to find high-quality structures from crystallography which can be reused for further science.

No description available.

Submitted by Marcos Anselmo (marcos.anselmo@unipampa.edu.br) on 2016-09-08T14:29:39Z No. of bitstreams: 2 MARILIA AVILA VALANDRO ok.pdf: 1044698 bytes, checksum: 07606147cdffad848dc4db44d0162dd3 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Approved for entry into archive by Marcos Anselmo (marcos.anselmo@unipampa.edu.br) on 2016-09-08T14:30:12Z (GMT) No. of bitstreams: 2 MARILIA AVILA VALANDRO ok.pdf: 1044698 bytes, checksum: 07606147cdffad848dc4db44d0162dd3 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2016-09-08T14:30:12Z (GMT). No. of bitstreams: 2 MARILIA AVILA VALANDRO ok.pdf: 1044698 bytes, checksum: 07606147cdffad848dc4db44d0162dd3 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2016-03-29 / A endocardiose valvar (EV) é a cardiopatia mais prevalente na espécie canina, capaz de alterar o balanço autonômico pela ativação crônica do sistema nervoso simpático, relacionado ao risco de morte súbita e pior prognóstico. Diversos programas de treinamento com caminhada foram eficazes no restabelecimento do equilíbrio autonômico em seres humanos cardiopata, verificados a luz da variabilidade da frequência cardíaca (VFC). Dessa forma, objetivou-se avaliar o efeito de oito semanas de caminhada, realizadas três vezes por semana, durante 30 a 50 minutos, de moderada intensidade (60 a 80% da frequência cardíaca máxima), sobre a função autonômica cardíaca de cães com EV, utilizando a VFC no domínio do tempo e da frequência como ferramenta. Para tanto, 20 cães com EV foram divididos em dois grupos: grupo controle - não treinado (GC, n=9) e grupo treinamento (GT, n=11), e avaliados nos momentos basal (T0), quatro semanas (T1) e oito semanas (T2). No domínio do tempo, a variável média rMSSD (raiz quadrada da média ao quadrado das diferenças sucessivas entre os intervalos NN) foi maior no GT em quatro (155,5+42,07) e oito semanas (199,8+83,54) em relação ao GC (91,17+35,79 e 88,17+57,51) (p<0,05). No domínio da frequência, a variável High Frequency (HF) foi a mais representativa, e apresentou aumento no GT (30950+25810) após quatro semanas quando comparado ao GC (19090+23210) (p<0,05) e dentro do grupo GT após oito semanas de treinamento (40300+33870) em relação à avaliação basal (29340+20950) (p<0,05). As demais variáveis não sofreram influências do programa de treinamento proposto. Esses resultados demonstram que o treinamento físico com a utilização de caminhadas foi capaz de alterar a VFC, indicando uma maior participação parassimpática em cães com EV. / Valvular endocardiosis is the most prevalent cardiopathy in canine specie. This disease is able to change autonomic balance, which is related to sudden death and worse prognostic, through chronic activation of sympathetic nervous system. Looking at heart rate variability, various walk training plans were efficient for the autonomic balance reestablishment in cardiophats people. In this way, this study focused on evaluate the effect of 8 weeks walking plan on cardiac autonomic function of dogs with valvular endocardiosis. These walking plans were consisted of moderated intensity walking (reaching from 60 to 80% of maximum heart rate) during 30 to 50 minutes, three times a week. Heart rate variability was analyzed by utilizing time and frequency domain as a tool. Thus, 20 dogs with valvular endocardiosis were divided into two groups: Control group, with no training (CG, n=9), and Training group (TG, n=11). They were evaluated at basal moment (T0), 4 weeks (T1), and 8 weeks (T2). At time domain, only the medium variable rMSSD (the root mean square of successive differences between the square NN intervals) was higher in the TG in four (155.5+42.07) and eight weeks (199.8+83.54) than CG (91.17+35.79 and 88.17+57.51) (p<0.05). At frequency domain, the high frequency variable was the most representative and after four weeks, it showed higher on TG (30950+25810) than CG (19090+23210) (p<0.05). After eight weeks, within TG there was higher frequency (40300+33870) when compared to basal evaluation (29340+20950) (p<0.05). The proposed training program did not affect the other variables. These results suggest that the physical training with utilization of walking plans were able to change the heart rate variability what indicated a higher parasimpathetic participation of dogs with valvular endocardiosis.

If every vertex in a graph G has the same degree, then the graph is called a regular graph. That is, if deg(v) = r for all vertices in the graph, then it is denoted as an r-regular graph. A graph G is said to be vertex-weighted if all of the vertices are assigned weights. A generalized definition for degree regularity for vertex-weighted graphs can be stated as follows: A vertex-weighted graph is said to be rw-regular if the sum of the weights in the neighborhood of every vertex is rw. If all vertices are assigned the unit weight of 1, then this is equivalent to the definition for r-regular graphs. In this thesis, we determine if a graph has a weighting scheme that makes it a weighted regular graph or prove no such scheme exists for a number of special classes of graphs such as paths, stars, caterpillars, spiders and wheels.