Modernização administrativa O licenciamento zero das atividades económicas nas Autarquias locais - Câmara Municipal de Óbidos

Dissertação de Mestrado em MPA – Administração Pública

Modelagem de ocorrência e densidade de juvenis de Callinectes sapidus (Decapoda, Portunidae) em dois estuários do Rio Grande do Sul, com dados zero-inflacionados

Dados de contagem de juvenis de siri-azul (Callinectes sapidus Rathbun, 1896) coletados em dois estuários do Rio Grande do Sul são objeto do presente estudo. Por se encontrarem zero-inflacionados, esses dados motivaram a formulação de modelos hierárquicos, que quantificam o efeito das covariáveis categóricas mês e local sobre a probabilidade de ocorrência e densidade dessas populações, levando em conta a detecção imperfeita. Foram também desenvolvidos modelos não-hierárquicos para comparação. Uma abordagem Bayesiana foi adotada para a estimação dos parâmetros dos modelos por simulação Monte Carlo com Cadeias de Markov (MCMC). A comparação entre modelos foi feita com o Critério de Informação da Deviância (DIC). Os modelos hierárquicos apresentaram ajustes melhores que os modelos convencionais, mitigaram o problema do excesso de zeros e permitiram analisar simultaneamente as probabilidades de ocorrência e a densidade de juvenis de siri-azul. No estuário da Lagoa dos Patos, a probabilidade de ocorrência de juvenis na Classe 2 aumenta com a distância da desembocadura, enquanto em Tramandaí os pontos intermediários apresentam as maiores probabilidades. Em ambos os estuários a ocorrência é mais provável nos meses de verão e de inverno. A densidade de juvenis da Classe 2 apresenta marcada variação em relação aos meses do ano sendo, em geral, maior no estuário de Tramandaí.

Real rank zero algebras have the corona factorization property

The purpose of this short note is to prove that a stable separable C*-algebra with real rank zero has the so-called corona factorization property, that is, all the full multiplier projections are properly in finite. Enroute to our result, we consider conditions under which a real rank zero C*-algebra admits an injection of the compact operators (a question already considered in [21]).

On the number of K3,3-minor-free and maximal K3,3-minor-free graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

Pure motives, mixed motives and extensions of motives associated to singular surfaces

We first recall the construction of the Chow motive modelling intersection cohomology of a proper surface X and study its fundamental properties. Using Voevodsky's category of effective geometrical motives, we then study the motive of the exceptional divisor D in a non-singular blow-up of X. If all geometric irreducible components of D are of genus zero, then Voevodsky's formalism allows us to construct certain one-extensions of Chow motives, as canonical subquotients of the motive with compact support of the smooth part of X. Specializing to Hilbert-Blumenthal surfaces, we recover a motivic interpretation of a recent construction of A. Caspar.

Disseny d'un divisor de potència programable per aplicació a antenes reconfigurables

En sistemes de comunicacions moderns, es dedica un interès especial als circuits i dispositius reconfigurables, tant per aplicacions comercials com militars. Aquest interès es fonamenta en la necessitat de sistemes d'altes prestacions i en les especificacions creixentment restrictives que això suposa en un ampli ventall d'aspectes. Dins aquest marc de reconfigurabilitat i adaptabilitat s'emmcarca el disseny proposat en el present projecte: un divisor de potència variable.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

Diseño e implementación de un divisor de potencia en banda dual con estructuras metamateriales basadas en CSRRs

L'electromagnetisme és una branca de la física que està en continu estudi. Fins a mitjans de la dècada dels 60 es pensava que, per a la propagació de les ones electromagnètiques fos possible, els medis propagatius havien de presentar una permitivitat dielèctrica i una permeabilitat magnètica simultàniament positives. No obstant, Victor G. Veselago va revolucionar la teoria electromagnètica amb la idea dels medis amb ε i μ negatives i va donar amb això origen als medis metamaterials. En el present treball s'estudiaran els principis físics en els que es fonamenten els metamaterials. Es veuran algunes de les seves característiques que els converteixen en medis exòtics i com aquestes poden ser utilitzades en el desenvolupament de dispositius amb prestacions difícils d'obtenir amb les tecnologies convencionals. A continuació s'aplicaran els conceptes tractats en el disseny d'un inversor d'impedàncies implementat mitjançant ressonadors en anells oberts complementaris. Aquest dispositiu, que presentarà un funcionament en banda dual, serà utilitzat en el posterior disseny d'un divisor de potencia. Finalment es realitzarà la implementació física del divisor de potencia dissenyat i es verificarà el seu correcte funcionament amb les mesures pertinents.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

On the growth rate of minor-closed classes of graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

What Belongs Where? Variable Selection for Zero-Inflated Count Models with an Application to the Demand for Health Care

This paper develops stochastic search variable selection (SSVS) for zero-inflated count models which are commonly used in health economics. This allows for either model averaging or model selection in situations with many potential regressors. The proposed techniques are applied to a data set from Germany considering the demand for health care. A package for the free statistical software environment R is provided.

On graphs with few disjoint t-stars

"Vegeu el resum a l'inici del document del fitxer adjunt."

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

Comparing Multilevel Clustering Methods on Weighted Graphs : The Case of Worldwide Air Passenger Traffic 2000-2004

Specific properties emerge from the structure of large networks, such as that of worldwide air traffic, including a highly hierarchical node structure and multi-level small world sub-groups that strongly influence future dynamics. We have developed clustering methods to understand the form of these structures, to identify structural properties, and to evaluate the effects of these properties. Graph clustering methods are often constructed from different components: a metric, a clustering index, and a modularity measure to assess the quality of a clustering method. To understand the impact of each of these components on the clustering method, we explore and compare different combinations. These different combinations are used to compare multilevel clustering methods to delineate the effects of geographical distance, hubs, network densities, and bridges on worldwide air passenger traffic. The ultimate goal of this methodological research is to demonstrate evidence of combined effects in the development of an air traffic network. In fact, the network can be divided into different levels of âeurooecohesionâeuro, which can be qualified and measured by comparative studies (Newman, 2002; Guimera et al., 2005; Sales-Pardo et al., 2007).