نتایج جستجو برای: tree
تعداد نتایج: 170609 فیلتر نتایج به سال:
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
dexsy2 is a dental expert system, which diagnoses oral diseases and offers a treatment course. the system which is designed and implemented from scratch is capable of diagnosing among thirty five oral diseases and offering a course of treatment for each. it uses a decision tree for its representation of knowledge, and each of its nodes contains a frame. the knowledge base of the system contains...
the effect of feeding silage of leaf and stem of banana tree with waste date palm on feed intake, microbial protein synthesis and blood parameters using four adult rams in a change- over design with four 21-days period were examined. eighty five kg leaf and stem of banana tree with 15 kg of waste date palm were mixed together and ensiled for 45 days. chemical composition and sensory evaluation ...
we investigated the relations among infection intensity of european mistletoe (viscum album l.) with host tree features in nour forest park, located in caspian forests in north of iran. the number of 30 circular plots with an area of 0.1 ha were sampled in all places have an aggregation of infested trees. parameters including dbh, height, distance to stand edge, distance to conspecific tree, ba...
in this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. let $t=(v,e)$ be a tree. the $(k,l)$-core of $t$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. we show that, when the sum of the weights of vertices is negative, t...
One of the main challenges in Wireless Sensor Networks is the limited energy of nodes which can cause to reduce the lifetime of nodes and whole network respectively. Transmissions between the nodes consumes most of the nodes' energy so minimization of unnecessary transmissions can led to reduction of energy consumption. Therefor routing protocols designed based on optimal energy consumption are...
orchard workers in north china are highly exposed to orchard pollens, especially peach and other rosaceae family pollens during pollination season. the aim of this study was to investigate whether occupational allergy to peach tree pollen as a member of rosaceae family is ige-mediated and to evaluate the cross-reactivity among rosaceae family pollens. allergen skin test and conjunctival challen...
the classification and regression trees (cart) possess the advantage of being able to handlelarge data sets and yield readily interpretable models. in spite to these advantages, they are alsorecognized as highly unstable classifiers with respect to minor perturbations in the training data.in the other words methods present high variance. fuzzy logic brings in an improvement in theseaspects due ...
the ip lookup process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to ipv6 addresses. the ip address lookup involves computation of the longest prefix matching (lpm), which existing solutions such as bsd radix tries, scale poorly when traıc in the router increases or when employed for ipv6 address lookups. in this paper, we describe a ...
forest types mapping, is one of the most necessary elements in the forest management and silviculture treatments. traditional methods such as field surveys are almost time-consuming and cost-intensive. improvements in remote sensing data sources and classification –estimation methods are preparing new opportunities for obtaining more accurate forest biophysical attributes maps. this research co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید