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

A parallel evolutionary extreme learning machine scheme for electrical load prediction

学校读者我要写书评

暂无评论

A parallel evolutionary extreme learning machine scheme for ...

science and information Conference (SAI)

作者： Peikun Chen Wanhua Li Yuzhong Chen Kun Guo Yuzhen Niu College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou Fujian Collaborative Innovation Center for Big Data Applications in Governments Fuzhou Fuzhou China

ISBN: (纸本)9781509054442

Application of cloud computing technologies in power system has made a great contribution to the establishment of smart grid. Among applications of smart grid, electrical load prediction plays an important role in efficient use of power resource. However, the exponential growth of data has posed a great challenge to the existing algorithms. In this paper, we firstly propose a novel parallel hybrid algorithm, combining the Improved Particle Swarm Optimization (PSO) with ELM, named PIPSO-ELM. Here a modified particle swarm optimization is presented to find the optimal number of hidden neurons as well as the corresponding input weights and hidden biases. Furthermore, in the iterative search process of PSO, an update strategy employs the mutation operator of evolutionary algorithms is introduced for further improving the global search capability and convergence speed of PSO. After that, to handle the large-scale dataset efficiently, the parallel implementation of PIPSO-ELM is achieved using Spark. Finally, extensive experiments on real-life electrical load data and comprehensive evaluation are conducted to verify the performance of PIPSO-ELM in electrical load prediction. Extensive experimental results demonstrate that PIPSO-ELM outperforms the compared algorithms in terms of stability, efficiency and scalability simultaneously.

关键词： Neurons Particle swarm optimization Algorithm design and analysis Prediction algorithms Smart grids Encoding Convergence

Graphene based functional devices: A short review

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Wang, Rong Jiang, Lijun Ren, Xingang Yan, Ze Sha, Wei E.I. Shan, Guangcun Department of Electrical and Electronic Engineering University of Hong Kong Pokfulam Road Hong Kong Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei230039 China School of Instrumentation Science & Opto-electronics Engineering Beihang University Beijing100191 China Key Laboratory of Micro-nano Electronic Devices and Smart Systems of Zhejiang Province College of Information Science & Electronic Engineering Zhejiang University Hangzhou310027 China School of Instrumentation Science & Opto-electronics Engineering Beihang University Beijing100191 China California NanoSystem Institute Department of Chemistry & Biochemistry University of California Los AngelesCA90095 United States

Graphene is an ideal 2D material system bridging electronic and photonic devices. It also breaks the fundamental speed and size limits by electronics and photonics, respectively. Graphene offers multiple functions of signal transmission, emission, modulation, and detection in a broad band, high speed, compact size, and low loss. Here, we will have a brief view of graphene based functional devices at microwave, terahertz, and optical frequencies. Their fundamental physics and computational models will be discussed as well. Copyright © 2018, The Authors. All rights reserved.

关键词： Graphene

Fractal and multifractal analyses of bipartite networks

学校读者我要写书评

暂无评论

Scientific reports 2017年第1期7卷 45588页

作者： Jin-Long Liu Jian Wang Zu-Guo Yu Xian-Hua Xie Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education and Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan Hunan 411105 China. School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia.

Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

关键词：

Maxwell-hydrodynamic model for simulating nonlinear terahertz generation from plasmonic metasurfaces

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Fang, Ming Huang, Zhixiang Sha, Wei E.I. Wu, Xianliang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230039 China College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China Department of Electrical and Electronic Engineering University of Hong Kong

The interaction between electromagnetic field and plasmonic nanostructures leads to both strong linear and nonlinear behaviors. In this paper, a time-domain hydrodynamic model for describing the motion of electrons in plasmonic nanostructures is presented, in which both surface and bulk nonlinearity are considered. A coupled Maxwell-hydrodynamic system capturing full-wave physics and free electron dynamics is numerically solved with the parallel finite-difference time-domain (FDTD) method. The validation of the proposed method is presented by simulating a plasmonic metasurface. The linear response is compared with the Drude dispersion model and the nonlinear terahertz emission from a difference-frequency generation process is theoretically analyzed. The work is fundamentally important to design nonlinear plasmonic nanodevices, especially for efficient and broadband THz emitters. Copyright © 2017, The Authors. All rights reserved.

关键词： Plasmonics

Online optimization scheduling for scientific workflows with deadline constraint on hybrid clouds

学校读者我要写书评

暂无评论

Online optimization scheduling for scientific workflows with...

作者： Lin, Bing Guo, Wenzhong Lin, Xiuyan School of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China

The tremendous parallel computing ability of cloud computing encourages investigators to research its drawbacks and advantages on processing large-scale scientific applications such as workflows. The current cloud market is composed of numerous diverse public clouds and a local private cloud, and workflow scheduling is one of the biggest challenges on hybrid clouds due to the highly fragmented cloud market with respect to service provisions, pricing models, and bandwidths. In this paper, we propose an online-scheduling strategy for continuous submitted scientific workflows on hybrid clouds, which aims to complete the deadline-constrained applications as more as possible at a lower price. Firstly, a hierarchical iterative application partition (HIAP) algorithm is proposed to partition the application into a set of dependent tasks. Moreover, many online-scheduling algorithms cooperated with HIAP are presented to finish the workflows with a low average payment. Our strategy takes into account the basic characteristics on hybrid clouds such as bandwidth constraints, data transfer cost and computational cost. Various well-known workflows are used for evaluating the multiple scheduling algorithms and the results show that the MLF_ID approach can achieve a promising performance. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Data transfer

Completeness of hoare logic over nonstandard models

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Xu, Zhaowei Sui, Yuefei Zhang, Wenhui State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard semantics, the Hungary semantics and axiomatic semantics, are so general that they are absent either from mathematical elegance or from practical usefulness. The aim of this paper is to exhibit a not only mathematically elegant but also practically useful nonstandard semantics. A basic property of computable functions in the standard model N of Peano arithmetic PA is Σ1definability. However, the functions induced by the standard interpretation of while-programs S in nonstandard models M of PA are not always arithmetical. The problem consists in that the standard termination of S in M uses the finiteness in N, which is not the finiteness in M. To this end, we shall give a new interpretation of S in M such that the termination of S uses M-finiteness, and the functions produced by S in all models of PA have the uniform Σ1-definability. Then we define, based on the new semantics of while-programs, a new semantics of Hoare logic in nonstandard models of PA, and show that the standard axiom system of Hoare logic is sound and complete w.r.t. the new semantics. It will be established, in PA, that the Hungary semantics and axiomatic semantics coincide with the new semantics of while-programs. Moreover, various comparisons with the previous results, usefulness of the nonstandard semantics, and remarks on the completeness issues are ***: Hoare logic, Peano arithmetic, nonstandard models, nonstandard semantics, logical completeness Copyright © 2017, The Authors. All rights reserved.

关键词： Semantics

On completeness results of Hoare logic relative to the standard model

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Xu, Zhaowei Zhang, Wenhui Sui, Yuefei State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

The general completeness problem of Hoare logic relative to the standard model N of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical formulas as assertions. In practice, the assertions would be simple arithmetical formulas, e.g. of a low level in the arithmetical hierarchy. In addition, we find that, by restricting inputs to N, the complexity of the minimal assertion theory for the completeness of Hoare logic to hold can be reduced. This paper further studies the completeness of Hoare Logic relative to N by restricting assertions to subclasses of arithmetical formulas (and by restricting inputs to N). Our completeness results refine Cook’s result by reducing the complexity of the assertion theory. Copyright © 2017, The Authors. All rights reserved.

关键词： Computer circuits

Convex local sensitive low rank matrix approximation

学校读者我要写书评

暂无评论

Convex local sensitive low rank matrix approximation

International Joint Conference on Neural Networks (IJCNN)

作者： Chong-Ya Li Lin Zhu Wen-Zheng Bao Yong-Li Jiang Chang-An Yuan De-Shuang Huang College of Electronics and Information Engineering Tongji University Shanghai China Ningbo Haisvision Intelligence System Co. Ltd. Ningbo Zhejiang China Science Computing and Intelligent Information Processing of GuangXi Higher Education Key Laboratory Guangxi Teachers Education University Nanning Guangxi China

ISBN: (纸本)9781509061839

The problem of matrix approximation appears ubiquitously in recommendation systems, computer vision and text mining. The prevailing assumption is that the partially observed matrix has a low-rank or can be well approximated by a low-rank matrix. However, this assumption is strictly that the partially observed matrix is globally low rank. In this paper, we propose a local sensitive formulation of matrix approximation which relaxes the global low-rank assumption, leading to a representation of the observed matrix as a weighted sum of low-rank matrices. We solve the problem by an efficient way based on the alternating direction method of multipliers (ADMM). Our experiments show improvements in prediction accuracy over classical approaches for recommendation tasks.

关键词： Kernel Recommender systems Convex functions Minimization Motion pictures Sparse matrices Smoothing methods

Research on batch scheduling in cloud computing

学校读者我要写书评

暂无评论

Telkomnika (Telecommunication computing Electronics and Control) 2016年第4期14卷 1454-1461页

作者： Jiao, Jintao Yu, Wensen Guo, Lei School of Mathematics and Computer Science Wuyi University Wuyishan354300 China The Key Laboratory of Cognitive Computing Intelligent Information Processing of Fujian Education Institutions Wuyishan354300 China Collaborative Innovation Center of Chinese Oolong Tea Industry Wuyishan354300 China

In the existing cloud computing environment, batch scheduling strategies mainly focus on the management of resources allocation. This paper provides the task scheduling algorithm based on service quality which fully considers priority and scheduling deadline. The improved algorithm combines the advantages of Min-min algorithm with higher throughput and linear programming with global optimization, considers not only all the tasks but also the high priority tasks. The experiment result shows that compared with the Min-min and DBCT the completed tasks of the improved algorithm increase about 10.6% and 22.0%, on the other hand the completed high priority tasks also increases approximately 20% and 40%. © 2016 Universitas Ahmad Dahlan.

关键词： Cloud computing