Filetype
As a way to understand vegetation changes, trend analysis on NDVI (normalized difference vegetation index) time series data have been widely performed at regional to global scales. However, most long-term NDVI datasets are based upon multiple sensor systems and unsuccessful corrections related to sensor shifts potentially introduce substantial uncertainties and artifacts in the analysis of trends.
Numerous coal fires burn underneath the Datong coalfield because of indiscriminate mining. Landsat TM/ETM, unmanned aerial vehicle (UAV), and infrared thermal imager were employed to monitor underground coal fires in the Majiliang mining area. The thermal field distributions of this area in 2000, 2002, 2006, 2007, and 2009 were obtained using Landsat TM/ETM. The changes in the distribution were th
The impact of human activities via land use/cover changes on NDVI trends is critical for an improved understanding of satellite-observed changes in vegetation productivity in drylands. The dominance of positive NDVI trends in the Sahel, the so-called re-greening, is sometimes interpreted as a combined effect of an increase in rainfall and cropland expansion or agricultural intensification. Yet, th
Woody vegetation in global tropical drylands is of significant importance for both the interannual variability of the carbon cycle and local livelihoods. Satellite observations over the past decades provide a unique way to assess the vegetation long-term dynamics across biomes worldwide. Yet, the actual changes in the woody vegetation are always hidden by interannual fluctuations of the leaf densi
A limitation of current LoRa networks is their single-hop nature. This causes difficulties in areas with poor Internet access, such as remote rural areas, or challenging radio environments, for example in metropolitan areas, as the LoRa gateway must be placed at a location with backhaul access to the network server, but must nonetheless be reachable by all end devices. To facilitate these applicatA limitation of current LoRa networks is their single-hop nature. This causes difficulties in areas with poor Internet access, such as remote rural areas, or challenging radio environments, for example in metropolitan areas, as the LoRa gateway must be placed at a location with backhaul access to the network server, but must nonetheless be reachable by all end devices. To facilitate these applicat
The rapidly growing human population in sub-Saharan Africa generates increasing demand for agricultural land and forest products, which presumably leads to deforestation. Conversely, a greening of African drylands has been reported, but this has been difficult to associate with changes in woody vegetation. There is thus an incomplete understanding of how woody vegetation responds to socio-economic
Woody vegetation in farmland acts as a carbon sink and provides ecosystem services for local people, but no macroscale assessments of the impact of management and climate on woody cover exist for drylands. Here we make use of very high spatial resolution satellite imagery to derive wall-to-wall woody cover patterns in tropical West African drylands. Our study reveals that mean woody cover in farml
Adverse weather conditions can cause deterioration of wireless channels, leading to reduced link capacities. Unlike in other types of networks, in radio-based wireless mesh networks, the link capacities depend not only on the prevailing conditions, but also on interfering transmissions, as well as the transmission power and modulation and coding schemes used. This leads to increased difficulty in Adverse weather conditions can cause deterioration of wireless channels, leading to reduced link capacities. Unlike in other types of networks, in radio-based wireless mesh networks, the link capacities depend not only on the prevailing conditions, but also on interfering transmissions, as well as the transmission power and modulation and coding schemes used. This leads to increased difficulty in
Understanding the relationships between snow and vegetation is important for interpretation of the responses of alpine ecosystems to climate changes. The Qinghai-Tibetan Plateau is regarded as an ideal area due to its undisturbed features with low population and relatively high snow cover. We used 500 m Moderate Resolution Imaging Spectroradiometer (MODIS) datasets during 2001–2010 to examine the
We consider the pebble game on DAGs with bounded fan-in introduced in [Paterson and Hewitt '70] and the reversible version of this game in [Bennett '89], and study the question of how hard it is to decide exactly or approximately the number of pebbles needed for a given DAG in these games. We prove that the problem of deciding whether s pebbles suffice to reversibly pebble a DAG G is PSPACE-comple
We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al. '99] also on proof size. [Alekhnovich and Razborov'03] established that if the clause-variable incidence graph of a CNF formula F is a good enough expander, then proving that F is unsatisfiable requires high PC/PCR degree. We further
We exhibit families of 4-CNF formulas over n variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) d but require SOS proofs of size nΩ(d) for values of d = d(n) from constant all the way up to nδ for some universal constant δ. This shows that the nO(d) running time obtained by using the Lasserre semidefinite programming relaxations to find degree-d SOS proofs
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of a Conjunctive Normal Form (CNF) formula is always an upper bound on the width needed to refute the formula. Their proof is beautiful but uses a nonconstructive argument based on Ehrenfeucht-Fraïssé games. We give an alternative, more explicit, proof that works
During the last 10 to 15 years, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs. Besides being a natural complexity measure of intrinsic interest, space is also an important concern in SAT solving, and so research has mostly focused on weak systems that are used by SAT solvers. There has been a relatively long sequence of paper
In 2010, Spence and Van Gelder presented a family of CNF formulas based on combinatorial block designs. They showed empirically that this construction yielded small instances that were orders of magnitude harder for state-of-the-art SAT solvers than other benchmarks of comparable size, but left open the problem of proving theoretical lower bounds. We establish that these formulas are exponentially
This talk is intended as a selective survey of proof complexity, focusing on some comparatively weak proof systems that are of particular interest in connection with SAT solving. We will review resolution, polynomial calculus, and cutting planes (related to conflict-driven clause learning, Gröbner basis computations, and pseudo-Boolean solvers, respectively) and some proof complexity measures that
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of formulas is always an upper bound on the width needed to refute them. Their proof is beautiful but somewhat mysterious in that it relies heavily on tools from finite model theory. We give an alternative, completely elementary, proof that works by simple syntact
We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size nω(w). This shows that the simple counting argument that any formula refutable in width w must have a proof in size nO(ω) is essentially tight. Moreover, our lower bounds can be generalized to polynomial calculus resolution (PCR) and Sherali-Adams, implying tha
During the last decade, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of resolution are fairly well understood, but many open problems remain for the related but stronger polynomial calculus (PC/PCR) proof system. For instance, the space complexity of many standard "benchmark formulas" is
