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

International Joint Conference on Neural Networks

作者： Yinyan Zhang Shuai Li Xin Luo Ming-sheng Shang Department of Computing The Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing 400714 China

ISBN: (纸本)9781509061839

The speed control of permanent magnet brushed (PMB) DC motors at low speeds is difficult due to the nonlinearity caused by various types of frictions. Under parameter uncertainty, the speed control becomes more difficult. In this paper, to handle the parameter uncertainty, we propose a dynamic neural network to adaptively reconstruct or learn the dynamics of PMB DC motors. Then, based on the parameters of the neural dynamic model, a near-optimal dynamic neural controller is designed and proposed for the speed control of PMB DC motors with frictions considered under parameter uncertainty. Simulations substantiate the efficacy of the proposed dynamic neural model and adaptive near-optimal controller for PMB DC motors with fully unknown parameters.

关键词： DC motors Velocity control Friction Optimal control Permanent magnet motors Biological neural networks

来源：评论

学校读者我要写书评

暂无评论

Publisher Correction: A Fast and Refined Cancer Regions Segmentation Framework in Whole-slide Breast Pathological Images

引用

Scientific reports 2020年第1期10卷 8591页

作者： Zichao Guo Hong Liu Haomiao Ni Xiangdong Wang Mingming Su Wei Guo Kuansong Wang Taijiao Jiang Yueliang Qian Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China. Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China. hliu@***. Research Center for Big Data of Biomedical Sciences Institute of Basic Medical Sciences Chinese Academy of Medical Sciences & Peking Union Medical College Beijing 100005 China. Suzhou Institute of Systems Medicine Suzhou 215123 China. Graduate School of Peking Union Medical College Beijing 100005 China. Department of Pathology Xiangya Hospital Central South University Changsha Hunan 410013 China. Department of Pathology School of Basic Medical Sciences Central South University Changsha Hunan 410013 China. Department of Pathology Xiangya Hospital Central South University Changsha Hunan 410013 China. ***@***. Department of Pathology School of Basic Medical Sciences Central South University Changsha Hunan 410013 China. ***@***. Research Center for Big Data of Biomedical Sciences Institute of Basic Medical Sciences Chinese Academy of Medical Sciences & Peking Union Medical College Beijing 100005 China. taijiao@***. Suzhou Institute of Systems Medicine Suzhou 215123 China. taijiao@***.

An amendment to this paper has been published and can be accessed via a link at the top of the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comments on cut-set bounds on network function computation

Comments on cut-set bounds on network function computation

引用

作者： Huang, Cupjin Tan, Zihan Yang, Shenghao Guang, Xuan Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109 United States Department of Computer Science University of Chicago ChicagoIL60637 United States School of Science and Engineering Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen518172 China School of Mathematical Sciences and LPMC Nankai University Tianjin China Institute of Network Coding Chinese University of Hong Kong Hong Kong Hong Kong

A function computation problem over a directed acyclic network has been considered in the literature, where a sink node is required to compute a target function correctly with the inputs arbitrarily generated at multiple source nodes. The network links are error free but capacity limited, and the intermediate nodes perform network coding. The computing rate of a network code is the average number of times that the target function is computed for one use of the network, i.e., each link in the network is used at most once. In the existing papers, two cut-set bounds were proposed on the computing rate. However, we in this paper show that these bounds are not valid for general network function computation problems. We analyze the reason of the invalidity and propose a general cut-set bound by using a new equivalence relation associated with the inputs of the target function. Moreover, some results in the existing papers were proved by applying the invalid upper bound. We also justify the validity of these results. © 1963-2012 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

A fine-grained perspective on the robustness of global cargo ship transportation networks

引用

Journal of Geographical Sciences 2018年第7期28卷 881-899页

作者：彭澎程诗奋陈金海廖梦迪吴琳刘希亮陆锋 State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research CAS University of Chinese Academy of Sciences Navigation Aids Technology Research Center of Jimei University National & Local Joint Engineering Research Center for Marine Navigation Aids Services College of Geomatics Shandong University of Science and Technology Institute of Computing Technology CAS Fujian Collaborative Innovation Center for Big Data Applications in Governments Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application

The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current research mainly focuses on the coarse-grained, holistic cargo ship transportation network while ignoring the structural diversity of different sub-networks. In this paper, we evaluate the robustness of the global cargo ship transportation network based on the most recent Automatic Identification System（AIS） data available. First, we subdivide three typical cargo ship transportation networks（i.e., oil tanker, container ship and bulk carrier） from the original cargo ship transportation network. Then, we design statistical indices based on complex network theory and employ four attack strategies, including random attack and three intentional attacks（i.e., degree-based attack, betweenness-based attack and flux-based attack） to evaluate the robustness of the three typical cargo ship transportation networks. Finally, we compare the integrity of the remaining ports of the network when a small proportion of ports lose their function. The results show that 1） compared with the holistic cargo ship transportation network, the fine-grain-based cargo ship transportation networks can fully reflect the pattern and process of global cargo transportation; 2） different cargo ship networks behave heterogeneously in terms of their robustness, with the container network being the weakest and the bulk carrier network being the strongest; and 3） small-scale intentional attacks may have significant influence on the integrity of the container network but a minor impact on the bulk carrier and oil tanker transportation networks. These conclusions can help improve the decision support capabilities in maritime transportation planning and emergency response and facilitate the establishment of a more reliable maritime transportation ***： The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current resear

关键词： complex network fine-grained cargo ship transportation network robustness automatic identification system

来源：评论

学校读者我要写书评

暂无评论

Forecasting transportation network speed using deep capsule networks with nested LSTM models

arXiv

引用

arXiv 2018年

作者： Ma, Xiaolei Li, Yi Cui, Zhiyong Wang, Yinhai School of Transportation Science and Engineering Beijing Key Laboratory for Cooperative Vehicle Infrastructure System and Safety Control Beihang University Beijing100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Department of Civil and Environmental Engineering University of Washington Seattle98195 United States

Accurate and reliable traffic forecasting for complicated transportation networks is of vital importance to modern transportation management. The complicated spatial dependencies of roadway links and the dynamic temporal patterns of traffic states make it particularly challenging. To address these challenges, we propose a new capsule network (CapsNet) to extract the spatial features of traffic networks and utilize a nested LSTM (NLSTM) structure to capture the hierarchical temporal dependencies in traffic sequence data. A framework for network-level traffic forecasting is also proposed by sequentially connecting CapsNet and NLSTM. On the basis of literature review, our study is the first to adopt CapsNet and NLSTM in the field of traffic forecasting. An experiment on a Beijing transportation network with 278 links shows that the proposed framework with the capability of capturing complicated spatiotemporal traffic patterns outperforms multiple state-of-the-art traffic forecasting baseline models. The superiority and feasibility of CapsNet and NLSTM are also demonstrated, respectively, by visualizing and quantitatively evaluating the experimental results. Copyright © 2018, The Authors. All rights reserved.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

intelligent Question and Answering System Based on SVM and Cosine Similarity

Intelligent Question and Answering System Based on SVM and C...

引用

2017 International Conference on Mathematics, Modelling and Simulation Technologies and Applications（MMSTA 2017)

作者： Wan-li SONG Wei-wei CHEN Ming-zhu ZHANG Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information EngineeringNanjing Xiao Zhuang University

It is a tough task for teachers to answer all questions from students effectively and *** this paper,we design and implements an intelligent question answering system using Natural Language Processing,template classification,support vector *** system also calculates the similarity between the question and answer pairs by cosine similarity algorithm,and returns the most similar *** the user is not satisfied with the answer,the system will write the question into the public section to fall back on other *** answer will be evaluated and added to the QA base if it is passed with the corresponding *** that the questions and answers in the QA base continue to *** use the QA base of a network forum as the basic library to carry out the *** implementation and experimental results indicate that the proposed approach is achievable.

关键词： intelligent system Question classification Question similarity Cosine similarity

来源：评论

学校读者我要写书评

暂无评论

Radio detection of an elusive millisecond pulsar in the Globular Cluster NGC 6397

arXiv

引用

arXiv 2022年

作者： Zhang, Lei Ridolfi, Alessandro Blumer, Harsha Freire, Paulo C.C. Manchester, Richard N. McLaughlin, Maura Kremer, Kyle Cameron, Andrew D. Zhang, Zhiyu Behrend, Jan Burgay, Marta Buchner, Sarah Champion, David J. Chen, Weiwei Dai, Shi Feng, Yi Fu, Xiaoting Guo, Meng Hobbs, George Keane, Evan F. Kramer, Michael Levin, Lina Li, Xiangdong Ni, Mengmeng Pan, Jingshan Padmanabh, Prajwal V. Possenti, Andrea Ransom, Scott M. Tsai, Chao-Wei Krishnan, Vivek Venkatraman Wang, Pei Zhang, Jie Zhi, Qijun Zhang, Yongkun Li, Di National Astronomical Observatories Chinese Academy of Sciences A20 Datun Road Chaoyang District Beijing100101 China Centre for Astrophysics and Supercomputing Swinburne University of Technology P.O. Box 218 HawthornVIC3122 Australia SelargiusI-09047 Italy Department of Physics and Astronomy West Virginia University MorgantownWV26506 United States Max-Planck Institut für Radioastronomie Auf dem Hügel 69 BonnD-53121 Germany CSIRO Space and Astronomy Australia Telescope National Facility PO Box 76 EppingNSW1710 Australia TAPIR California Institute of Technology PasadenaCA91125 United States The Observatories of the Carnegie Institution for Science PasadenaCA91101 United States Swinburne University of Technology Mail H74 PO Box 218 VIC3122 Australia School of Astronomy and Space Science Nanjing University Nanjing210023 China Ministry of Education Nanjing210093 China South African Radio Astronomy Observatory Fir Street Black River Park Cape Town7925 South Africa School of Science Western Sydney University Locked Bag 1797 PenrithNSW2751 Australia Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China Purple Mountain Observatory Chinese Academy of Sciences Nanjing210023 China National Supercomputing Center in Jinan Qilu University of Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China Jinan Institute of Supercomputing Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China School of Physics Trinity College Dublin College Green Dublin Ireland Jodrell Bank Centre for Astrophysics Department of Physics and Astronomy The University of Manchester ManchesterM13 9PL United Kingdom HannoverD-30167 Germany MonserratoI-09042 Italy NRAO 520 Edgemont Road CharlottesvilleVA22903 United States College of Physics and Electronic Engineering Qilu Normal University 2 Wenbo Road Zhangqiu District Jinan250200 China Guizhou Provincial Key Laboratory of Radio

We report the discovery of a new 5.78 ms-period millisecond pulsar (MSP), PSR J1740−5340B (NGC 6397B), in an eclipsing binary system discovered with the Parkes radio telescope (now also known as Murriyanga), Australia, and confirmed with the MeerKAT radio telescope in South Africa. The measured orbital period, 1.97 days, is the longest among all eclipsing binaries in globular clusters (GCs) and consistent with that of the coincident X-ray source U18, previously suggested to be a ‘hidden MSP’. Our XMM-Newton observations during NGC 6397B’s radio quiescent epochs detected no X-ray flares. NGC 6397B is either a transitional MSP or an eclipsing binary in its initial stage of mass transfer after the companion star left the main sequence. The discovery of NGC 6397B potentially reveals a subgroup of extremely faint and heavily obscured binary pulsars, thus providing a plausible explanation to the apparent dearth of binary neutron stars in core-collapsed GCs as well as a critical constraint on the evolution of GCs. Copyright © 2022, The Authors. All rights reserved.

关键词： Mass transfer

来源：评论

学校读者我要写书评

暂无评论

A relation prediction method based on PU learning

A relation prediction method based on PU learning

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Gao-Jing Peng Ke-Jia Chen Shijun Xue Bin Liu Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing Jiangsu China

This paper studies relation prediction in heterogeneous information networks under PU learning context. One of the challenges of this problem is the imbalance of data number between the positive set P (the set of node pairs with the target relation) and the unlabeled set U (the set of node pairs without the target relation). We propose a K-means and voting mechanism based technique SemiPUclus to extract the reliable negative set RN from U under a new relation prediction framework PURP. The experimental results show that PURP achieves better performance than comparative methods in DBLP co-authorship network data.

关键词： Reliability Artificial neural networks Clustering algorithms Algorithm design and analysis Prediction methods Sun

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：