检索结果-南通市图书馆

Digital Communications and Networks 2024年第1期10卷 53-62页

作者： Zhipeng Cheng Minghui Liwang Ning Chen Lianfen Huang Nadra Guizani xiaojiang du Department of Information and Communication Engineering Xiamen UniversityXiamen361005China School of Electrical and Computer Engineering University of Texas at ArlingtonArlingtonTX76019USA Department of Electrical and Computer Engineering Stevens Institute of TechnologyHobokenNJ07030USA

Unmanned Aerial Vehicles(UAvs)as aerial base stations to provide communication services for ground users is a flexible and cost-effective paradigm in ***,dynamic resource allocation and multi-connectivity can be adopted to further harness the potentials of UAVs in improving communication capacity,in such situations such that the interference among users becomes a pivotal disincentive requiring effective *** this end,we investigate the Joint UAV-User Association,Channel Allocation,and transmission Power Control(J-UACAPC)problem in a multi-connectivity-enabled UAV network with constrained backhaul links,where each UAV can determine the reusable channels and transmission power to serve the selected ground *** goal was to mitigate co-channel interference while maximizing long-term system *** problem was modeled as a cooperative stochastic game with hybrid discrete-continuous action space.A Multi-Agent Hybrid Deep Reinforcement Learning(MAHDRL)algorithm was proposed to address this *** simulation results demonstrated the effectiveness of the proposed algorithm and showed that it has a higher system utility than the baseline methods.

关键词： UAV-user association Multi-connectivity Resource allocation Power control Multi-agent deep reinforcement learning

A blockchain based privacy-preserving federated learning scheme for Internet of Vehicles

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2024年第1期10卷 126-134页

作者： Naiyu Wang Wenti Yang Xiaodong Wang Longfei Wu Zhitao Guan xiaojiang du Mohsen Guizani School of Control and Computer Engineering North China Electric Power UniversityChina Department of Mathematics&Computer Science Fayetteville State UniversityFayettevilleNCUSA Department of Electrical and Computer Engineering Stevens Institute of TechnologyHobokenNJ07030USA Department of Computer Science and Engineering Qatar UniversityDohaQatar

The application of artificial intelligence technology in Internet of Vehicles(lov)has attracted great research interests with the goal of enabling smart transportation and traffic ***,concerns have been raised over the security and privacy of the tons of traffic and vehicle *** this regard,Federated Learning(FL)with privacy protection features is considered a highly promising ***,in the FL process,the server side may take advantage of its dominant role in model aggregation to steal sensitive information of users,while the client side may also upload malicious data to compromise the training of the global *** existing privacy-preserving FL schemes in IoV fail to deal with threats from both of these two sides at the same *** this paper,we propose a Blockchain based Privacy-preserving Federated Learning scheme named BPFL,which uses blockchain as the underlying distributed framework of *** improve the Multi-Krum technology and combine it with the homomorphic encryption to achieve ciphertext-level model aggregation and model filtering,which can enable the verifiability of the local models while achieving ***,we develop a reputation-based incentive mechanism to encourage users in IoV to actively participate in the federated learning and to practice *** security analysis and performance evaluations are conducted to show that the proposed scheme can meet the security requirements and improve the performance of the FL model.

关键词： Federated learning Blockchain Privacy-preservation Homomorphic encryption Internetof vehicles

Analysis on unit maximum capacity of orthogonal multiple watermarking for multimedia signals in B5G wireless communications

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2024年第1期10卷 38-44页

作者： Mianjie Li Senfeng Lai Jiao Wang Zhihong Tian Nadra Guizani xiaojiang du Chun Shan School of Electronics and Information Guangdong Polytechnic Normal UniversityGuangzhou510665China Cyberspace Institute of Advanced Technology Guangzhou UniversityGuangzhou510006China Schoolof Electrical Engineering and Computer Science Washington State UniversityPullmanWA99164USA Department of Computer and Information Science Temple UniversityPhiladelphiaPA19122USA

Beyond-5G(B5G)aims to meet the growing demands of mobile traffic and expand the communication *** that intelligent applications to B5G wireless communications will involve security issues regarding user data and operational data,this paper analyzes the maximum capacity of the multi-watermarking method for multimedia signal hiding as a means of alleviating the information security problem of *** multiwatermarking process employs spread transform dither *** the watermarking procedure,Gram-Schmidt orthogonalization is used to obtain the multiple spreading ***,multiple watermarks can be simultaneously embedded into the same position of a multimedia ***,the multiple watermarks can be extracted without affecting one another during the extraction *** analyze the effect of the size of the spreading vector on the unit maximum capacity,and consequently derive the theoretical relationship between the size of the spreading vector and the unit maximum capacity.A number of experiments are conducted to determine the optimal parameter values for maximum robustness on the premise of high capacity and good imperceptibility.

关键词： B5G Multimedia information security Spread transform dither modulation Spreading vector measurement Unit maximum capacity

S^(2-)和Cl^(-)对316L奥氏体不锈钢的腐蚀钝化行为的协同作用

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

中国腐蚀与防护学报 2024年第3期44卷 797-806页

作者：耿真真张钰柱杜小将吴汉辉重庆化工职业学院建筑工程学院重庆400020 重庆移通学院智能工程学院重庆401520 重庆恒晟大业建筑设计有限公司重庆401120

为了研究S^(2-)和Cl^(-)对316L奥氏体不锈钢的耐腐蚀性能的协同破坏作用,采用电化学测试技术、扫描电子显微镜(SEM)、激光共聚焦扫描显微镜(CLSM)、能谱仪(EDS)和X射线光电子能谱仪(XPS)等方法研究了316L奥氏体不锈钢在不同S^(2-)浓度... 详细信息

为了研究S^(2-)和Cl^(-)对316L奥氏体不锈钢的耐腐蚀性能的协同破坏作用,采用电化学测试技术、扫描电子显微镜(SEM)、激光共聚焦扫描显微镜(CLSM)、能谱仪(EDS)和X射线光电子能谱仪(XPS)等方法研究了316L奥氏体不锈钢在不同S^(2-)浓度人工海水中的腐蚀行为和钝化行为。结果表明:S^(2-)和Cl^(-)对316L奥氏体不锈钢的耐腐蚀性能具有协同损害作用。S^(2-)与OH-竞争吸附抑制钝化膜生成,并且S^(2-)参与钝化过程形成FeS和MoS_(2),提高钝化膜掺杂密度,降低钝化膜屏蔽性能,从而加速Cl^(-)诱发点蚀。随着S^(2-)浓度从0增大至100 mmol/L,溶液pH从8.2上升至12.8,导致自腐蚀电位E_(corr)负移0.328 V,腐蚀电流密度I_(corr)增大约1倍。当S^(2-)浓度大于0.1 mmol/L时,316L奥氏体不锈钢失去再钝化性能,当S^(2-)浓度大于100 mmol/L时,316L奥氏体不锈钢失去钝化性能。

关键词： 316L奥氏体不锈钢 S^(2-) Cl^(-) 钝化膜耐腐蚀性能协同作用

维普期刊数据库

Intermittent Fault Diagnosability of Interconnection Networks

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2017年第6期32卷 1279-1287页

作者： Jia-Rong Liang Hao Feng xiaojiang du School of Computer and Electronic Information Guangxi University Nanning 530004 China Department of Computer and Information Sciences Temple University Philadelphia PA 19122 U.S.A.

An interconnection network＇s diagnosability is an important metric for measuring its self-diagnostic capability. Permanent fault and intermittent fault are two different fault models that exist in an interconnection network. In this paper, we focus on the problem pertaining to the diagnosability of interconnection networks in an intermittent fault situation. First, we study a class of interconnection networks called crisp three-cycle networks, in which the Chin-number （the number of common vertices each pair of vertices share） is no more than one. Necessary and sufficient conditions are derived for the diagnosability of crisp three-cycle networks under the PMC （Preparata, Metze, and Chien） model. A simple check can show that many well-known intereonnection networks are crisp three-cycle networks. Second, we prove that an intereonnection network S is a ti-fault diagnosable system without repair if and only if its minimum in-degree is greater than ti under the BGM （Barsi, Grandoni, and Masetrini） model. Finally, we extend the necessary and sufficient conditions to determine whether an interconnection network S is ti-fault diagnosable without repair under the MM （Maeng and Malek） model from the permanent fault situation to the intermittent fault situation.

关键词： diagnosability intermittent fault PMC(Preparata,Metze,and Chien)model BGM(Barsi,Grandoni,and Masetrini)model MM(Maeng and Malek)model

Identifying the vulnerabilities of bitcoin anonymous mechanism based on address clustering

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第3期63卷 105-119页

作者： Baokun ZHENG Liehuang ZHU Meng SHEN xiaojiang du Mohsen GUIZANI School of Computer Science and Technology Beijing Institute of Technology School of Information Management for Law China University of Political Science and Law Department of Computer and Information Sciences Temple University Department of Computer Science and Engineering Qatar University

The anonymity mechanism of bitcoin is favored by the society, which promotes its usage and development. An adversary should not be able to discover the relation between bitcoin addresses and bitcoin users to ensure effective privacy. However, the relation among bitcoin transactions can be used to analyze the bitcoin privacy information, which seriously jeopardizes the bitcoin anonymity. Herein, we describe the vulnerabilities associated with the anonymity mechanism of bitcoin, including the relation among bitcoin addresses and the relation among bitcoin users. Further, we demonstrate that the existing methods do not guarantee the comprehensiveness, accuracy, and efficiency of the analysis results. We propose a heuristic clustering method to judge the relation among bitcoin addresses and employ the Louvain method to discover the relation among bitcoin users. Subsequently, we construct an address-associated database of historical transactions and implement real-time updates. Extensive experiments are used to demonstrate the comprehensiveness, accuracy, and efficiency of the proposed scheme. Specifically, the proposed scheme reveals the privacy vulnerability associated with the blockchain technology. We expect that our scheme can be applied to improve the blockchain technology.

关键词： privacy blockchain bitcoin transaction cluster

Improved Dota2 Lineup Recommendation Model Based on a Bidirectional LSTM

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2020年第6期25卷 712-720页

作者： Lei Zhang Chenbo Xu Yihua Gao Yi Han xiaojiang du Zhihong Tian Henan Key Laboratory of Big Data Analysis and Processing Kaifeng 457004China Institute of Data and Knowledge Engineering Henan UniversityKaifeng 475004.China National Internet Emergency Center Zhengzhou 450000China Department of Computer and Information Sciences Temple UniversityPhiladelphiaPA 19122-6008USA Cyberspace Institute of Advanced Technology Guangzhou UniversityGuangzhou 510006China

In recent years,e-sports has rapidly developed,and the industry has produced large amounts of data with specifications,and these data are easily to be *** to the above characteristics,data mining and deep learning methods can be used to guide players and develop appropriate strategies to win *** one of the world’s most famous e-sports events,Dota2 has a large audience base and a good game system.A victory in a game is often associated with a hero’s match,and players are often unable to pick the best lineup to *** solve this problem,in this paper,we present an improved bidirectional Long Short-Term Memory(LSTM)neural network model for Dota2 lineup *** model uses the Continuous Bag Of Words(CBOW)model in the Word2 vec model to generate hero *** CBOW model can predict the context of a word in a ***,a word is transformed into a hero,a sentence into a lineup,and a word vector into a hero vector,the model applied in this article recommends the last hero according to the first four heroes selected first,thereby solving a series of recommendation problems.

关键词： Word2vec mutiplayer online battle arena games Continuous Bag Of Words(CBOW)model Long Short-Term Memory(LSTM)

维普期刊数据库

A Survey of Game Theory as Applied to Social Networks

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2020年第6期25卷 734-742页

作者： Xinfang Song Wei Jiang Xiaohui Liu Hui Lu Zhihong Tian xiaojiang du Beijing Information Technology College Beijing 100015China Chinese Academy of Cyberspace Studies Beijing 100010China Guangzhou University Guangzhou 510006China the Department of Computer and Information Sciences Temple UniversityPhiladelphiaAZ 19122USA

Social network services can not only help people form relationships and make new friends and partners,but also assist in processing personal information,sharing knowledge,and managing social *** networks achieve valuable communication and collaboration,bring additional business opportunities,and have great social *** on social network problems is effective by using assumption,definition,analysis,modeling,and optimization *** this paper,we survey the existing problems of game theory applied to social networks and classify their application scenarios into four categories:information diffusion,behavior analysis,community detection,and information *** can clearly master knowledge application in every ***,we discuss certain limitations of game theory on the basis of research in recent years and propose future directions of social network research.

关键词： social network social value application scenarios game theory

维普期刊数据库

PPLS: a privacy-preserving location-sharing scheme in mobile online social networks

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第3期63卷 173-183页

作者： Chang XU Xuan XIE Liehuang ZHU Kashif SHARIF Chuan ZHANG xiaojiang du Mohsen GUIZANI School of Computer Science and Technology Beijing Institute of Technology Department of Computer and Information Sciences Temple University Department of Computer Science and Engineering Qatar University

The recent proliferation of mobile devices has given rise to mobile online social networks(m OSNs), an emerging network paradigm that uses social networks as its main design element. As one of the most critical components in m OSNs, location sharing plays an important role in helping users share information and strengthen their social bonds, which however may compromise users’ privacy, including location information and social relationship details. To address these challenges, some solutions have been proposed. However, none of them considers the privacy of inter-user threshold distance, which effectively can be used to identify users, their friends, and location information, by malicious or undesired elements of the system. To overcome this limitation, we propose a secure distance comparison protocol. Furthermore,we present a privacy-preserving location-sharing scheme(PPLS), which allows users to build more complex access control policies. The safety of our scheme is validated by the security analysis and the experimental results demonstrate the efficiency of PPLS scheme.

关键词： privacy-preservation location-sharing mobile online social networks

Adversarial Attacks on Content-Based Filtering Journal Recommender Systems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2020年第9期64卷 1755-1770页

作者： Zhaoquan Gu Yinyin Cai Sheng Wang Mohan Li Jing Qiu Shen Su xiaojiang du Zhihong Tian Cyberspace Institute of Advanced Technology Guangzhou UniversityGuangzhouChina Department of Computer and Information Sciences Temple UniversityPhiladelphiaUSA

Recommender systems are very useful for people to explore what they really *** papers are important achievements for researchers and they often have a great deal of choice to submit their *** order to improve the efficiency of selecting the most suitable journals for publishing their works,journal recommender systems(JRS)can automatically provide a small number of candidate journals based on key information such as the title and the ***,users or journal owners may attack the system for their own *** this paper,we discuss about the adversarial attacks against content-based filtering *** propose both targeted attack method that makes some target journals appear more often in the system and non-targeted attack method that makes the system provide incorrect *** also conduct extensive experiments to validate the proposed *** hope this paper could help improve JRS by realizing the existence of such adversarial attacks.

关键词： Journal recommender system adversarial attacks Rocchio algorithm k-nearest-neighbor algorithm