检索结果-南通市图书馆

Structure splitting framework for data-layout optimization

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2009年第5期16卷 107-113页

作者： FU Xiong , wang ru-chuan college of computer, nanjing university of posts and telecommunications, nanjing 210003, china college of computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

To improve data cache performance, optimizing program data layout by data reorganization has become an important method of decreasing the impact of increasing gap of speed between processor and memory. In this article, a structure splitting framework with an analysis model named structure field relation graph （SFRG） is presented to optimize program data layout. The SFRG can be used to quantify relationship between fields. It helps to find an optimal layout for structure as well as the optimal program data layout. And the data cache performance is improved through SFRG-based structure splitting. Experiments show that this framework is effective in optimizing program data layout and improving the performance of data cache and whole program.

关键词： program optimization structure splitting data layout cache performance

Secure coverage-preserving node scheduling scheme using energy prediction for wireless sensor networks

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2010年第5期17卷 100-108页

作者： LI Zhi-yuan,wang ru-chuan. college of computer,nanjing university of posts and telecommunications,nanjing 210003,china college of computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

With the fast development of the micro-electro-mechanical systems （MEMS）,wireless sensor networks （WSNs） have been extensively *** of the studies focus on saving energy consumption because of restricted energy supply in ***-based node scheduling scheme is commonly considered as one of the most energy-efficient ***,it is not always so efficient especially when there exist hot spot and network attacks in *** this article,a secure coverage-preserved node scheduling scheme for WSNs based on energy prediction is proposed in an uneven deployment *** scheme is comprised of an uneven clustering algorithm based on arithmetic progression,a cover set partition algorithm based on trust and a node scheduling algorithm based on energy *** results show that network lifetime of the scheme is 350 rounds longer than that of other scheduling ***,the scheme can keep a high network coverage ratio during the network lifetime and achieve the designed objective which makes energy dissipation of most nodes in WSNs balanced.

关键词： wireless sensor networks secure energy-efficient coverage node scheduling cover set energy prediction

Key technologies of new malicious code developments and defensive measures in communication networks

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2010年第4期17卷 69-73页

作者： LI Peng,wang ru-chuan ,ZHANG Wei college of computer,nanjing university of posts and telecommunications,nanjing 210003,china college of computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

This article is focused on analyzing the key technologies of new malicious code and corresponding defensive measures in the large-scale communication networks. Based on description of the concepts and development of the malicious code, the article introduces the anti-analysis technology, splitting and inserting technology, hiding technology, polymorph virus technology, and auto production technology of the malicious code trends with intelligence, diversity and integration. Following that, it summarizes the security vulnerabilities of communication networks from four related layers aspects, according to the mechanisms of malicious code in the communication networks. Finally, it proposes rapid response disposition of malicious code attacks from four correlated steps： building up the network node monitoring system, suspicious code feature automation analysis and extraction, rapid active malicious code response technique for unknown malicious code, and malicious code attack immunity technique. As a result, it actively defenses against the unknown malicious code attacks and enhances the security performance of communication networks.

关键词： network security malicious code network attack and defense malicious code defense

QoS routing based on mobile agent for LEO satellite IP networks

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2009年第6期16卷 57-63页

作者： RAO Yuan,wang ru-chuan college of computer,nanjing university of posts and telecommunications,nanjing 230001,china college of computer Nanjing University of Posts and Telecommunications Nanjing 230001 China

Current quality of service（QoS） routing schemes for low earth orbit（LEO） satellites IP networks either neglect the varying population density or fail to guarantee end-to-end *** a remedy,QoS routing protocol based on mobile agent（QoSRP-MA） is ***-MA is a source-based routing *** connection requests arrive,QoS mobile agents are dispatched from ingress satellite to explore routes,which migrate using satellite routing *** arriving in egress satellite,QoS mobile agents migrate back towards ingress satellite to reserve *** construct satellite routing tables,load balancing routing algorithm based on mobile agent（LBRA-MA） is *** LBRP-MA,at regular intervals mobile agents launched on all satellites migrate autonomously to evaluate path cost and update routing ***,path cost between source and destination is evaluated considering satellite geographical position as well as inter-satellite link（ISL） ***,ISL congestion index is considered to update routing *** simulations on a Courier-like constellation,it shows that QoSRP-MA can achieve guaranteed end-to-end delay bound with higher throughput,lower connection failing ratio and signaling overhead compared to high performance satellite routing（HPSR） scheme.

关键词： QoS routing load balancing mobile agent satellite IP networks

Method for replica creation in data grids based on complex networks

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2010年第4期17卷 110-115页

作者： CHEN Dan-wei ,ZHOU Shu-tao,REN Xun-yi,KONG Qiang college of computer,nanjing university of posts and telecommunications,nanjing 210003,china college of computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

In order to reduce makespan and storage consumption in data grids, a node selection model for replica creation is proposed. The model is based on the degree distribution of complex networks. We define two candidate replica nodes： a degree-based candidate pool and a frequency-based candidate pool, through which a degree-based candidate pool is defined in consideration of onsidering the access frequency; a candidate pool-based frequency is also defined. The data replica is copied to the node with the minimum Local cost in the two pools. Further, this paper presents and proves a replica creation theorem. A dynamic multi-replicas creation algorithm （DMRC） is also provided. Simulation results show that the proposed method may simultaneously reduce makespan and data used in space storage consumption.

关键词： data grid replica creation complex networks

Epidemic spreading on a scale-free network with awareness

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2012年第10期21卷 44-48页

作者：鲁延玲蒋国平宋玉蓉 college of computer Nanjing University of Posts and Telecommunications college of Automation Nanjing University of Posts and Telecommunications

This paper presents a modified susceptible-infected-recovered（SIR） model with the effects of awareness and vaccination to study the epidemic spreading on scale-free networks based on the mean-field *** this model,when susceptible individuals receive awareness from their infected neighbor nodes,they will take vaccination *** theoretical analysis and the numerical simulations show that the existence of awareness and vaccination can significantly improve the epidemic threshold and reduce the risk of virus *** addition,regardless of the existence of vaccination,the awareness can increase the spreading threshold and slow the spreading speed *** a given awareness and a certain spreading rate,the total number of infections reduces with the increasing vaccination rate.

关键词： scale-free network awareness vaccination epidemic threshold

InstaCropNet:An efficient Unet-Based architecture for precise crop row detection in agricultural applications

在线全文

学校读者我要写书评

暂无评论

Artificial Intelligence in Agriculture 2024年第2期12卷 85-96页

作者： Zhiming Guo Yuhang Geng chuan wang Yi Xue deng Sun Zhaoxia Lou Tianbao Chen Tianyu Geng Longzhe Quan School of Engineering Anhui Agricultural UniversityHefei 230036China college of Engineering Northeast Agricultural UniversityHarbin 150030China School of Mathematics and computer Science Nanchang UniversityNanchang 330031China

Autonomous navigation in farmlands is one of the key technologies for achieving autonomous management in maize *** various navigation techniques,visual navigation using widely available RGB images is a cost-effective ***,current mainstream methods for maize crop row detection often rely on highly specialized,manually devised heuristic rules,limiting the scalability of these *** simplify the solution and enhance its universality,we propose an innovative crop row annotation *** strategy,by simulating the strip-like structure of the crop row's central area,effectively avoids interference from lateral growth of crop *** on this,we developed a deep learning network with a dual-branch architecture,InstaCropNet,which achieves end-to-end segmentation of crop row ***,through the row anchor segmen-tation technique,we accurately locate the positions of different crop row instances and perform line *** results demonstrate that our method has an average angular deviation of no more than 2°,and the accuracy of crop row detection reaches 96.5%.

关键词： Visual navigation Deep learning Maize crop row detection Early corn crops Row clustering Crop row segmentation

An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

china Communications 2016年第8期13卷 177-183页

作者： Zeheng Yang yongan Guo School of computer Science and Engineering University of Electronic Science and Technology of China(UESTC) college of telecommunications and Information Engineering Nanjing University of Posts and Telecommunications

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the *** exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link *** on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate *** topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

关键词： network virtualization virtual network embedding exact VNE algorithm integer linear Programming location constraint VNR acceptance ratio

A relative local variational principle for topological pressure

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2010年第6期53卷 1491-1506页

作者： MA XianFeng1,CHEN ErCai2,3,& ZHANG AiHua2,4 1Department of Mathematics,East china university of Science and Technology,Shanghai 200237,china 2School of Mathematics and computer Science,nanjing Normal university,nanjing 210097,china 3Center of Nonlinear Science,nanjing university,nanjing 210093,china 4college of Mathematics and Physics,nanjing university of posts and telecommunications,nanjing 210046,china Department of Mathematics East China University of Science and Technology Shanghai China School of Mathematics and computer Science Nanjing Normal University Nanjing China Center of Nonlinear Science Nanjing University Nanjing China college of Mathematics and Physics Nanjing University of Posts and Telecommunications Nanjing China

We define the relative local topological pressure for any given factor map and open cover,and prove the relative local variational principle of this *** precisely,for a given factor map π:(X,T)→(Y,S) between two topological dynamical systems,an open cover U of X,a continuous,real-valued function f on X and an S-invariant measure ν on Y,we show that the corresponding relative local pressure P(T,f,U,y) satisfies sup μ∈M(X,T){ hμ(T,U|Y)+∫X f(x)dμ(x) :πμ=ν}=∫Y P(T,f,U,y)dν(y),where M(X,T) denotes the family of all T-invariant measures on ***,the supremum can be attained by a T-invariant measure.

关键词： pressure conditional entropy relative local variational principle