نتایج جستجو برای: london plane tree
تعداد نتایج: 329965 فیلتر نتایج به سال:
BACKGROUND Plant food allergies associated with lipid transfer protein (LTP) have been widely described in the Mediterranean Basin. OBJECTIVE The aim of this work was to describe the clinical profile and pollen sensitization of plant food- allergic patients sensitized to LTP in a non-Mediterranean area. METHODS Patients with clear IgE-mediated symptoms associated with plant foods and a posi...
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalisation of the classical Euclidean and rectilinear Steiner ...
The partial discharge activity during propagation of electrical treeing in epoxy resin is described. The electrical trees grew in needle-plane samples without and with an internal barrier up to the final breakdown. The simultaneous taken tree growth and discharge activity show a correlation between the propagation state of the tree and the thereby measured PD. Especially the changes in the tree...
Information-Centric Networking (ICN) is one promising architecture paradigm which is a profound shift from address-centric communication model to information-centric one. Although ICN routing has attracted much attention from researchers, there are few researches on improving it inspired by other fields. In this paper, we propose a Routing mechanism for ICN incorporating Software-Defined Networ...
Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. In this paper, we present an approximation algorithm that generates a tree whose diameter is no more than (1+ ) times that of a GMDST, for any > 0. Our algorithm reduces the problem to several grid-aligned versions of the...
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We compute the limiting distribution explicitly and study its properties. We introduce an infinite random tree consistent with these limiting distributions and show ...
Bottleneck Steiner tree problem asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. The problem has applications in the design of wireless communication networks. In this paper we study a restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Stein...
The Krushkal polynomial is the most general polynomial invariant of graphs on surfaces. It was introduced in [1]. A collection of edges forms a spanning quasi-tree if the regular neighborhood of the corresponding spanning subgraph has one boundary component. In the case of plane graphs it is just a spanning tree. The set of edges of a spanning quasi-trees is a feasible set of the corresponding ...
in order to investigate factors affecting on seed germinating of london rocket (sisymbrium irio), lab experiments were set up in 2011 at the payamenoor university, mashhad, khorasan razavi province. effect of different concentrations of gibberellic acid (ga3) and cytokinin, wet and dry prechilling duration, hydrogen peroxide duration, ethanol, salt and osmotic stress and burial depth on seed ge...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید