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

arXiv 2018年

作者： Liu, Feng Shi, Yong Li, Peijia Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China

Artificial intelligence (AI) like deep learning, cloud AI computation has been advancing at a rapid pace since 2014. There is no doubt that the prosperity of AI is inseparable with the development of the Internet. However, there has been little attention to the link between AI and the internet. This paper explores them with brain insights mainly from four views:1) How is the general relation between artificial intelligence and Internet of Things, cloud computing, big data and Industrial Internet from the perspective of brain science. 2) Construction of a new AI system model with the Internet and brain science. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Stable and unstableperiodic solutions for quadratic contact Hamiltonians with a small parameter

引用

Journal of Physics: Conference Series 2019年第1期1324卷

作者： Yanan Huang Leilei Jia Xiuyu Sun Zhanyong Li School of Mathematics and Computing Science Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation Guilin University of Electronic Technology Guilin China School of Electronic Information and Automation Guilin University of Aerospace Technology Guilin China

In this paper, we study the existence of periodic solutions for a class of quadratic contact Hamiltonian system with a small parameter by averaging *** have proved that the quadratic contact Hamiltonian system has a stable periodic solution and an unstable periodic solution when the corresponding parameter is small enough.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The packing problem of uncertain multicasts

The packing problem of uncertain multicasts

引用

作者： Ren, Bangbang Guo, Deke Xie, Junjie Li, Wenxin Yuan, Bo Liu, Yunfei Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology Changsha China School of Computer Science and Technology Dalian University of Technology Dalian China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin China

Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizing the transmission cost of each multicast session. In practice, it is not necessary that the source of each multicast session has to be in a specific location, as long as certain constraints are satisfied. Accordingly, applications usually meet a novel multicast with uncertain sources, ie, uncertain multicast. That is, multiple nodes have the responsibility to act as the root node of a multicast session. Prior proposals have addressed an uncertain multicast by constructing the minimum cost forest. However, it is still unknown how to efficiently share the network resources, when a set of uncertain multicast occupies the network simultaneously. To tackle such a challenging issue, we present the packing problem of uncertain multicasts (MPU) to minimize the total transmission cost, under the constraint of link capacity. We prove that the MPU problem is NP-hard. An intrinsic solution is constructing the minimum cost forest for each uncertain multicast individually. This method, however, is inefficient and may be infeasible because of the constraint of link capacity. Thus, we design 2 dedicated greedy methods, named priority-based and adjusting congested link, to approximate the optimal solution. The comprehensive results indicate that both of our 2 methods can find a feasible solution for the MPU problem. Moreover, given a set of uncertain multicasts, the adjusting congested link method can generate a desired transmission structure for each uncertain multicast and achieve the least total cost when packing them. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Self-Triggered Distributed Optimization for Multi-Agent Systems with Periodic Sampling Schemes

Self-Triggered Distributed Optimization for Multi-Agent Syst...

引用

Chinese Automation Congress (CAC)

作者： Shuling Li Wu Ai Jian Wu College of Science Center for Data analysis and Algorithm Technology Guilin University of Technology Guilin P. R. China College of Science Guilin University of Technology Guangxi Key Laboratory of Spatial Information and Geomatics Guilin P. R. China Perception and Computing of Anhui University Key Laboratory of Intelligent Province Anqing P. R. China

This work is the first to consider the self-triggered distributed optimization problem for multi-agent systems with periodic sampling communication. Each agent computes its next update time instance at the previous time. The self-triggered distributed protocols are proposed to reduce the load of in-network communication. It is proved that these self-triggered protocol achieves optimal consensus exponentially under a undirected and connected network topology.

关键词： Multi-agent systems Cost function Protocols Eigenvalues and eigenfunctions Geomagnetism Network topology

来源：评论

学校读者我要写书评

暂无评论

Nonlinearly-Activated Noise-Tolerant Zeroing Neural Network for Distributed Motion Planning of Multiple Robot Arms

Nonlinearly-Activated Noise-Tolerant Zeroing Neural Network ...

引用

International Joint Conference on Neural Networks

作者： Long Jin Shuai Li Xin Luo Ming-sheng Shang School of Information Science and Engineering Lanzhou University Department of Computing The Hong Kong Polytechnic University Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences

ISBN: (纸本)9781509061839

This paper investigates the distributed motion planning of multiple robot arms with limited communications in the presence of noises. To do this, a nonlinearly-activated noise-tolerant zeroing neural network (NANTZNN) is designed and presented for the first time for solving the presented distributed scheme online. Theoretical analyses and simulation results show the effectiveness and accuracy of the presented distributed scheme with the aid of NANTZNN model.

关键词： robotic arm motion planning Distribute Noise Neural network Automatic incident detection Simulation results

来源：评论

学校读者我要写书评

暂无评论

Design of intelligent Shopping Cart for Supermarket

引用

Journal of Physics: Conference Series 2019年第1期1207卷

作者： Li Bo Zhang Xiao Yan Jingyi School of Computer Science Northwestern Polytechnical University Xi'an Shaanxi 710129 China Ministry of communications Key Laboratory of big data storage and management Xi'an Shaanxi 710129 China School of Management Northwestern Polytechnical University Xi'an Shaanxi 710129 China

With the development of science and technology and the continuous improvement of people's living standards, the demand for intelligent service equipment is increasing. In view of the supermarket environment, this paper explores the intelligent automatic following shopping cart. The idea is based on high-performance vehicle motor equipment, through the combination of ultrasonic detection technology, infrared detection technology, mobile Bluetooth technology, and other detection technologies, by the control module (TMS320F2812 chip) processing detection signal, through SLAM algorithm analysis, to achieve intelligent evasion and automatic follow. Through simulation and experimental analysis, the idea can realize the function of intelligent following shopping cart.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Radviz-based visualization for understanding fuzzy clustering results 17

A Radviz-based visualization for understanding fuzzy cluster...

引用

10th International Symposium on Visual Information Communication and Interaction, VINCI 2017

作者： Zhou, Fangfang Chan, Minghui Wang, Zeyu Luo, Feng Luo, Xiaobo Huang, Wei Chen, Yi Zhao, Ying School of Information Science and Engineering Central South University China 360 Enterprise Security Group China Beijing Key Laboratory of Big Data Technology for Food Safety Beijing Technology and Business University China

ISBN: (纸本)9781450352925

Fuzzy clustering analysis is an effective method to describe the uncertainty relationship between data objects and clusters. However, fuzzy clustering results will become complex and high-dimensional membership degree matrixes when they contain a large number of data points and multiple clusters. In this paper, we propose a Radviz-based interactive visualization to help users understand fuzzy clustering results. Firstly, we utilize the projection mechanism of Radviz to map the membership degree matrixes onto planar and radial pictures, in which data points with low membership uncertainty are located near Radviz circumference, while the others are scattered in the center of Radviz circle. To provide an informative interactive visualization, we then improve traditional Radviz visualization in many aspects, including implementing an optimal and uneven placement of dimension anchors by using the Prim algorithm, designing visual codings of data points and dimension arcs to express statistical information, combining chord diagram to depict the sharing relationship between clusters, and offering a set of interactions to support deeper exploration. Finally, we use a case study to illustrate the effectiveness and usefulness of our visualization. © 2017 Association for computing Machinery.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Visco-acoustic Wave-equation Traveltime Inversion with Correct and Incorrect Attenuation Profiles 87

Visco-acoustic Wave-equation Traveltime Inversion with Corre...

引用

Society of Exploration Geophysicists International Exposition and 87th Annual Meeting, SEG 2017

作者： Yu, Han Chen, Yuqing Guo, Bowen Schuster, Gerard T. Division of Physical Sciences and Engineering King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Jiangsu Key Lab of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210003 China

A visco-acoustic wave-equation traveltime inversion method is presented that inverts for a shallow subsurface velocity distribution with correct and incorrect attenuation profiles. Similar to the classical wave equation traveltime inversion, this method applies the misfit functional that minimizes the first break differences between the observed and predicted data. Although, WT can partly avoid the cycle skipping problem, an initial velocity model approaches to the right or wrong velocity models under different setups of the attenuation profiles. However, with a Q model far away from the real model, the inverted tomogram is obviously different from the true velocity model while a small change of the Q model does not improve the inversion quality in a strong manner if low frequency information is not lost.. © 2017 SEG.

关键词： Wave equations

来源：评论

学校读者我要写书评

暂无评论

Social cognitive optimization with tent map for combined heat and power economic dispatch

arXiv

引用

arXiv 2018年

作者： Sun, Jiaze Li, Yang School of Computer Science and Technology Xi 'an University of Posts and Telecommunications Xi'an710121 China Shaanxi Key Laboratory of Network Data Intelligent Processing Xi 'an University of Posts and Telecommunications Xi 'an710121 China School of Electrical Engineering Northeast Electric Power University Jilin132012 China

Combined Heat and Power Economic Dispatch (CHPED) problem is a sophisticated constrained nonlinear optimization problem in a heat and power production system for assigning heat and power production to minimize the production costs. To address this challenging problem, a novel Social Cognitive Optimization algorithm with Tent map (TSCO) is presented for solving the CHPED problem. To handle the equality constraints in heat and power balance constraints, Adaptive Constraints Relaxing (ACR) rule is adopted in constraint processing. The novelty of our work lies in the introduction of a new powerful TSCO algorithm to solve the CHPED issue. The effectiveness and superiority of the presented algorithm is validated by carrying out two typical CHPED cases. The numerical results show that the proposed approach has better convergence speed and solution quality than all other existing state-of-the-art algorithms. Copyright © 2018, The Authors. All rights reserved.

关键词： Functions

来源：评论

学校读者我要写书评

暂无评论

ChaLearn looking at people: IsoGD and ConGD large-scale RGB-D gesture recognition

arXiv

引用

arXiv 2019年

作者： Wan, Jun Lin, Chi Wen, Longyin Li, Yunan Miao, Qiguang Escalera, Sergio Anbarjafari, Gholamreza Guyon, Isabelle Guo, Guodong Li, Stan Z. National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China JD Finance Mountain ViewCA United States University of Southern California Los AngelesCA90089-0911 United States School of Computer Science and Technology Xidian University & Xi'an Key Laboratory of Big Data and Intelligent Vision 2nd South Taibai Road Xi'an710071 China Universitat de Barcelona Computer Vision Center Spain iCV Lab Institute of Technology University of Tartu Estonia Faculty of Engineering Hasan Kalyoncu University Gaziantep Turkey Institute of Digital Technologies Loughborough University London United Kingdom ChaLearn United States University Paris-Saclay France institute of Deep Learning Baidu Research National Engineering Laboratory for Deep Learning Technology and Application China

The ChaLearn large-scale gesture recognition challenge has been run twice in two workshops in conjunction with the International Conference on Pattern Recognition (ICPR) 2016 and International Conference on Computer Vision (ICCV) 2017, attracting more than 200 teams around the world. This challenge has two tracks, focusing on isolated and continuous gesture recognition, respectively. This paper describes the creation of both benchmark datasets and analyzes the advances in large-scale gesture recognition based on these two datasets. We discuss the challenges of collecting large-scale ground-truth annotations of gesture recognition, and provide a detailed analysis of the current state-of-the-art methods for large-scale isolated and continuous gesture recognition based on RGB-D video sequences. In addition to recognition rate and mean jaccard index (MJI) as evaluation metrics used in our previous challenges, we also introduce the corrected segmentation rate (CSR) metric to evaluate the performance of temporal segmentation for continuous gesture recognition. Furthermore, we propose a bidirectional long short-term memory (Bi-LSTM) baseline method, determining the video division points based on the skeleton points extracted by convolutional pose machine (CPM). Experiments demonstrate that the proposed Bi-LSTM outperforms the state-of-the-art methods with an absolute improvement of 8.1% (from 0.8917 to 0.9639) of CSR. Copyright © 2019, The Authors. All rights reserved.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：