检索结果-内蒙古大学图书馆

4th IFIP/IEEE International Conference on Management of Multimedia networks and Services, MMNS 2001

作者： Zhai, Mingyu Gu, Guanqun Yuan, Yuan Department of Computer Science and Engineering Southeast University Nanjing210096 China The Key Laboratory for Computer Networks and Information Integration Ministry of Education China

ISBN: (纸本)9783540455080

In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

Voice conversion towards modeling dynamic characteristics using switching state space model

引用

Science China(information Sciences) 2013年第12期56卷 237-251页

作者： XU Ning BAO JingYi LIU XiaoFeng JIANG AiMing TANG YiBing College of Computer and Information Engineering Hohai University Ministry of Education Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications School of Electronic Information and Electric Engineering of Changzhou Institute of Technology

In the literature of voice conversion(VC),the method based on statistical Gaussian mixture model(GMM)serves as a ***,one of the inherent drawbacks of GMM is well-known as discontinuity problem,which is caused by transforming features on a frame-by-frame basis,thus ignoring the dynamics between adjacent frames and fnally resulting in degraded quality of the converted speech.A variety of algorithms have been proposed to overcome this defciency,among which the state space model(SSM)based method provides some promising *** this paper,we proceed by presenting an enhanced version of the traditional SSM,namely,the switching SSM(SSSM).This new structure is more flexible than the conventional one in that it allows using mixture of components to account for the rapid transitions between neighboring ***,physical meaning of the model parameters of SSSM has been examined in depth,leading to efcient application-specifc training and transforming procedures of *** including both objective and subjective measurements were conducted to compare the performances of the conventional and the proposed SSM-based methods,which have convinced that obvious improvements in both aspects of similarity and quality can be obtained by SSSM.

关键词： discontinuity problem dynamic characteristics Gaussian mixture model switching state space model voice conversion

来源：评论

学校读者我要写书评

暂无评论

Watermark Embedding for Direct Binary Searched Halftone Images by Adopting Visual Cryptography

引用

computers, Materials & Continua 2018年第5期55卷 255-265页

作者： Yangyang Wang Rongrong Ni Yao Zhao Min Xian Beijing Key Laboratory of Advanced Information Science and Network Technology Institute of Information ScienceBeijing Jiaotong UniversityBeijing 100044China Department of Computer Science University of IdahoIdaho FallsID 83402United States

In this paper,two methods are proposed to embed visual watermark into direct binary search(DBS)halftone images,which are called Adjusted Direct Binary Search(ADBS)and Dual Adjusted Direct Binary Search(DADBS).DADBS is an improved version of *** using the proposed methods,the visual watermark will be embedded into two halftone images separately,thus,the watermark can be revealed when these two halftone images are *** results show that both methods can achieve excellent image visual quality and decoded visual patterns.

关键词： Data hiding halftone direct binary search visual watermark.

来源：评论

学校读者我要写书评

暂无评论

Secure AODV Routing Protocol Using SL Multi-Signcryption

引用

电子学报(英文版) 2007年第2期16卷 311-314页

作者： ZHANG Chuanrong YIN Zhonghai ZHANG Yuqing XIAO Guozhen Telecommunication Engineering Institute A irforce Engineering University Xi ＇ an 710077 China National Computer Network Intrusion Protection Center GUCAS Beijing 100049 China State Key Laboratory of Integrated Service Networks Xidian University Xi＇an 710071 China The Ministry of Education Key Laboratory of Computer Network and Information Security Xidian University Xi＇an 710071 China

Routing security is an important issue in secure ad hoc networks, and it appears to be a problem that is not trivial to solve. In this paper, we consider secure routing protocol and applied new cryptographic mechanism: multi-signcryption to routing protocol for ad hoc networks. SL multi-signcryption scheme efficiently provides message flexibility, order flexibility, message verifiability, order verifiability, message confidentiality, message unforgeability, non-repudiation and robustness. It is suitable for protecting messages and multi-signers from malicious attacks in networks. For this reason, using SL multi-signcryption, we propose a new secure AODV (Ad hoc on-demand distance vecter) routing protocol: SCRP (Signcryption based routing protocol). SCRP indeed enhances the security of AODV routing protocol and provides confidentiality, integrity, authentication, and non-repudiation to the routing message. Moreover, compared with other secure AODV, SCRP provides some other advantages such as lower computational cost and communicational overhead, flexibility of route message, and partially anonymous route.

关键词：安全AODV 路由协议 SL多重签密 ad-hoc网络

来源：评论

学校读者我要写书评

暂无评论

Load Balanced Coding Aware Multipath Routing for Wireless Mesh networks

引用

Chinese Journal of Electronics 2015年第1期24卷 8-12页

作者： SHAO Xing WANG Ruchuan HUANG Haiping SUN Lijuan College of Computer Nanjing University of Posts and Telecommunications College of Information Engneering Yancheng Institutue of Technology Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Key Lab of Broadband Wireless Communication and Sensor Network Technology

The growth of network coding opportunities is considered the unique optimization goal by most current network coding based routing algorithms for wireless mesh networks. This usually results in flows aggregation problem in areas with coding opportunities, and degrades the network performance. This paper proposes a Load balanced coding aware multipath routing(LCMR)for wireless mesh networks. To facilitate the evaluation of discovered multiple paths and the tradeoffs between coding opportunity and load balancing, a novel routing metric, Load balanced coding aware routing metric(LCRM) is presented, which considers the load degree of nodes when detects coding opportunities. LCMR could spread traffic over multipath to further balance load. Simulation results demonstrate that LCMR could evenly spread the traffic over the network with increasing network throughput in a heavy load at the expense of some coding opportunities.

关键词： Load balanced Coding aware Multipath Routing Wireless mesh networks.

来源：评论

学校读者我要写书评

暂无评论

A PSO Based Multi-Domain Virtual network Embedding Approach

引用

China Communications 2019年第4期16卷 105-119页

作者： Yongjing Ni Guoyan Huang Sheng Wu Chenxi Li Peiying Zhang Haipeng Yao College of Information Science and Engineering Yanshan University College of Information Science and Engineering Hebei University of Science and Technology The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University School of Information and Communication Engineering Beijing University of Posts and Telecommunications College of Computer & Communication Engineering China University of Petroleum (East China)

This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.

关键词： multi-domain virtual network embedding candidate node particle swarm optimization algorithm virtual network request division

来源：评论

学校读者我要写书评

暂无评论

Motiviting Others Drives Jamshidi [SMC Innovators]

引用

IEEE Systems, Man, and Cybernetics Magazine 2015年第3期1卷 67-72页

作者： M.E. El-Hawary School of Computer Science and Engineering Southeast University China Ministry of Education Key Laboratory of Computer Network and Information Integration China

Presents an interview conducted with Dr. Jamshidi.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Novel way to research nonlinear feedback shift register

引用

Science China(information Sciences) 2014年第9期57卷 161-174页

作者： ZHAO DaWei PENG HaiPeng LI LiXiang HUI SiLi YANG YiXian Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Zhejiang Provincial Key Lab of Data Storage and Transmission Technology Hangzhou Dianzi University National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center

In this paper,we regard the nonlinear feedback shift register(NLFSR)as a special Boolean network,and use semi-tensor product of matrices and matrix expression of logic to convert the dynamic equations of NLFSR into an equivalent algebraic *** on them,we propose some novel and generalized techniques to study ***,a general method is presented to solve an open problem of how to obtain the properties(the number of fixed points and the cycles with different lengths)of the state sequences produced by a given NLFSR,i.e.,the analysis of a given *** then show how to construct all 22n-(l-n)/22n-lshortest n-stage feedback shift registers(nFSR)and at least 22n-(l-n)-1/22n-l-1shortest n-stage nonlinear feedback shift registers(nNLFSR)which can output a given nonperiodic/periodic sequence with length ***,we propose two novel cycles joining algorithms for the construction of full-length ***,two algorithms are presented to construct 22n-2-1different full-length nNLFSRs,respectively.

关键词： nonlinear feedback shift register semi-tensor product Boolean network full-length nNLFSR binary sequence

来源：评论

学校读者我要写书评

暂无评论

Mobile Anchor Assisted Localization in Wireless Sensor networks with Regular Polygon Path

Mobile Anchor Assisted Localization in Wireless Sensor Netwo...

引用

2013 IEEE 4th International Conference on Software Engineering and Service Science

作者： Huanqing Cui Chuan'ai Zhou Xiaojing Meng Rong Hua Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center College of Information Science and Engineering Shandong University of Science and Technology

ISBN: (纸本)9781467349994

Mobile anchor assisted localization methods for wireless sensor networks can decrease the cost while improving the accuracy,and the moving trajectory is an interesting and basic issue in this kind of *** paper proposes the regular polygon path derived from Circle,which is the best determined *** upper-bound of the polygon and the localization scheme are presented,and the performance is evaluated by simulations.

关键词： wireless sensor network localization mobile anchor regular polygon path

来源：评论

学校读者我要写书评

暂无评论

Adaptive Group Personalization for Federated Mutual Transfer Learning 41

Adaptive Group Personalization for Federated Mutual Transfer...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Xu, Haoqing Shen, Dian Wang, Meng Wang, Beilun School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China College of Design and Innovation Tongji University Shanghai China

Mutual transfer learning aims to improve prediction with knowledge from related domains. Recently, federated learning is applied in this field to address the communication and privacy concerns. However, previous clustered federated learning (CFL) solutions lack theoretical guarantee of learnability recovery and require time-consuming hyper-parameter tuning, while centralized mutual transfer learning methods lack adaptability to concept drifts. In this paper, we propose the Adaptive Group Personalization method (AdaGrP) to overcome these challenges. We adaptively decide the recovery threshold with a nonparametric method, adaptive threshold correction, for tuning-free solution with relaxed condition. Theoretical results guarantee the perfect learnability recovery with the corrected threshold. Empirical results show AdaGrP achieves 16.9% average improvement in learnability structure recovery compared with state-of-the-art CFL baselines. Copyright 2024 by the author(s)

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：