Este trabalho é o resultado da pesquisa lexicográfico-toponímica dos topônimos de cabeceiras, córregos, morros, ribeirões, rios, serras, vazantes, etc. registrados nos mapas e cartas topográficas dos 22 (vinte e dois) municípios que compõem a mesorregião Sudeste Mato-grossense. Os topônimos individualizam os acidentes físicos ou antrópicos, possibilitam uma localização específica dentro de um espaço geográfico amplo, concorrem para delimitar ou unir áreas em um determinado contexto territorial, seja ele, rural ou urbano e demonstram pela amplitude e variedade, extenso campo de estudo para a pesquisa lexicológica. O ato de denominar contribui para diferenciar e, até mesmo, para especificar algo ou alguém que de certo modo apresentava-se igual aos da mesma espécie. O estudo dos nomes próprios de lugares denomina-se Toponímia que é uma das subdivisões da Onomástica. O nome de lugar ou topônimo constitui-se, portanto, o principal objeto de estudo em uma pesquisa lexicográfico-toponímica e, muitas vezes, traz em seu bojo expressiva riqueza histórico-cultural. A conclusão desta pesquisa representa também a elaboração de mais uma etapa do Atlas Toponímico do Estado de Mato Grosso (ATEMT), vinculado ao Projeto ATB Atlas Toponímico do Brasil. As taxionomias de natureza física destacam-se dentre os topônimos pesquisados e constata-se expressivo registro de topônimos de etimologia bororo e tupi. / This study is a result fo a lexicographic-toponymic research of the headwaters, small tributary streams, hills, large streams, rivers, mountain ridges, low waters, etc. registered in the maps and topographic letters of the 22 (twenty-two) municipalities that are part of the Mato-grossense Southeastern mesoregion. The toponyms individualize the physical or human-caused accidents, make possible a specific localization within a wide geographic space, allow the delimitation or joining of areas in a certain territorial context, be it, rural or urban and show through wideness and variety, a vast study field for the lexicological research. The act of naming contributes to differentiate and, even, specify something or someone that in a certain way presented itself similar to those of the same species. The study of the proper names of places is called Toponymy which is one of the subdivisions of the Onomastics. The name of a place or toponymy is, therefore, the main object of study in a lexicographic-toponymic research and, many times, brings impressive historicalcultural wealth. The conclusion of this research also represents the elaboration of one more phase of the Toponymic Atlas of the State of Mato Grosso (ATEMT), linked to the ATB - Project Toponymic Atlas of Brazil. The taxonomies of a physical nature stand out among the researched toponyms and an expressive record of toponyms of bororo and tupi etymology is acknowledge.

As economies develop, novel products are created and markets for these products arise. Genetically modified food (GMF) is an example of such a novel product and provides economists with the opportunity to investigate an infant market. Of particular interest with GMF is the impact of consumer reactions on the market. The response of consumers to GMF and their willingness to pay for it has emerged as an important factor in the development of this technology. This research investigates these consumer responses. Prior research suggests that two aspects of consumer behaviour may be relevant for the GMF market. First, consumers may react differently to different types of GMF, so that some products are potentially more economically viable. Secondly, some consumers appear to prefer not having GMF at all. Consumer behaviour is often framed according to neoclassical economic theory. Consumer preferences over goods and the attributes of those goods are generally held to have certain properties. The aspects of consumers' reactions to GMF noted above, however, may be in conflict with two properties of preferences in neoclassical theory. First, preferences over food attributes are not separable, but may interact with each other. Secondly, some consumers may have preferences regarding GMF that are not continuous. As a result, aggregate impacts of introducing GMF may be difficult to measure, which raises a third issue for investigation, aggregation. Finally, an alternative model of consumer behaviour is bounded rationality, which theorises that choices may be discontinuous as a result of specific protocols. It also suggests that consumers seek to make good-enough choices, rather than attempting to maximise their satisfaction. Thus, optimisation or maximisation is the fourth issue considered in this thesis. In order to investigate these properties of consumers' preferences, a choice experiment survey was developed. The strength of a choice experiment for examining these issues is its focus on the impact of each product attribute on a respondent's choices. Thus, it may be possible to identify potentially discontinuous choice patterns and to identify choices affected by interactions between GM technology and other food attributes. Results from a neoclassical analysis of the survey data suggest that some consumers consider the type of benefit created with GM technology in making their choices. In addition, one-quarter to one-half of respondents may have had discontinuous preferences with respect to GMF. Reactions to GMF appear related to respondents' attitudes, but not to socio-economic or demographic descriptors. As a result, aggregate measures of the impact of GMF may not fully account for consumers' responses. A boundedly rational model also has reasonable goodness of fit, and may provide a different perspective on consumer behaviour. It is hoped that the results of this research provide a better understanding of consumer behaviour regarding GMF and, by extension, of the process of consumer adoption of novel products. It is further hoped that this attempt to incorporate choice protocols into discrete choice analysis will provide a useful example for further research.

En relativamente poco tiempo el mundo lexicográfico ha experimentado cambios radicales respecto a la producción, a la disponibilidad y al uso de los distintos recursos lexicográficos. Han surgido nuevos medios que, aunque no ti enen la búsqueda lexicográfica como primera función, bien pueden servir pa ra este objetivo: buscadores de internet, corpus de textos paralelos, foros electrónicos, medios social es, traductores automáticos, etc. En este contexto se plantean preguntas como qué papel desempeñan los distintos recursos lexicográficos en una búsqueda lexicográfica concreta, cuál es la combinación de ellos y cuál su cronología de uso. Este artículo profun diza en estas preguntas a base de un análisis del comportamiento lexicográfico en cinco leng uas extranjeras diferentes de 62 estudiantes de Administración de Empresas y, de esta manera, determina distintas estrategias de búsqueda.

The thesis is concerned with the substandard expressions of parts of the face in the French language, specifically with the synonyms of mouth, eyes, ears and nose. The theoretical part deals with the definition of slang in general, its history and word formation processes. The practical part presents synonyms of the given parts of the face, which are in the dictionary of slang Dictionnaire avec Bob and also introduces their occurrence in four French slang dictionaries, for example Argoji, and in four reference dictionaries, for example Le Petit Robert, where it compares their lexicographic marking. The thesis further deals with etymology of the synonyms and their Czech equivalents which examines in the parallel French-Czech corpus Intercorp. Last but not least, a questionnaire is implemented, which verifies the knowledge of the most frequent synonyms among native speakers of the French language. In conclusion, the thesis summarizes whether lexicographic marking differ from one reference dictionary to another and presents the most frequent synonyms and results of the questionnaire. Key words: lexicography, lexicographic marking, substandard French, dictionaries, face, Bob

Данная магистерская диссертация, выполненная в форме проекта, описывает опыт создания автором двуязычного (англо-русского) словаря коневодства. / This master degree project describes the author’s experience of creating an English-Russian dictionary of horse breeding vocabulary.

Thesis (MPhil)--Stellenbosch University, 2012. / ENGLISH ABSTRACT: The focus in this paper is on terms of endearment, and initially linking it with love, affection and care, which prominently feature in the oldest ancient languages. Users of dictionaries are motivated by finding and understanding the unbelievable variety of words in languages. In many faiths/religions people give credence to a perception that love and understanding of one another's needs and aspirations form the true basis of successful interpersonal relationships but as yet no consensus has been reached. The data was empirically collected through personal conversations with local people, including children, the young generation, parents and grandparents, staff of banks, supermarkets and bookshops. A distinction is made between terms generally used for kids, adults, men and women according to context in usage and the meanings thereof as reported by respondents, varying from seriously meant (dearest), to affectionate (darling, beloved) to mere superficial friendship (pal, love). As the focus was on Afrikaans which is the home language of the most residents in the Western Cape, according to information received from Statistics South Africa, and the knowledge as well as present usage of the word 'troetel' as a term of endearment, the English equivalents and additional similar terms are not of importance here. The impression is, however, that a special nuance of emotion is attached to the usage of the mentioned examples. Dictionaries should include terms of endearment known in the colloquial language at the time of their compilation and must be reliable sources of information regarding vocabulary, ways to address people and the varying degrees of communication in the wide distinguishable variety of contexts. / AFRIKAANSE OPSOMMING: Woordeboekverklarings vir die woord troetel sluit onder meer in met liefde behandel, liefkoos, streel en versorg. Hierdie besonder positiewe konnotasie het gelei na ʼn soekroete in die oudste antieke tale as vertrekpunt om die ontstaan, bekendheid en gebruik van hierdie woordjie in Afrikaans te probeer vasstel. Omdat liefde in verskeie gelowe as basis vir suksesvolle menseverhoudinge deur die eeue aanbeveel, uitgeleef of geopponeer is, en tog nog geen algemeen aanvaarde konsensus, ten spyte van al die slim argumente en beredenerings deur briljante geleerdes bereik is nie, kan troeteltaal wat meestal met ʼn ondertoon van ʼn nuanse van liefde gepaard gaan, gebruikstaal positief beïnvloed. Deur middel van onoffisiële proefvraelysies aan die publiek plaaslik en op die platteland en deur persoonlike empiriese navorsing in gemeenskappe is die verlangde inligting by oud en jonk versamel, bank-, supermark- en boekwinkelpersoneel se menings is ingewin. Daar is onderskei tussen troetel- of troetelverwante name vir babas tot jongmense en seniors, mans en dames, met betekenisse volgens konteks soos deur respondente verstrek. Alhoewel troetel as sulks nie by die jonger geslag juis algemeen, soos vroeër, bekend is nie, veral in dorpsgemeenskappe, kom dit nog redelik wyd in die Wes-Kaap, streek- en gesinsgebonde voor. Daar word probeer om leksikograwe te beïnvloed om meer aandag aan troetelwoordjies soos bokkie, dingetjie, kleintjie en pikkie in woordeboek te gee en die gebruik daarvan en krag daarin opgesluit by gebruikers te laat ervaar en weer in gebruik te laat herlewe, veral by ouers en jongmense. ʼn Doel van woordeboeke vir die algemene taalgebruiker is in hoofsaak om ʼn data-aanbod daar te stel wat verteenwoordigend is van die gewone omgangstaal in die tydsgewrig van samestelling, maar om verder ook as interessante inligtingsbronne van data in gebruikstaal te dien.

Many entrepreneurs and companies use loans to cover their business needs. Usually it is difficult to choose the best offer. The possible solution is the utilization of methods of multiple-criteria decision-making, which make the decision process easier. The goal of this thesis is to describe these methods and use them practically to choose the best loan offer. It was found out that most of the companies do not use these methods. The results are usually significantly affected by the criterion which was the most preferred. For the most of the companies the offer made by MONETA Money Bank, a.s. was the most favourable.

This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches previously employed to solve the problem: divide-and-conquer and factorizing permutations. It runs in linear-time, and is straightforward in its understanding, correctness, and implementation. It merely requires a collection of trees and simple traversals of these trees. The split-decomposition algorithm is similar in being straightforward in its understanding and correctness. An efficient implementation of the algorithm is described that uses the union-find data-structure. A novel charging argument is used to prove the running-time. The algorithm is the first to use the recent reformulation of split decomposition in terms of graph-labelled trees. This facilitates its extension to circle graph recognition. In particular, it allows us to efficiently apply a new lexicographic breadth-first search characterization of circle graphs developed in the thesis. Lexicographic breadth-first search is additionally responsible for the efficiency of the split decomposition algorithm, and contributes to the simplicity of the modular decomposition algorithm.

This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches previously employed to solve the problem: divide-and-conquer and factorizing permutations. It runs in linear-time, and is straightforward in its understanding, correctness, and implementation. It merely requires a collection of trees and simple traversals of these trees. The split-decomposition algorithm is similar in being straightforward in its understanding and correctness. An efficient implementation of the algorithm is described that uses the union-find data-structure. A novel charging argument is used to prove the running-time. The algorithm is the first to use the recent reformulation of split decomposition in terms of graph-labelled trees. This facilitates its extension to circle graph recognition. In particular, it allows us to efficiently apply a new lexicographic breadth-first search characterization of circle graphs developed in the thesis. Lexicographic breadth-first search is additionally responsible for the efficiency of the split decomposition algorithm, and contributes to the simplicity of the modular decomposition algorithm.

Ce travail contribue à la théorie de la décision possibiliste et plus précisément à la prise de décision séquentielle dans le cadre de la théorie des possibilités, à la fois au niveau théorique et pratique. Bien qu'attrayante pour sa capacité à résoudre les problèmes de décision qualitatifs, la théorie de la décision possibiliste souffre d'un inconvénient important : les critères d'utilité qualitatives possibilistes comparent les actions avec les opérateurs min et max, ce qui entraîne un effet de noyade. Pour surmonter ce manque de pouvoir décisionnel, plusieurs raffinements ont été proposés dans la littérature. Les raffinements lexicographiques sont particulièrement intéressants puisqu'ils permettent de bénéficier de l'arrière-plan de l'utilité espérée, tout en restant "qualitatifs". Cependant, ces raffinements ne sont définis que pour les problèmes de décision non séquentiels. Dans cette thèse, nous présentons des résultats sur l'extension des raffinements lexicographiques aux problèmes de décision séquentiels, en particulier aux Arbres de Décision et aux Processus Décisionnels de Markov possibilistes. Cela aboutit à des nouveaux algorithmes de planification plus "décisifs" que leurs contreparties possibilistes. Dans un premier temps, nous présentons des relations de préférence lexicographiques optimistes et pessimistes entre les politiques avec et sans utilités intermédiaires, qui raffinent respectivement les utilités possibilistes optimistes et pessimistes. Nous prouvons que les critères proposés satisfont le principe de l'efficacité de Pareto ainsi que la propriété de monotonie stricte. Cette dernière garantit la possibilité d'application d'un algorithme de programmation dynamique pour calculer des politiques optimales. Nous étudions tout d'abord l'optimisation lexicographique des politiques dans les Arbres de Décision possibilistes et les Processus Décisionnels de Markov à horizon fini. Nous fournissons des adaptations de l'algorithme de programmation dynamique qui calculent une politique optimale en temps polynomial. Ces algorithmes sont basés sur la comparaison lexicographique des matrices de trajectoires associées aux sous-politiques. Ce travail algorithmique est complété par une étude expérimentale qui montre la faisabilité et l'intérêt de l'approche proposée. Ensuite, nous prouvons que les critères lexicographiques bénéficient toujours d'une fondation en termes d'utilité espérée, et qu'ils peuvent être capturés par des utilités espérées infinitésimales. La dernière partie de notre travail est consacrée à l'optimisation des politiques dans les Processus Décisionnels de Markov (éventuellement infinis) stationnaires. Nous proposons un algorithme d'itération de la valeur pour le calcul des politiques optimales lexicographiques. De plus, nous étendons ces résultats au cas de l'horizon infini. La taille des matrices augmentant exponentiellement (ce qui est particulièrement problématique dans le cas de l'horizon infini), nous proposons un algorithme d'approximation qui se limite à la partie la plus intéressante de chaque matrice de trajectoires, à savoir les premières lignes et colonnes. Enfin, nous rapportons des résultats expérimentaux qui prouvent l'efficacité des algorithmes basés sur la troncation des matrices. / This work contributes to possibilistic decision theory and more specifically to sequential decision-making under possibilistic uncertainty, at both the theoretical and practical levels. Even though appealing for its ability to handle qualitative decision problems, possibilisitic decision theory suffers from an important drawback: qualitative possibilistic utility criteria compare acts through min and max operators, which leads to a drowning effect. To overcome this lack of decision power, several refinements have been proposed in the literature. Lexicographic refinements are particularly appealing since they allow to benefit from the expected utility background, while remaining "qualitative". However, these refinements are defined for the non-sequential decision problems only. In this thesis, we present results on the extension of the lexicographic preference relations to sequential decision problems, in particular, to possibilistic Decision trees and Markov Decision Processes. This leads to new planning algorithms that are more "decisive" than their original possibilistic counterparts. We first present optimistic and pessimistic lexicographic preference relations between policies with and without intermediate utilities that refine the optimistic and pessimistic qualitative utilities respectively. We prove that these new proposed criteria satisfy the principle of Pareto efficiency as well as the property of strict monotonicity. This latter guarantees that dynamic programming algorithm can be used for calculating lexicographic optimal policies. Considering the problem of policy optimization in possibilistic decision trees and finite-horizon Markov decision processes, we provide adaptations of dynamic programming algorithm that calculate lexicographic optimal policy in polynomial time. These algorithms are based on the lexicographic comparison of the matrices of trajectories associated to the sub-policies. This algorithmic work is completed with an experimental study that shows the feasibility and the interest of the proposed approach. Then we prove that the lexicographic criteria still benefit from an Expected Utility grounding, and can be represented by infinitesimal expected utilities. The last part of our work is devoted to policy optimization in (possibly infinite) stationary Markov Decision Processes. We propose a value iteration algorithm for the computation of lexicographic optimal policies. We extend these results to the infinite-horizon case. Since the size of the matrices increases exponentially (which is especially problematic in the infinite-horizon case), we thus propose an approximation algorithm which keeps the most interesting part of each matrix of trajectories, namely the first lines and columns. Finally, we reports experimental results that show the effectiveness of the algorithms based on the cutting of the matrices.