Zugl.: München, Univ., Diss., 2006

Thesis (Ph. D.)--University of Notre Dame, 2008. / Thesis directed by John T. McGreevy for the Department of History. "August 2008." Includes bibliographical references (leaves 255-276).

Thesis (M.S. in Physics)--United States Naval Postgraduate School, 1959. / "Physics and Mathematics" -t.p. Includes bibliographical references (p. 17).

Thesis (Ph. D.)--University of California, May 1930. / Bibliography: p. 347-360.

Thesis (Ph. D.)--University of Missouri-Columbia, 2006. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed July 31, 2007). Includes bibliographical references.

Thesis (Ph. D.)--University of Missouri-Columbia, 2006. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (May 2, 2007) Vita. Includes bibliographical references.

The purpose of this thesis is to examine whether or not there has been a change in the way DN Debatt has been depicting muslims. This study process the time between 11 September 2000 and 11 September 2002. To reach my result I am using a content analysis, this because I found it the most useful to my material. The result I got with this thesis was that it wasn’t that big of a difference in the picture that the writers wanted to show. The biggest difference was the linguistic, the words used in the articles changed from quite positive to become rather negative. For example before 11 September 2001 the word terrorism was not to be seen in a article about Muslims, but after the same date every article used in this study has the word terrorist in some way. In my thesis I used a hypothesis, the hypothesis was that the reporting about Muslims was going to be radically changed and become hostile towards Muslims. This was not the case and my hypothesis was in one way contradicted.

In this dissertation, we study the following two topics, i.e., the union closed set conjecture and the maximum edges cut in connected digraphs. The union-closed-set-conjecture-topic goes as follows. A finite family of finite sets is {\it union closed} if it contains the union of any two sets in it. Let $X_{\mathcal{F}}=\cup_{F\in\mathcal{F}}F$. A union closed family of sets is {\it separating} if for any two distinct elements in $\mathcal{F}$, there is a set in $\mathcal{F}$ containing one of them, but not the other and there does not exist an element which is contained in every set of it. Note that any union closed family $\mathcal{F}$ is a poset with set inclusion as the partial order relation. A separating union closed family $\mathcal{F}$ is {\it irreducible} ({\it normalized}) if $|X_{\mathcal{F}}|$ is the minimum (maximum, resp.) with respect to the poset structure of $\mathcal{F}$. In the part of dissertation related to this topic, we develop algorithms to transfer any given separating union closed family to a/an normalized/irreducible family without changing its poset structure. We also study properties of these two extremal union closed families in connection with the {\it Union Closed Sets Conjecture} of Frankl. Our result may lead to potential full proof of the union closed set conjecture and several other conjectures. The part of the dissertation related to the maximum edge cuts in connected digraphs goes as follows. In a given digraph $D$, a set $F$ of edges is defined to be a {\it directed cut} if there is a nontrivial partition $(X,Y)$ of $V(D)$ such that $F$ consists of all the directed edges from $X$ to $Y$. The maximum size of a directed cut in a given digraph $D$ is denoted by $\Lambda (D)$, and we let $\mathcal{D}(1,1)$ be the set of all digraphs $D$ such that $d^{+}(v)=1$ or $d^{-}(v)=1$ for every vertex $v$ in $D$. In this part of dissertation, we prove that $\Lambda (D) \geq \frac{3}{8}(|E(D)|-1)$ for any connected digraph $D\in\mathcal{D}(1,1)$, which provides a positive answer to a problem of Lehel, Maffray, and Preissmann. Additionally, we consider triangle-free digraphs in $\mathcal{D}(1,1)$ and answer their another question.

In this paper, we show that a pointwise λ -symmetric λ -isotonic λ -closure function is uniquely determined by the pairs of sets it separates. We then show that when the λ -closure function of the domain is λ -isotonic and the λ -closure function of the codomain is λ -isotonic and pointwise- λ -symmetric, functions which separate only those pairs of sets which are already separated are λ -continuous.

A identificação de sistemas em malha fechada assume papel importante no contexto atual, já que reduz o custo operacional do processo de identificação no estágio de testes, evitando, por exemplo, a geração de produtos fora de especificação. Entretanto, requer uma série de cuidados especiais no tratamento dos dados a serem analisados para a obtenção dos modelos. Nesta dissertação um estudo acerca da identificação de sistemas monovariáveis lineares a partir de dados de operação em malha fechada, avaliando diferentes métodos e técnicas de identificação em malha fechada já consolidados é apresentado. Um novo método, recentemente proposto por Agüero (2005), o Virtual Closed Loop ouMétodo da Malha Virtual, que consiste na adição e remoção virtual de um controlador à malha analisada, de forma a filtrar a ação de controle real em um procedimento totalmente offline, é estudado em detalhes e uma adaptação é realizada na metodologia, com a simplificação do filtro virtual e forma de obtenção do modelo da malha aberta. O desenvolvimento e estudo da metodologia estão baseados em uma série de sistemas SISO distintos, com dinâmicas variáveis. Além disso, diferentes cenários com características peculiares são aplicados ao estudo, como distúrbios não medidos e ruído de medição, ilustrando de forma simples possíveis comportamentos dinâmicos encontrados em plantas industriais. / The identification of closed loop systems has taken on an important role in the current context, since it reduces the operational costs of the identification process in the testing stage, thus avoiding, for instance, the creation of non-specified products. However, it requires special care in the treatment of data to be analyzed for the obtainment of models. In this work, we present a study on the identification of linear models from closed loops operational data, evaluating different consolidated methods and techniques of closed loop identification. A new method is studied in detail in this work: the Virtual Closed Loop, which was proposed by Agüero (2005). It consists of the virtual addition and removal of a controller to the analyzed loop, so as to filter the input of the system in a completely offline procedure. It is also presented modifications on this methodology resulting in an simplification of the virtual filter and in the ways to obtain the open loop model. The development and study of this methodology are both based on different SISO systems, with variable dynamics. Other interesting characteristics, peculiar to the study, are considered in this work, as noise and dither signals. It illustrates, in a simple way, possible dynamic behavior patterns found in industrial plants.