Linking forest edge structure to edge function: mediation of herbivore damage

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge Effects on Forest Composition and Structure

Forest fragmentation arising from modern forestry practices has dramatically increased the amount of edge habitat relative to interior habitat. Edge habitats have unique microenvironments that have the potential to profoundly impact forest communities. In this study, we characterized the forest composition and structure of edge and interior plots within a second growth big leaf maple-Douglas fi...

متن کامل

Edge Extraction and Linking

Many computer vision systems use edge detection as an important part of the processing. This can be divided into two phases: converting the input image into another image in which the edges are clearly delineated; and, converting the image based representation into an explicit description of the location and interconnectivity of the edges, for example, a list of connected edge elements. Algorit...

متن کامل

Multiresolution sequential edge linking

In this paper we describe a multiresolution approach to edge detection using a sequential search algorithm. The use of a multiresolution image pyramid allows integration of global edge information contained in lower resolutions to guide the sequential search at higher resolutions. As a consequence, dependence on a priori knowledge about the image edges is greatly reduced. Estimating the sequent...

متن کامل

Sufficient conditions for maximally edge-connected and super-edge-connected

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

متن کامل

EDGE LINKING AND JUNCTION PRESERVATIONDr

An edge detector produces an image in which edge information is stored implicitly. For example, the output may consist of an image in which the (multi-dimensional) values are non-zero only at edge elements. An edge extraction algorithm converts the edge information into an explicit representation of junction locations and the edge elements connecting them. This paper presents an edge extraction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Ecology

سال: 2000

ISSN: 0022-0477,1365-2745

DOI: 10.1046/j.1365-2745.2000.00423.x