Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 64 )

2018 ( 497 )

2017 ( 534 )

2016 ( 513 )

Custom range...

Search Results: 1 - 10 of 40678 matches for " CHENG Ju-Long "
All listed articles are free for downloading (OA Articles)
Page 1 /40678
Display every page Item
Analysis on Lookup of CAM Aided Hash Table

Wan Cheng-wei Wu Jiang-xing Li Yu-feng Lan Ju-long,

电子与信息学报 , 2011,
Abstract: Hashing is popularly adopted when it comes to a large scale of IP flows. High throughout is available with minimized average memory access number. This paper mainly focused on the lookup performance of CAM (Content Addressable Memory) Aided Hash Table (CAHT). By rational approximation, the paper provides the lower bound on average memory access number over lookup of CASHT; based on the analysis of CASHT, the paper also proposes the condition when to get the lower bound on average memory access number over lookup of CAMHT; Finally, simulation of actual network data shows its consistency to the theory model, which gives essential theory support to design and evaluate the hashing scheme in the actual applications.
Analysing and Improving TCP SACK Mechanism in Wireless Networks

JIAO Cheng-bo,DOU Rui-yu,LAN Ju-long,

计算机应用研究 , 2007,
Abstract: TCP SACK mechanism was modified and the results from the NS2 emulation was got.
Causal agent of tobacco gray mould in Shaanxi Province and preventive effects of Trametes versicolor polysaccharides on the disease

LI Jin-Ling,LUO Jing,SHAN Hong-Ying,CHENG Ju-Long,CHEN De-Xin,AN De-Rong,

菌物学报 , 2013,
Abstract: 采用形态学观察和分子鉴定方法对2011年在陕西省发生的一种烟草未知病害的病原菌进行鉴定。从病叶组织分离纯化得到病原菌,通过致病性测定以及人工接种后再分离病菌,证明编号LJL007的菌株为该病的致病菌。依据病原菌的形态学和培养特征,将菌株LJL007鉴定为灰葡萄孢Botrytis cinerea Pers.,其有性型为富氏葡萄孢盘菌Botryotinia fuckeliana Whetzel。通过核糖体DNA ITS序列分析,分离菌株LJL007序列(登录号:HM17900)与富氏葡萄孢盘菌序列(登录号:HM849615)同源性达100%,进一步证明该病原菌是灰葡萄孢Botrytis cinerea。云芝多糖在离体条件下,对灰葡萄孢的菌丝生长和孢子萌发均无直接抑制作用。云芝多糖对烟草灰霉病有较好预防保护作用,其预防效果可达56.29%。云芝多糖可显著提高烟草体内几丁质酶和β-1,3-葡聚糖酶活性,其活性峰值分别比对照提高56.89%和429.83%,说明云芝多糖可诱导植物产生抗病性。
Locator resolving system for flat identity

LIU Jian-qiang,CHENG Dong-nian,WU Jiang-xing,ZHANG Jian-wei,LAN Ju-long,

计算机应用研究 , 2010,
Abstract: Universal network is a new architecture based on identity/locator separating. A challenge from the separating is how to find a locator for a identity. This paper designed a three tiers system for mapping entries storing and resolving. Stored mapping entries in different tier with the difference frequency odds of the remote communication terminal called, and flowed from one tier to another. In order to reduce the cost of large scale mobility, policy of report to the top tier was different. It shows that the resolving system satisfies the require of universal network identity mapping resolving.
A New Algorithm for Solving a Class of Nonlinear Optimization Problems

SONG Ju-long~,QIAN Fu-cai~,

系统工程理论与实践 , 2004,
Abstract: For solving unconstrained nonlinear optimization problems, a new algorithm, which is called Golden\|section on plane, is presented. It is a kind of direct method and a extending of the 0.618 method in one\|dimensional search in two\|dimensional space. The derivative of objective function with respect to decision making variables is not needed to be calculated. On the other hand, this method needs so little memory that it almost can be implemented on any personal computer and its efficiency is not influenced. It works as well as grandient methods.
The Range Suitable for GM(1,1)

LIU Si-feng,DENG Ju-long,

系统工程理论与实践 , 2000,
Abstract: The range suitable for GM (1, 1 ) has been studied in this paper based on simulated test. The area of validity, the area to be used carefully, the area not suitable for use and the prohibited area of GM (1, 1 ) have been divided clearly according to the threshold of the developing coefficients..
Kernel-based adaptation for affinity propagation clustering algorithm

FU Ying-ding,LAN Ju-long,

计算机应用研究 , 2012,
Abstract: AP algorithm has become increasingly popular in recent years as an efficient and fast clustering algorithm.AP has better performance on large and multi-class dataset than the existing clustering algorithms.But for the datasets with complex cluster structures,it cannot produce good clustering results.Through analyzing the property of data clusters,this paper proposed a kernel function,optimized that the parameters automatically according to the dataset structure,and the dataset in kernel space were linearly separable or almost linearly.Carried AP on the kernel space,it had a kernel-adaptive affinity propagation clustering algorithm(KA-APC).Compared with the original AP clustering,it had the advantages of effectively dealing with the large multi-scale dataset.The promising experimental results show that this algorithm outperforms the original AP algorithm.
Node split based on shortest spanning tree against attack

LIU Jian-qiang,LAN Ju-long,

计算机应用研究 , 2010,
Abstract: To ensure the ability of communication network topology, established the corresponding mathematical model based on node split method, focusing on balanced traffic load of each node, and proposed a shortest spanning tree node split algorithm(SSTNS). Simulation results show that SSTNS balance the traffic load after node split and can obtain similar results with the exhaustive method.
New Group Key Management Algorithm

TANG Yang,LAN Ju-long,

计算机科学 , 2008,
Abstract: Based on the research of group key management algorithm,a new group key management algorithm applied to secure multicast was proposed.The algorithm combins the conentrated key assignment algorithm with the distributed key agreement algorithm,has good extensiblity and overcomes the single point failure and large computation delay.So it can substitute the key assignment algorithm for being applied to a loarge multicast group in which all the members are equal and there is no trusted third part and the relatio...
A New Dynamic Configuration Method of Address in Ethernet

LI Peng,JIANG Kun-Peng,LAN Ju-Long,

计算机科学 , 2006,
Abstract: The distributed structure is widely used in large systems such as Core Routers,and Ethernet is a good means to transfer information among subsystems in the distributed structure. This paper brings forward a new method of dynamic configuration of MAC address and IP address in inner Ethernet of the distributed systems. Through this method, address can be configured flexibly, resources will be used efficiently and production scale is easy to enlarge.
Page 1 /40678
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.