نتایج جستجو برای: dependent leveled height differences into unique path

تعداد نتایج: 3032708  

Journal: :Homo : internationale Zeitschrift fur die vergleichende Forschung am Menschen 2015
K Sohn

In general, women prefer men taller than themselves; this is referred to as the male-taller norm. However, since women are shorter than men on average, it is difficult to determine whether the fact that married women are on average shorter than their husbands results from the norm or is a simple artifact generated by the shorter stature of women. This study addresses the question by comparing t...

2009
Arun K. Subramanian Günther H. Peters

Secretory phospholipases A2 (sPLA2s) constitute a family of interfacially active mammalian enzymes that catalyze the cleavage of sn-2 ester bond of glycerophospholipid substrates resulting in lysophospholipid and free fatty acid [1]. sPLA2-IIA has proven to be especially interesting in therapeutic intervention since elevated levels of sPLA2-IIA is present in the microenvironment surrounding dif...

2005
Costas Busch Shailesh Kelkar Malik Magdon-Ismail

We give near optimal bufferless routing algorithms for leveled networks. N packets with preselected paths are given, and once injected, the packets may not be buffered while in transit to their destination. For the preselected paths, the dilation D is the maximum path length, and the congestion C is the maximum number of times an edge is used. We give two bufferless routing algorithms for level...

Journal: :International research journal of management, IT and social sciences 2019

2003
Christian Brenneke Oliver Wulf Bernardo Wagner

Robot navigation in poorly structured and uneven outdoor environments is an unsolved problem. Thus we present a SLAM (simultaneous localization and mapping) approach that is based on “leveled range scans”. The method is combining 3D perception with 2D localization and mapping. In this way established path planning and 2D navigation algorithms can be used in uneven terrain without the computatio...

Journal: :Therapeutic Advances in Cardiovascular Disease 2010

Journal: :SIAM J. Discrete Math. 1998
Tomasz Luczak

The behaviour of a greedy algorithm which estimates the height of a random labelled rooted tree is studied. A self-similarity argument is used to characterize the limit distribution of the length H of the path found by such an algorithm in a random rooted tree as the unique solution of an integral equation. Furthermore, it is shown that lim n!1 E H p n = p 2 2 p 2 ln(3 + 2 p 2) = 2 : 353139::: ...

Journal: :Combinatorica 2010
Péter Csikvári

We will prove that the path minimizes the number of closed walks of length l among the connected graphs for all l. Indeed, we will prove that the number of closed walks of length l and many other properties such as the spectral radius, Estada index increase or decrease along a certain poset of trees. This poset is a leveled poset with path as the smallest element and star as the greatest element.

Journal: :journal of computational applied mechanics 0
mahdi khorram center of excellence in robotics and control advanced robotics and automated systems lab, dept of mech eng, k. n. toosi univ of tech, tehran, iran. s. ali a. moosavian center of excellence in robotics and control advanced robotics and automated systems lab, dept of mech eng, k. n. toosi univ of tech, tehran, iran.

quadruped robots have unique capabilities for motion over uneven natural environments. this article presents a stable gait for a quadruped robot in such motions and discusses the inverse-dynamics control scheme to follow the planned gait. first, an explicit dynamics model will be developed using a novel constraint elimination method for an 18-dof quadruped robot. thereafter, an inverse-dynamics...

Journal: :CoRR 2015
Michael J. Bannister William E. Devanny Vida Dujmovic David Eppstein David R. Wood

We investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number and layered pathwidth. We use these two types of layouts to characterize leveled planar graphs, the graphs with planar layered drawings with no dummy vertices. It follows from the known NP-completeness of leveled planarity that track-number...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید