منابع مشابه
Maximum height in a conifer is associated with conflicting requirements for xylem design.
Despite renewed interest in the nature of limitations on maximum tree height, the mechanisms governing ultimate and species-specific height limits are not yet understood, but they likely involve water transport dynamics. Tall trees experience increased risk of xylem embolism from air-seeding because tension in their water column increases with height because of path-length resistance and gravit...
متن کاملChanges in context and perception of maximum reaching height.
Successfully performing a given behavior requires flexibility in both perception and behavior. In particular, doing so requires perceiving whether that behavior is possible across the variety of contexts in which it might be performed. Three experiments investigated how (changes in) context (ie point of observation and intended reaching task) influenced perception of maximum reaching height. Th...
متن کاملThe maximum height of grasses is determined by roots.
Grasses such as bamboos can produce upright stems more than 30 m tall, yet the processes that constrain plant height in this important group have never been investigated. Air embolisms form commonly in the water transport system of grasses and we hypothesised that root pressure-dependent refilling these embolisms should limit the maximum height of grass species to the magnitude of their root pr...
متن کاملUsing Answer Set Programming to Find Maximum Height Spanning Trees
The max tree-height of an undirected graph is the longest possible length of a path among all spanning trees of the graph. A maximum height spanning tree of an undirected graph is a spanning tree that has a path of length equal to the max tree-height of the graph. Finding the max tree-height of a graph, or similarly some spanning tree of maximum height, is an NP-hard optimization problem for wh...
متن کاملHitting time results for Maker-Breaker games
We analyze classical Maker-Breaker games played on the edge set of a randomly generated graph G. We consider the random graph process and analyze, for each of the properties “being spanning k-vertex-connected” , “admitting a perfect matching”, and “being Hamiltonian”, the first time when Maker starts having a winning strategy for building a graph possessing the target property (the so called hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Coastal Engineering Proceedings
سال: 1972
ISSN: 2156-1028,0589-087X
DOI: 10.9753/icce.v13.21