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

作者： Xing, Lining Li, Wen He, Minfan Tan, Xu School of Mathematics and Big Data Foshan University Foshan528000 China College of Engineering Shanghai Polytechnic University Shanghai201209 China College of Information Systems and Management National University of Defense Technology Changsha410073 China Business School of Hunan University Changsha410082 China School of Software Engineering Shenzhen Institute of Information Technology Shenzhen518172 China

Scientific scheduling of limited resource plays an important role in the remote sensing data processing. The remote sensing data processing task scheduling is characterized as one novel comprehensive multi-objective model. In this proposed model, the remote sensing data processing task scheduling problem is divided into task dispensation and task scheduling sub-problem with hundreds of variables being considered in it. In order to effectively solve this problem, Bayes belief model is applied to generate the initial dispensation plan, and learnable ant colony optimization is proposed to solve task scheduling sub-problem. Experimental results suggest that the proposed comprehensive multi-objective model and its solving methods are feasible and efficient to remote sensing data processing task scheduling, and it also promotes processing centers interoperability among heterogeneous and dispersed processing center. The model and the method of this paper can provide a valuable reference for solving other complex scheduling problem. Copyright © 2017 John Wiley & Sons, Ltd.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Random asynchronous iterations in distributed coordination algorithms

arXiv

引用

arXiv 2018年

作者： Chen, Yao Xia, Weiguo Cao, Ming Lü, Jinhu Department of Computer Science Southwestern University of Finance and Economics Chengdu611130 China School of Control Science and Engineering Dalian University of Technology Dalian116024 China Faculty of Science and Engineering ENTEG University of Groningen Groningen9747 AG Netherlands School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

Distributed coordination algorithms (DCA) carry out information processing processes among a group of networked agents without centralized information fusion. Though it is well known that DCA characterized by an SIA (stochastic, indecomposable, aperiodic) matrix generate consensus asymptotically via synchronous iterations, the dynamics of DCA with asynchronous iterations have not been studied extensively, especially when viewed as stochastic processes. This paper aims to show that for any given irreducible stochastic matrix, even non-SIA, the corresponding DCA lead to consensus successfully via random asynchronous iterations under a wide range of conditions on the transition probability. Particularly, the transition probability is neither required to be independent and identically distributed, nor characterized by a Markov chain. Copyright © 2018, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Improved Metaheuristic Algorithms for Metabolic Network Optimization

引用

IOP Conference Series: Materials Science and engineering 2019年第1期551卷

作者： K Mohd Daud Z Zakaria R Hassan M S Mohamad Z Ali Shah Artificial Intelligence and Bioinformatics Research Group School of Computing Faculty of Engineering Universiti Teknologi Malaysia 81310 Johor Bahru Malaysia Software Engineering Department School of Computing Faculty of Engineering Universiti Teknologi Malaysia 81310 Johor Bahru Malaysia Institute for Artificial Intelligence and Big Data Universiti Malaysia Kelantan City Campus Pengkalan Chepa 16100 Kota Bharu Kelantan Malaysia Faculty of Bioengineering and Technology Universiti Malaysia Kelantan Jeli Campus Lock Bag 100 17600 Jeli Kelantan Malaysia

Metaheuristic algorithms have been used in various domains to solve the optimization problem. In metabolic engineering, the problem of identifying near-optimal reactions knockout that can optimize the production rate of desired metabolites are hindered by the complexity of the metabolic networks. Through Flux Balance Analysis, different metaheuristics algorithms have been improved to optimize the desired phenotypes. In this paper, a comparative study of four metaheuristic algorithms have been proposed. Differential Search Algorithm (DSA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC) and Genetic Algorithm (GA) are considered. These algorithms are tested on succinic acid production in Escherichia coli. The comparative performances are measured based on production rate, growth rate, and computational time. Hence, from the results, the best metaheuristic algorithms to solve the metabolic network optimization is identified.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Image encryption using random sequence generated from generalized information domain

引用

Chinese Physics B 2016年第5期25卷 176-185页

作者：张夏衍张国基李璇任亚洲伍杰华 School of Computer Science and Engineering South China University of TechnologyHigher Education Mega Centre School of Mathematics South China University of Technology School of Software Fujian Normal University School of Computer Science and Engineering Big Data Research Center University of Electronic Science and Technology of China

A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security.

关键词： image encryption random number generator cryptography

来源：评论

学校读者我要写书评

暂无评论

End-to-end symmetry preserving inter-atomic potential energy model for finite and extended systems 18

End-to-end symmetry preserving inter-atomic potential energy...

引用

Proceedings of the 32nd International Conference on Neural Information Processing Systems

作者： Linfeng Zhang Jiequn Han Han Wang Wissam A. Saidi Roberto Car E. Weinan Program in Applied and Computational Mathematics Princeton University Institute of Applied Physics and Computational Mathematics China and CAEP Software Center for High Performance Numerical Simulation China Department of Mechanical Engineering and Materials Science University of Pittsburgh Program in Applied and Computational Mathematics Princeton University and Department of Chemistry and Department of Physics Princeton University and Princeton Institute for the Science and Technology of Materials Princeton University Program in Applied and Computational Mathematics Princeton University and Department of Mathematics Princeton University and Beijing Institute of Big Data Research China

Machine learning models are changing the paradigm of molecular modeling, which is a fundamental tool for material science, chemistry, and computational biology. Of particular interest is the inter-atomic potential energy surface (PES). Here we develop Deep Potential - Smooth Edition (DeepPot-SE), an end-to-end machine learning-based PES model, which is able to efficiently represent the PES of a wide variety of systems with the accuracy of ab initio quantum mechanics models. By construction, DeepPot-SE is extensive and continuously differentiable, scales linearly with system size, and preserves all the natural symmetries of the system. Further, we show that DeepPot-SE describes finite and extended systems including organic molecules, metals, semiconductors, and insulators with high fidelity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

End-to-end symmetry preserving inter-atomic potential energy model for finite and extended systems

arXiv

引用

arXiv 2018年

作者： Zhang, Linfeng Han, Jiequn Wang, Han Saidi, Wissam A. Car, Roberto Weinan, E. Program in Applied and Computational Mathematics Princeton University United States Institute of Applied Physics and Computational Mathematics China CAEP Software Center for High Performance Numerical Simulation China Department of Mechanical Engineering and Materials Science University of Pittsburgh United States Department of Chemistry and Department of Physics Princeton University United States Princeton Institute for the Science and Technology of Materials Princeton University United States Department of Mathematics Princeton University United States Beijing Institute of Big Data Research China

关键词： Potential energy

来源：评论

学校读者我要写书评

暂无评论

Semantic interoperability for asset communication within smart factories 22

Semantic interoperability for asset communication within sma...

引用

22nd IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2017

作者： Diedrich, Christian Belyaev, Alexander Schröder, Tizian Willmann, Alexander Koziolek, Heiko Pethig, Florian Niggemann, Oliver Vialkowitsch, Jens Usländer, Thomas Wende, Jörg Institute for Automation Engineering Otto-von-Guericke-Universität Magdeburg39106 Germany Industrial Internet of Things Group Fraunhofer FOKUS Berlin10589 Germany Corporate Research Center ABB Ladenburg68526 Germany Intelligent Automation Lab Big Data Lemgo32657 Germany Robert Bosch GmbH Stuttgart70442 Germany Information Management and DCS Fraunhofer IOSB Karlsruhe76131 Germany IBM Hybrid Cloud Software IBM Deutschland GmbH Dresden01067 Germany

ISBN: (纸本)9781509065059

Industrie 4.0 (I4.0) aims at a manufacturer-independent, vertical- And horizontal-oriented communication and cooperation within smart factories. This is only manageable using international standards. The so-called reference architecture model for Industrie 4.0 (RAMI4.0) and the requirement specification of an I4.0 component are already available. RAMI4.0 could be the basis for the interoperability of the interactions. The working group "Semantic and interaction model for I4.0 components" (GMA 7.20) made progress in this direction. The language used for the interaction of I4.0 components needs model definitions for the interaction consisting of the structure of the components, syntax for the description of the messages and the means to assign the meaning to the language elements. This paper discusses the results for a broader audience. © 2017 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A human-machine cooperative approach for combinatorial optimization problem

A human-machine cooperative approach for combinatorial optim...

引用

2016 International Conference on Machine Learning and Cybernetics, ICMLC 2016

作者： Yan, Xue-Ming Huang, Han Hao, Zhi-Feng Li, Gang School of Computer and Engineering South China University of Technology Guangzhou China School of Software Engineering South China University of Technology Guangzhou China School of Mathematics and Big Data Foshan University P. O. Box Foshan China

ISBN: (纸本)9781509003891

The human-computer cooperative approaches for handling the combinatorial optimization problems are introduced. In this paper we propose the human-computer cooperation approach for combinatorial optimization problems. Firstly, the initial solutions are seen as the sampling in human cognition by computer games. The games are developed for special combinatorial optimization problems. Then fuzzy decomposition decomposes the optimization problem into several sub-problems according to initial solutions by human. Moreover, local search strategy is given in conformational space with human strategy development capabilities, which also explores the space of possible search strategies. Last, the stochastic elements of the search in the traditional computational algorithms are gone with human intelligence during the fuzzy composition process. Human-computer cooperation approach can indeed lead to mutual advantage, and it can improve the problem-solving skills. We apply the proposed method to two-echelon vehicle routing problem to verify its effectiveness and usefulness. © 2016 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Evolutionary process: Parallelism analysis of differential evolution algorithm based on graph theory 11th

Evolutionary process: Parallelism analysis of differential e...

引用

11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016

作者： Peng, Xiaoqi Hao, Zhifeng Huang, Han Wu, Hongyue Liu, Fangqing School of Applied Mathematics Guangdong University of Technology Guangzhou510520 China School of Mathematics and Big Data Foshan University Foshan528000 China School of Software Engineering South China University of Technology Guangzhou510006 China

ISBN: (纸本)9789811036132

Computation intelligence is becoming an essential technology during the development of human society. There are many family members in computation intelligence. Many researchers have already studied the mathematical inherent rules of these biology-inspired algorithms to found methods to improve the capacity of the algorithms. In the family of computation intelligence, differential evolution (DE) algorithm shows performance optimization ability. In order to explore the reason why DE could have stable and robust quality. We analyzed the parallelism of the evolutionary process in the iterative process of DE algorithm based on graph theory. By the knowledge of graph theory, it will directly exhibit the essential reason of differential evolution in the algorithm. The research will reveal that the superior DE algorithm have more extent parallelism ability than the elementary algorithm. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Dynamic Shortest Path Monitoring in Spatial Networks

引用

Journal of Computer Science & Technology 2016年第4期31卷 637-648页

作者： Shuo Shang Lisi Chen Zhe-Wei Wei Dan-Huai Guo Ji-Rong Wen State Key Laboratory of Software Development Environment Beijing 100191 China Department of Computer Science China University of Petroleum Beijing 102249 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Beijing Key Laboratory of Big-Data Management and Analysis Methods Renmin University of China Beijing 100080 China Computer Network Information Center Chinese Academy of Sciences Beijing 100190 China

With the increasing availability of real-time traffic information, dynamic spatial networks are pervasive nowa- days and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks （DSPM query）. When a traveler aims to a des- tination, his/her shortest path to the destination may change due to two reasons： 1） the travel costs of some edges have been updated and 2） the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons： 1） how to maintain and reuse the existing computation results to accelerate the following computations, and 2） how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data.

关键词： shortest path dynamic spatial network spatial database location-based service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：