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

arXiv 2022年

作者： Song, Siyang Song, Yuxin Luo, Cheng Song, Zhiyuan Kuzucu, Selim Jia, Xi Guo, Zhijiang Xie, Weicheng Shen, Linlin Gunes, Hatice The Department of Computer Science and Technology University of Cambridge CambridgeCB3 0FT United Kingdom Baidu Inc Beijing100193 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China Department of Computer Engineering Middle East Technical University Ankara Turkey School of Computer Science University of Birmingham Birmingham United Kingdom

Graph is powerful for representing various types of real-world data. The topology (edges’ presence) and edges’ features of a graph decides the message passing mechanism among vertices within the graph. While most existing approaches only manually define a single-value edge to describe the connectivity or strength of association between a pair of vertices, task-specific and crucial relationship cues may be disregarded by such manually defined topology and single-value edge features. In this paper, we propose the first general graph representation learning framework (called GRATIS) which can generate a strong graph representation with a task-specific topology and task-specific multi-dimensional edge features from any arbitrary input (i.e., graph or non-graph data). To learn each edge’s presence and multi-dimensional feature, our framework takes both of the corresponding vertices pair and their global contextual information into consideration, enabling the generated graph representation to have a globally optimal message passing mechanism for different down-stream tasks. The principled investigation results achieved for various graph analysis tasks (e.g., graph classification, vertex classification, and link prediction) on 11 graph and non-graph datasets show that our GRATIS can not only largely enhance pre-defined graphs but also learns a strong graph representation for non-graph data, with clear performance improvements on all tasks. In particular, the learned topology and multi-dimensional edge features provide complementary task-related cues for graph analysis tasks. Our framework is effective, robust and flexible, and is a plug-and-play module that can be combined with different backbones and Graph Neural Networks (GNNs) to generate a task-specific graph representation from various graph and non-graph data. Our code is made publicly available at https://***/SSYSteve/Learning-Graph-Representation-with-Task-specific-Topology-and-Multi-dimensional-Edge-Feature

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Iterative H-norm Estimation Using Cyclic-Prefixed Signals 59

Iterative H-norm Estimation Using Cyclic-Prefixed Signals

引用

59th IEEE Conference on Decision and Control, CDC 2020

作者： Muller, Matias I. Rojas, Cristian R. Kth Royal Institute of Technology School of Electrical Engineering and Computer Science Department of Intelligent Systems StockholmSE100-44 Sweden

ISBN: (纸本)9781728174471

The problem of estimating the largest gain of an unknown linear and time-invariant filter is studied, known as the {{\mathcal{H}}_\infty }-norm estimation problem. The approach presented in this paper is iterative and corresponds to the combination of two state-of-the-art methods: Power Iterations and Weighted Thompson Sampling. The combination is done by means of a well-known technique in communications known as a cyclic prefix, in which the last points of a signal are prepended to it. This allows to take considerably more exact measurements of the frequency response of the system at a set of equispaced frequencies. The discussion is complemented with a simulation study, showing that the proposed algorithm has an increased speed of convergence to the quantity of interest. © 2020 IEEE.

关键词： Frequency response

来源：评论

学校读者我要写书评

暂无评论

A smart wearable device for capturing biomechanical energy from human knee motion

A smart wearable device for capturing biomechanical energy f...

引用

IEEE/ASME (AIM) International Conference on Advanced intelligent Mechatronics

作者： Hugo Hung-Tin Chan Haisu Liao Xuan Zhao Junrui Liang Wei-Hsin Liao Xinyu Wu Fei Gao Guangdong Provincial Key Laboratory of Robotics and Intelligent System Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Guangdong-Hong Kong-Macao Joint Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen China Department of Mechanical and Automation Engineering The Chinese University of Hong Kong Shatin Hong Kong China School of Information Science and Technology ShanghaiTech University Shanghai China

ISBN: (数字)9798350355369

ISBN: (纸本)9798350355376

Sustainable power supply is a challenge for portable and wearable electronic devices such as cell phones and headsets. To address this, researchers proposed capturing biomechanical energy from human motion to generate electricity. This paper proposed and developed a lightweight wearable device to capture the biomechanical energy from the human knee motion. To reduce the effect of inertial force on human gait, we developed a lightweight and compact transmission chain to convert the bidirectional rotation of the knee to a unidirectional rotation of the generator. Two input bevel gears with opposite one-way bearings on the same shaft are engaged with a single output bevel gear of the generator thereby only one input bevel gear is engaged for each input direction, achieving unidirectional output. In addition, to reduce velocity fluctuation and further minimize the effect of inertial force, a flywheel was fixed to the motor shaft via a gearbox. A prototype of the wearable device was developed and tested on a subject walking on a treadmill. Experimental results shows the flywheel enabled the harvester to achieve a continuous output while halving voltage fluctuations compared to a conventional harvester. The harvesters average power output can reach 0.11 W with minimal effects on the subject’s walking gait.

关键词： Knee Legged locomotion Biomechanics Shafts Fluctuations Voltage fluctuations Torque

来源：评论

学校读者我要写书评

暂无评论

Stochastic-Robust Planning of Networked Hydrogen-Electrical Microgrids: A Study on Induced Refueling Demand

arXiv

引用

arXiv 2024年

作者： Sun, Xunhang Cao, Xiaoyu Zeng, Bo Zhai, Qiaozhu Başar, Tamer Guan, Xiaohong School of Automation Science and Engineering The Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Coordinated Science Laboratory University of Illinois Urbana-Champaign UrbanaIL61801 United States Smart Integrated Energy Department Sichuan Digital Economy Industry Development Research Institute Sichuan Chengdu610037 China Department of Industrial Engineering The Department of Electrical and Computer Engineering University of Pittsburgh PittsburghPA15106 United States Center for Intelligent and Networked Systems Department of Automation Tsinghua University Beijing100084 China

Hydrogen-electrical microgrids are increasingly assuming an important role on the pathway toward decarbonization of energy and transportation systems. This paper studies networked hydrogen-electrical microgrids planning (NHEMP), considering a critical but often-overlooked issue, i.e., the demand-inducing effect (DIE) associated with infrastructure development decisions. Specifically, higher refueling capacities will attract more refueling demand of hydrogen-powered vehicles (HVs). To capture such interactions between investment decisions and induced refueling demand, we introduce a decision-dependent uncertainty (DDU) set and build a trilevel stochastic-robust formulation. The upper-level determines optimal investment strategies for hydrogen-electrical microgrids, the lower-level optimizes the risk-aware operation schedules across a series of stochastic scenarios, and, for each scenario, the middle-level identifies the "worst" situation of refueling demand within an individual DDU set to ensure economic feasibility. Then, an adaptive and exact decomposition algorithm, based on Parametric Column-and-Constraint Generation (PC&CG), is customized and developed to address the computational challenge and to quantitatively analyze the impact of DIE. Case studies on an IEEE exemplary system validate the effectiveness of the proposed NHEMP model and the PC&CG algorithm. It is worth highlighting that DIE can make an important contribution to the economic benefits of NHEMP, yet its significance will gradually decrease when the main bottleneck transits to other system restrictions. Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

AR intelligent Real-time Method for Cultural Heritage Object Recognition

AR Intelligent Real-time Method for Cultural Heritage Object...

引用

International Conference on Advanced Information and Communication Technologies (AICT)

作者： Oleh Pisnyi Ivan Kit Khrystyna Lipianina-Honcharenko Jürgen Sieck Anatoliy Sachenko Maciej Dobrowolski Grygoriy Sapozhnyk Master's degree in Computer Science West Ukrainian National University Ternopil Ukraine Department for Information-Computing Systems and Control West Ukrainian National University Ternopil Ukraine Hochschule für Technik und Wirtschaft Berlin Berlin Germany Research Institute for Intelligent Computer Systems West Ukrainian National University Ternopil Ukraine Department of Informatics and Teleinformatics Kazimierz Pulaski University of Technology and Humanities in Radom Radom Poland

In a world of rapid technological changes and growing interest in cultural heritage, the development of innovative tools for travelers and history enthusiasts becomes incredibly important. Even in the digital age, interactive ways of exploring historical landmarks remain relevant and attractive. In this research, an AR intelligent Real-time Method for Cultural Heritage Object Recognition has been developed. The method is implemented through a chatbot, which, when using a smartphone's camera, recognizes objects of cultural heritage and provides descriptions of these objects. The chatbot opens up new possibilities for travelers, allowing them to enjoy history and cultural heritage using intelligent tools and augmented reality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robot self-recognition via facial expression sensorimotor learning

Robot self-recognition via facial expression sensorimotor le...

引用

IEEE International Workshop on Robot and Human Communication (ROMAN)

作者： Zhegong Shangguan Mengyuan Ding Chuang Yu Chaona Chen Adriana Tapus Autonomous Systems and Robotics Lab/U2IS ENSTA Paris Institut Polytechnique de Paris 828 Boulevard des Maréchaux Palaiseau France National Engineering Laboratory for Visual Information Applications college of Artificial Intelligence Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Xi’an China Cognitive Robotics Lab Department of Computer Science University of Manchester Kilburn Building Oxford Rd Manchester UK School of Psychology and Neuroscience University of Glasgow Glasgow UK

To develop robots that can show cognitive functions, we must learn from the knowledge of human cognition. Existing biological and psychological evidence suggests that self-face perception and sensorimotor learning mechanisms play a crucial role in self-recognition. However, one of the most important self-identity cues – facial information – has not been extensively studied in the robot self-recognition task. Current research on robot self-recognition primarily relies on the recognition of high-precision targets and tracking of manipulator motions, where the self-perception of facial information is not well studied. In this work, we propose a novel approach to achieve self-recognition via self-perception of facial expressions. Specifically, we developed a Conditional Generative Adversarial Network (CGAN) model using the knowledge on human cognitive and sensorimotor functions. It allows the robot to be aware of self-face (i.e., off-line model). Passing the observed visual variations in a mirror and comparing them to self-perceptive information, the robot can recognize the self through an online Bayesian learning regression. The results of our first experiment show that the robot can recognize itself in a mirror. The results from the second experiment show that our algorithm could be tricked by a similar robot with the same facial expressions, which is similar to the rubber hand illusion (RHI).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automated Colorectal Polyps Detection from Endoscopic Images using MultiResUNet Framework with Attention Guided Segmentation

引用

Human-Centric intelligent systems 2024年第2期4卷 299-315页

作者： Ahamed, Md. Faysal Islam, Md. Rabiul Nahiduzzaman, Md. Chowdhury, Muhammad E. H. Alqahtani, Abdulrahman Murugappan, M. Department of Computer Science & Engineering Rajshahi University of Engineering & Technology Rajshahi Bangladesh Department of Electrical & Computer Engineering Rajshahi University of Engineering & Technology Rajshahi Bangladesh Department of Electrical Engineering Qatar University Doha Qatar Department of Biomedical Technology College of Applied Medical Sciences Al-Kharj Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia Department of Medical Equipment Technology College of Applied Medical Science Majmaah University Majmaah City Saudi Arabia Intelligent Signal Processing (ISP) Research Lab Department of Electronics and Communication Engineering Kuwait College of Science and Technology Doha Kuwait Department of Electronics and Communication Engineering Vels Institute of Sciences Technology and Advanced Studies Chennai India DCenter for Unmanned Autonomous Systems (CoEUAS) Universiti Malaysia Perlis Perlis Malaysia

The early detection of colorectal polyps is crucial for the reduction of mortality rates. However, manually identifying polyps is time-consuming and expensive, increasing the risk of missing them. Our paper aims to address this issue by presenting an automated segmentation approach for colorectal polyps. This paper proposes a method that combines a skip connection with hybrid attention guidance (AG) using attention guidance (AG) and residual path frameworks to identify salient features. Furthermore, we augment test samples using original, horizontal flip, and vertical flip transformations to enhance model robustness through Test Time Augmentation (TTA). The model was trained with Kvasir-seg samples and evaluated on Kvasir-seg and CVC-ClinicDB datasets to gauge generalizability. A significant accuracy (0.9546), a Dice Similarity Coefficient (DSC) of 0.8557, a Cross-section over Union (IoU) of 0.8824, a Recall (0.8221), a Precision (0.8922), an area under Receiver Operating Characteristics (ROC-AUC) of 0.9454, and an area under Precision-Recall (AUC-PR) of 0.8717 were achieved without TTA. Through TTA integration, accuracy (0.9993), DSC (0.8663), IoU (0.8277), Recall (0.8060), Precision (0.9364), and ROC-AUC (0.9587) have been improved. A comparison of our framework with state-of-the-art models demonstrated its effectiveness and segmentation capabilities. Additionally, the proposed model contains only 0.47 million parameters and a weight size of 6.71 MB, illustrating its potential for clinical diagnostics. A computer-aided diagnosis (CAD) system improves patient outcomes by detecting colorectal polyps early and improving segmentation accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mixed-variable Bayesian optimization 29

Mixed-variable Bayesian optimization

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Daxberger, Erik Makarova, Anastasia Turchetta, Matteo Krause, Andreas Department of Engineering University of Cambridge United Kingdom Max Planck Institute for Intelligent Systems Tübingen Germany Department of Computer Science ETH Zurich Switzerland

ISBN: (纸本)9780999241165

The optimization of expensive to evaluate, black-box, mixed-variable functions, i.e. functions that have continuous and discrete inputs, is a difficult and yet pervasive problem in science and engineering. In Bayesian optimization (BO), special cases of this problem that consider fully continuous or fully discrete domains have been widely studied. However, few methods exist for mixed-variable domains and none of them can handle discrete constraints that arise in many real-world applications. In this paper, we introduce MIVABO, a novel BO algorithm for the efficient optimization of mixed-variable functions combining a linear surrogate model based on expressive feature representations with Thompson sampling. We propose an effective method to optimize its acquisition function, a challenging problem for mixed-variable domains, making MIVABO the first BO method that can handle complex constraints over the discrete variables. Moreover, we provide the first convergence analysis of a mixed-variable BO algorithm. Finally, we show that MIVABO is significantly more sample efficient than state-of-the-art mixed-variable BO algorithms on several hyperparameter tuning tasks, including the tuning of deep generative models. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Variational Bayes in Private Settings (VIPS) 29

Variational Bayes in Private Settings (VIPS)

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Foulds, James R. Park, Mijung Chaudhuri, Kamalika Welling, Max Department of Information Systems University of Maryland Baltimore County United States Max Planck Institute for Intelligent Systems Germany Department of Computer Science University of Tübingen Germany Department of Computer Science University of California San Diego United States Informatics Institute University of Amsterdam Netherlands

ISBN: (纸本)9780999241165

Many applications of Bayesian data analysis involve sensitive information such as personal documents or medical records, motivating methods which ensure that privacy is protected. We introduce a general privacy-preserving framework for Variational Bayes (VB), a widely used optimization-based Bayesian inference method. Our framework respects differential privacy, the gold-standard privacy criterion. The iterative nature of variational Bayes presents a challenge since iterations increase the amount of noise needed to ensure privacy. We overcome this by combining: (1) an improved composition method, called the moments accountant, and (2) the privacy amplification effect of subsampling mini-batches from large-scale data in stochastic learning. We empirically demonstrate the effectiveness of our method on LDA topic models, evaluated on Wikipedia. In the full paper we extend our method to a broad class of models, including Bayesian logistic regression and sigmoid belief networks [Park et al., 2020]. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Cryptocurrency Trading Agent Using Deep Reinforcement Learning

Cryptocurrency Trading Agent Using Deep Reinforcement Learni...

引用

International Conference on Soft Computing and Machine Intelligence (ISCMI)

作者： Uwais Suliman Terence L. van Zyl Andrew Paskaramoorthy Computer Science and Applied Maths University of the Witwatersrand Johannesburg South Africa Institute for Intelligent Systems University of Johannesburg Johannesburg South Africa Department of Statistical Sciences University of Cape Town Johannesburg South Africa

Cryptocurrencies are peer-to-peer digital assets monitored and organised by a blockchain network. Price prediction has been a significant focus point with various machine learning algorithms, especially concerning cryptocurrency. This work addresses the challenge faced by traders of short-term profit maximisation. The study presents a deep reinforcement learning algorithm to trade in cryptocurrency markets, Duelling DQN. The environment has been designed to simulate actual trading behaviour, observing historical price movements and taking action on real-time prices. The proposed algorithm was tested with Bitcoin, Ethereum, and Litecoin. The respective portfolio returns are used as a metric to measure the algorithm's performance against the buy-and-hold benchmark, with the buy-and-hold outperforming the results produced by the Duelling DQN agent.

关键词： Deep learning Sentiment analysis Machine learning algorithms Reinforcement learning Prediction algorithms Real-time systems Cryptocurrency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：