131 |
Odhady a testy v modelech panelových dat / Estimators and tests in panel data modelsZvejšková, Magdalena January 2013 (has links)
This work investigates mainly panel data models in which cross-sections can be considered independent. In the first part, we summarize results in the field of pool models and one-way error component models with fixed and random effects. We focus especially on the ways of estimating unknown parameters and on effects significance tests. We also briefly describe two-way error component model issues. In the second part, estimators of first order autoregressive panel data model parameters are derived, for both fixed and random parameters case. The work proves unbiasedness, consistency and asymptotic normality of selected estimators. Using these features, hypothesis tests about corresponding parameters are derived. Application of models is illustrated using real data and simulated data examples. Powered by TCPDF (www.tcpdf.org)
|
132 |
Algoritmos de inferência exata para modelos de primeira ordem. / Exact inference algorithms for first-order models.Takiyama, Felipe Iwao 27 February 2014 (has links)
Este trabalho descreve a implementação de algoritmos de inferência para modelos de primeira ordem. Três algoritmos foram implementados: ve, c-fove e ac-fove. Este último e o estado da arte no calculo de probabilidades em Redes Bayesianas Relacionais e não possua nenhuma implementação disponível. O desenvolvimento foi feito segundo uma metodologia ágil que resultou em um pacote de software que pode ser utilizado em outras implementações. Mostra-se que o software criado possui o desempenho esperado em teoria, embora apresente algumas limitações. Esta dissertação contribui também com novos tópicos teóricos que complementam o algoritmo. / In this work, we describe the implementation of inference algorithms for first order models. Three algorithms were implemented: ve, c-fove and ac-fove. The latter is the state of the art in probability calculations for Relational Bayesian Networks and had no implementation available. The development was done according to an agile methodology, which resulted in a software that can be used in other packages. We show that the resulting software has the expected performance from the theory, although with some limitations. This work also contributes with new theoretical topics that complement the algorithm.
|
133 |
Teorias de calibre no formalismo de 1ª ordem / First Order Formalism in gauge TheoriesCamargo Filho, Rogerio Tadeu da Rocha 26 April 2019 (has links)
O principal objetivo do presente trabalho é expor o procedimento de quantização de teorias de Yang-Mills, através do método de Faddeev-Popov, no formalismo de 1a Ordem, e investigar num primeiro momento sua equivalência (clássica e quântica) ao formalismo usual (2a Ordem) e algumas de suas aplicações, principalmente no cálculo de correções quânticas. Para isso, ideias gerais a respeito do processo de quantização via formalismo de Faddeev-Popov foram expostas, e posteriormente utilizadas no processo de quantização de teorias de Yang-Mills no formalismo de 1a Ordem. Apresenta-se também as ideias gerais relativas ao método de regularização dimensional utilizado no cálculo de correções quânticas à nível de 1-loop para a teoria de Yang-Mills no formalismo de 1a ordem, utilizando-se, para isso, computação simbólica. Foi demonstrado que via formalismo de 1a Ordem, a estrutura ultravioleta encontrada no propagador do bóson de gauge é consistente com a renormalizabilidade da teoria. Embora tenhamos diferenças quanto a estrutura das interações neste novo formalismo, a estrutura das divergências ultravioletas continua a mesma do formalismo usual. / The main objective of the present work is to expose the quantization procedure of Yang- Mills theories in first order formalism, by Faddeev Popov\'s method. We want to investigate the classical and quantum equivalence between first and second order formalism, and look and analyze the differences in practical calculations of quantum corrections. Therefore, the general ideas about quantizantion by Faddeev-Popov\'s method was exposed, and used later in first order theory. It is also presented in this work, the main ideas concerning to dimensional regularization used in quantum corrections calculations at one-loop order for Yang-Mills theories, using for that, symbolic computation. It has been shown that upon using the first order formalism, the ultraviolet structre found in gauge boson propagator is also consistent to the theory\'s renormalizability. Although we have differences concerning to interactions structures in this new formalism, the ultraviolet structures from usual formalism is also found in it.
|
134 |
Singularidades simples de curvas determinantais / Simple singularities of determinantal curvesSiesquén, Nancy Carolina Chachapoyas 27 August 2010 (has links)
Neste trabalho, estudamos a classificação de singularidades de curvas espaciais simples que não são intersecções completas. O Teorema de Hilbert-Burch nos permite usar a matriz de representação para estudar a variedade definida pelo ideal gerado por seus menores maximais. Da mesma forma, as deformações da variedade determinantal podem ser representadas por perturbações da matriz e qualquer perturbação da matriz fornece uma deformação da variedade. Assim, o estudo das singularidades de curvas determinantais pode ser formulado em termos da matriz de representação da curva / In this work, we study the classification of simple space curve singularities which are not complete intersections. The Theorem of Hilbert-Burch enables us to deal with the presentation matrices instead of the ideals defined by their maximal minors. In the same way, deformations of the determinantal variety can be represented by perturbations of the matrix and any perturbation of the matrix gives rise to a deformation of the variety. Therefore, the study of determinantal curves can be formulated in terms of the presentation matrices
|
135 |
Sistema de controle com compensação de tempo morto aplicado à geração de vento em tanque de prova. / Control, system with dead time compensation applied to wind generation in tank test.Parra, Luis Antonio 11 October 2013 (has links)
Este trabalho descreve o desenvolvimento de um sistema de controle com compensação de tempo morto aplicado a um ventilador para simular os efeitos do vento em modelos de embarcações. O sistema é instalado no tanque de provas do Departamento de Engenharia Naval da Escola Politécnica da USP. Um sistema de controle baseado em computador é elaborado para a realização dos testes e validação, procedendo-se inicialmente a identificação do sistema a ser controlado. Na malha de controle, o sinal de referência é a velocidade do vento desejada em uma distância pré-definida do ventilador e pode ser tanto um valor constante (representando um vento constante) ou um valor variante no tempo (representando uma rajada de vento). O sistema atuador consiste de um inversor de frequência que aciona o ventilador e a velocidade do vento é medida por um anemômetro, cujo sinal é usado como realimentação para o controlador. A sintonia da malha é realizada pelo método do modelo interno (IMC) e o efeito do tempo morto é observado nos testes, aplicando-se o compensador baseado no Preditor de Smith para minimizá-lo. Pelos resultados dos ensaios, conclui-se que o Preditor de Smith melhora o desempenho do sistema de geração de vento. / This paper describes the development of a control system with dead time compensation applied to a fan to simulate wind effects in models of vessels. The system is installed on the academic towing tank of the Naval Architecture and Oceanic Engineering Department of the University of São Paulo. A control system based on computer is designed for testing and validation, proceeding initially to identify the system to be controlled. In the control loop, the set-point is the desired speed of the wind on a pre-defined distance from the fan and it can be either a constant value (representing a constant wind) or a time-varying value (representing a wind gust). The actuator system consists of a frequency-inverter that drives the fan and the wind speed is measured by an anemometer, whose signal is used as feedback to the controller. The tuning of the controller is made by the internal model control (IMC) and the effect of dead time is observed in the tests, applying the compensator based on Smith Predictor to minimize it. Through the results from the tests, it was concluded that the Smith Predictor improves the performance of the wind generation system.
|
136 |
Sobre o conceito semântico de satisfaçãoAlves, Carlos Roberto Teixeira 14 December 2015 (has links)
Made available in DSpace on 2016-04-27T17:27:13Z (GMT). No. of bitstreams: 1
Carlos Roberto Teixeira Alves.pdf: 1331347 bytes, checksum: cebe03a83120937101a3595710844df2 (MD5)
Previous issue date: 2015-12-14 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This work aims to show the current treatment of the semantic notion of satisfiability to
the logic of the first order, the relevant problems of Tarski's solution to define this
notion - in this case, the use of infinite sequences to satisfy the formulas - and propose
an alternative to circumvent this problem. The notion established by Tarski became, in
discussions on the subject, standard solution and resulted in rich tools to work with the
languages, in particular tools such as the Theory of Models. However, from a
philosophical point of view, it is very important to broaden perspectives and look at the
problem from a new dimension. Our proposal is to avoid the counterintuitive idea of
using infinite sequences of objects to satisfy the finite formulas, knowing that these
infinite sequences are composed almost entirely of 'superfluous terms', expendable in
the process of satisfaction, but they should and are listed and indexed in the process. It
would be interesting to solve the issue involving sequences without 'superfluous terms'.
We propose a structure of first-order language that dispenses variables and constants.
The notion of satisfaction in this case is distinct, which increases the possibilities and
provides an alternative to the satisfaction of infinite sequences. In the end, we show
how our solution can produce the satisfaction of formulas of a first-order language
within a framework where satisfaction is interpreted according to certain specific
criteria and can be performed by finite sequences, differing essentially from Tarski
solution / Este trabalho tem por objetivo mostrar o tratamento atual da noção semântica de
satisfatibilidade para as lógicas de primeira ordem, os problemas relevantes da solução
de Tarski para definir essa noção no caso, o uso de sequências infinitas para a
satisfação das fórmulas , e propor uma alternativa que contorne esse problema. A
noção estabelecida por Tarski tornou-se, nas discussões a respeito do tema, a solução
padrão e resultou em ferramentas ricas para operar com as linguagens, em especial
ferramentas como a Teoria dos Modelos. No entanto, de um ponto de vista filosófico, é
sadio ampliar as perspectivas e olhar o problema sob uma dimensão nova. Nossa
proposta é superar a ideia contraintuitiva de elencarmos sequências infinitas de objetos
para satisfação das formulas finitas, sabendo que essas sequências infinitas são
compostas quase que totalmente de termos supérfluos , dispensáveis no processo de
satisfação, mas que devem e são enumerados e indexados no processo. Seria
interessante solucionar a questão envolvendo sequências sem termos supérfluos .
Proporemos uma estrutura de linguagem de primeira ordem que dispensa variáveis e
constantes. A noção de satisfação nesse caso é distinta, o que amplia as possibilidades e
fornece uma alternativa à satisfação por sequências infinitas. No fim, mostraremos
como nossa solução consegue produzir a satisfação de fórmulas de uma linguagem de
primeira ordem dentro de uma estrutura interpretada onde a satisfação ocorre segundo
certos critérios específicos e consegue ser realizada por sequências finitas, diferindo
essencialmente da solução de Tarski
|
137 |
Deep Learning Black Box ProblemHussain, Jabbar January 2019 (has links)
Application of neural networks in deep learning is rapidly growing due to their ability to outperform other machine learning algorithms in different kinds of problems. But one big disadvantage of deep neural networks is its internal logic to achieve the desired output or result that is un-understandable and unexplainable. This behavior of the deep neural network is known as “black box”. This leads to the following questions: how prevalent is the black box problem in the research literature during a specific period of time? The black box problems are usually addressed by socalled rule extraction. The second research question is: what rule extracting methods have been proposed to solve such kind of problems? To answer the research questions, a systematic literature review was conducted for data collection related to topics, the black box, and the rule extraction. The printed and online articles published in higher ranks journals and conference proceedings were selected to investigate and answer the research questions. The analysis unit was a set of journals and conference proceedings articles related to the topics, the black box, and the rule extraction. The results conclude that there has been gradually increasing interest in the black box problems with the passage of time mainly because of new technological development. The thesis also provides an overview of different methodological approaches used for rule extraction methods.
|
138 |
Un modèle de données pour bibliothèques numériques / A data model for digital librariesYang, Jitao 30 May 2012 (has links)
Les bibliothèques numériques sont des systèmes d'information complexes stockant des ressources numériques (par exemple, texte, images, sons, audio), ainsi que des informations sur les ressources numériques ou non-numériques; ces informations sont appelées des métadonnées. Nous proposons un modèle de données pour les bibliothèques numériques permettant l'identification des ressources, l’utilisation de métadonnées et la réutilisation des ressources stockées, ainsi qu’un langage de requêtes pour l’interrogation de ressources. Le modèle que nous proposons est inspiré par l'architecture du Web, qui forme une base solide et universellement acceptée pour les notions et les services attendus d'une bibliothèque numérique. Nous formalisons notre modèle comme une théorie du premier ordre, afin d’exprimer les concepts de bases de la bibliothèque numérique, sans aucune contrainte technique. Les axiomes de la théorie donnent la sémantique formelle des notions du modèle, et en même temps fournissent une définition de la connaissance qui est implicite dans une bibliothèque numérique. La théorie est traduite en un programme Datalog qui, étant donnée une bibliothèque numérique, permet de la compléter efficacement avec les connaissances implicites. Le but de notre travail est de contribuer à la technologie de gestion des informations des bibliothèques numériques. De cette façon, nous pouvons montrer la faisabilité théorique de notre modèle, en montrant qu'il peut être efficacement appliqué. En outre, nous démontrons la faisabilité pratique du modèle en fournissant une traduction complète du modèle en RDF et du langage de requêtes en SPARQL.Nous fournissons un calcul sain et complet pour raisonner sur les graphes RDF résultant de la traduction. Selon ce calcul, nous prouvons la correction de ces deux traductions, montrant que les fonctions de traduction préservent la sémantique de la bibliothèque numérique et de son langage de requêtes. / Digital Libraries are complex information systems, storing digital resources (e.g., text, images, sound, audio), as well as knowledge about digital or non-digital resources; this knowledge is referred to as metadata. We propose a data model for digital libraries supporting resource identification, use of metadata and re-use of stored resources, as well as a query language supporting discovery of resources. The model that we propose is inspired by the architecture of the Web, which forms a solid, universally accepted basis for the notions and services expected from a digital library. We formalize our model as a first-order theory, in order to be able to express the basic concepts of digital libraries without being constrained by any technical considerations. The axioms of the theory give the formal semantics of the notions of the model, and at the same time, provide a definition of the knowledge that is implicit in a digital library. The theory is then translated into a Datalog program that, given a digital library, allows to efficiently complete the digital library with the knowledge implicit in it. The goal of our research is to contribute to the information management technology of digital libraries. In this way, we are able to demonstrate the theoretical feasibility of our digital library model, by showing that it can be efficiently implemented. Moreover, we demonstrate our model’s practical feasibility by providing a full translation of the model into RDF and of the query language into SPARQL. We provide a sound and complete calculus for reasoning on the RDF graphs resulting from translation. Based on this calculus, we prove the correctness of both translations, showing that the translation functions preserve the semantics of the digital library and of the query language.
|
139 |
派翠網路的基本架構 / Fundamental Structures in Petri Nets廖扶西, Jose Marcelino Arrozal Nicdao Unknown Date (has links)
The thesis contributes to the theoretical study of Petri net theory. We conduct boundedness and liveness structural analysis of Synchronized Choice nets (SNC) based on fundamental structures in Petri nets and identified as first-order structures. By studying these structures, the study proposes two ways of preserving good properties: addition of second-order structures or other asymmetric structures. Liveness of these new SNC nets is studied based on the concept of siphons and traps. We prove that SNC nets thus formed are structurally bounded and live. The thesis extends this class of nets to those with pure TP and PT first-order structures and explores its structural and marking conditions. Based on this, we introduce a new class of Synchronized Choice nets called Expanded Synchronized Choice nets.
|
140 |
Effects of wood ash on freshwater organisms and aquatic forest ecosystemsAronsson, K. Andreas January 2007 (has links)
Wood ash application (WAA) has been recommended mainly for two reasons; i) to avoid depletion of minerals in the soil due to whole tree harvest in the forestry and ii) to mitigate harmful effects of acidification of soil and surface waters. In conclusion, the effects on terrestrial ecosystems and, especially, tree growth, can be attributed to the properties of the ash, the dose applied and the specific site at which the ash is applied. The research conducted on the effects of WAA on limnological ecosystems is very limited, and the major purpose of the present thesis was to gain knowledge of the effects of wood ash to different freshwater organisms, and the more comprehensive, limnological effects of WAA in the first stream in Bispgården, Sweden. Effects of wood ash solutions on the unicellular alga Euglena gracilis Klebs, the amphipod Gammarus pulex L., and the moss Fontinalis antipyretica Hedw. were investigated under laboratory conditions. Common in all three species was the decline in performance (growth/velocity/respiration/oxygen evolution) when the concentration of wood ash exceeded 5 g/l and no adjustment of pH was done (alkaline solution). In contrast, different movement parameters (motility, upwards swimming and velocity) in E. gracilis (neutral conditions), and increased growth of F. antipyretica with increased concentrations of wood ash indicated that nutrients in the ash was bioavailable for these organisms. There was no evidence of toxic effects on the organisms from metals or other compounds as a result from exposure to wood ash solutions in the present studies. The field study was conducted in a forest area close to Bispgården, about 100 km NW from Sundsvall, Sweden. The catchment area (50 ha) of the stream Fanbergsbäcken was treated with wood ash in September of 2004 (3,000 kg/ha;selfhardened crush-ash). In general, both biological (diatoms) and chemical (pH, alkalinity, and aluminum (Al) measurements) indicators have shown no significant effect on acidification parameters from the addition of wood ash. There was, however, evidence of an increased pH during spring flood, accompanied with a decrease in the frequency of low pH values (<5.6) during spring flood. In addition to this, alkalinity was significantly higher in the period 2005-2006, compared to that of 2003. High concentrations of toxic forms of Al repeatedly occured in the stream Fanbergsbäcken, and the WAA did not affect the frequencies of high concentrations of toxic Al forms (<50 μg/l). Both the moss F. antipyretica and the leaves from Alnus incana displayed increased potassium (K) concentrations, although other nutrients did not increase from WAA. In conclusion, no evidence of WAA being effective in restoring or improving the ecological status of freshwater environments has been established, either in the literature or in the present field study. On the other hand, there were no indications of harmful effects due to WAA, either. However, we still do not know the effects of wood ash on several organisms (predominantly invertebrates) inhabiting small ponds and other, temporary or permanent, freshwater ecosystems. In the context of WAA, these environments and organisms have not attended any attention in the research published to date, and future studies are strongly encouraged.
|
Page generated in 0.0737 seconds