中国积雪时空演变特征及其与海气环流因子的时序关联性

积雪时空变化作为表征增暖背景下冰冻圈的重要指标之一,在全球气候变化科学研究中具有重要作用。采用1961—2016年中国545个气象观测站的积雪日数、积雪深度日值数据和3个海气环流因子,通过多种统计方法,诊断中国积雪的时空演变特征及积雪与海气环流因子的时频相关性。结果表明:(1)1961—2016年中国积雪日数和深度在波动中呈缓慢增加趋势,且具有明显的年代分段变化特征。中国积雪日数和深度均具有30a和50a的周期振荡特征,其中积雪深度在1969年发生突变。(2)1961—2016年中国气候态积雪日数和深度具有明显的南低北高的空间分异特征,尤其是东北、内蒙古东部和新疆北部的积雪较多分布。中国积雪多寡具有明显的年代和区域分异特征。(3)在变化趋势上,1961—2016年中国积雪日数在东北和内蒙古东部趋于增多;而积雪深度除上述区域外,在华北、西北和江淮东部也趋于增多。在波动特征上,中国积雪日数和深度在华南南部、云南和四川东部波动较大,其它地区波动相对较小。(4)与海气因子时频关联性上,中国积雪与不同海气因子关联性不同,且与同一因子在不同时段的关联性也有一定差异。     

不同灌溉量对退化草地的生态恢复作用

在希拉穆仁草原进行了为期3年的草地灌溉试验,对测试的试验地在灌溉3年期间及停灌后1年内进行了植被调查和土壤种子库发芽试验,结果表明：一是灌溉可以明显提高草地植被的生产性能且不同灌溉量间并无明显差异。当停止灌溉后,原灌溉样地的植被生产性能均略低于无灌溉对照区,且不同灌溉量间也无明显差异。二是不同灌溉量样地植被物种组成与无灌溉对照区的Bray-curtis相似性系数始终保持在0.8左右,表明灌溉期间群落结构并未发生很大变化。当停止灌溉后,原灌溉样地与无灌溉对照区的Bray-curtis相似性系数下降为充足灌溉区0.61和中度灌溉区0.55,表明灌溉对植物的生存策略有一定的影响且不同灌溉量基本相同。三是土壤中的种子总数量有所增加,但物种的数量有所减少。充足灌溉样地土壤种子库情况略差于无灌溉对照区,中度灌溉样地则略好于无灌溉对照区,表明不同灌溉量对植物的繁殖策略有一定的影响。     

不同土地利用/覆被条件下松嫩盆地降水入渗补给量研究

土地利用/覆被条件是降水入渗补给量的主要影响因素,近10年来松嫩盆地土地利用/覆被变化显著.本次研究采WetSpass模型计算土地利用/覆被条件不同对降水入渗补给量的影响.定性分析不同土地利用/覆被类型的转化对降水入渗补给量的影响,并计算1995～2005这10年间,松嫩盆地的土地利用/覆被条件变化对其年均降水入渗补给...     

The Sanaga discharge at the Edea Catchment outlet (Cameroon): An example of hydrologic responses of a tropical rain‐fed river system to changes in precipitation and groundwater inputs and to flow regulation

The Sanaga River is one of Sub‐Saharan Africa's largest and greatly regulated rivers. Available flow data for this hydrosystem largely cover the pre‐ and post‐regulation periods. From comparisons between unregulated (hypothetical) and observed scenarios, it has been possible to separate and to quantify hydro‐climatic (groundwater + rainfall) change effects from anthropogenic impacts (especially dam‐related alterations). To appreciate shifts in the river regime, discontinuity detection tests and the IHA model were applied to discharge data series reflecting average and extreme flow conditions, respectively. Results obtained principally from the Hubert segmentation method reveal that a major discontinuity occurred in 1970–1971 separating a surplus phase between 1945–1946 and 1969–1970, and a deficient and much contrasted one, from 1971/1972. This implies that the Sanaga catchment is dominantly affected by hydro‐climatic changes. However, wide land cover/land use changes experienced here since 1988 have resulted in an increase in surface runoff. Additional quickflows linked to these changes may have partly compensated for the substantial decline in the dry season rainfall and groundwater inputs observed from this date. Although at the monthly scale, dam‐related impacts on average flows increase with stage of regulation, the seasonal variability of the river regime remains generally unaffected. A comparison of the IHA statistics, calculated from unregulated and observed streamflow data, show that hydrologic shifts occurring in maximum and minimum discharges are mostly significant from 1971/1972 and are mainly due to the action of dams. Minimum flows appear, however, widely impacted, thus reflecting the prime objective assigned to the existing reservoirs, constructed to supplement flows for hydroelectricity production during the dry season. Copyright © 2010 John Wiley & Sons, Ltd.     

The two-equal-disjoint path cover problem of Matching Composition Network

Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u,v) and (w,x) of G, there exist two disjoint paths P and Q satisfied that (1) P (Q, respectively) joins u and v (w and x, respectively), (2) |P|=|Q|, and (3) V(PQ)=V(G). The Matching Composition Network (MCN) is a family of networks which two components are connected by a perfect matching. In this paper, we consider the globally two-equal-disjoint path cover property of MCN. Applying our result, the Crossed cube CQ_n, the Twisted cube TQ_n, and the Möbius cube MQ_n can all be proven to be globally two-equal-disjoint path coverable for n5.     

Some challenges in global land cover mapping: An assessment of agreement and accuracy in existing 1 km datasets

Many investigators need and use global land cover maps for a wide variety of purposes. Ironically, after many years of very limited availability, there are now multiple global land cover maps and it is not readily apparent (1) which is most useful for particular applications or (2) how to combine the different maps to provide an improved dataset. The existing global land cover maps at 1 km spatial resolution have arisen from different initiatives and are based on different remote sensing data and employed different methodologies. Perhaps more significantly, they have different legends. As a result, comparison of the different land cover maps is difficult and information about their relative utility is limited. In an attempt to compare the datasets and assess their strengths and weaknesses we harmonized the thematic legends of four available coarse-resolution global land cover maps (IGBP DISCover, UMD, MODIS 1-km, and GLC2000) using the LCCS-based land cover legend translation protocols. Analysis of the agreement among the global land cover maps and existing validation information highlights general patterns of agreement, inconsistencies and uncertainties. The thematic classes of Evergreen broadleaf trees, Snow and Ice, and Barren show high producer and user accuracy and good agreement among the datasets, while classes of mixed tree types show high commission errors. Overall, the results show a limited ability of the four global products to discriminate mixed classes characterized by a mosaic of trees, shrubs, and herbaceous vegetation. There is a strong relationship between class accuracy, spatial agreement among the datasets, and the heterogeneity of landscapes. Suggestions for future mapping projects include careful definition of mixed unit classes, and improvement in mapping heterogeneous landscapes.     

An application of MODIS data to snow cover monitoring in a pastoral area: A case study in Northern Xinjiang, China

Snow is an important land cover on the earth's surface. It is characterized by its changing nature. Monitoring snow cover extent plays a significant role in dynamic studies and prevention of snow-caused disasters in pastoral areas. Using NASA EOS Terra/MODIS snow cover products and in situ observation data during the four snow seasons from November 1 to March 31 of year 2001 to 2005 in northern Xinjiang area, the accuracy of MODIS snow cover mapping algorithm under varied snow depth and land cover types was analyzed. The overall accuracy of MODIS daily snow cover mapping algorithm in clear sky condition is high at 98.5%; snow agreement reaches 98.2%, and ranges from 77.8% to 100% over the 4-year period for individual sites. Snow depth (SD) is one of the major factors affecting the accuracy of MODIS snow cover maps. MODIS does not identify any snow for SD less than 0.5 cm. The overall accuracy increases with snow depth if SD is equal to or greater than 3 cm, and decreases for SD below 3 cm. Land cover has an important influence in the accuracy of MODIS snow cover maps. The use of MOD10A1 snow cover products is severely affected by cloud cover. The 8-day composite products of MOD10A2 can effectively minimize the effect of cloud cover in most cases. Cloud cover in excess of 10% occurs on 99% of the MOD10A1 products and 14.7% of the MOD10A2 products analyzed during the four snow seasons. User-defined multiple day composite images based on MOD10A1, with flexibilities of selecting composite period, starting and ending date and composite sequence of MOD10A1 products, have an advantage in effectively monitoring snow cover extent for regional snow-caused disasters in pastoral areas.     

Use of a dark object concept and support vector machines to automate forest cover change analysis

An automated method was developed for mapping forest cover change using satellite remote sensing data sets. This multi-temporal classification method consists of a training data automation (TDA) procedure and uses the advanced support vector machines (SVM) algorithm. The TDA procedure automatically generates training data using input satellite images and existing land cover products. The derived high quality training data allow the SVM to produce reliable forest cover change products. This approach was tested in 19 study areas selected from major forest biomes across the globe. In each area a forest cover change map was produced using a pair of Landsat images acquired around 1990 and 2000. High resolution IKONOS images and independently developed reference data sets were available for evaluating the derived change products in 7 of those areas. The overall accuracy values were over 90% for 5 areas, and were 89.4% and 89.6% for the remaining two areas. The user's and producer's accuracies of the forest loss class were over 80% for all 7 study areas, demonstrating that this method is especially effective for mapping major disturbances with low commission errors. IKONOS images were also available in the remaining 12 study areas but they were either located in non-forest areas or in forest areas that did not experience forest cover change between 1990 and 2000. For those areas the IKONOS images were used to assist visual interpretation of the Landsat images in assessing the derived change products. This visual assessment revealed that for most of those areas the derived change products likely were as reliable as those in the 7 areas where accuracy assessment was conducted. The results also suggest that images acquired during leaf-off seasons should not be used in forest cover change analysis in areas where deciduous forests exist. Being highly automatic and with demonstrated capability to produce reliable change products, the TDA-SVM method should be especially useful for quantifying forest cover change over large areas.     

Path Hitting in Acyclic Graphs

An instance of the path hitting problem consists of two families of paths, and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to and ℋ as the sets of demand and hitting paths, respectively. When p∈ℋ and share at least one mutual edge, we say that p hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of . In this paper we provide constant factor approximation algorithms for path hitting, confined to instances in which the underlying graph is a tree, a spider, or a star. Although such restricted settings may appear to be very simple, we demonstrate that they still capture some of the most basic covering problems in graphs. Our approach combines several novel ideas: We extend the algorithm of Garg, Vazirani and Yannakakis (Algorithmica, 18:3–20, 1997) for approximate multicuts and multicommodity flows in trees to prove new integrality properties; we present a reduction that involves multiple calls to this extended algorithm; and we introduce a polynomial-time solvable variant of the edge cover problem, which may be of independent interest. An extended abstract of this paper appeared in Proceedings of the 14th Annual European Symposium on Algorithms, 2006. This work is part of D. Segev’s Ph.D. thesis prepared at Tel-Aviv University under the supervision of Prof. Refael Hassin.     

Approximation algorithms for partially covering with edges

The edge dominating set (EDS) and edge-cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or vertices, respectively, of a graph. We consider the generalized partial cover version of these problems, in which failing to cover an edge, in the EDS case, or vertex, in the EC case, induces a penalty. Given a bound on the total amount of penalties that we are permitted to pay, the objective is to find a minimum cost cover with respect to this bound. We give an 8/3-approximation for generalized partial EDS. This result matches the best-known guarantee for the {0,1}-EDS problem, a specialization in which only a specified set of edges need to be covered. Moreover, 8/3 corresponds to the integrality gap of the natural formulation of the {0,1}-EDS problem. Our techniques can also be used to derive an approximation scheme for the generalized partial edge-cover problem, which is -complete even though the uniform penalty version of the partial edge-cover problem is in .