10 resultados para Building and Pest Inspection Clause

em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco


Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this thesis project, a building in Vegagatan 12, Gävle has been analysed in order to see why it does consume more energy than it was expected. This building is a low energy building certified by Miljöbyggnad and it should use less than 55kWh/m2 year and nowadays it is using 62.23 kWh/m2. To get the needed data, some information about the building has been gathered, some measurements have been done in the building and some calculations have been done with those measurements. Finally, some possible solutions have been offered to reduce the energy use of the building. Insulating the floor, the pipes and the walls, reducing the indoor temperature in winter... All of these changes need the help of environmentally friendly attitudes, which is a very important fact in low energy buildings.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

[ES] Para más información véase el trabajo LDGP_mem_003-2: "Estudio topográfico de las deformaciones del conjunto arquitectónico de la iglesia de Nuestra Señora de la Blanca (Agoncillo, La Rioja) [Julio 2007 – Octubre 2009]", http://hdl.handle.net/10810/7050

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

There is an increasing number of Ambient Intelligence (AmI) systems that are time-sensitive and resource-aware. From healthcare to building and even home/office automation, it is now common to find systems combining interactive and sensing multimedia traffic with relatively simple sensors and actuators (door locks, presence detectors, RFIDs, HVAC, information panels, etc.). Many of these are today known as Cyber-Physical Systems (CPS). Quite frequently, these systems must be capable of (1) prioritizing different traffic flows (process data, alarms, non-critical data, etc.), (2) synchronizing actions in several distributed devices and, to certain degree, (3) easing resource management (e.g., detecting faulty nodes, managing battery levels, handling overloads, etc.). This work presents FTT-MA, a high-level middleware architecture aimed at easing the design, deployment and operation of such AmI systems. FTT-MA ensures that both functional and non-functional aspects of the applications are met even during reconfiguration stages. The paper also proposes a methodology, together with a design tool, to create this kind of systems. Finally, a sample case study is presented that illustrates the use of the middleware and the methodology proposed in the paper.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

[ES]En el mundo de la aeronáutica cada vez más se utilizan materiales de alta dureza y baja maquinabilidad. Por ello la necesidad de utilización de métodos de fabricación no convencionales de mecanizado. Para la fabricación de los Blisks, la electroerosión resulta un proceso ventajoso frente a otros procesos. En este trabajo se va llevar a cabo las etapas de puesta a punto de utillajes, mecanizado y control dimensional de los álabes mecanizados.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

[ES]El presente documento analiza las principales funciones que se le exigen actualmente a un sistema constructivo; concretamente, a la envolvente de los edificios. Se plantean inicialmente las causas y necesidades que han derivado en el nuevo concepto de envolvente así como las nuevas funciones que se le son exigibles. Se describen los conceptos relativos a los diferentes sistemas constructivos, a los métodos de ventilación natural y, a continuación, se analizan los criterios de generación fotovoltaica y solar térmica en los edificios, además de la integración de estos sistemas en los edificios. También se analizan los fundamentos sobre materiales de cambio de fase. Todo ello permite presentar los criterios de construcción de edificios ecoeficientes. Asimismo se presentan una serie de soluciones arquitectónicas desde el punto de vista de la eficiencia energética.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

[ES]En el proyecto se analizan diferentes soluciones de fachada y cubierta de un edificio residencial, buscando la eficiencia energética y la economía. Para ello, partiendo de un caso concreto, se estudian las cargas térmicas del edificio existente y de otras dos soluciones posibles. En estas además, se utilizan materiales sostenibles, con el fin de hacer el menor impacto medioambiental posible. Se ha analizado también la rentabilidad de estas soluciones, para comprobar cuál es la más adecuada desde un punto de vista económico.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

[ES]Este trabajo tiene como objetivos realizar la auditoria energética de un edificio de viviendas y planificar un proyecto de posibles mejoras para aumentar la nota obtenida. La certificación se ha llevado a cabo mediante el programa CE3X, programa homologado por el Ministerio de Industria. La calificación del edificio ha sido 89.8 G y tras implantar las mejoras se ha conseguido una puntuación de 14.8 C, de acuerdo con la actual normativa europea. También, se adjuntan varias imágenes sobre el funcionamiento del programa CE3X además del certificado real obtenido. La planificación y el presupuesto de las mejoras están incluidos en este documento.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

[ES]Mediante este trabajo se tiene como objetivo el análisis energético del proceso de fabricación de productos cerámicos, así como un análisis y valoración de posibles mejoras. El trabajo se basará en una descripción del proceso, analizando todos los elementos que intervienen en él, desde las materias primas hasta los equipos. Aunque se hará una descripción de todos los productos cerámicos que existen en el mercado, este trabajo se focalizará en los productos de construcción y menaje, puesto que son los que mayor producción tienen dentro del estado español. Por último se indicarán una serie de propuestas de mejora, junto con un presupuesto para cuantificar éstas.