نتایج جستجو برای: Tree-like structure

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

Journal: :journal of nanostructures 2015
m. khademalrasool m. farbod

silver nanowires were synthesized by solvothermal method through reducing silver nitrate (agno3) with ethylene glycol (eg) in the presence of polyvinylpyrrolidone (pvp). in order to prevent the agglomeration of ag+ in the initial ag seeds formation, sodium chloride (nacl) was added into the solution to form agcl colloids. by dissolving agcl in the late stages, ag+ ions were released into the so...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - پژوهشکده فنی و مهندسی 1388

asymmetric polyethersulfone (pes) microfiltration flat sheet membranes were composed by the phase inversion method (pim) and were used as supports. composite membranes were fabricated by coating silicone rubber as selective layer. effect of different concentrations of pes and pdms and different solvent such as nmp, dmf and dms effects as pes solvents and support thickness and different coagulat...

Journal: :journal of advances in computer research 0

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 ...

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 ...

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 ...

2013
Yingxin Zhang Chao Chen Jianmai Shi

Tree-like hierarchical structure is one of the key features in many real complex systems. To investigate its properties, a deterministic tree-like hierarchical network model is proposed. Next, the static properties of the tree-like hierarchical networks are discussed. The simulation and theoretical results prove that the artificial tree-like networks conformably possess small-world and scalefre...

Journal: :Theor. Comput. Sci. 1996
Igor Walukiewicz

An operation M∗ which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such tree-like structures is defined. It is shown that automata of this kind characterise expressive power of monadic second-order logic (MSOL) over tree-like structures. Using this characterisation it is pr...

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

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