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

arXiv 2022年

作者： Xu, Wenjia Xian, Yongqin Wang, Jiuniu Schiele, Bernt Akata, Zeynep State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Max Planck Institute for Informatics Saarland Informatics Campus Saarbrücken Germany Computer Vision Laboratory ETH Zurich Switzerland University of Tübingen Tübingen Germany Max Planck Institute for Intelligent Systems Tübingen Germany City University of Hong Kong Hong Kong Hong Kong Aerospace Information Research Institute Chinese Academy of Sciences China School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences China

Any-shot image classification allows to recognize novel classes with only a few or even zero samples. For the task of zero-shot learning, visual attributes have been shown to play an important role, while in the few-shot regime, the effect of attributes is underexplored. To better transfer attribute-based knowledge from seen to unseen classes, we argue that an image representation with integrated attribute localization ability would be beneficial for any-shot, i.e. zero-shot and few-shot, image classification tasks. To this end, we propose a novel representation learning framework that jointly learns discriminative global and local features using only class-level attributes. While a visual-semantic embedding layer learns global features, local features are learned through an attribute prototype network that simultaneously regresses and decorrelates attributes from intermediate features. Furthermore, we introduce a zoom-in module that localizes and crops the informative regions to encourage the network to learn informative features explicitly. We show that our locality augmented image representations achieve a new state-of-the-art on challenging benchmarks, i.e. CUB, AWA2, and SUN. As an additional benefit, our model points to the visual evidence of the attributes in an image, confirming the improved attribute localization ability of our image representation. The attribute localization is evaluated quantitatively with ground truth part annotations, qualitatively with visualizations, and through welldesigned user studies. Copyright © 2022, The Authors. All rights reserved.

关键词： Image representation

来源：评论

学校读者我要写书评

暂无评论

Comparison of centralized and decentralized approaches in cooperative coverage problems with energy-constrained agents

arXiv

引用

arXiv 2020年

作者： Meng, Xiangyu Sun, Xinmiao Cassandras, Christos G. Xu, Kaiyuan Division of Electrical and Computer Engineering Louisiana State University Baton RougeLA70803 United States School of Automation and Electrical Engineering Shunde Graduate School and Key Laboratory of Knowledge Automation for Industrial Processes University of Science and Technology Beijing100083 China Division of Systems Engineering Center for Information and Systems Engineering Boston University BrooklineMA02446 United States

A multi-agent coverage problem is considered with energy-constrained agents. The objective of this paper is to compare the coverage performance between centralized and decentralized approaches. To this end, a near-optimal centralized coverage control method is developed under energy depletion and repletion constraints. The optimal coverage formation corresponds to the locations of agents where the coverage performance is maximized. The optimal charging formation corresponds to the locations of agents with one agent fixed at the charging station and the remaining agents maximizing the coverage performance. We control the behavior of this cooperative multi-agent system by switching between the optimal coverage formation and the optimal charging formation. Finally, the optimal dwell times at coverage locations, charging time, and agent trajectories are determined so as to maximize coverage over a given time interval. In particular, our controller guarantees that at any time there is at most one agent leaving the team for energy repletion. Copyright © 2020, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Dense r-robust formations on lattices

Dense r-robust formations on lattices

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Luis Guerrero-Bonilla David Saldaña Vijay Kumar Division of Decision and Control Systems in the School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Autonomous and Intelligent Robotics Laboratory (AIRLab) Lehigh University Bethlehem PA USA GRASP Laboratory University of Pennsylvania

ISBN: (数字)9781728173955

ISBN: (纸本)9781728173962

Robot networks are susceptible to fail under the presence of malicious or defective robots. Resilient networks in the literature require high connectivity and large communication ranges, leading to high energy consumption in the communication network. This paper presents robot formations with guaranteed resiliency that use smaller communication ranges than previous results in the literature. The formations can be built on triangular and square lattices in the plane, and cubic lattices in the three-dimensional space. We support our theoretical framework with simulations.

关键词： Lattices Robot kinematics Communication networks Robustness Robot sensing systems Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Vector Symbolic Architectures as a Computing Framework for Emerging Hardware

arXiv

引用

arXiv 2021年

作者： Kleyko, Denis Davies, Mike Frady, E. Paxon Kanerva, Pentti Kent, Spencer J. Olshausen, Bruno A. Osipov, Evgeny Rabaey, Jan M. Rachkovskij, Dmitri A. Rahimi, Abbas Sommer, Friedrich T. The Redwood Center for Theoretical Neuroscience The University of California BerkeleyCA94720 United States The Intelligent Systems Lab Research Institutes of Sweden Kista16440 Sweden The Neuromorphic Computing Laboratory Intel Labs Santa ClaraCA95054 United States The Department of Computer Science Electrical and Space Engineering Luleå University of Technology Luleå97187 Sweden The Department of Electrical Engineering and Computer Sciences The University of California BerkeleyCA94720 United States International Research and Training Center for Information Technologies and Systems Kyiv03680 Ukraine IBM Research – Zurich Rüschlikon8803 Switzerland

This article reviews recent progress in the development of the computing framework Vector Symbolic Architectures (also known as Hyperdimensional Computing). This framework is well suited for implementation in stochastic, emerging hardware and it naturally expresses the types of cognitive operations required for Artificial Intelligence (AI). We demonstrate in this article that the field-like algebraic structure of Vector Symbolic Architectures offers simple but powerful operations on high-dimensional vectors that can support all data structures and manipulations relevant to modern computing. In addition, we illustrate the distinguishing feature of Vector Symbolic Architectures, "computing in superposition," which sets it apart from conventional computing. It also opens the door to efficient solutions to the difficult combinatorial search problems inherent in AI applications. We sketch ways of demonstrating that Vector Symbolic Architectures are computationally universal. We see them acting as a framework for computing with distributed representations that can play a role of an abstraction layer for emerging computing hardware. This article serves as a reference for computer architects by illustrating the philosophy behind Vector Symbolic Architectures, techniques of distributed computing with them, and their relevance to emerging computing hardware, such as neuromorphic computing. Copyright © 2021, The Authors. All rights reserved.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Accurately predicting anticancer peptide using an ensemble of heterogeneously trained classifiers

引用

Informatics in Medicine Unlocked 2023年 42卷

作者： Azim, Sayed Mehedi Sabab, Noor Hossain Nuri Noshadi, Iman Alinejad-Rokny, Hamid Sharma, Alok Shatabda, Swakkhar Dehzangi, Iman Center for Computational and Integrative Biology Rutgers University Camden 08102 NJ United States Department of Computer Science and Engineering United International University Plot 2 United City Madani Avenue BaddaDhaka 1212 Bangladesh Department of Bioengineering University of California Riverside 92507 CA United States BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering The University of New South Wales (UNSW Sydney) Sydney NSW 2052 Australia UNSW Data Science Hub UNSW Sydney Sydney NSW 2052 Australia Health Data Analytics Program AI-enabled Processes Research Centre Macquarie University Sydney 2109 Australia Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia Laboratory for Medical Science Mathematics RIKEN Center for Integrative Medical Sciences Yokohama 230-0045 Japan Department of Computer Science Rutgers University Camden 08102 NJ United States

The use of therapeutic peptides for the treatment of cancer has received tremendous attention in recent years. Anticancer peptides (ACPs) are considered new anticancer drugs which have several advantages over chemistry-based drugs including high specificity, strong tumor penetration capacity, and low toxicity level for normal cells. Due to the rise of experimentally verified bioactive peptides, several in silico approaches became imperative for the investigation of the characteristics of ACPs. In this paper, we proposed a new machine learning tool named iACP-RF that uses a combination of several sequence-based features and an ensemble of three heterogeneously trained Random Forest classifiers to accurately predict anticancer peptides. Experimental results show that our proposed model achieves an accuracy of 75.9% which outperforms other state-of-the-art methods by a significant margin. We also achieve 0.52, 75.6%, and 76.2% in terms of Matthews Correlation Coefficient (MCC), Sensitivity, and Specificity, respectively. iACP-RF as a standalone tool and its source code are publicly available at: https://***/MLBC-lab/iACP-RF. © 2023 The Authors

关键词： Anticancer peptides Ensemble learning Feature extraction Heterogeneous classifiers Machine learning Random Forest

来源：评论

学校读者我要写书评

暂无评论

On the Normalization in Evolutionary Multi-Modal Multi-Objective Optimization

On the Normalization in Evolutionary Multi-Modal Multi-Objec...

引用

Congress on Evolutionary Computation

作者： Yiping Liu Hisao Ishibuchi Gary G. Yen Yusuke Nojima Naoki Masuyama Yuyan Han Department of Computer Science and Intelligent Systems Osaka Prefecture University Sakai Osaka Japan Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China School of Electrical and Computer Engineering Oklahoma State University Stillwater OK USA School of Computer Science Liaocheng University Liaocheng China

ISBN: (数字)9781728169293

ISBN: (纸本)9781728169309

Multi-modal multi-objective optimization problems may have different Pareto optimal solutions with the same objective vector. A number of evolutionary multi-modal multiobjective algorithms have been developed to solve these problems. They aim to search for a Pareto optimal solution set with good diversity in both the objective and decision spaces. Although the normalization in both the objective and decision spaces is very important for these algorithms, there are few studies on this topic. In this paper, we investigate the effect of four normalization methods on two evolutionary multi-modal multiobjective algorithms. Six distance minimization problems are chosen as test problems. The experimental results show that the effect of normalization in evolutionary multi-modal multiobjective optimization is algorithm- and problem-dependent.

关键词： Pareto optimization Sociology Evolutionary computation computer science Search problems

来源：评论

学校读者我要写书评

暂无评论

Hysteresis Control of the Pseudo Boost PFC Converter

Hysteresis Control of the Pseudo Boost PFC Converter

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Aleksandra Lekić-Vervoort Milovan Majstorović Leposava Ristić Dušan Stipanović Intelligent Electrical Power Grids (IEPG) Electrical Sustainable Energy (ESE) Faculty of Electrical Engineering Mathematics and Computer Science TU Delft Delft Netherlands The Department of Power Converters and Drive Systems University of Belgrade Belgrade Serbia Coordinated Science Laboratory University of Illinois Urbana IL USA

ISBN: (数字)9781728156354

ISBN: (纸本)9781728156361

In this paper, a control design for the the Pseudo Boost PFC converter with the application in the charger for electric vehicles, is formulated and verified. The rectifier ends up being energy efficient because due to containing smaller number of switches. The converter is controlled using a method involving the minimum Lyapunov function derivative and a hysteresis. This control provides an averaged value of the converter sine input current, and thus, decreasing the THD value. Theoretical results are complemented with the corresponding simulations and experimental waveforms.

关键词： Hysteresis Switches Lyapunov methods Inductors Mathematical model Electric vehicles

来源：评论

学校读者我要写书评

暂无评论

Abnormal Data Cleaning for Wind Turbines by Image Segmentation Based on Active Shape Model and Class Uncertainty

SSRN

引用

SSRN 2022年

作者： Liang, Guoyuan Su, Yahao Wu, Xinyu Ma, Jiajun Long, Huan Song, Zhe Guangdong Provincial Key Lab of Robotics and Intelligent System Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Province Shenzhen China Guangdong Provincial Key Laboratory of Computer Vision and Virtual Reality Technology Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Province Shenzhen China Guangdong-Hong Kong-Macao Joint Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Province Shenzhen China School of Electrical Engineering Southeast University Jiang Su Province Nanjing China School of Business Nanjing University Jiang Su Province Nanjing China

Wind power curve describes the relationship between wind speed and output power of wind turbine, which may be contaminated due to various unexpected factors. Following the idea of image segmentation in our previous work, in this paper, we propose a novel image-based abnormal data cleaning algorithm aiming to provide high quality data for wind power curve modeling and relevant applications. For image binarization, a multiscale space is built to determine the optimal scale at which the most stable as well as informative shape representations are extracted. The Active Shape Model is utilized to model the power curve shape and generate a set of segmentation candidates for filtering abnormal data. To measure the cost of each candidate, the Class Uncertainty map based on dual feature images is built. And eventually the optimal segmentation boundary is determined by the optimization in the energy space. A series of comparative experiments conducted over the real-world datasets of 37 wind turbines have validated the superior performance of the proposed algorithm. © 2022, The Authors. All rights reserved.

关键词： Wind power

来源：评论

学校读者我要写书评

暂无评论

Authors' Reply

引用

IEEE Sensors Journal 2018年第3期18卷 1336-1337页

作者： Ghanbari, Milad Yazdanpanah, Mohammad Javad School of Electrical and Computer Engineering University of Tehran Tehran*** Iran Control and Intelligent Processing Center of Excellence Advanced Control Systems Laboratory College of Engineering School of Electrical and Computer Engineering University of Tehran Tehran*** Iran

The experimental results of the paper titled 'Delay compensation of tilt sensors based on mems accelerometer using data fusion technique' was commented by Bodnicki and Luczak. In this note, we address the raised comments by the mentioned authors. Moreover, appropriate explanations are provided in order to make the procedure of the experimental section more clear. © 2001-2012 IEEE.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Harmonia: A high throughput B+tree for GPUs 19

Harmonia: A high throughput B+tree for GPUs

引用

24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2019

作者： Yan, Zhaofeng Lin, Yuzhe Peng, Lu Zhang, Weihua Software School Fudan University China Shanghai Key Laboratory of Data Science Fudan University China Shanghai Institute of Intelligent Electronics and Systems Shanghai China Division of Electrical and Computer Engineering Louisiana State University United States

ISBN: (纸本)9781450362252

B+tree is one of the most important data structures and has been widely used in different fields. With the increase of concurrent queries and data-scale in storage, designing an eficient B+tree structure has become critical. Due to abundant computation resources, GPUs provide potential opportunities to achieve high query throughput for B+tree. However, prior methods cannot achieve satisfactory performance results due to low resource utilization and poor memory performance. In this paper, we first identify the gaps between B+tree and GPUs. Concurrent B+tree queries involve many global memory accesses and different divergences, which mismatch with GPU features. Based on this observation, we propose Harmonia, a novel B+tree structure to bridge the gap. In Harmonia, a B+tree structure is divided into a key region and a child region. The key region stores the nodes with its keys in a breadth-first order. The child region is organized as a prefix-sum array, which only stores each node's first child index in the key region. Since the prefix-sum child region is small and the children's index can be retrieved through index computations, most of it can be stored in on-chip caches, which can achieve good cache locality. To make it more eficient, Harmonia also includes two optimizations: partially-sorted aggregation and narrowed thread-group traversal, which can mitigate memory and warp divergence and improve resource utilization. Evaluations on a TITAN V GPU show that Harmonia can achieve up to 3.6 billion queries per second, which is about 3.4X faster than that of HB+Tree [39], a recent state-of-the-art GPU solution. © 2019 Association for Computing Machinery.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：