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

A short-term output power prediction model of wind power based on deep learning of grouped time series

European Journal of Electrical Engineering 2020年第1期22卷 29-38页

作者： Wang, Yongsheng Gao, Jing Xu, Zhiwei Li, Leixiao College of Computer and Information Engineering Inner Mongolia Agricultural University Hohhot010018 China Inner Mongolia Autonomous Region Key Laboratory of Big Data Research and Application for Agriculture and Animal Husbandry Hohhot010018 China College of Data Science and Application Inner Mongolia University of Technology Hohhot010080 China Inner Mongolia Autonomous Region Engineering and Technology Research Center of Big Data Based Software Service Hohhot010080 China Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China

The output power prediction of wind power plants is an important guarantee to improve the utilization rate of wind energy and reduce wind curtailment. However, due to the strong randomness of wind energy, the ultra-short-term prediction accuracy of wind power output is poor. In view of the problem above, a prediction model based on deep learning of grouped time series (LW-CLSTM) was proposed in this paper. Based on this model, the authors attempted to explore a prediction method of wind power output. For this, first the multivariate data of wind power was fused, cleaned, dimension-reduced, and standardized, and the time period characteristics of the output power itself were extracted. Afterwards, it proposes a time sliding window (TSW) algorithm, and constructs a neural network input data set. Then a deep neural network prediction model combining the Convolutional Neutral network (CNN) and Long-Short Term Memory (LSTM) was established, and the regression evaluation criteria for output power forecast accuracy in wind power production were designed, to compare the proposed model with four other prediction models. Finally, the experiments on the TensorFlow platform using real data show that this model has better prediction accuracy than the other four models, reaching a prediction accuracy rate of 92.5%, which verified the effectiveness of this prediction method. © 2020 International Information and Engineering technology Association. All rights reserved.

关键词： Wind power

来源：评论

学校读者我要写书评

暂无评论

A Distributed Privacy-Preserving Learning Dynamics in General Social networks

arXiv

引用

arXiv 2020年

作者： Tao, Youming Chen, Shuzhen Li, Feng Yu, Dongxiao Yu, Jiguo Sheng, Hao School of Computer Science and Technology Shandong University Qingdao266237 China Big Data Institute Qilu University of Technology Jinan250353 China State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China

In this paper, we study a distributed privacy-preserving learning problem in social networks with general topology. The agents can communicate with each other over the network, which may result in privacy disclosure, since the trustworthiness of the agents cannot be guaranteed. Given a set of options which yield unknown stochastic rewards, each agent is required to learn the best one, aiming at maximizing the resulting expected average cumulative reward. To serve the above goal, we propose a four-staged distributed algorithm which efficiently exploits the collaboration among the agents while preserving the local privacy for each of them. In particular, our algorithm proceeds iteratively, and in every round, each agent i) randomly perturbs its adoption for the privacy-preserving purpose, ii) disseminates the perturbed adoption over the social network in a nearly uniform manner through random walking, iii) selects an option by referring to the perturbed suggestions received from its peers, and iv) decides whether or not to adopt the selected option as preference according to its latest reward feedback. Through solid theoretical analysis, we quantify the trade-off among the number of agents (or communication overhead), privacy preserving and learning utility. We also perform extensive simulations to verify the efficacy of our proposed social learning algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Symmetric Uniform Formula and Sole Index Method for Sieving (Twin) Primes

A Symmetric Uniform Formula and Sole Index Method for Sievin...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Wei Ren School of Computer Science China University of Geosciences Wuhan P.R. China Guangxi Key Laboratory of Cryptography and Information Security Guilin P.R. China Key Laboratory of Network Assessment Technology CAS Institute of Information Engineering Chinese Academy of Sciences Beijing P.R. China

ISBN: (数字)9781665403924

ISBN: (纸本)9781665403931

All primes can be indexed by k, as primes must be in the form of 6k+1 or 6k-1. In this paper, we explore for the set of k such that either 6k+1 or 6k-1 is not a prime. Our method provides a uniform formula for k that can sieve primes and twin primes as well. The uniform presents symmetry in terms of k that works as single index in sieving. We also propose a new conjecture that is equivalent to Twin Prime Conjecture but possibly be easier to approach by merely exploring of sole index in term of k. The uniform formula for prime sieving are as follows: k ∈ S l ⇒ 6k-1 ∉ P, where s l = [-I]6I+1 = [I] 6I-1 \min([I] 6I-1 ), I ∈ N. ∈ s r ⇒ 6k+1 ∉ P, where s r = [-I] 6I-1 ∪ ([I] 6I+1 \min([I] 6I+1 )), I ∈ N.

关键词： data privacy Conferences Indexes Computer security

来源：评论

学校读者我要写书评

暂无评论

SCScan: A SVM-Based Scanning System for Vulnerabilities in Blockchain Smart Contracts

SCScan: A SVM-Based Scanning System for Vulnerabilities in B...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Xiaohan Hao Wei Ren Wenwen Zheng Tianqing Zhu School of Computer Science China University of Geosciences Wuhan P.R. China Guangxi Key Laboratory of Cryptography and Information Security Guilin P.R. China Key Laboratory of Network Assessment Technology CAS Institute of Information Engineering Chinese Academy of Sciences Beijing P.R. China

ISBN: (数字)9781665403924

ISBN: (纸本)9781665403931

The application of blockchain has moved beyond cryptocurrencies, to applications such as credentialing and smart contracts. The smart contract allows ones to achieve fair exchange for values without relying on a centralized entity. However, as the smart contract can be automatically executed with token transfers, an attacker can seek to exploit vulnerabilities in smart contracts for illicit profits. Thus, this paper proposes a support vector machine (SVM)-based scanning system for vulnerabilities on smart contracts. Our evaluation on Ethereum demonstrate that we achieve a identification rate of over 90% based on several popular attacks.

关键词： Support vector machines Deep learning Privacy Smart contracts Supervised learning Blockchain Pattern matching

来源：评论

学校读者我要写书评

暂无评论

DPANet: Depth potentiality-aware gated attention network for RGB-D salient object detection

arXiv

引用

arXiv 2020年

作者： Chen, Zuyao Cong, Runmin Xu, Qianqian Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100190 China The Institute of Information Science Beijing Jiaotong University Beijing100044 China The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China The Department of Computer Science City University of Hong Kong Hong Kong Hong Kong The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

There are two main issues in RGB-D salient object detection: (1) how to effectively integrate the complementarity from the cross-modal RGB-D data;(2) how to prevent the contamination effect from the unreliable depth map. In fact, these two problems are linked and intertwined, but the previous methods tend to focus only on the first problem and ignore the consideration of depth map quality, which may yield the model fall into the sub-optimal state. In this paper, we address these two issues in a holistic model synergistically, and propose a novel network named DPANet to explicitly model the potentiality of the depth map and effectively integrate the cross-modal complementarity. By introducing the depth potentiality perception, the network can perceive the potentiality of depth information in a learning-based manner, and guide the fusion process of two modal data to prevent the contamination occurred. The gated multi-modality attention module in the fusion process exploits the attention mechanism with a gate controller to capture long-range dependencies from a cross-modal perspective. Experimental results compared with 16 state-of-the-art methods on 8 datasets demonstrate the validity of the proposed approach both quantitatively and qualitatively. Copyright © 2020, The Authors. All rights reserved.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Multi-Dimensional Packet Classification for Multi-Core Systems

引用

Journal of Computer science & technology 2018年第5期33卷 1056-1071页

作者： Tong Shen Da-Fang Zhang Gao-Gang Xie Xin-Yi Zhang College of Computer Science and Electronic Engineering Hunan University Changsha 410082 China Network Technology Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China

Packet classification has been studied for decades; it classifies packets into specific flows based on a given rule set. As software-defined network was proposed, a recent trend of packet classification is to scale the five-tuple model to multi-tuple. In general, packet classification on multiple fields is a complex problem. Although most existing software-based algorithms have been proved extraordinary in practice, they are only suitable for the classic five-tuple model and difficult to be scaled up. Meanwhile, hardware-specific solutions are inflexible and expensive, and some of them are power consuming. In this paper, we propose a universal multi-dimensional packet classification approach for multi-core systems. In our approach, novel data structures and four decomposition-based algorithms are designed to optimize the classification and updating of rules. For multi-field rules, a rule set is cut into several parts according to the number of fields. Each part works independently. In this way, the fields are searched in parallel and all the partial results are merged together at last. To demonstrate the feasibility of our approach, we implement a prototype and evaluate its throughput and latency. Experimental results show that our approach achieves a 40% higher throughput than that of other decomposed-based algorithms and a 43% lower latency of rule incremental update than that of the other algorithms on average. Furthermore, our approach saves 39% memory consumption on average and has a good scalability.

关键词： multi-dimensional multi-core packet classification

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Model Incorporating Knowledge Representation Vectors and Its Application in Diabetes Prediction

引用

Disease Markers 2022年第1期2022卷 7593750页

作者： Xu, He Zheng, Qunli Zhu, Jingshu Xie, Zuoling Cheng, Haitao Li, Peng Ji, Yimu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Province Nanjing 210023 China Institute of High Performance Computing and Big Data Nanjing University of Posts and Telecommunications Nanjing 210023 China Nanjing Center of HPC China Nanjing 210023 China Jiangsu Research Engineering of HPC and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Department of Endocrinology Zhongda Hospital Southeast University Nanjing 210009 China

The deep learning methods for various disease prediction tasks have become very effective and even surpass human experts. However, the lack of interpretability and medical expertise limits its clinical application. This paper combines knowledge representation learning and deep learning methods, and a disease prediction model is constructed. The model initially constructs the relationship graph between the physical indicator and the test value based on the normal range of human physical examination index. And the human physical examination index for testing value by knowledge representation learning model is encoded. Then, the patient physical examination data is represented as a vector and input into a deep learning model built with self-attention mechanism and convolutional neural network to implement disease prediction. The experimental results show that the model which is used in diabetes prediction yields an accuracy of 97.18% and the recall of 87.55%, which outperforms other machine learning methods (e.g., lasso, ridge, support vector machine, random forest, and XGBoost). Compared with the best performing random forest method, the recall is increased by 5.34%, respectively. Therefore, it can be concluded that the application of medical knowledge into deep learning through knowledge representation learning can be used in diabetes prediction for the purpose of early detection and assisting diagnosis. © 2022 He Xu et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Convolutional neural network-assisted recognition of nanoscale L12 ordered structures in face-centred cubic alloys

arXiv

引用

arXiv 2021年

作者： Li, Yue Zhou, Xuyang Colnaghi, Timoteo Wei, Ye Marek, Andreas Li, Hongxiang Bauer, Stefan Rampp, Markus Stephenson, Leigh T. Max-Planck Institut für Eisenforschung GmbH Max-Planck-Straße 1 Düsseldorf40237 Germany Max Planck Computing and Data Facility Gießenbachstraße 2 Garching85748 Germany State Key Laboratory for Advanced Metals and Materials University of Science and Technology Beijing Beijing100083 China Max Planck Institute for Intelligent Systems Max-Planck-Ring 4 Tübingen72076 Germany

Nanoscale L12-type ordered structures are widely used in face-centred cubic (FCC) alloys to exploit their hardening capacity and thereby improve mechanical properties. These fine-scale particles are typically fully coherent with matrix with the same atomic configuration disregarding chemical species, which makes them challenging to be characterized. Spatial distribution maps (SDMs) are used to probe local order by interrogating the three-dimensional (3D) distribution of atoms within reconstructed atom probe tomography (APT) data. However, it is almost impossible to manually analyse the complete point cloud (>10 million) in search for the partial crystallographic information retained within the data. Here, we proposed an intelligent L12-ordered structure recognition method based on convolutional neural networks (CNNs). The SDMs of a simulated L12-ordered structure and the FCC matrix were firstly generated. These simulated images combined with a small amount of experimental data were used to train a CNN-based L12-ordered structure recognition model. Finally, the approach was successfully applied to reveal the 3D distribution of L12–type d¢–Al3(LiMg) nanoparticles with an average radius of 2.54 nm in a FCC Al-Li-Mg system. The minimum radius of detectable nanodomain is even down to 5 Å. The proposed CNN-APT method is promising to be extended to recognize other nanoscale ordered structures and even more-challenging short-range ordered phenomena in the near future. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

An extensible Hadoop framework for monitoring performance metrics and events of OpenStack cloud 3

An extensible Hadoop framework for monitoring performance me...

引用

3rd IEEE International Conference on Big data Analysis, ICBDA 2018

作者： Yang, Jianxi Shen, Chaoxiao Chi, Yaping Xu, Ping Sun, Wei Department of Communication Engineering Beijing Electronic Science and Technology Institute Key Laboratory of Network Assessment Technology Institute of Information Engineering CAS Beijing China

ISBN: (纸本)9781538647936

In recent years, many hot topics for research are manipulation of big data, cloud computing and a combination of them. OpenStack is a complex and evolving system that continuously generates vast amounts of metrics and log data. The more complex your system gets, the harder it is to understand its performance and troubleshoot problems, making monitoring a critical piece of the OpenStack control system. In order to effectively create, test and deploy new algorithms or frameworks one need suitable monitoring solutions. However, the conventional monitoring tools lack some performances to keep data freshness from a variety of sources in OpenStack. In the paper we design a critical monitoring solutions based on existing Hadoop architecture integrated with OpenStack clouds. Hundreds of different metrics are gathered form Hadoop metrics subsystem and all data is stored in HBase database to make it ready for processing or displaying it with MapReduce paradigm. With alarms/events generated, we also present a comprehensive view of the status of the infrastructure resources as well as the network services running on OpenStack. © 2018 IEEE.

关键词： Monitoring

来源：评论

学校读者我要写书评

暂无评论

Optimal network slicing for service-oriented networks with flexible routing and guaranteed E2E latency

arXiv

引用

arXiv 2020年

作者： Chen, Wei-Kun Liu, Ya-Feng de Domenico, Antonio Luo, Zhi-Quan Dai, Yu-Hong The School of Mathematics and Statistics Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Huawei Technologies Co. Ltd France Research Center Boulogne-Billancourt92100 France The Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China

network function virtualization is a promising technology to simultaneously support multiple services with diverse characteristics and requirements in the 5G and beyond networks. In particular, each service consists of a predetermined sequence of functions, called service function chain (SFC), running on a cloud environment. To make different service slices work properly in harmony, it is crucial to appropriately select the cloud nodes to deploy the functions in the SFC and flexibly route the flow of the services such that these functions are processed in the order defined in the corresponding SFC, the end-to-end (E2E) latency constraints of all services are guaranteed, and all cloud and communication resource budget constraints are respected. In this paper, we first propose a new mixed binary linear program (MBLP) formulation of the above network slicing problem that optimizes the system energy efficiency while jointly considers the E2E latency requirement, resource budget, flow routing, and functional instantiation. Then, we develop another MBLP formulation and show that the two formulations are equivalent in the sense that they share the same optimal solution. However, since the numbers of variables and constraints in the second problem formulation are significantly smaller than those in the first one, solving the second problem formulation is more computationally efficient especially when the dimension of the corresponding network is large. Numerical results demonstrate the advantage of the proposed formulations compared with the existing ones. Copyright © 2020, The Authors. All rights reserved.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：