Reconstructing mean maximum temperatures of May–August from tree-ring maximum density in North Da Hinggan Mountains, China
نویسندگان
چکیده
منابع مشابه
Statistical Analysis of Relationships between Monthly Maximum Temperatures in Iran and Global Mean Land-Ocean Temperature Anomalies
Global warming and the meaningful relationship between temperature and precipitation changes over different areas of the earth with temperature increment of the earth, are considered as the most important patterns of this century’s climate changes. Today, there is debate over climate change and global temperatures increasing. Damaging effects of this phenomenon on the planet is one of the most ...
متن کاملFinding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E , where w(e) is an edge weight function for e ∈ E . The density of a path, say e1, e2, . . . , ek , is defined as ∑k i=1 w(ei )/k. The length of a path is the number of its edges. Given a tree with n edges and a lower bound L where 1 ≤ L ≤ n, this paper presents two efficient algorithms for finding a maximum-den...
متن کاملComputing Maximum Mean Cuts
Most primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancelling negative augmenting cycles. The analogous view of dual MCNF algorithms is that they cancel positive augmenting cuts. In a companion paper we show that if a dual algorithm chooses to cancel cuts which have the greatest rate of increase in dual objective value per arc, which are called maximum mean cuts,...
متن کاملThe Maximum-Mean Subtree
In this paper, we define the Maximum-Mean Subtree problem on trees, an equivalent reformulation of the Fractional Prize-Collecting Steiner Tree Problem on Trees. We describe an algorithm that solves the Maximum-Mean Subtree problem, and prove that our algorithm runs in O(n) time in the worst case, improving a previous O(n log n) algorithm. 1 The Maximum-Mean Subtree Problem Given a rooted tree ...
متن کاملOptimized Maximum Mean Discrepancy
We propose a method to optimize the representation and distinguishability of samples from two probability distributions, by maximizing the estimated power of a statistical test based on the maximum mean discrepancy (MMD). This optimized MMD is applied to the setting of unsupervised learning by generative adversarial networks (GAN), in which a model attempts to generate realistic samples, and a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Science Bulletin
سال: 2012
ISSN: 1001-6538,1861-9541
DOI: 10.1007/s11434-012-5055-9