نتایج جستجو برای: like network

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

Journal: :Expert Syst. Appl. 2014
Jingxuan Li Wei Peng Tao Li Tong Sun Qianmu Li Jian Xu

http://dx.doi.org/10.1016/j.eswa.2014.02.038 0957-4174/ 2014 Elsevier Ltd. All rights reserved. ⇑ Corresponding author. Tel.: +1 305 348 6036; fax: +1 305 348 3549. E-mail addresses: [email protected] (J. Li), [email protected] (W. Peng), [email protected] (T. Li), [email protected] (T. Sun), [email protected] (Q. Li), [email protected] (J. Xu). Jingxuan Li , Wei Peng , Tao Li a,⇑, Ton...

2013
Jiantie Xu Shixue Dou Huakun Liu Liming Dai

nt matter & 2013 0.1016/j.nanoen.2 thor. uthor. Tel.: +1 216 . : [email protected] (L. Dai). Abstract The recent progress and future development of cathode materials for lithium ion batteries have been critically reviewed in this article. We have given some critical opinions and rational ideas regarding the development of cathode materials to dramatically reduce the cost and increase the efficienc...

2005
Liu Mu - Ren

Received (received date) Revised (revised date) We analyze the evolution of Sznajd Model with synchronous updating in several complex networks. Similar to the model on square lattice, we have found a transition between the state with no-consensus and the state with complete consensus in several complex networks. Furthermore, by adjusting the network parameters, we find that a large clustering c...

Journal: :IBM Journal of Research and Development 1994
C. T. Howard Ho S. Lennart Johnsson

A &k, d ) hyperpyramid is a level structure of k hypercubes, where the hypercube at level i is of dimension id, and a node at level i 1 is connected to every node in a &dimensional subcube at level i, except for the leaf level k. Hyperpyramids contain pyramids as propy subgraphs. We show that a hyperpyramid P(k, d ) can be embedded in a hypercube with minimal expansion and dilation = d. The con...

2007
S. Dürr L. Lellouch

S. Dürr1, Z. Fodor1,2,3, C. Hoelbling2,5, S.D. Katz2,3, S. Krieg2,4, Th. Kurth2, L. Lellouch∗,5, Th. Lippert1,2,4, K.K. Szabo2, G. Vulvert5 1John von Neumann Institute for Computing (NIC), DESY, D-15738, Zeuthen / FZJ, D-52425, Juelich, Germany 2Department of Physics, University of Wuppertal, D-42097 Wuppertal, Germany 3Institute for Theoretical Physics, Eötvös University, H-1117 Budapest, Hung...

1995
B. Manning

This memo clarifies issues surrounding subnetting IP networks by providing a standard subnet table. This table includes subnetting for Class A, B, and C networks, as well as Network IDs, host ranges and IP broadcast addresses with emphasis on Class C subnets. This memo is intended as an informational companion to Subneting RFC [1] and the Hosts Requirements RFC [2].

2011
Robbert Haarman Fei Liu Patrick Goering Geert Heijenk

The context discovery protocol Ahoy has been proposed earlier for resource-limited fully-distributed ad-hoc networks. Ahoy has been proven as an efficient context discovery protocol, which generates only little network traffic, in both static and dynamic ad-hoc networks. In this report, we implement the prototype of Ahoy and test it on UNIX-like platforms. We show the possibility to implement A...

Journal: :CoRR 2014
Yuanqing Ye Xin Huang Ting Wen Jiaqing Huang Alfred Uwitonze

Network coding in geometric space, a new research direction also known as S pace In f ormation Flow, is a promising research field which shows the superiority of network coding in space over routing in space. Present literatures proved that given six terminal nodes, network coding in space is strictly superior to routing in space in terms of single-source multicast in regular (5+1) model, in wh...

2002
B. Manning

This memo clarifies issues surrounding subnetting IP networks by providing a standard subnet table. This table includes subnetting for Class A, B, and C networks, as well as Network IDs, host ranges and IP broadcast addresses with emphasis on Class C subnets. This memo is intended as an informational companion to Subneting RFC [1] and the Hosts Requirements RFC [2].

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

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