This thesis investigates the properties of generic refinements of behavioral specifications. At the base of this investigation stands the view from algebraic specification that abstract data types can be modeled as algebras. A specification of a data type is formed from a syntactic part, i.e. a signature detailing the interface of the data type, and a semantic part, i.e. a class of algebras (called its models) that contains the valid implementations of that data type. Typically, the class of algebras that constitutes the semantics of a specification is defined as the class of algebras that satisfy some given set of axioms. The behavioral aspect of a specification comes from relaxing the requirements imposed by axioms, i.e. by allowing in the semantics of a specification not only the algebras that literally satisfy the given axioms, but also those algebras that appear to behave according to those axioms. Several frameworks have been developed to express the adequate notions of what it means to be a behavioral model of a set of axioms, and our choice as the setting for this thesis will be Bidoit and Hennicker’s Constructor-based Observational Logic, abbreviated COL. Using specifications that rely on the behavioral aspects defined by COL we study the properties of generic refinements between specifications. Refinement is a relation between specifications. The refinement of a target specification by a source specification is given by a function that constructs models of the target specification from the models of the source specification. These functions are called constructions and the source and target specifications that they relate are called the context of the refinement. The theory of refinements between algebraic specifications, with or without the behavioral aspect, has been well studied in the literature. Our analysis starts from those studies and adapts them to COL, which is a relatively new framework, and for which refinement has been studied only briefly. The main part of this thesis is formed by the analysis of generic refinements. Generic refinements are represented by constructions that can be used in various contexts, not just in the context of their definition. These constructions provide the basis for modular refinements, i.e. one can use a locally defined construction in a global context in order to refine just a part of a source specification. The ability to use a refinement outside its original context imposes additional requirements on the construction that represents it. An implementer writing such a construction must not use details of the source models that can be contradicted by potential global context requirements. This means, roughly speaking, that he must use only the information available in the source signature and also any a priori assumption that was made about the contexts of use. We look at the basic case of generic refinements that are reusable in every global context, and then we treat a couple of variations, i.e. generic refinements for which an a priori assumption it is made about the nature of their usage contexts. In each of these cases we follow the same pattern of investigation. First we characterize the constructions that ensure reusability by means of preservation of relations, and then, in most cases, we show that such constructions must be definable in terms of their source signature. Throughout the thesis we use an informal analogy between generic (i.e. polymorphic) functions that appear in second order lambda calculus and the generic refinements that we are studying. This connection will enable us to describe some properties of generic refinements that correspond to the properties of polymorphic functions inferred from their types and named “theorems for free” by Wadler. The definability results, the connection between the assumptions made about the usage contexts and the characterizing relations, and the “theorems for free” for behavioral specifications constitute the main contributions of this thesis.

Two players take alternating turns filling a rectangular board with unit squares without rotation, but may be otherwise arbitrary. Squares may not overlap and the game ends when there is no space for the next one. The result of the game is the number of turns. The constructor aims to maximize this quantity while the destructor wants to minimize it. We would like to get close to this value, provided that both players use their optimal strategy. We prove some new lower and upper bound for the game. This thesis extends results given by Tamás Hubai in his paper Competitive rectangle filling. Furthermore, we have a look at other board shapes and shapes to fill with.

p. 1-182 / Submitted by Santiago Fabio (fabio.ssantiago@hotmail.com) on 2013-03-25T18:32:12Z No. of bitstreams: 8 Apêndice D.pdf: 86958 bytes, checksum: 16f6abc2fcfce1845930b8c4bf21cb52 (MD5) Apendice C.pdf: 99766 bytes, checksum: 67b965e81e4dcf00e95ff1c240ae45d9 (MD5) Apendice B.pdf: 90092 bytes, checksum: 18964b492022cf5d14e77fc2dfd96bb2 (MD5) Apendice A.pdf: 82609 bytes, checksum: 3417d0ec006d7e619586537477136d48 (MD5) Anexo B.pdf: 64616 bytes, checksum: 5f8da888971f622eddbc865a557cbe5a (MD5) ANEXO A.pdf: 83713 bytes, checksum: 7c626888f1fba6da272fc5c04a93a9dd (MD5) DISSERTAÇÃO_2.pdf: 641434 bytes, checksum: 81abfd6b3788a4c2be1d8d20843aa719 (MD5) DISSERTAÇÃO_1.pdf: 748696 bytes, checksum: aab87c6fca52f2f4416aac7f213a275b (MD5) / Approved for entry into archive by Tatiana Lima(tatianasl@ufba.br) on 2013-04-08T16:57:51Z (GMT) No. of bitstreams: 8 Apêndice D.pdf: 86958 bytes, checksum: 16f6abc2fcfce1845930b8c4bf21cb52 (MD5) Apendice C.pdf: 99766 bytes, checksum: 67b965e81e4dcf00e95ff1c240ae45d9 (MD5) Apendice B.pdf: 90092 bytes, checksum: 18964b492022cf5d14e77fc2dfd96bb2 (MD5) Apendice A.pdf: 82609 bytes, checksum: 3417d0ec006d7e619586537477136d48 (MD5) Anexo B.pdf: 64616 bytes, checksum: 5f8da888971f622eddbc865a557cbe5a (MD5) ANEXO A.pdf: 83713 bytes, checksum: 7c626888f1fba6da272fc5c04a93a9dd (MD5) DISSERTAÇÃO_2.pdf: 641434 bytes, checksum: 81abfd6b3788a4c2be1d8d20843aa719 (MD5) DISSERTAÇÃO_1.pdf: 748696 bytes, checksum: aab87c6fca52f2f4416aac7f213a275b (MD5) / Made available in DSpace on 2013-04-08T16:57:51Z (GMT). No. of bitstreams: 8 Apêndice D.pdf: 86958 bytes, checksum: 16f6abc2fcfce1845930b8c4bf21cb52 (MD5) Apendice C.pdf: 99766 bytes, checksum: 67b965e81e4dcf00e95ff1c240ae45d9 (MD5) Apendice B.pdf: 90092 bytes, checksum: 18964b492022cf5d14e77fc2dfd96bb2 (MD5) Apendice A.pdf: 82609 bytes, checksum: 3417d0ec006d7e619586537477136d48 (MD5) Anexo B.pdf: 64616 bytes, checksum: 5f8da888971f622eddbc865a557cbe5a (MD5) ANEXO A.pdf: 83713 bytes, checksum: 7c626888f1fba6da272fc5c04a93a9dd (MD5) DISSERTAÇÃO_2.pdf: 641434 bytes, checksum: 81abfd6b3788a4c2be1d8d20843aa719 (MD5) DISSERTAÇÃO_1.pdf: 748696 bytes, checksum: aab87c6fca52f2f4416aac7f213a275b (MD5) Previous issue date: 2003 / Esta dissertação tem por objetivo geral ampliar o entendimento acerca das relações entre clientes e fornecedores na construção civil, a partir da implantação, em empresas construtoras, de Sistemas de Gestão da Qualidade (SGQ), baseados no Sistema de Qualificação de Empresas de Serviços e Obras (SIQ-C) do Programa Brasileiro da Qualidade e Produtividade no Habitat (PBQP- H), dentro de um contexto de transformações organizacionais. Para tanto, realizou-se um estudo exploratório em 15 empresas baianas de construção civil, qualificadas ou em processo de qualificação através do próprio PBQP-H ou do Programa da Qualidade das Obras Públicas do Estado da Bahia (QUALIOP). Primeiramente, buscou-se descrever o cenário econômico e institucional no qual estas empresas estão inseridas, através da caracterização da Indústria da Construção Civil (ICC) em geral, e do subsetor de edificações em particular. Inclui-se aí uma breve análise da estratégia e competitividade das construtoras baianas. Em seguida, o conceito mais amplo de mudanças organizacionais foi estudado a partir das dimensões da desintegração vertical, da necessidade de estabelecer-se relações cooperativas com fornecedores e da implantação de Sistemas de Gestão da Qualidade. Como resultados a pesquisa indicou que a obrigatoriedade de qualificação e avaliação de fornecedores, decorrente da implantação do SGQ, constitui um instrumento que permite às construtoras selecionar melhor os fornecedores com os quais trabalham, o que tem contribuído para que ocorram modificações nos relacionamentos entre eles. Em todas as construtoras pesquisadas, verificou-se haver relações de longo prazo com fornecedores. Em algumas delas estes fornecedores, ditos estáveis, têm preferência na contratação. No entanto, apesar de a certificação estar promovendo mudanças nos relacionamentos entre construtoras e fornecedores, o estabelecimento de relações estáveis e cooperativas entre eles não pode ser diretamente atribuído ao SGQ. / Salvador

Issues of control and causation are central to the Quantum Theory of Computation. Yet there is no place for them in fundamental laws of Physics when expressed in the prevailing conception, i.e., in terms of initial conditions and laws of motion. This thesis aims at arguing that Constructor Theory, recently proposed by David Deutsch to generalise the quantum theory of computation, is a candidate to provide a theory of control and causation within Physics. To this end, I shall present a physical theory of information that is formulated solely in constructor-theoretic terms, i.e., in terms of which transformations of physical systems are possible and which are impossible. This theory solves the circularity at the foundations of existing information theory; it provides a unifying relation between classical and quantum information, revealing the single property underlying the most distinctive phenomena associated with the latter: the unpredictability of the outcomes of some deterministic processes, the lack of distinguishability of some states, the irreducible perturbation caused by measurement and the existence of locally inaccessible information in composite systems (entanglement). This thesis also aims to investigate the restrictions that quantum theory imposes on copying-like tasks. To this end, I will propose a unifying, picture-independent formulation of the no-cloning theorem. I will also discuss a protocol to accomplish the closely related task of transferring perfectly a quantum state along a spin chain, in the presence of systematic errors. Furthermore, I will address the problem of whether self-replication (as it occurs in living organisms) is compatible with Quantum Mechanics. Some physicists, notably Wigner, have argued that this logic is in fact forbidden by Quantum Mechanics, thus claiming that the latter is not a universal theory. I shall prove that those claims are invalid and that the logic of self-replication is, of course, compatible with Quantum Mechanics.

The main objective of this diploma thesis is description of poetics in Václav Řezáč's (1951-1956) novels. It 's especially interested in transformations of poetics between three periods of Řezáč's literary production. Vaclav Řezáč's novels influenced by literary tradition and time period he lived in. That's why we have analyze also novels by other writers. It is believed that Řezáč's evolution was rather cyclical; his novel Nástup in a way refers to some techniques of his previous work Slepá ulička, although with quite different ideological message.

Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constructor, which generalizes both the usual existential restrictions and so-called qualified number restrictions. We show that the new constructor can be expressed in ALCQ, the extension of the basic DL ALC by qualified number restrictions. However, this representation results in an exponential blow-up. By giving direct algorithms for ALC extended with the new constructor, we can show that the complexity of reasoning in this new DL is actually not harder than the one of reasoning in ALCQ. Moreover, in our chemical process engineering application, a restricted DL that provides only the new constructor together with conjunction, and satisfies an additional restriction on the occurrence of roles names, is sufficient. For this DL, the subsumption problem is polynomial. / Short versions of this report have also appeared in Proc. of KI'05 and Proc. of DL'05.

台灣地小人稠，促使近十幾年來房屋建築投資事業（營建業）蓬勃的發展。由於營建 業需要大量的資金，工程又常跨越數個會計期間，使其經營型態及會計問題，與其他 行業相較，顯得較為特殊。 企業報導損益的目的在於衡量經營績效，預測未來所得流量及作為決策之參考。基於 營建業會計問題的特殊性，如何正確的報導其損益，以達到上述目的，是為本文研究 的方向。本文計分六章二十二節，針對營建業損益取決的理論及其實務應用上之問題 加以研究分析，並就研究結果提出建議，冀望有助於我國營建業之損益報導功能。

Die „Virtuelle Bibliothek Matthäus Daniel Pöppelmann“ ist als Bücherverzeichnis mit beigefügten Weblinks zu digitalisierten historischen Druckwerken konzipiert und spiegelt die einstige, im Original verlorene Privatbibliothek des bekannten Dresdner Barockbaumeisters wieder. Die Erarbeitung erfolgte 2013/14 im Teilprojekt-Team der TU Dresden innerhalb des European Network of Baroque Cultural Heritage (ENBaCH). 2017 ist die Virtuelle Bibliothek im Rahmen des an der TU Dresden angesiedelten Fritz-Thyssen-Forschungsprojekts Matthäus Daniel Pöppelmann (1662-1736): Die Schloss- und Zwingerplanungen für Dresden. Planen und Bauen im „modus Romanus“ hinsichtlich der transkribierten Buchtitel und der weiterführenden Verlinkungen aktualisiert worden.

The „Virtual Library Matthäus Daniel Pöppelmann“ is planned as a book index with attached weblinks to digitized historical printed works and reflects the former, in original lost private library of the famous baroque architect in Dresden. The index was developed in 2013/14 by the subproject-team of the TU Dresden within the European Network of Baroque Cultural Heritage (ENBaCH). In 2017 the virtual library has been brought up-to-date with regard to the transcribed book titles and the additional weblinks within the context of the Project Matthäus Daniel Pöppelmann (1662-1736): Die Schloss- und Zwingerplanungen für Dresden. Planen und Bauen im “modus romanus” of the TU Dresden, supported by the Fritz-Thyssen-Stiftung.

Die „Virtuelle Bibliothek Matthäus Daniel Pöppelmann“ ist als Bücherverzeichnis mit beigefügten Weblinks zu digitalisierten historischen Druckwerken konzipiert und spiegelt die einstige, im Original verlorene Privatbibliothek des bekannten Dresdner Barockbaumeisters wieder. Die Erarbeitung erfolgte 2013/14 im Teilprojekt-Team der TU Dresden innerhalb des European Network of Baroque Cultural Heritage (ENBaCH). 2017 ist die Virtuelle Bibliothek im Rahmen des an der TU Dresden angesiedelten Fritz-Thyssen-Forschungsprojekts Matthäus Daniel Pöppelmann (1662-1736): Die Schloss- und Zwingerplanungen für Dresden. Planen und Bauen im „modus Romanus“ hinsichtlich der transkribierten Buchtitel und der weiterführenden Verlinkungen aktualisiert worden.