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

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

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. Copyright © 2018, The Authors. All rights reserved.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Robust frequent directions with application in online learning

arXiv

引用

arXiv 2017年

作者： Luo, Luo Chen, Cheng Zhang, Zhihua Li, Wu-Jun Zhang, Tong Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dongchuan Road Shanghai200240 China National Engineering Lab for Big Data Analysis and Applications School of Mathematical Sciences Peking University 5 Yiheyuan Road Beijing100871 China National Key Laboratory for Novel Software Technology Collaborative Innovation Center of Novel Software Technology and Industrialization Department of Computer Science and Technology Nanjing University 163 Xianlin Avenue Nanjing210023 China Computer Science & Mathematics Hong Kong University of Science and Technology Hong Kong

The frequent directions (FD) technique is a deterministic approach for online sketching that has many applications in machine learning. The conventional FD is a heuristic procedure that often outputs rank deficient matrices. To overcome the rank deficiency problem, we propose a new sketching strategy called robust frequent directions (RFD) by introducing a regularization term. RFD can be derived from an optimization problem. It updates the sketch matrix and the regularization term adaptively and jointly. RFD reduces the approximation error of FD without increasing the computational cost. We also apply RFD to online learning and propose an effective hyperparameter-free online Newton algorithm. We derive a regret bound for our online Newton algorithm based on RFD, which guarantees the robustness of the algorithm. The experimental studies demonstrate that the proposed method outperforms state-of-the-art second order online learning algorithms. Copyright © 2017, The Authors. All rights reserved.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Building Chinese affective resources in valence-arousal dimensions 15

Building Chinese affective resources in valence-arousal dime...

引用

15th Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2016

作者： Yu, Liang-Chih Lee, Lung-Hao Hao, Shuai Wang, Jin He, Yunchao Hu, Jun Lai, K. Robert Zhang, Xuejie Department of Information Management Yuan Ze University Taiwan Department of Computer Science and Engineering Yuan Ze University Taiwan Innovation Center for Big Data and Digital Convergence Yuan Ze University Taiwan Information Technology Center National Taiwan Normal University Taiwan School of Software Nanchang University Jiangxi China School of Information Science and Engineering Yunnan University Yunnan China

ISBN: (纸本)9781941643914

An increasing amount of research has recently focused on representing affective states as continuous numerical values on multiple dimensions, such as the valence-arousal (VA) space. Compared to the categorical approach that represents affective states as several classes (e.g., positive and negative), the dimensional approach can provide more fine-grained sentiment analysis. However, affective resources with valence-arousal ratings are still very rare, especially for the Chinese language. Therefore, this study builds 1) an affective lexicon called Chinese valence-arousal words (CVAW) containing 1,653 words, and 2) an affective corpus called Chinese valence-arousal text (CVAT) containing 2,009 sentences extracted from web texts. To improve the annotation quality, a corpus cleanup procedure is used to remove outlier ratings and improper texts. Experiments using CVAW words to predict the VA ratings of the CVAT corpus show results comparable to those obtained using English affective resources. ©2016 Association for Computational Linguistics.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic Identification of Traffic Accidents based on Intelligent Identification

引用

Journal of Physics: Conference Series 2018年第6期1087卷

作者： Huihong Chen Shiming Li Chen Huihong (School of information engineering Guangzhou Panyu polytechnic University Guangzhou China 511483) Fujian Gutian people associate professor master mainly engaged in image recognition software development and big data research. *** Liu Shiming (Corresponding author) (School of management Guangzhou Panyu polytechnic University Guangzhou China 511483) Hubei Zaoyang people senior engineer doctor mainly engaged in safety early warning risk analysis and evaluation safety management. ***

The traffic accident process system is complex, by extracting the traffic accident information, the real-time state monitoring of the traffic accident image can be realized. A method of traffic accident information extraction and automatic recognition is proposed based on depth neural network and intelligent image analysis. The remote sensing method is used to collect the traffic accident image, the traffic accident remote sensing image is adaptively de-noised, and the block feature matching method is used to deal with the traffic accident image block fusion. The feature extraction of traffic accident state is carried out in the subspace component of traffic accident image, and the image feature classification of traffic accident is processed by using depth neural network classifier to realize image feedback recognition of traffic accident state feature quantity. A large number of traffic video images are selected for experiments. The simulation results show that the proposed method is more intelligent and accurate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantum homomorphic signature using coherent states 2

Quantum homomorphic signature using coherent states

引用

2nd IEEE International Conference on Computer and Communications, ICCC 2016

作者： Luo, Qingbin Yang, Guowu She, Kun Li, Xiaoyu Yuqi, Wang School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Edward S. Rogers Sr. Department of Electrical Computer Engineering Department University of Toronto TorontoONM5S 3G4 Canada Big Data Research Center and School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China College of Computer Minnan Normal University Zhangzhou China

ISBN: (纸本)9781467390262

In this paper, a novel scheme for quantum homomorphic signature based on coherent states is proposed, which is an effective approach to identity authentication for multiple streams to enhance the security of quantum networks. The state used for signature are arbitrarily close in trace distance to states of O(log2n), if the length of the nodes' messages is n-bit. The scheme analysis shows that the scheme is a quantum group homomorphic signature scheme and the signature is unforgeable. © 2016 IEEE.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

A secure access and associate deleting scheme for multi-replica in multi-cloud environment

引用

International Journal of High Performance Systems Architecture 2016年第3期6卷 143-152页

作者： Xiong, Jinbo Li, Suping Li, Xuan Zhang, Yuanyuan Jin, Biao Faculty of Software Fujian Normal University Fuzhou China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China Fujian Engineering Research Center Public Service Big Data Mining and Application Fuzhou China

With the rapid development of cloud services in multi-cloud environment, it is convenient to generate multi-replica for user's data stored in multi-cloud servers. On the one hand, multi-replica is able to improve data availability and users' experience. But on the other hand, it becomes increasingly easy to disclose sensitive data and brings serious challenges to security and privacy for user's data and its multi-replica. In order to tackle the above issues, in this paper, we propose a secure access and associate deleting scheme for multi-replica (MADS) in multi-cloud environment, which is based on symmetric encryption algorithm, attribute-based encryption and replica location technology. We construct a novel multi-layered key structure, called multi-way search key tree (MSKT) that ensures no key material will be revealed, yet the data owner is able to control the master key and manage other keys by performing some tree operations. We also propose a data replica associated model, which is able to associate all the data replicas in multi-cloud environment. Comprehensive comparison and security analysis demonstrate that the proposed MADS scheme is effective and secure. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：