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

Clustering-based codebook design for MIMO communication system

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Jiang, Jing Wang, Xiaojing Sidhu, Guftaar Ahmad Sardar Zhen, Li Gao, Runchen Shaanxi Key Laboratory of Information Communication Network and Security Xi'An University of Posts and Telecommunications Xi'an China COMSATS Institute of Information Technology Islamabad Pakistan

Codebook design is one of the core technologies in limited feedback multi-input multi-output (MIMO) communication systems. However, the conventional codebook designs usually assume MIMO vectors are uniformly distributed or isotropic. Motivated by the excellent classfication and analysis ability of clustering algorithms, we propose a K-means clustering based codebook design. First, large amounts of channel state information (CSI) is stored as the input data of the clustering, and finally divided into N clusters according to the minimal distance. The clustering centroids are used as the statistic channel information of the codebook construction which the sum distance is minimal to the real channel information. Simulation results consist with theoretical analysis in terms of the achievable rate, and demonstrate that the proposed codebook design outperforms conventional schemes, especially in the non-uniform distribution of channel scenarios. Copyright © 2019, The Authors. All rights reserved.

关键词： K-means clustering

LR-RRA-CCA secure functional encryption for randomized functionalities from trapdoor HPS and LAF

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第5期61卷 291-305页

作者： Huige WANG Kefei CHEN Baodong QIN Ziyuan HU Department of Network Engineering Anhui Science and Technology University Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Mathematics Hangzhou Normal University Westone Cryptologic Research Center National Engineering Laboratory for Wireless Security Xi'an University of Posts and Telecommunications State Key Laboratory of Cryptology

Original public-key encryption is viewed as a tool to encrypt point-to-point *** data is aimed at a particular user,where a sender encrypts a message x under a specified public key P *** this case,only the owner of the(unique)secret key corresponding to P K can decrypt the resulting ciphertext to recover the message ***,on some occasions,encryption is necessary to implement more fine-grained control of the encrypted *** example,the sender

关键词： LAF CCA RRA

FedCM: A real-time contribution measurement method for participants in federated learning

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yan, Bingjie Liu, Boyi Zhou, Yize Liang, Zhixuan Xu, Cheng-Zhong School of Compute Science and Cyberspace Security Hainan University Haikou China State Key Laboratory of Internet of Things for Smart City University of Macao China School of Science Hainan University Haikou China Department of Computing The Hong Kong Polytechnic University Hong Kong Faculty of Science and Technology University of Macao China

Federated Learning (FL) creates an ecosystem for multiple agents to collaborate on building models with data privacy consideration. The method for contribution measurement of each agent in the FL system is critical for fair credits allocation but few are proposed. In this paper, we develop a real-time contribution measurement method FedCM that is simple but powerful. The method defines the impact of each agent, comprehensively considers the current round and the previous round to obtain the contribution rate of each agent with attention aggregation. Moreover, FedCM updates contribution every round, which enable it to perform in real-time. Real-time is not considered by the existing approaches, but it is critical for FL systems to allocate computing power, communication resources, etc. Compared to the state-of-the-art method, the experimental results show that FedCM is more sensitive to data quantity and data quality under the premise of real-time. Furthermore, we developed federated learning open-source software based on FedCM. The software has been applied to identify COVID-19 based on medical images. © 2020, CC BY-NC-ND.

关键词： Open systems

学校读者我要写书评

暂无评论

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Saiqin Long Zhetao Li Zihao Liu Qingyong Deng Sangyoon Oh Nobuyoshi Komuro Key Laboratory of Hunan Province for Internet of Things and Information Security Hunan International Scientific and Technological Cooperation Base of Intelligent network School of Computer Science Xiangtan University Xiangtan China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) National University of Defense Technology Changsha China Ajou University Suwon South Korea Graduate School of Advanced Integration Science Chiba University Chiba Japan

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

Deduplication is a data redundancy elimination technique, designed to save system storage resources by reducing redundant data in cloud storage systems. With the development of cloud computing technology, deduplication has been increasingly applied to cloud data centers. However, traditional technologies face great challenges in big data deduplication to properly weigh the two conflicting goals of deduplication throughput and high duplicate elimination ratio. This paper proposes a similarity clustering-based deduplication strategy (named SCDS), which aims to delete more duplicate data without significantly increasing system overhead. The main idea of SCDS is to narrow the query range of fingerprint index by data partitioning and similarity clustering algorithms. In the data preprocessing stage, SCDS uses data partitioning algorithm to classify similar data together. In the data deletion stage, the similarity clustering algorithm is used to divide the similar data fingerprint superblock into the same cluster. Repetitive fingerprints are detected in the same cluster to speed up the retrieval of duplicate fingerprints. Experiments show that the deduplication ratio of SCDS is better than some existing similarity deduplication algorithms, but the overhead is only slightly higher than some high throughput but low deduplication ratio methods.

关键词： Cloud computing Clustering algorithms Estimation Fingerprint recognition Throughput Partitioning algorithms Classification algorithms

TCPModel: A short-term traffic congestion prediction model based on deep learning 1

学校读者我要写书评

暂无评论

2nd CCF International Conference on Artificial Intelligence, CCF-ICAI 2019

作者： Xu, Xiujuan Gao, Xiaobo Xu, Zhenzhen Zhao, Xiaowei Pang, Wei Zhou, Hongmei School of Software Dalian University of Technology Dalian116620 China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian116620 China School of Natural and Computing Sciences University of Aberdeen AberdeenAB24 3UE United Kingdom School of Transportation and Logistics Dalian University of Technology Dalian116024 China

ISBN: (数字)9789813292987

ISBN: (纸本)9789813292970

With the progress of the urbanization, a series of traffic problems have occurred because of the growing urban population and the far lower growth rate of roads than that of cars. One of the most prominent problems is traffic congestion problem. The prediction of traffic congestion is the key to alleviate traffic congestion. To ensure the real-time performance and accuracy of the traffic congestion prediction, we propose a short-term traffic congestion prediction model called TCPModel based on deep learning. By processing a massive amount of urban taxi transportation data, we extract the traffic volume and average speed of taxis which are the most important parameters for assessing of traffic flow prediction. After analyzing the temporal and spatial distribution characteristics of the traffic flow and average speed, we present a short-term traffic volume prediction model called TVPModel, and a short-term traffic speed prediction model called TSPModel. Both models are based on a deep learning method Stacked Auto Encoder (SAE). By comparing the other traffic flow forecasting methods and average speed forecasting methods, the methods proposed by this paper have improved the accuracy rate. For traffic congestion recognition, we use a novel model called TCPModel based on three traffic parameters (average speed, traffic flow and density), which uses standard function method to standardize the parameters and calculate the congestion comprehensive threshold to determine the congestion level by thresholds. According to the experiments, TVPModel and TSPModel in this paper got satisfied accuracy compared with other prediction models. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Traffic congestion

Competition on Dynamic Optimization Problems Generated by Generalized Moving Peaks Benchmark (GMPB)

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yazdani, Danial Mavrovouniotis, Michalis Li, Changhe Chen, Guoyu Luo, Wenjian Omidvar, Mohammad Nabi Branke, Jürgen Yang, Shengxiang Yao, Xin The Business Intelligence Team WINC Australia Cyprus University of Technology Lemesos Cyprus ERATOSTHENES Centre of Excellence Cyprus The School of Artificial Intelligence Anhui University of Sciences & Technology Hefei China The Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Peng Cheng Laboratory Shenzhen518055 China The School of Computing University of Leeds Leeds University Business School LeedsLS2 9JT United Kingdom The Operational Research and Management Sciences Group at Warwick Business school University of Warwick CoventryCV4 7AL United Kingdom School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom The Department of Computing and Decision Sciences Lingnan University Hong Kong The CERCIA School of Computer Science BirminghamB15 2TT United Kingdom

The Generalized Moving Peaks Benchmark (GMPB) [1] is a tool for generating continuous dynamic optimization problem instances with controllable dynamic and morphological characteristics. GMPB has been used in recent Competitions on Dynamic Optimization at prestigious conferences, such as the IEEE Congress on Evolutionary Computation (CEC). This dynamic benchmark generator can create a wide variety of landscapes, ranging from simple unimodal to highly complex multimodal configurations, and from symmetric to asymmetric forms. It also supports diverse surface textures, from smooth to highly irregular, and can generate varying levels of variable interaction and conditioning. This document provides an overview of GMPB, emphasizing how its parameters can be adjusted to produce landscapes with customizable characteristics. The MATLAB implementation of GMPB is available on the EDOLAB platform [2]. © 2021, CC BY-NC-ND.

关键词： Optimization algorithms

Signed graph attention networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Huang, Junjie Shen, Huawei Hou, Liang Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Graph or network data is ubiquitous in the real world, including social networks, information networks, traffic networks, biological networks and various technical networks. The non-Euclidean nature of graph data poses the challenge for modeling and analyzing graph data. Recently, Graph Neural network (GNNs) are proposed as a general and powerful framework to handle tasks on graph data, e.g., node embedding, link prediction and node classification. As a representative implementation of GNNs, Graph Attention networks (GATs) are successfully applied in a variety of tasks on real datasets. However, GAT is designed to networks with only positive links and fails to handle signed networks which contain both positive and negative links. In this paper, we propose Signed Graph Attention networks (SiGATs), generalizing GAT to signed networks. SiGAT incorporates graph motifs into GAT to capture two well-known theories in signed network research, i.e., balance theory and status theory. In SiGAT, motifs offer us the flexible structural pattern to aggregate and propagate messages on the signed network to generate node embeddings. We evaluate the proposed SiGAT method by applying it to the signed link prediction task. Experimental results on three real datasets demonstrate that SiGAT outperforms feature-based method, network embedding method and state-of-the-art GNN-based methods like signed graph convolutional network (SGCN). Copyright © 2019, The Authors. All rights reserved.

关键词： Graph neural networks

A Reinforcement Learning-Based Virtual Machine Placement Strategy in Cloud Data Centers

学校读者我要写书评

暂无评论

A Reinforcement Learning-Based Virtual Machine Placement Str...

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Saiqin Long Zhetao Li Yun Xing Shujuan Tian Dongsheng Li Rong Yu Key Laboratory of Hunan Province for Internet of Things and Information Security Hunan International Scientific and Technological Cooperation Base of Intelligent network School of Computer Science Xiangtan University Xiangtan China School of Computer Science Xiangtan University Xiangtan China College of Computer National University of Defense Technology Changsha China School of Automation Guangdong University of Technology Guangzhou China

ISBN: (纸本)9781728176505

With the widespread use of cloud computing, energy consumption of cloud data centers is increasing which mainly comes from IT equipment and cooling equipment. This paper argues that once the number of virtual machines on the physical machines reaches a certain level, resource competition occurs, resulting in a performance loss of the virtual machines. Unlike most papers, we do not impose placement constraints on virtual machines by giving a CPU cap to achieve the purpose of energy savings in cloud data centers. Instead, we use the measure of performance loss to weigh. We propose a reinforcement learning-based virtual machine placement strategy(RLVMP) for energy savings in cloud data centers. The strategy considers the weight of virtual machine performance loss and energy consumption, which is finally solved with the greedy strategy. Simulation experiments show that our strategy has a certain improvement in energy savings compared with the other algorithms.

关键词： Weight measurement Cloud computing Data centers Energy consumption NP-hard problem High performance computing Virtual machining

Fuzzy C-mean clustering based: LEO satellite handover 4th

学校读者我要写书评

暂无评论

Fuzzy C-mean clustering based: LEO satellite handover

4th International Conference of Pioneer Computer Scientists, Engineers and Educators, ICPCSEE 2018

作者： Bukhari, Syed Umer Yu, Liwei Di, Xiao Qiang Chen, Chunyi Liu, Xu School of Computer Science and Technology Changchun University of Science and Technology Changchun China Jilin Province Key Laboratory of Network and Information Security Changchun China

ISBN: (纸本)9789811322020

Satellite networks are better alternatives to terrestrial networks because of their global coverage. Different satellite networks like GEO, MEO, and LEO can be used for the purpose of global communication. Especially, LEO satellites are more suitable for communication because of their lower propagation delays and fewer power consumptions. However, the high speed of LEO satellites is a big issue which leads to frequent cell and satellite handovers. Many techniques have been proposed to deal with satellite handover, but most of proposed techniques did not consider the situation when "the required channels are more than available channels" which causes more delays, terminations, and blocking. To handle this situation, we proposed a fuzzy C-mean cluster-based handover technique to improve the QoS of the network during handover. In the proposed technique, users (waiting for handover in a queue) are divided into clusters based on their geographic locations. Cluster heads are selected from each cluster and they act as the relay between their members and the satellite. During handover, only cluster heads reserve the channels in upcoming satellite and perform handover with their members. The experimental results prove that the proposed technique helps to reduce the handover failure, terminations, and number of waiting users, as well as it also improves the utility of network. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Orbits