检索结果-南通市图书馆

Performance evaluation of new echo state networks based on complex network

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2012年第1期19卷 87-93页

作者： LIU Xiang CUI Hong-yan ZHOU Tian-jun CHEN Jian-ya Key Laboratory of network System Architecture and Convergence Beijing University of Posts and TelecommtmicationsBeijing 100876China

Recently, echo state networks （ESN） have aroused a lot of interest in their nonlinear dynamic system modeling capabilities. In a classical ESN, its dynamic reservoir （DR） has a sparse and random topology, but the performance of ESN with its DR taking another kind of topology is still unknown. So based on complex network theory, three new ESNs are proposed and investigated in this paper. The small-world topology, scale-free topology and the mixed topology of small-world effect and scale-free feature are considered in these new ESNs. We studied the relationship between DR architecture and prediction capability. In our simulation experiments, we used two widely used time series to test the prediction performance among the new ESNs and classical ESN, and used the independent identically distributed （i.i.d） time series to analyze the short-term memory （STM） capability. We answer the following questions： What are the differences of these ESNs in the prediction performance？ Can the spectral radius of the internal weights matrix be wider？ What is the short-term memory capability？ The experimental results show that the proposed new ESNs have better prediction performance, wider spectral radius and almost the same STM capacity as classical ESN＇s.

关键词： ESN complex network time series prediction short-term memory capacity

A network Calculus Approach for the Analysis of Packet-switching networks

在线全文

学校读者我要写书评

暂无评论

China Communications 2007年第2期4卷 97-105页

作者： Li, Minghui Tan, Xianhai SW Jiaotong Univ Network Informat Technol Lab Chengdu Peoples R China

network calculus is an evolving new methodology for backlog and delay analysis of packet-switching networks. With network calculus we are able to compute tight bounds on delays,backlogs,and effective bandwidths in a lossless setting applicable to packet-switching networks and better understand some physical properties of networks. In this paper,the basic network calculus concepts of arrival curves and service curves are *** we provide the approach for modeling leaky-bucket,generic cell rate algorithm(GCRA),constant bit rate(CBR)flow, variable bit rate(VBR) flow with arrival *** is shown that all rate-based packet schedulers can be by a simple rate latency service *** by applying these fundamental rules of network calculus,bounds on delay, buffer,effective bandwidth for leaky bucket,GCRA,CBR and VBR can be derived and some practical examples are ***,we compare all the results obtained and conclude this paper.

关键词： network calculus packet-switching networks generic cell rate algorithm(GCRA) constant bit rate(CBR) flow variable bit rate(VBR) flow

A Hybrid Model Using Bio-Inspired Metaheuristic Algorithms for network Intrusion Detection System

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2021年第7期68卷 409-429页

作者： Omar Almomani Department of Computer network and Information Systems The World Islamic Sciences and Education UniversityAmman11947Jordan

network Intrusion Detection System(IDS)aims to maintain computer network security by detecting several forms of attacks and unauthorized uses of applications which often can not be detected by *** features selection approach plays an important role in constructing effective network *** bio-inspired metaheuristic algorithms used to reduce features to classify network traffic as abnormal or normal traffic within a shorter duration and showing more ***,this paper aims to propose a hybrid model for network IDS based on hybridization bio-inspired metaheuristic algorithms to detect the generic *** proposed model has two objectives;The first one is to reduce the number of selected features for network *** objective was met through the hybridization of bioinspired metaheuristic algorithms with each other in a hybrid *** algorithms used in this paper are particle swarm optimization(PSO),multiverse optimizer(MVO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),firefly algorithm(FFA),and bat algorithm(BAT).The second objective is to detect the generic attack using machine learning *** objective was met through employing the support vector machine(SVM),C4.5(J48)decision tree,and random forest(RF)***-NB15 dataset used for assessing the effectiveness of the proposed hybrid ***-NB15 dataset has nine attacks *** generic attack is the highest among ***,the proposed model aims to identify generic *** data showed that J48 is the best classifier compared to SVM and RF for the time needed to build the *** terms of features reduction for the classification,my data show that the MFO-WOA and FFA-GWO models reduce the features to 15 features with close accuracy,sensitivity and F-measure of all features,whereas MVO-BAT model reduces features to 24 features with the same accuracy,sensitivity and F-measure of all features for all classifiers.

关键词： IDS metaheuristic algorithms PSO MVO GWO MFO WOA FFA BAT SVM J48 RF UNSW-NB15 dataset

APPOW:An Advanced Routing Protocol Based on Parameters Optimization in the Weighted Mobile Social network

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2016年第S1期13卷 107-115页

作者： HUO Yan QI Jinghao LI Zhen JING Tao Shuhua Wireless network and Information Perception Center School of Electronics and Information Engineering Beijing Jiaotong University

Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a *** Decentralized Mobile Social network(DMSN) is a paradigm where nodes can move freely and organize themselves *** in these environments is difficult for the reason of the rapid changes of the social relationship graph's ***,the social ties among nodes change ***,an efficient data forwarding mechanism should be considered over the temporal weighted relationship *** this paper,an Advanced routing Protocol based on Parameters Optimization in the Weighted mobile social network(APPOW) is proposed to improve the delivery success ratio and reduce the cost of exchanging *** combines the normalized relative weights of three local social metrics,i.e.,LinkRank,similarity and contact strength,to select the next relay *** weights of the three metrics are derived by pair-wise learning *** result shows that APPOW outperforms the state-ofthe-art SimBet Routing in delivering message and significantly reduces the average ***,the delivery performance of APPOW is close to Epidemic Routing but without message duplications.

关键词： link rank similarity contact strength routing protocol mobile social network

Distributed Information Flow Verification for Secure Service Composition in Smart Sensor network

在线全文

学校读者我要写书评

暂无评论

China Communications 2016年第4期13卷 119-130页

作者： XI Ning SUN Cong MA Jianfeng CHEN Xiaofeng SHEN Yulong Shaanxi Key Laboratory of network and System Security XIDIAN University School of Cyber Engineering XIDIAN University

Accelerate processor, efficient software and pervasive connections provide sensor nodes with more powerful computation and storage ability, which can offer various services to user. Based on these atomic services, different sensor nodes can cooperate and compose with each other to complete more complicated tasks for user. However, because of the regional characteristic of sensor nodes, merging data with different sensitivities become a primary requirement to the composite services, and information flow security should be intensively considered during service composition. In order to mitigate the great cost caused by the complexity of modeling and the heavy load of single-node verification to the energy-limited sensor node, in this paper, we propose a new distributed verification framework to enforce information flow security on composite services of smart sensor network. We analyze the information flows in composite services and specify security constraints for each service participant. Then we propose an algorithm over the distributed verification framework involving each sensor node to participate in the composite service verification based on the security constraints. The experimental results indicate that our approach can reduce the cost of verification and provide a better load balance.

关键词： information flow security service composition formal verification smart sensor network

Parameter adjustment based on improved genetic algorithm for cognitive radio networks

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2012年第3期19卷 22-26页

作者： ZHAO Jun-hui LI Fei ZHANG Xue-xue State Key Laboratory of rail Traffic Control and Safety Beijing Jiaotong University Beijing 100044 China Key Laboratory of Wireless Sensor network & Communication Shanghai Institute of Mierosystem and Information Technology Chinese Academy of Sciences Shanghai 200050 China

Multi-objective parameter adjustment plays an important role in improving the performance of the cognitive radio （CR） system. Current research focus on the genetic algorithm （GA） to achieve parameter optimization in CR, while general GA always fall into premature convergence. Thereafter, this paper proposed a linear scale transformation to the fitness of individual chromosome, which can reduce the impact of extraordinary individuals exiting in the early evolution iterations, and ensure competition between individuals in the latter evolution iterations. This paper also introduces an adaptive crossover and mutation probability algorithm into parameter adjustment, which can ensure the diversity and convergence of the population. Two applications are applied in the parameter adjustment of CR, one application prefers the bit error rate and another prefers the bandwidth. Simulation results show that the improved parameter adjustment algorithm can converge to the global optimal solution fast without falling into premature convergence.

关键词： cognitive radio genetic algorithm global optimal solution linear scale transformation adaptive crossover and mutation probability

Zero-forcing dirty paper coding aided physical-layer network coding for MIMO two-way relaying channels with multiple users

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2011年第2期18卷 53-58页

作者： GONG Peng XU Jie QIU Ling Personal Communication network & Spread Spectrum Laboratory University of Science and Technology of China Hefei 230027 China

This article considers the two-way multiple-input multiple-output（MIMO） relaying channels with multiple users,in which multiple users are served simultaneously by the base station（BS） with the assistance of the *** transmission consists of only two phases,doubling the system throughout over traditional one-way half-duplex transmission.A zero-forcing dirty paper coding（ZFDPC） aided physical-layer network coding（PNC） scheme is proposed in this article and the achievable capacity of the ZFDPC aided PNC scheme is *** results show that the proposed scheme outperforms the previous decode-and-forward（DF） and zero-forcing beamforming（ZFBF） aided PNC scheme due to more degrees of freedoms and the advantage of ***,we analyze the effect of the imperfect channel state information（CSI） from RS to users at BS side to show the robustness of the proposed ZFDPC aided PNC scheme.

关键词： zero-forcing dirty paper coding MIMO physical-layer network coding two-way relaying multiuser diversity

Attention-Enhanced Voice Portrait Model Using Generative Adversarial network

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第4期79卷 837-855页

作者： Jingyi Mao Yuchen Zhou YifanWang Junyu Li Ziqing Liu Fanliang Bu School of Information network Security People’s Public Security University of ChinaBeijing100038China

Voice portrait technology has explored and established the relationship between speakers’ voices and their facialfeatures, aiming to generate corresponding facial characteristics by providing the voice of an unknown *** to its powerful advantages in image generation, Generative Adversarial networks (GANs) have now beenwidely applied across various fields. The existing Voice2Face methods for voice portraits are primarily based onGANs trained on voice-face paired datasets. However, voice portrait models solely constructed on GANs facelimitations in image generation quality and struggle to maintain facial similarity. Additionally, the training processis relatively unstable, thereby affecting the overall generative performance of the model. To overcome the abovechallenges,wepropose a novel deepGenerativeAdversarialnetworkmodel for audio-visual synthesis, namedAVPGAN(Attention-enhanced Voice Portrait Model using Generative Adversarial network). This model is based ona convolutional attention mechanism and is capable of generating corresponding facial images from the voice ofan unknown speaker. Firstly, to address the issue of training instability, we integrate convolutional neural networkswith deep GANs. In the network architecture, we apply spectral normalization to constrain the variation of thediscriminator, preventing issues such as mode collapse. Secondly, to enhance the model’s ability to extract relevantfeatures between the two modalities, we propose a voice portrait model based on convolutional attention. Thismodel learns the mapping relationship between voice and facial features in a common space from both channeland spatial dimensions independently. Thirdly, to enhance the quality of generated faces, we have incorporated adegradation removal module and utilized pretrained facial GANs as facial priors to repair and enhance the clarityof the generated facial images. Experimental results demonstrate that our AVP-GAN achieved a cosine similarity of0.511, ou

关键词： Cross-modal generation GANs voice portrait technology face synthesis

network resource allocation attack detection with long range dependence

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Harbin Institute of Technology(New Series) 2007年第1期14卷 74-78页

作者：王欣方滨兴 Research Center of Computer network and Information Security Technology Harbin Institute of Technology

The approach of traffic abnormality detection of network resource allocation attack did not have reliable signatures to depict abnormality and identify them. However, it is crucial for us to detect attacks accurately. The technique that we adopted is inspired by long range dependence ideas. We use the number of packet arrivals of a flow in fixed-length time intervals as the signal and attempt to extend traffic invariant “self-similarity”. We validate the effectiveness of the approach with simulation and trace analysis.

关键词： network resource allocation attack long range dependence Hurst parameter