<p>Cilj - Cilj istraživanja je razvoj modela, implementacija prototipa i verifikacija računarskog simulacionog sistema koji omogućuje rad sa nepreciznim geoprostornim podacima u realnim uslovima, i pro&scaron;irivanje postojećiim sistemima, razvoja novih algoritama za obradu, novih modela za reprezentaciju procesa i njihovu integraciju.<br />Metodologija - Za modeliranje neodređenosti i nepreciznosti u podacima i procesima kori&scaron;ćen je fazi pristup. Za razvoj softverskog sistema kori&scaron;ćen je objektni pristup (UML 2.0.), model vi&scaron;eslojne distribuirane softverske arhitekture, kombinacija vi&scaron;e objektno orijentisanih programskih jezika, i standardi iz oblasti prostornih podataka i procesa. Verifikacija je izvr&scaron;ena na primeru ekstrakcije prostornih osobina na<br />osnovu rasterskih mapa, i implementirana su dva prostorna procesa u skladu sa definisanim modelima.<br />Rezultati - Predloženi su modeli tačkastih (fazi tačka), pravolinijskih (fazi duž) i jednostavnih povr&scaron;inskih (fazi trougao, fazi krug) nepreciznih objekata pomoću fazi skupova. Date su definicije i osobine osnovnih prostornih operacija (prostorna merenja, prostorne funkcije i prostorne relacije). Dat je predlog za modeliranje geoprostornih procesa i algoritam za odreĎivanje fazi konveksnog omotača koji se odlikuje smanjenom računskom složeno&scaron;ću u odnosu na postojeće algoritme.<br />Ograničenja istraživanja/implikacije &ndash; Sistem ne obuhvata standardizovan format za razmenu nepreciznih prostornih podataka. To znači da se format razmene mora implementirati u softveru.<br />Praktične implikacije - Predloženi modeli mogu se, pre svega, koristiti u geografskim informacionim sistemima, ali i u analizi slike, te drugim zadacima koji zahtevaju modelovanje realnog prostora (robotika i slično).<br />Originalnost/vrednost &ndash; Originalni doprinosi su sledeći: novi modeli tačkastih (fazi tačka), pravolinijskih (fazi duž) i jednostavnih povr&scaron;inskih (fazi trougao, fazi krug) objekata, novi modeli osnovnih prostornih operacija (prostorna merenja, prostorne funkcije i prostorne relacije) i novi algoritam za odreĎivanje fazi konveksnog omotača koji se odlikuje smanjenom računskom složeno&scaron;ću u odnosu na postojeće algoritme.</p> / <p> Purpose- The purpose is model development, software prototype implementation and verification of the computer simulation system which provides support for imprecise data processing under real conditions, as well as extensions to existing systems, development of novel algorithms for data processing, new models for processes&rsquo; representation and their integration.<br /> Design/methodology/approach - Fuzzy approach is used for modelling uncertainties and imprecision. For the software system&rsquo;s development object approach (UML 2.0), multi-tiered distributed software architecture,<br /> combination of several object programming languages, and standards for geospatial data and processes are deployed. Verification is carried out by the example of spatial features extraction from raster maps which is applied to two spatial processes compliant to the proposed model.<br /> Findings- Models for point (fuzzy point), line (fuzzy line) and simple planar (fuzzy triangle, fuzzy circle) imprecise objects are proposed. The definitions and basic features of spatial operations (spatial measurements, spatial functions and spatial relations) are given. A proposal for modelling geospatial processes is given and the algorithm for fuzzy convex hull characterized by reduced computational complexity.<br /> Research limitations/implications - The system does not comprise standardized format for imprecise data interchange. This means that interchange format should be implemented within the software.<br /> Practical implications - The proposed models can be used, primarily for geographic information systems, but they can be also deployed in image analysis as well as tasks requiring modelling of the real space (robotics, etc.).<br /> Originality/Value - The main original contributions are: novel models for point (fuzzy point), line (fuzzy line) and simple planar (fuzzy triangle, fuzzy circle) imprecise objects, novel models for imprecise spatial operations (spatial measurements, spatial functions and spatial relations), and the algorithm for fuzzy convex hull characterized by reduced computational complexity.</p>

This study examines nursing students' adoption of inferential sets in a clinical situation. The investigation determines (1) the particular inferential set(s) nursing students adopt toward a patient in a clinical situation; (2) the particular inferential set(s) adopted by sophomore and senior nursing students in a clinical situation; and (3) whether or not inferential sets adopted by the sophomore and senior nursing students differ. Sophomore and senior nursing students at a woman's university in Texas were asked to complete a research tool designed to determine inferential set adoption.

Many longitudinal clinical studies suffer from patient dropout. Often the dropout is nonignorable and the missing mechanism needs to be incorporated in the analysis. The methods handling missing data make various assumptions about the missing mechanism, and their utility in practice depends on whether these assumptions apply in a specific application. Ramakrishnan and Wang (2005) proposed a method (MDT) to handle nonignorable missing data, where missing is due to the observations exceeding an unobserved threshold. Assuming that the observations arise from a truncated normal distribution, they suggested an EM algorithm to simplify the estimation.In this dissertation the EM algorithm is implemented for the MDT method when data may include missing at random (MAR) cases. A data set, where the missing data occur due to clinical deterioration and/or improvement is considered for illustration. The missing data are observed at both ends of the truncated normal distribution. A simulation study is conducted to compare the performance of other relevant methods. The factors chosen for the simulation study included, the missing data mechanisms, the forms of response functions, missing at one or two time points, dropout rates, sample sizes and different correlations with AR(1) structure. It was found that the choice of the method for dealing with the missing data is important, especially when a large proportion is missing. The MDT method seems to perform the best when there is reason to believe that the assumption of truncated normal distribution is appropriate.A multiple imputation (MI) procedure under the MDT method to accommodate the uncertainty introduced by imputation is also proposed. The proposed method combines the MDT method with Rubin's (1987) MI method. A procedure to implement the MI method is described.

This thesis presents a close iconographic and contextual study of a set of seven Tibetan thangka paintings depicting portraits of the First through the Ninth Dalai Lamas, currently in a private collection and dated to the nineteenth-century. Through this case study, I propose to situate the genre of Dalai Lama portraits within the larger context of Tibetan Buddhist practice by considering their role and function in merit-making activities. I propose that as visual reminders of the Dalai Lamas, these portraits can be considered a type of “relic” that is foundational to devotional practices in Buddhism. Specifically, this thesis will investigate portraits of Dalai Lamas within the framework of Buddhist relic traditions. As a secondary focus, the thesis will examine the artistic conventions through which the figures are rendered present, problematizing the notion of “portrait-likeness.”

Steganography is a science which is interested in communication hiding. This work is focused on the most recent methods related to this topic. Mainly, it is matrix embedding, which uses coding theory, and sum and difference covering sets (SDCS). Rainbow coloring of grid graphs is used to receive even better results. This technique decrease amplitude of performed changes. It makes stegosystems less likely to be detected. Properties which describe behavior of each stegosystem are included for each technique. 1

We study families of small sets which appear in Harmonic analysis. We focus on the systems H(N) , N ∈ N, U and U0. In particular we compare their sizes via comparing the polars of these classes, i.e. the families of measures annihilating all sets from given class. Lyons showed that in this sense, the family N∈N H(N) is smaller than U0. The main goal of this thesis is the study of the question whether this also holds when the system U0 is replaced by the much smaller system U. To this end we define a new system H(∞) and systems of sets of type N where N ∈ N∪{∞}. We then prove some of their properties, which might be useful in solving the studied question. 1

Let fd(n), n > d ≥ 2, be the smallest positive integer such that any set of fd(n) points, in general position in Rd , contains n points in convex position. Let hd(n, k), n > d ≥ 2 and k ≥ 0, denote the smallest number with the property that in any set of hd(n, k) points, in general position in Rd , there are n points in convex position whose convex hull contains at most k other points. Previous result of Valtr states that h4(n, 0) does not exist for all n ≥ 249. We show that h4(n, 0) does not exist for all n ≥ 137. We show that h3(8, k) ≤ f3(8) for all k ≥ 26, h4(10, k) ≤ f4(10) for all k ≥ 147 and h5(12, k) ≤ f5(12) for all k ≥ 999. Next, let fd(k, n) be the smallest number such that in every set of fd(k, n) points, in general position in Rd , there are n points whose convex hull has at least k vertices. We show that, for arbitrary integers n ≥ k ≥ d + 1, d ≥ 2, fd(k, n) ≥ (n − 1) (k − 1)/(cd logd−2 (n − 1)) , where cd > 0 is a constant dependent only on the dimension d. 1

First we define microscopic sets on the real axis and study their relation to the sets of Hausdorff and Lebesgue measure zero and the sets of first category. In the second part, we prove the Ekeland's variational principle and its equivalence with the the Daneš's drop theorem, the Brézis-Browder's theorem, the Phelps' lemma and the Caristi-Kirks's theorem. Furthermore, we discuss its relation to the Bishop-Phelps' theorem. Doing so we define the notion of a drop as the convex hull of a set and a point. In the third part we prove that the drop property equals reflexivity in some sense. A space has the drop property if it is possible to find the drop from the Daneš's theorem even in a more general case than the theorem itself guarantees. Furthermore, we characterize this property using the approximative compactness. Last, we study the microscopic drop property that is more relaxed than the original drop property. We find out that those two notions are for certain sets in reflexive spaces equivalent.

One of the problems associated with automatic thesaurus construction is with determining the semantic relationship between word pairs. Quasi-synonyms provide a type of equivalence relationship: words are similar only for purposes of information retrieval. Determining such relationships in a thesaurus is hard to achieve automatically. The term vector space model and an inverse term frequency similarity function can provide a way to automatically determine the similarity between words in thesaurus. A thesaurus constructed using this method can also improve precision and recall in information retrieval, when the thesaurus is constructed in conjunction with fuzzy rough set algorithms and used with tight upper approximation query expansion. This dissertation presents a method that combines fuzzy rough sets and a word weighting and inverse term frequency similarity function as a technique for automatic thesaurus construction.

Orientador: Henrique Lazari / Banca: Adilson José Vieira Brandão / Banca: Wlademir Seixas / Resumo: Desde cedo entramos em contato com as implicações lógicas. O binômio verdadeiro-falso está sempre presente em nossas vidas e nós nos acostumamos a aceitar que as coisas ou são verdadeiras ou são falsas. Divertimo-nos quando alguém nos conta histórias interessantes envolvendo lógica e que terminam em contradições, tais como, por exemplo, a do barbeiro que pode e não pode barbear a si mesmo, ou como a do advogado que consegue ganhar ou perder a mesma causa. Apreciamos mais "paradoxos" sem nos apercebermos que por trás deles existe toda uma teoria matemática, a chamada lógica fuzzy. Essa dissertação tem por objetivo apresentar um resumo deste teoria, mostrando como ela trata a existência de tais paradoxos e dar detalhes sobre uma visão compacta dos conjuntos fuzzy, a saber, utilizando uma representação geométrica. A análise de alguns resultados sobre tais conjuntos usando esta representação leva a uma justificativa para o estudo da lógica fuzzy, a saber, a diferença entre "fuzziness" e probabilidade, incluindo uma demonstração de que "fuzziness", de fato, existe / Abstract: Early on we got in touch with the logical implications. The binomial true-false is always present in our lives and we have come to accept that things are either true or false. Have fun when somebody tells interesting stories involving logic and ending with contradictions, such as, for example, the barber who can and can not shave himself, or as the lawyer who can win or lose the same cause. Appreciate more "paradoxes" without realizing that behind them there is a whole mathematical theory, called fuzzy logic. This thesis aims to present a summary of this theory, showing how it treats the existence of such paradoxes and give details about a compact view of fuzzy sets, namely, using a geometrical representation. The analysis of some results on such sets using this representation leads to a justification for the study of fuzzy logic, namely the difference between "fuzziness" and probability, including a demonstration that "fuzziness" in fact, exists / Mestre