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

arXiv 2020年

作者： Yang, Ying Shen, Ruigang Fang, Mingjuan Shu, Shi School of Mathematics and Computational Science Guangxi Colleges Universities Key Laboratory of Data Analysis and Computation Guilin University of Electronic Technology Guilin541004 China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan411105 China School of Mathematics and Computational Science Guilin University of Electronic Technology GuilinGuangxi541004 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan411105 China

The a posteriori error estimates are studied for a class of nonlinear stead-state Poisson-Nernst-Planck equations, which are a coupled system consisting of the Nernst-Planck equation and the Poisson equation. Both the global upper bounds and the local lower bounds of the error estimators are obtained by using a local averaging operator. Numerical experiments are given to confirm the reliability and efficiency of the error estimators. Copyright © 2020, The Authors. All rights reserved.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

Multiple residual dense networks for reconfigurable intelligent surfaces cascaded channel estimation

arXiv

引用

arXiv 2021年

作者： Jin, Yu Zhang, Jiayi Huang, Chongwen Yang, Liang Xiao, Huahua Ai, Bo Wang, Zhiqin The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China The Frontiers Science Center for Smart High-speed Railway System Beijing Jiaotong University Beijing100044 China Zhejiang Provincial Key Lab of Information Processing Communication and Networking Zhejiang University Hangzhou310007 China College of Computer Science and Electronic Engineering Hunan University Changsha410082 China ZTE Corporation State Key Laboratory of Mobile Network Mobile Multimedia Technology Shenzhen518057 China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen518055 China China Academy of Information and Communications Technology Beijing100191 China

Reconfigurable intelligent surface (RIS) constitutes an essential and promising paradigm that relies programmable wireless environment and provides capability for space-intensive communications, due to the use of low-cost massive reflecting elements over the entire surfaces of man-made structures. However, accurate channel estimation is a fundamental technical prerequisite to achieve the huge performance gains from RIS. By leveraging the low rank structure of RIS channels, three practical residual neural networks, named convolutional blind denoising network, convolutional denoising generative adversarial networks and multiple residual dense network, are proposed to obtain accurate channel state information, which can reflect the impact of different methods on the estimation performance. Simulation results reveal the evolution direction of these three methods and reveal their superior performance compared with existing benchmark schemes. Copyright © 2021, The Authors. All rights reserved.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Doubling Algorithm for Nonsymmetric Algebraic Riccati Equations Based on a Generalized Transformation

引用

Advances in Applied Mathematics and Mechanics 2018年第6期10卷 1327-1343页

作者： Bo Tang Yunqing Huang Ning Dong School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and EngineeringKey Laboratory of Intelligent Computing and Information Processing of Ministry of EducationXiangtan UniversityXiangtan 411105HunanChina School of Science Hunan City UniversityYiyang 413000HunanChina School of Science Hunan University of TechnologyZhuzhou 412000HunanChina

We consider computing the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation with *** is well known that such equations can be efficiently solved via the structure-preserving doubling algorithm(SDA)with the shift-and-shrink transformation or the generalized Cayley *** this paper,we propose a more generalized transformation of which the shift-and-shrink transformation and the generalized Cayley transformation could be viewed as two special ***,the doubling algorithm based on the proposed generalized transformation is presented and shown to be ***,the convergence result and the comparison theorem on convergent rate are *** numerical experiments show that the doubling algorithm with the generalized transformation is efficient to derive the minimal nonnegative solution of nonsymmetric algebraic Riccati equation with M-matrix.

关键词： Shift-and-shrink transformation generalized Cayley transformation doubling algorithm nonsymmetric algebraic Riccati equation

来源：评论

学校读者我要写书评

暂无评论

Efficiently Retrieving Differences between Remote Sets using Counting Bloom Filter

引用

International Journal of Performability Engineering 2019年第7期15卷 1947-1954页

作者： Tian, Xiaomei Zhao, Huihuang Sun, Yaqi Liang, Xiaoman College of Computer Science and Technology Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

Retrieving differences between remote sets is widely used in set reconciliation and data deduplication. Set reconciliation and data deduplication between two nodes are widely used in various network applications. The basic idea of the difference retrieving problem is that each member of a node pair has an object set and seeks to find all differences between the two remote sets. There are many methods for retrieving difference sets, such as the standard Bloom filter (SBF), counting Bloom filter (CBF), and invertible Bloom filter (IBF). In these methods, based on the standard Bloom filter or its variants, each node represents its objects using a standard Bloom filter or other Bloom filter, which is then exchanged. A receiving node retrieves different objects between the two sets according to the received SBF, CBF, or IBF. We propose a new algorithm for retrieving differences that finds differences between remote sets using counting Bloom filters' deletion operation. The theoretical analyses and experimental results show that the differences can be retrieved efficiently. Only a very small number of differences are missing in the retrieving process, and this false negative rate can be decreased to 0% by adjusting the counting Bloom filter's parameters. © 2019 Totem Publisher, Inc. All rights reserved.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

引用

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

来源：评论

学校读者我要写书评

暂无评论

An extragradient algorithm for fixed point problems and pseudomonotone equilibrium problems

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2020年第4期82卷 89-96页

作者： Yao, Zhangsong Liou, Yeong-Cheng Zhu, Li-Jun School of Information Engineering Nanjing Xiaozhuang University Nanjing211171 China Department of Healthcare Administration and Medical Informatics Research Center of Nonlinear Analysis and Optimization Kaohsiung Medical University Department of Medical Research Kaohsiung Medical University Hospital Kaohsiung807 Taiwan The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province and Health Big Data Research Institute Advanced Intelligent Perception and Control Technology Innovative Team of NingXia North Minzu University Yinchuan750021 China

Iterative methods for solving fixed point problems and pseudomonotone equilibrium problems have been considered. An extragradient algorithm has been presnted for finding a common element of the fixed points of pseudocontractive operators and the solutions of pseudomonotone equilibrium problems in Hilbert spaces. Weak convergence result of the suggested algorithm is proved. © 2020, Politechnica University of Bucharest. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Distributed resource scheduling for large-scale MEC systems: A multi-agent ensemble deep reinforcement learning with imitation acceleration

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

We consider the optimization of distributed resource scheduling to minimize the sum of task latency and energy consumption for all the Internet of things devices (IoTDs) in a large-scale mobile edge computing (MEC) system. To address this problem, we propose a distributed intelligent resource scheduling (DIRS) framework, which includes centralized training relying on the global information and distributed decision making by each agent deployed in each MEC server. More specifically, we first introduce a novel multi-agent ensemble-assisted distributed deep reinforcement learning (DRL) architecture, which can simplify the overall neural network structure of each agent by partitioning the state space and also improve the performance of a single agent by combining decisions of all the agents. Secondly, we apply action refinement to enhance the exploration ability of the proposed DIRS framework, where the near-optimal state-action pairs are obtained by a novel Lvy flight search. Finally, an imitation acceleration scheme is presented to pre-train all the agents, which can significantly accelerate the learning process of the proposed framework through learning the professional experience from a small amount of demonstration data. Extensive simulations are conducted to demonstrate that the proposed DIRS framework is efficient and outperforms the existing benchmark schemes. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Magnetotelluric signal-noise separation method based on SVM–CEEMDWT

引用

Applied Geophysics 2019年第2期16卷 160-170,252-253页

作者： Li Jin Cai Jin Tang Jing-Tian Li Guang Zhang Xian Xu Zhi-Min Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and EngineeringHunan Normal UniversityChangsha 410081China School of Geosciences and Info-Physics Key Laboratory of Metallogenic Prediction of Non-Ferrous Metals and Geological Environment MonitorMinistry of EducationCentral South UniversityChangsha 410083China State Key Laboratory Breeding Base of Nuclear Resources and Environment East China University of TechnologyNanchang 330013China

To better retain useful weak low-frequency magnetotelluric(MT)signals with strong interference during MT data processing,we propose a SVM-CEEMDWT based MT data signal-noise separation method,which extracts the weak MT signal affected by strong ***,the approximate entropy,fuzzy entropy,sample entropy,and Lempel-Ziv(LZ)complexity are extracted from the magnetotelluric ***,four robust parameters are used as the inputs to the support vector machine(SVM)to train the sample library and build a model based on the different complexity of *** on this model,we can only consider time series with strong interference when using the complementary ensemble empirical mode decomposition(CEEMD)and wavelet threshold(WT)for noise *** results suggest that the SVM based on the robust parameters can distinguish the time periods with strong interference well before noise *** with the CEEMD WT,the proposed SVM-CEEMDWT method retains more low-frequency low-variability information,and the apparent resistivity curve is smoother and more ***,the results better reflect the deep electrical structure in the field.

关键词： SVM-CEEMDWT magnetotelluric signal-noise separation MT data processing

来源：评论

学校读者我要写书评

暂无评论

Multifractal temporally weighted detrended partial cross-correlation analysis of two non-stationary time series affected by common external factors

引用

Physica A: Statistical Mechanics and its Applications 2021年 573卷

作者： Bao-Gen Li Dian-Yi Ling Zu-Guo Yu Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China School of Electrical Engineering and Computer Science Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia

When common factors strongly influence two cross-correlated time series recorded in complex natural and social systems, the results will be biased if we use multifractal detrended cross-correlation analysis (MF-DXA) without considering these common factors. In order to better study the time series of such cases, we extend the multifractal temporally weighted detrended cross-correlation analysis (MF-TWXDFA) proposed by our group (Wei et al., 2017) and propose multifractal temporally weighted detrended partial cross-correlation analysis (MF-TWDPCCA) to quantify intrinsic power-law cross-correlation of two non-stationary time series affected by common external factors in this paper. To test the performance of MF-TWDPCCA, we apply it and multifractal partial cross-correlation analysis (MF-DPXA) proposed by Qian et al. (2015) on simulated series. Numerical tests on artificially simulated series demonstrate that MF-TWDPCCA can more accurately detect the intrinsic cross-correlations for two simultaneously recorded series than MF-DPXA and MF-TWXDFA. To further show the utility of MF-TWDPCCA, we apply it on time series from stock markets and find that there exists significantly multifractal power-law cross-correlation between stock returns. In addition, a new partial cross-correlation coefficient is defined to quantify the level of intrinsic cross-correlation between two time series.

关键词： Partial cross-correlation Multifractal temporally weighted detrended partial cross-correlation analysis Partial cross-correlation coefficient

来源：评论

学校读者我要写书评

暂无评论

Stacked auto encoder based Deep Reinforcement Learning for online resource scheduling in large-scale MEC networks

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom University of Electronic Science and Technology of China Chengdu China

An online resource scheduling framework is proposed for minimizing the sum of weighted task latency for all the mobile users, by optimizing offloading decision, transmission power, and resource allocation in the mobile edge computing (MEC) system. Towards this end, a deep reinforcement learning (DRL) method is proposed to obtain an online resource scheduling policy. Firstly, a related and regularized stacked auto encoder (2r-SAE) with unsupervised learning is proposed to perform data compression and representation for high dimensional channel quality information (CQI) data, which can reduce the state space for DRL. Secondly, we present an adaptive simulated annealing based approach (ASA) as the action search method of DRL, in which an adaptive h-mutation is used to guide the search direction and an adaptive iteration is proposed to enhance the search efficiency during the DRL process. Thirdly, a preserved and prioritized experience replay (2p-ER) is introduced to assist the DRL to train the policy network and find the optimal offloading policy. Numerical results are provided to demonstrate that the proposed algorithm can achieve near-optimal performance while significantly decreasing the computational time compared with existing benchmarks. It also shows that the proposed framework is suitable for resource scheduling problem in large-scale MEC networks, especially in the dynamic environment. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：