36 resultados para unit disk graphs
em Consorci de Serveis Universitaris de Catalunya (CSUC), Spain
Resumo:
The main aim of this short paper is to advertize the Koosis theorem in the mathematical community, especially among those who study orthogonal polynomials. We (try to) do this by proving a new theorem about asymptotics of orthogonal polynomi- als for which the Koosis theorem seems to be the most natural tool. Namely, we consider the case when a SzegÄo measure on the unit circumference is perturbed by an arbitrary measure inside the unit disk and an arbitrary Blaschke sequence of point masses outside the unit disk.
Resumo:
Investigación producida a partir de una estancia en la London South Bank University, Reino Unido, entre los meses de setiembre y diciembre del 2005. Se estudia el trabajo sexual en el Reino Unido desde tres perspectivas diferentes. Por una parte, se trata la historia del feminismo anglosajón respecto a sus visiones sobre la prostitución, desde una aproximación a las fuentes. Por otra parte, se plantea la situación jurídico-política. Finalmente, se presenta brevemente a las principales entidades que dan apoyo al colectivo de trabajadoras del sexo en la ciudad de Londres.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
In this paper we study basic properties of the weighted Hardy space for the unit disc with the weight function satisfying Muckenhoupt's (Aq) condition, and study related approximation problems (expansion, moment and interpolation) with respect to two incomplete systems of holomorphic functions in this space.
Resumo:
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.
Resumo:
Estudi elaborat a partir d’una estada al Center for Socio-Legal Studies de la Universitat d’Oxford, Gran Bretanya, entre setembre del 2006 i gener del 2007. L'objectiu d'aquesta recerca ha estat determinar i avaluar com la política de la competència de la Unió Europea ha contribuït a la configuració del sector públic televisiu espanyol i britànic. El marc teòric està basat en el concepte d’ “europeització”, desenvolupat per Harcourt (2002) en el sector de mitjans, i que implica una progressiva referencialitat de les polítiques estatals amb les europees mitjançant dos mecanismes: la redistribució de recursos i els efectes en la socialització de la política europea. Per tal de verificar aquest impacte en el sector televisiu, la recerca ha desenvolupat una aproximació en dues etapes. En primer lloc, a banda de fer un inicial repàs bibliogràfic s'han estudiat les accions de la Comissió Europea en aquest terreny, sobre tot la Comunicació sobre aplicació de la reglamentació d'ajudes públiques al sector de la radiodifusió de 2001. En una segona etapa, s'han desenvolupat un seguit d'entrevistes personals a directius i polítics del sector a Brussel•les, Londres i Madrid. Els resultats de la recerca mostren que el procés d’Europeïtzació es un fenomen creixent en el sector audiovisual públic a Espanya i el Regne Unit, però que encara les peculiaritats estatals juguen un factor preponderant en regular aquesta influència de la UE. L'anàlisi de les entrevistes qualitatives mostren també que hi ha una relació inversament proporcional entre la tradició democràtica i el grau d’influència i de referència que suposa la UE en el sector audiovisual. Mentre que el Regne Unit, l'acció de la política de la competència de la UE es percep com a element suplementari, a Espanya la seva referencialitat ha estat clau, tot i que no decisiva, per la reforma dels mitjans públics estatals.
Resumo:
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.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
This paper tests for real interest parity (RIRP) among the nineteen major OECD countries over the period 1978:Q2-1998:Q4. The econometric methods applied consist of combining the use of several unit root or stationarity tests designed for panels valid under cross-section dependence and presence of multiple structural breaks. Our results strongly support the fulfillment of the weak version of the RIRP for the studied period once dependence and structural breaks are accounted for.
Resumo:
A multiple-partners assignment game with heterogeneous sales and multiunit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of units. We define a competitive equilibrium for this generalized assignment game and prove its existence by using only linear programming. In particular, we show how to compute equilibrium price vectors from the solutions of the dual linear program associated to the primal linear program defined to find optimal assignments. Using only linear programming tools, we also show (i) that the set of competitive equilibria (pairs of price vectors and assignments) has a Cartesian product structure: each equilibrium price vector is part of a competitive equilibrium with all optimal assignments, and vice versa; (ii) that the set of (restricted) equilibrium price vectors has a natural lattice structure; and (iii) how this structure is translated into the set of agents' utilities that are attainable at equilibrium.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
El Port d'Informació Científica és un centre de Computació Grid de referència que dona suport a comunitats científiques, com el LHC (CERN). Al PIC, trobem una gran varietat de tecnologies que proporcionen serveis al centre. Des de l'arquitectura i elements de la xarxa, fins a recursos informàtics de computació, sistemes d'emmagatzematge a disc i cinta magnètica, bases de dades (ORACLE/PostgreSQL). El projecte consisteix en el disseny i implementació d'una base de dades col·lectora de tota la informació rellevant dels diferents sistemes del centre, i un portal web on mostrar tots els valors i gràfiques, tot basat en programari lliure.
Resumo:
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.
Resumo:
We use historical data that cover more than one century on real GDP for industrial countries and employ the Pesaran panel unit root test that allows for cross-sectional dependence to test for a unit root on real GDP. We find strong evidence against the unit root null. Our results are robust to the chosen group of countries and the sample period. Key words: real GDP stationarity, cross-sectional dependence, CIPS test. JEL Classification: C23, E32
Resumo:
iii. Catheter-related bloodstream infection (CR-BSI) diagnosis usually involves catheter withdrawal. An alternative method for CR-BSI diagnosis is the differential time to positivity (DTP) between peripheral and catheter hub blood cultures. This study aims to validate the DTP method in short-term catheters. The results show a low prevalence of CR-BSI in the sample (8.4%). The DTP method is a valid alternative for CR-BSI diagnosis in those cases with monomicrobial cultures (80% sensitivity, 99% specificity, 92% positive predictive value, and 98% negative predictive value) and a cut-off point of 17.7 hours for positivity of hub blood culture may assess in CR-BSI diagnosis.