13,436 research outputs found
Existentially Closed Models in the Framework of Arithmetic
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (parameter free) П1–formula. This definition is optimal with respect to quantifier complexity and allows us to improve some previously known results on existentially closed models of fragments of arithmetic.Ministerio de Educación y Ciencia MTM2011–2684
Large-scale Spatial Distribution Identification of Base Stations in Cellular Networks
The performance of cellular system significantly depends on its network
topology, where the spatial deployment of base stations (BSs) plays a key role
in the downlink scenario. Moreover, cellular networks are undergoing a
heterogeneous evolution, which introduces unplanned deployment of smaller BSs,
thus complicating the performance evaluation even further. In this paper, based
on large amount of real BS locations data, we present a comprehensive analysis
on the spatial modeling of cellular network structure. Unlike the related
works, we divide the BSs into different subsets according to geographical
factor (e.g. urban or rural) and functional type (e.g. macrocells or
microcells), and perform detailed spatial analysis to each subset. After
examining the accuracy of Poisson point process (PPP) in BS locations modeling,
we take into account the Gibbs point processes as well as Neyman-Scott point
processes and compare their accuracy in view of large-scale modeling test.
Finally, we declare the inaccuracy of the PPP model, and reveal the general
clustering nature of BSs deployment, which distinctly violates the traditional
assumption. This paper carries out a first large-scale identification regarding
available literatures, and provides more realistic and more general results to
contribute to the performance analysis for the forthcoming heterogeneous
cellular networks
A localic theory of lower and upper integrals
An account of lower and upper integration is given. It is constructive in the sense of geometric logic. If the integrand takes its values in the non-negative lower reals, then its lower integral with respect to a valuation is a lower real. If the integrand takes its values in the non-negative upper reals,then its upper integral with respect to a covaluation and with domain of
integration bounded by a compact subspace is an upper real. Spaces of valuations and of covaluations are defined.
Riemann and Choquet integrals can be calculated in terms of these lower and upper integrals
Saturation in the Hypercube and Bootstrap Percolation
Let denote the hypercube of dimension . Given , a spanning
subgraph of is said to be -saturated if it does not
contain as a subgraph but adding any edge of
creates a copy of in . Answering a question of Johnson and Pinto, we
show that for every fixed the minimum number of edges in a
-saturated graph is .
We also study weak saturation, which is a form of bootstrap percolation. A
spanning subgraph of is said to be weakly -saturated if the
edges of can be added to one at a time so that each
added edge creates a new copy of . Answering another question of Johnson
and Pinto, we determine the minimum number of edges in a weakly
-saturated graph for all . More generally, we
determine the minimum number of edges in a subgraph of the -dimensional grid
which is weakly saturated with respect to `axis aligned' copies of a
smaller grid . We also study weak saturation of cycles in the grid.Comment: 21 pages, 2 figures. To appear in Combinatorics, Probability and
Computin
Two-tier Spatial Modeling of Base Stations in Cellular Networks
Poisson Point Process (PPP) has been widely adopted as an efficient model for
the spatial distribution of base stations (BSs) in cellular networks. However,
real BSs deployment are rarely completely random, due to environmental impact
on actual site planning. Particularly, for multi-tier heterogeneous cellular
networks, operators have to place different BSs according to local coverage and
capacity requirement, and the diversity of BSs' functions may result in
different spatial patterns on each networking tier. In this paper, we consider
a two-tier scenario that consists of macrocell and microcell BSs in cellular
networks. By analyzing these two tiers separately and applying both classical
statistics and network performance as evaluation metrics, we obtain accurate
spatial model of BSs deployment for each tier. Basically, we verify the
inaccuracy of using PPP in BS locations modeling for either macrocells or
microcells. Specifically, we find that the first tier with macrocell BSs is
dispersed and can be precisely modelled by Strauss point process, while Matern
cluster process captures the second tier's aggregation nature very well. These
statistical models coincide with the inherent properties of macrocell and
microcell BSs respectively, thus providing a new perspective in understanding
the relationship between spatial structure and operational functions of BSs
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics,
presented in a formalism based on nested sequents. A nested sequent can be seen
as a tree of traditional single-sided sequents. Our first style of calculi is
what we call "shallow calculi", where inference rules are only applied at the
root node in a nested sequent. Our shallow calculi are extensions of Kashima's
calculus for tense logic and share an essential characteristic with display
calculi, namely, the presence of structural rules called "display postulates".
Shallow calculi enjoy a simple cut elimination procedure, but are unsuitable
for proof search due to the presence of display postulates and other structural
rules. The second style of calculi uses deep-inference, whereby inference rules
can be applied at any node in a nested sequent. We show that, for a range of
extensions of tense logic, the two styles of calculi are equivalent, and there
is a natural proof theoretic correspondence between display postulates and deep
inference. The deep inference calculi enjoy the subformula property and have no
display postulates or other structural rules, making them a better framework
for proof search
- …