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

High Conductance Margin for Efficient Neuromorphic Computing Enabled by Stacking Nonvolatile van der Waals Transistors

引用

Physical Review Applied 2021年第4期16卷 044049-044049页

作者： Liping Xu (徐丽萍) Hao Xiong (熊浩) Zhichao Fu (付志超) Menghan Deng (邓梦晗) Shuiyuan Wang (王水源) Jinzhong Zhang (张金中) Liyan Shang (商丽燕) Kai Jiang (姜凯) Yawei Li (李亚巍) Liangqing Zhu (朱亮清) Liang He Zhigao Hu (胡志高) Junhao Chu (褚君浩) Technical Center for Multifunctional Magneto-Optical Spectroscopy (Shanghai) Engineering Research Center of Nanophotonics & Advanced Instrument (Ministry of Education) Department of Materials School of Physics and Electronic Science East China Normal University Shanghai 200241 China Center for Advanced Electronic Materials and Devices School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai 200240 China School of Computer Science and Technology East China Normal University Shanghai 200062 China ASIC & System State Key Laboratory School of Microelectronics Fudan University Shanghai 200433 China Collaborative Innovation Center of Extreme Optics Shanxi University Taiyuan Shanxi 030006 China Shanghai Institute of Intelligent Electronics & Systems Fudan University Shanghai 200433 China

High-performance artificial synaptic devices are key building blocks for developing efficient neuromorphic computing systems. However, the nonlinear and asymmetric weight update of existing devices has restricted their practical applications. Herein, floating gate nonvolatile memory (FG NVM) devices based on two-dimensional (2D) HfS2/h-BN/FG-graphene heterostructures have been designed and investigated as multifunctional NVM and artificial optoelectronic synapses. Benefiting from the FG architecture, the HfS2-based NVM device exhibits competitive performances, such as a high on:off ratio (>105), large memory window (approximately 100 V), excellent charge retention ability (>104s), and robust durability (>103 cycles). Notably, the artificial optoelectronic synapses based on HfS2 FG NVM show an impressive large conductance margin and good linearity, owing to the ultrahigh photoresponsivity and photogain of HfS2. The energy consumption of per spike in our artificial synapse is as low as 0.2 pJ. Therefore, a high recognition accuracy up to 91.5% of the artificial neural network on the basis of our HfS2-based optoelectronic synapse at the system level has been achieved, which is superior to other reported 2D artificial optoelectronic synapses. This work paves the way forward for all 2D material-based memory for developing efficient optogenetics-inspired neuromorphic computing in brain-inspired intelligent systems.

关键词： electrical conductivity Optoelectronics Synapses 2-dimensional systems Artificial neural networks Transistors Transition metal dichalcogenides Lithography

来源：评论

学校读者我要写书评

暂无评论

When counterpoint meets chinese folk melodies 20

When counterpoint meets chinese folk melodies

引用

Proceedings of the 34th International Conference on Neural Information Processing systems

作者： Nan Jiang Sheng Jin Zhiyao Duan Changshui Zhang Institute for Artificial Intelligence Tsinghua University (THUAI) and State Key Lab of Intelligent Technologies and Systems and Beijing National Research Center for Information Science and Technology (BNRist) and Department of Automation Tsinghua University Beijing China Department of Electrical and Computer Engineering University of Rochester

ISBN: (纸本)9781713829546

Counterpoint is an important concept in Western music theory. In the past century, there have been significant interests in incorporating counterpoint into Chinese folk music composition. In this paper, we propose a reinforcement learning-based system, named FolkDuet, towards the online countermelody generation for Chinese folk melodies. With no existing data of Chinese folk duets, FolkDuet employs two reward models based on out-of-domain data i.e., Bach chorales, and monophonic Chinese folk melodies. An interaction reward model is trained on the duets formed from outer parts of Bach chorales to model counterpoint interaction, while a style reward model is trained on monophonic melodies of Chinese folk songs to model melodic patterns. With both rewards, the generator of FolkDuet is trained to generate countermelodies while maintaining the Chinese folk style. The entire generation process is performed in an online fashion, allowing real-time interactive human-machine duet improvisation. Experiments show that the proposed algorithm achieves better subjective and objective results than the baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PitVis-2023 Challenge: Workflow Recognition in videos of Endoscopic Pituitary Surgery

arXiv

引用

arXiv 2024年

作者： Das, Adrito Khan, Danyal Z. Psychogyios, Dimitrios Zhang, Yitong Hanrahan, John G. Vasconcelos, Francisco Pang, You Chen, Zhen Wu, Jinlin Zou, Xiaoyang Zheng, Guoyan Qayyum, Abdul Mazher, Moona Razzak, Imran Li, Tianbin Ye, Jin He, Junjun Plotka, Szymon Kaleta, Joanna Yamlahi, Amine Jund, Antoine Godau, Patrick Kondo, Satoshi Kasai, Satoshi Hirasawa, Kousuke Rivoir, Dominik Pérez, Alejandra Rodriguez, Santiago Arbeláez, Pablo Stoyanov, Danail Marcus, Hani J. Bano, Sophia Wellcome EPSRC Centre for Interventional and Surgical Sciences University College London London United Kingdom Department of Neurosurgery National Hospital for Neurology and Neurosurgery London United Kingdom HKISI CAS China Institute of Medical Robotics School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China National Heart and Lung Institute Faculty of Medicine Imperial College London United Kingdom Centre for Medical Image Computing University College London London United Kingdom University of New South Wales Sydney Australia Shanghai AI Lab Shanghai China Informatics Institute University of Amsterdam Amsterdam Netherlands Department of Biomedical Engineering and Physics Amsterdam University Medical Center University of Amsterdam Amsterdam Netherlands Sano Center for Computational Medicine Krakow Poland Heidelberg Division of Intelligent Medical Systems Germany NCT Heidelberg a partnership between DKFZ University Hospital Heidelberg Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Muroran Institute of Technology Hokkaido Japan Niigata University of Health and Welfare Niigata Japan Konica Minolta Inc. Osaka Japan National Center for Tumor Diseases Dresden Germany Centre for Tactile Internet TUD Dresden Germany Universidad de los Andes Bogota Colombia DKFZ UKDD TUD Germany

The field of computer vision applied to videos of minimally invasive surgery is ever-growing. Workflow recognition pertains to the automated recognition of various aspects of a surgery: including which surgical steps are performed;and which surgical instruments are used. This information can later be used to assist clinicians when learning the surgery;during live surgery;and when writing operation notes. The Pituitary Vision (PitVis) 2023 Challenge tasks the community to step and instrument recognition in videos of endoscopic pituitary surgery. This is a unique task when compared to other minimally invasive surgeries due to the smaller working space, which limits and distorts vision;and higher frequency of instrument and step switching, which requires more precise model predictions. Participants were provided with 25-videos, with results presented at the MICCAI-2023 conference as part of the Endoscopic Vision 2023 Challenge in Vancouver, Canada, on 08-Oct-2023. There were 18-submissions from 9-teams across 6-countries, using a variety of deep learning models. A commonality between the top performing models was incorporating spatio-temporal and multi-task methods, with greater than 50% and 10% macro-F1-score improvement over purely spacial single-task models in step and instrument recognition respectively. The PitVis-2023 Challenge therefore demonstrates state-of-the-art computer vision models in minimally invasive surgery are transferable to a new dataset, with surgery specific techniques used to enhance performance, progressing the field further. Benchmark results are provided in the paper, and the dataset is publicly available at: https://***/10.5522/04/26531686. Copyright © 2024, The Authors. All rights reserved.

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive non-parametric kernels

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2020年第1期21卷 8590-8628页

作者： Fanghui Liu Xiaolin Huang Chen Gong Jie Yang Li Li Department of Electrical Engineering ESAT-STADIUS KU Leuven Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China and Department of Computing Hong Kong Polytechnic University Hong Kong SAR China Department of Automation BNRist Tsinghua University China

In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.

关键词： support vector machines non-parametric kernel learning gradient-Lipschitz continuous

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Coverage in Urban Environments

arXiv

引用

arXiv 2020年

作者： Patel, Shivang Hariharan, Senthil Dhulipala, Pranav Lin, Ming C. Manocha, Dinesh Xu, Huan Otte, Michael Maryland Robotics Center University of Maryland College Park United States Department of Computer Science University of Maryland College Park United States Department of Electrical and Computer Engineering University of Maryland College Park United States Department of Aerospace Engineering University of Maryland College Park United States Instiitute for Systems Research University of Maryland College Park United States

We study multi-agent coverage algorithms for autonomous monitoring and patrol in urban environments. We consider scenarios in which a team of flying agents uses downward facing cameras (or similar sensors) to observe the environment outside of buildings at street-level. Buildings are considered obstacles that impede movement, and cameras are assumed to be ineffective above a maximum altitude. We study multi-agent urban coverage problems related to this scenario, including: (1) static multi-agent urban coverage, in which agents are expected to observe the environment from static locations, and (2) dynamic multi-agent urban coverage where agents move continuously through the environment. We experimentally evaluate six different multi-agent coverage methods, including: three types of ergodic coverage (that avoid buildings in different ways), lawn-mower sweep, voronoi region based control, and a naive grid method. We evaluate all algorithms with respect to four performance metrics (percent coverage, revist count, revist time, and the integral of area viewed over time), across four types of urban environments [low density, high density] × [short buildings, tall buildings], and for team sizes ranging from 2 to 25 agents. We believe this is the first extensive comparison of these methods in an urban setting. Our results highlight how the relative performance of static and dynamic methods changes based on the ratio of team size to search area, as well the relative effects that different characteristics of urban environments (tall, short, dense, sparse, mixed) have on each algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Data Needs and Challenges for Quantum Dot Devices Automation

arXiv

引用

arXiv 2023年

作者： Zwolak, Justyna P. Taylor, Jacob M. Andrews, Reed Benson, Jared Bryant, Garnett Buterakos, Donovan Chatterjee, Anasua Sarma, Sankar Das Eriksson, Mark A. Greplová, Eliška Gullans, Michael J. Hader, Fabian Kovach, Tyler J. Mundada, Pranav S. Ramsey, Mick Rasmussen, Torbjoern Severin, Brandon Sigillito, Anthony Undseth, Brennan Weber, Brian National Institute of Standards and Technology GaithersburgMD20899 United States Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States Department of Physics University of Maryland College ParkMD20742 United States Joint Quantum Institute National Institute of Standards and Technology University of Maryland GaithersburgMD20899 United States HRL Laboratories LLC 3011 Malibu Canyon Road MalibuCA90265 United States Department of Physics University of Wisconsin-Madison MadisonWI53706 United States Center for Quantum Devices Niels Bohr Institute University of Copenhagen Copenhagen2100 Denmark Condensed Matter Theory Center University of Maryland College ParkMD20742 United States Kavli Institute of Nanoscience Delft University of Technology Lorentzweg 1 Delft2628 CJ Netherlands Central Institute of Engineering Electronics and Analytics ZEA-2 - Electronic Systems Forschungszentrum Jülich GmbH Jülich52425 Germany Q-CTRL Santa MonicaCA90401 United States Intel Components Research Intel Corporation HillsboroOR97124 United States Department of Materials University of Oxford Parks Road OxfordOX1 3PH United Kingdom School of Electrical Engineering and Telecommunications The University of New South Wales SydneyNSW2052 Australia Department of Electrical and Systems Engineering University of Pennsylvania PhiladelphiaPA19104 United States QuTech Delft University of Technology Lorentzweg 1 Delft2628 CJ Netherlands Intelligent Geometries LLC Lake Frederick VA22630 United States

Gate-defined quantum dots are a promising candidate system for realizing scalable, coupled qubit systems and serving as a fundamental building block for quantum computers. However, presentday quantum dot devices suffer from imperfections that must be accounted for, which hinders the characterization, tuning, and operation process. Moreover, with an increasing number of quantum dot qubits, the relevant parameter space grows sufficiently to make heuristic control infeasible. Thus, it is imperative that reliable and scalable autonomous tuning approaches are developed. This meeting report outlines current challenges in automating quantum dot device tuning and operation with a particular focus on datasets, benchmarking, and standardization. We also present insights and ideas put forward by the quantum dot community on how to overcome them. We aim to provide guidance and inspiration to researchers invested in automation efforts. Copyright © 2023, The Authors. All rights reserved.

关键词： Nanocrystals

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Aware Score Distribution Learning for Action Quality Assessment

Uncertainty-Aware Score Distribution Learning for Action Qua...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Yansong Tang Zanlin Ni Jiahuan Zhou Danyang Zhang Jiwen Lu Ying Wu Jie Zhou Department of Automation Tsinghua University China State Key Lab of Intelligent Technologies and Systems China Beijing National Research Center for Information Science and Technology China Electrical and Computer Engineering Department Northwestern University Tsinghua Shenzhen International Graduate School Tsinghua University China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Assessing action quality from videos has attracted growing attention in recent years. Most existing approaches usually tackle this problem based on regression algorithms, which ignore the intrinsic ambiguity in the score labels caused by multiple judges or their subjective appraisals. To address this issue, we propose an uncertainty-aware score distribution learning (USDL) approach for action quality assessment (AQA). Specifically, we regard an action as an instance associated with a score distribution, which describes the probability of different evaluated scores. Moreover, under the circumstance where finer-grained score labels are available (e.g., difficulty degree of an action or multiple scores from different judges), we further devise a multi-path uncertainty-aware score distribution learning (MUSDL) method to explore the disentangled components of a score. In order to demonstrate the effectiveness of our proposed methods, We conduct experiments on two AQA datasets containing various Olympic actions. Our approaches set new state-of-the-arts under the Spearman's Rank Correlation (i.e., 0.8102 on AQA-7 and 0.9273 on MTL-AQA).

关键词： Videos Uncertainty Games Gaussian distribution Task analysis Quality assessment Training

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Score Distribution Learning for Action Quality Assessment

arXiv

引用

arXiv 2020年

作者： Tang, Yansong Ni, Zanlin Zhou, Jiahuan Zhang, Danyang Lu, Jiwen Wu, Ying Zhou, Jie Department of Automation Tsinghua University China State Key Lab of Intelligent Technologies and Systems China Beijing National Research Center for Information Science and Technology China Tsinghua Shenzhen International Graduate School Tsinghua University China Electrical and Computer Engineering Department Northwestern University

Assessing action quality from videos has attracted growing attention in recent years. Most existing approaches usually tackle this problem based on regression algorithms, which ignore the intrinsic ambiguity in the score labels caused by multiple judges or their subjective appraisals. To address this issue, we propose an uncertainty-aware score distribution learning (USDL) approach for action quality assessment (AQA). Specifically, we regard an action as an instance associated with a score distribution, which describes the probability of different evaluated scores. Moreover, under the circumstance where fine-grained score labels are available (e.g., difficulty degree of an action or multiple scores from different judges), we further devise a multi-path uncertainty-aware score distributions learning (MUSDL) method to explore the disentangled components of a score. We conduct experiments on three AQA datasets containing various Olympic actions and surgical activities, where our approaches set new state-of-the-arts under the Spearman’s Rank Correlation.1 Copyright © 2020, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

On the Philosophical, Cognitive and Mathematical Foundations of Symbiotic Autonomous systems (SAS)

arXiv

引用

arXiv 2021年

作者： Wang, Yingxu Karray, Fakhri Kwong, Sam Plataniotis, Konstantinos N. Leung, Henry Hou, Ming Tunstel, Edward Rudas, Imre J. Trajkovic, Ljiljana Kaynak, Okyay Kacprzyk, Janusz Zhou, Mengchu Smith, Michael H. Chen, Philip Patel, Shushma University of Calgary Canada FIEEE Dept. of Electrical & Computer Engineering University of Waterloo ON Canada FIEEE Department of Computer Science City University of Hong Kong Hong Kong FIEEE Dept. of Electrical & Computer Engineering University of Toronto ON Canada SMIEEE Toronto Research Centre DRDC Canada FIEEE Autonomous & Intelligent Systems Dept. Raytheon Technologies Research Center United States Óbuda University Budapest Hungary FIEEE School of Engineering Science Simon Fraser University BurnabyBC Canada FIEEE Bogazici University Bebek Istanbul Turkey FIEEE Systems Research Institute Polish Academy of Sciences Warsaw Poland FIEEE Dept. of Computer Science New Jersey Institute of Technology NJ United States SMIEEE Furaxa Inc. OrindaCA United States FIEEE School of Computer Science and Engineering South China University of Technology Guangzhou China FBCS Faculty of Computing Engineering and Media De Montfort University LeicesterLE1 9BH United Kingdom

Symbiotic Autonomous systems (SAS) are advanced intelligent and cognitive systems exhibiting autonomous collective intelligence enabled by coherent symbiosis of human-machine interactions in hybrid societies. Basic research in the emerging field of SAS has triggered advanced general AI technologies functioning without human intervention or hybrid symbiotic systems synergizing humans and intelligent machines into coherent cognitive systems. This work presents a theoretical framework of SAS underpinned by the latest advances in intelligence, cognition, computer, and system sciences. SAS are characterized by the composition of autonomous and symbiotic systems that adopt bio-brain-social-inspired and heterogeneously synergized structures and autonomous behaviors. This paper explores their cognitive and mathematical foundations. The challenge to seamless human-machine interactions in a hybrid environment is addressed. SAS-based collective intelligence is explored in order to augment human capability by autonomous machine intelligence towards the next generation of general AI, autonomous computers, and trustworthy mission-critical intelligent systems. Emerging paradigms and engineering applications of SAS are elaborated via an autonomous knowledge learning system that symbiotically works between humans and cognitive robots. © 2021, CC BY-NC-ND.

关键词： Cognitive systems

来源：评论

学校读者我要写书评

暂无评论

The Lagrangian remainder of Taylor’s series, distinguishes O(f(x)) time complexities to polynomials or not

arXiv

引用

arXiv 2020年

作者： Bakas, Nikolaos P. Kosmatopoulos, Elias Chatzichristofis, Savvas A. Computation-based Science and Technology Research Center Cyprus Institute 20 Konstantinou Kavafi Street Aglantzia Nicosia2121 Cyprus Democritus University of Thrace Electrical and Computer engineering Intelligent Systems Lab Department of Computer Science Neapolis University Pafos 2 Danais Avenue Pafos8042 Cyprus

The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials [1–3]. In particular, it is demonstrated that the examination of the P = NP equality, is associated with the determination of whether the nth derivative of a particular solution is bounded or not. Accordingly, in some cases, this is not true, and hence in general. Copyright © 2020, The Authors. All rights reserved.

关键词： Taylor series

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：