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

6th World Congress on Global Optimization, WCGO 2019

作者： Foglino, Francesco Leonetti, Matteo Sagratella, Simone Seccia, Ruggiero School of Computing University of Leeds Leeds United Kingdom Department of Computer Control and Management Engineering Antonio Ruberti Sapienza University of Rome Via Ariosto 25 Roma00185 Italy

ISBN: (纸本)9783030218027

Curriculum learning is often employed in deep reinforcement learning to let the agent progress more quickly towards better behaviors. Numerical methods for curriculum learning in the literature provides only initial heuristic solutions, with little to no guarantee on their quality. We define a new gray-box function that, including a suitable scheduling problem, can be effectively used to reformulate the curriculum learning problem. We propose different efficient numerical methods to address this gray-box reformulation. Preliminary numerical results on a benchmark task in the curriculum learning literature show the viability of the proposed approach. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and Knowledge Distillation

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-...

引用

Information Science, Parallel and Distributed Systems (ISPDS), International Conference on

作者： Chengjia Jiang Tao Wang Sien Li Jinyang Wang Shirui Wang Antonios Antoniou Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China The Key Laboratory of Cognitive Computing and Intelligent Information Processing Fujian Education Institutions Wuyi University Wuyishan China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Engineering European University Cyprus Nicosia Cyprus

We address the problem of learning new classes for semantic segmentation models from few examples, which is challenging because of the following two reasons. Firstly, it is difficult to learn from limited novel data to capture the underlying class distribution. Secondly, it is challenging to retain knowledge for existing classes and to avoid catastrophic forgetting. For learning from limited data, we propose a pseudo-labeling strategy to augment the few-shot training annotations in order to learn novel classes more effectively. Given only one or a few images labeled with the novel classes and a much larger set of unlabeled images, we transfer the knowledge from labeled images to unlabeled images with a coarse-to-fine pseudo-labeling approach in two steps. Specifically, we first match each labeled image to its nearest neighbors in the unlabeled image set at the scene level, in order to obtain images with a similar scene layout. This is followed by obtaining pseudo-labels within this neighborhood by applying classifiers learned on the few-shot annotations. In addition, we use knowledge distillation on both labeled and unlabeled data to retain knowledge on existing classes. We integrate the above steps into a single convolutional neural network with a unified learning objective. Extensive experiments on the Cityscapes and KITTI datasets validate the efficacy of the proposed approach in the self-driving domain. Code is available from https://***/ChasonJiang/FSCILSS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MLAR-Net: A multilevel attention-based ResNet module for the automated recognition of emotions using single-channel EEG signals

引用

IEEE Access 2025年 13卷 99122-99144页

作者： Maithri, M. Raghavendra, U. Gudigar, Anjan Praharaj, Samir Kumar Karthikeyan, S. Salvi, Massimo Yeong, Chai Hong Molinari, Filippo Rajendra Acharya, U. Manipal Academy of Higher Education Manipal Institute of Technology Department of Mechatronics Manipal 576104 India Manipal Academy of Higher Education Manipal Institute of Technology Department of Instrumentation and Control Engineering Karnataka Manipal 576104 India Taylor’s University School of Medicine Faculty of Health and Medical Sciences Digital Health and Medical Advancement Impact Laboratory Subang Jaya 47500 Malaysia Kasturba Medical College Manipal Academy of Higher Education Department of Psychiatry Manipal Karnataka Manipal 576104 India Manipal Academy of Higher Education Manipal Institute of Technology Department of Electrical & Electronics Engineering Karnataka Manipal 576104 India Politecnico di Torino Biolab PoliToBIOMed Lab Department of Electronics and Telecommunications Corso Duca degli Abruzzi 24 Turin 10129 Italy University of Southern Queensland School of Mathematics Physics and Computing Springfield Australia University of Southern Queensland Centre for Health Research Australia

Human emotion recognition is important as it finds applications in multiple domains such as medicine, entertainment, and military. However, accurately identifying emotions remains challenging due to humans’ ability to hide or suppress their emotional expressions. Hence it becomes important to recognize emotions by using brain signals as they provide more reliable data. Brain signals can be captured using Electroencephalograms (EEG) electrodes. Most used EEG devices come with multiple channels. But not all channel information is important for emotion recognition. Another issue with the existing dataset is the availability of a small quantity of samples. To address these challenges, we propose MLAR-Net, a novel multi-level attention module for emotion recognition using single-channel EEG signals. Our approach converts EEG signals into spectrograms using multiple parameters to generate large set of images. This data is then processed through our proposed MLAR-Net, which integrates a multi-level attention module with ResNet18 architecture. Our study identifies channel number 24 (T7) as the most effective for emotion classification, achieving an average accuracy of 98.06% using cubic support vector machine and a maximum accuracy of 99.51% using fine K-Nearest Neighbours. The study was conducted using SEED dataset. It is a publicly available dataset developed by capturing EEG signals from fifteen subjects for three classes of emotions namely positive, negative and neutral. The results achieved by the proposed study show around 4 to 5% improvement in comparison with the state-of-the-art studies using the same channel. This performance surpasses existing state-of-the-art methods for single-channel EEG-based emotion recognition. Furthermore, we highlight the top-performing channels that can be used for real-time implementation of the system with a minimum number of channels. © 2013 IEEE.

关键词： Attention-Based ResNet Emotion Recognition Explainable AI Single-Channel EEG Spectrograms

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Estimation of Infinitesimal Generators of Stochastic Systems ⁎

引用

IFAC-PapersOnLine 2021年第5期54卷 277-282页

作者： Ameneh Nejati Abolfazl Lavaei Sadegh Soudjani Majid Zamani Department of Electrical Engineering Technical University of Munich Germany Institute for Dynamic Systems and Control ETH Zurich Switzerland School of Computing Newcastle University United Kingdom Department of Computer Science University of Colorado Boulder USA and LMU Munich Germany

This paper is concerned with a data-driven approach for the estimation of infinitesimal generators of continuous-time stochastic systems with unknown dynamics. We first approximate the infinitesimal generator of the solution process via a set of data collected from trajectories of the unknown system. The approximation utilizes both time discretization and sampling from the solution process. Assuming proper continuity assumptions on dynamics of the system, we then quantify the closeness between the infinitesimal generator and its approximation while providing a priori guaranteed confidence bound. We demonstrate that both the time discretization and the number of data play significant roles in providing a reasonable closeness precision. Moreover, for a fixed size of data, variance of the estimation converges to infinity when the time discretization parameter goes to zero. The formulated error bound shows how to pick proper data size and time discretization jointly to prevent this counter-intuitive behavior. The proposed results are demonstrated on a case study.

关键词： Continuous-time stochastic systems Data-driven estimation Infinitesimal generators

来源：评论

学校读者我要写书评

暂无评论

Fair Equilibria in Sponsored Search Auctions: The Advertisers’ Perspective

arXiv

引用

arXiv 2021年

作者： Birmpas, Georgios Celli, Andrea Colini-Baldeschi, Riccardo Leonardi, Stefano Department of Computer Control and Management Engineering Sapienza University Rome Italy Department of Computing Sciences Bocconi University Milan Italy Core Data Science Meta London United Kingdom

In this work we introduce a new class of mechanisms composed of a traditional Generalized Second Price (GSP) auction and a fair division scheme, in order to achieve some desired level of fairness between groups of Bayesian strategic advertisers. We propose two mechanisms, β-Fair GSP and GSP-EFX, that compose GSP with, respectively, an envy-free up to one item, and an envy-free up to any item fair division scheme. The payments of GSP are adjusted in order to compensate advertisers that suffer a loss of efficiency due the fair division stage. We investigate the strategic learning implications of the deployment of sponsored search auction mechanisms that obey to such fairness criteria. We prove that, for both mechanisms, if bidders play so as to minimize their external regret they are guaranteed to reach an equilibrium with good social welfare. We also prove that the mechanisms are budget balanced, so that the payments charged by the traditional GSP mechanism are a good proxy of the total compensation offered to the advertisers. Finally, we evaluate the quality of the allocations through experiments on real-world data. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

FaSTrack:A Modular Framework for Real-Time Motion Planning and Guaranteed Safe Tracking

FaSTrack:A Modular Framework for Real-Time Motion Planning a...

引用

作者： Chen, Mo Herbert, Sylvia L. Hu, Haimin Pu, Ye Fisac, Jaime Fernandez Bansal, Somil Han, Soojean Tomlin, Claire J. School of Computing Science Simon Fraser University BurnabyBCV5A 1S6 Canada Department of Mechanical and Aerospace Engineering University of California San Diego San DiegoCA92122 United States Department of Electrical Engineering Princeton University PrincetonNJ08536 United States Department of Electrical and Electronic Engineering University of Melbourne ParkvilleVIC3010 Australia Department of Electrical Engineering and Computer Sciences University of California Berkeley BerkeleyCA94704 United States Control and Dynamical Systems Program California Institute of Technology Los AngelesCA90019 United States

Real-time, guaranteed safe trajectory planning is vital for navigation in unknown environments. However, real-time navigation algorithms typically sacrifice robustness for computation speed. Alternatively, provably safe trajectory planning tends to be too computationally intensive for real-time replanning. We propose FaSTrack, Fast and Safe Tracking, a framework that achieves both real-time replanning and guaranteed safety. In this framework, real-time computation is achieved by allowing any trajectory planner to use a simplified planning model of the system. The plan is tracked by the system, represented by a more realistic, higher dimensional tracking model. We precompute the tracking error bound (TEB) due to mismatch between the two models and due to external disturbances. We also obtain the corresponding tracking controller used to stay within the TEB. The precomputation does not require prior knowledge of the environment. We demonstrate FaSTrack using Hamilton-Jacobi reachability for precomputation and three different real-time trajectory planners with three different tracking-planning model pairs. © 1963-2012 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Clustering Interval and Triangular Granular Data: Modeling, Execution, and Assessment

引用

IEEE Transactions on Neural Networks and Learning Systems 2024年第6期36卷 10000-10014页

作者： Yiming Tang Wenbin Wu Witold Pedrycz Jianwei Gao Xianghui Hu Zhaohong Deng Rui Chen Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Hefei China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada School of Computer and Information Hefei University of Technology Hefei China Faculty of Automatic Control Electronics and Computer Science Silesian University of Tecghnology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul TÃrkiye School of Computer Science and Engineering Southeast University Nanjing China School of Artificial Intelligence and Computer Jiangnan University Wuxi Jiangsu China

In current granular clustering algorithms, numeric representatives were selected by users or an ordinary strategy, which seemed simple; meanwhile, weight settings for granular data could not adequately express their structural characteristics. Aiming at these problems, in this study, a new scheme called a granular weighted kernel fuzzy clustering (GWKFC) algorithm is put forward. We propose the representative selection and granularity generation (RSGG) algorithm enlightened by the density peak clustering (DPC) algorithm. We build interval and triangular granular data on the strength of numeric representatives obtained by RSGG under the principle of justifiable granularity (PJG), in which we establish some combinations of functions and boundary constraints and prove their properties. Furthermore, we present a novel distance formula via the kernel function for granular data and design new weights to affect the coverage and specificity of granular data. In addition, based upon these factors, we come up with the GWKFC algorithm of granular clustering, and its performance with different granularity is assessed. To sum up, a macro framework involving granular modeling, granular clustering, and assessment has been set up. Lastly, the GWKFC algorithm and ten other granular clustering algorithms are compared by experiments on some artificial and UCI datasets together with datasets with large data or those of high dimensionality. It is found that the GWKFC algorithm can provide better granular clustering results by contrast with other algorithms. The originality is embodied as follows. First, we improve the previous density radius and present the RSGG algorithm to acquire numeric representatives. Second, we propose a new strategy to determine granular data boundaries and further obtain novel weights enlightened by the idea of volume. Lastly, we employ the kernel function to calculate the distance between granular data, which has a stronger spatial division ability than the pr

关键词： Clustering algorithms Data models Computational modeling Numerical models Kernel Phase change materials Granular computing Uncertainty Fuzzy sets Noise

来源：评论

学校读者我要写书评

暂无评论

Correction: Towards automated remote sizing and hot steel manufacturing with image registration and fusion

引用

Journal of Intelligent Manufacturing 2023年第1期36卷 439-439页

作者： Lin, Yueda Wang, Peng Wang, Zichen Ali, Sardar Mihaylova, Lyudmila Automatic Control and Systems Engineering The University of Sheffield Sheffield UK Department of Computing and Mathematics Manchester Metropolitan University Manchester UK

来源：评论

学校读者我要写书评

暂无评论

vailá: VERSATILE ANARCHO INTEGRATED LIBERATION ÁNALYSIS IN MULTIMODAL TOOLBOX

arXiv

引用

arXiv 2024年

作者： Santiago, Paulo Roberto Pereira Chinaglia, Abel Gonçalves Flanagan, Kira Bedo, Bruno L.S. Mochida, Ligia Yumi Aceros, Juan Bononi, Aline Cesar, Guilherme Manna Biomechanics and Motor Control Laboratory School of Physical Education and Sport USP Brazil Graduate Program in Rehabilitation and Functional Performance Medical School USP Brazil Technology and Sports Performance Analysis Laboratory School of Physical Education USP Brazil Laboratory of Applied Biomechanics and Engineering Brooks College of Health UNF United States Department of Physical Therapy Brooks College of Health UNF United States College of Computing Engineering and Construction UNF United States Municipal Pharmacy Ribeirão Preto Brazil

Human movement analysis is crucial in health and sports biomechanics for understanding physical performance, guiding rehabilitation, and preventing injuries. However, existing tools are often proprietary, expensive, and function as "black boxes", limiting user control and customization. This paper introduces vailá—Versatile Anarcho Integrated Liberation Ánalysis in Multimodal Toolbox—an open-source, Python-based platform designed to enhance human movement analysis by integrating data from multiple biomechanical systems. vailá supports data from diverse sources, including retroreflective motion capture systems, inertial measurement units (IMUs), markerless video capture technology, electromyography (EMG), force plates, and GPS/GNSS systems, enabling comprehensive analysis of movement patterns. Developed entirely in Python 3.11.9, which offers improved efficiency and long-term support, and featuring a straightforward installation process, vailá is accessible to users without extensive programming experience. In this paper, we also present several workflow examples that demonstrate how vailá allows the rapid processing of large batches of data, independent of the type of collection method. This flexibility is especially valuable in research scenarios where unexpected data collection challenges arise, ensuring no valuable data point is lost. We demonstrate the application of vailá in analyzing sit-to-stand movements in pediatric disability, showcasing its capability to provide deeper insights even with unexpected movement patterns. By fostering a collaborative and open environment, vailá encourages users to innovate, customize, and freely explore their analysis needs, potentially contributing to the advancement of rehabilitation strategies and performance optimization. For more details in GitHub repository: https://***/vaila-multimodaltoolbox/vaila and the online documentation: https://*** Codes 92C10, 68U10, 65D18, 65K10 © 2024, CC BY-SA.

关键词： Electromyography

来源：评论

学校读者我要写书评

暂无评论

Lightweight Trust Model with Machine Learning scheme for secure privacy in VANET

引用

Procedia Computer Science 2021年 194卷 45-59页

作者： Muhammad Haleem Junejo Ab Al-Hadi Ab Rahman Riaz Ahmed Shaikh Kamaludin Mohamad Yusof Dileep Kumar Imran Memon Faculty of Electrical Engineering Universiti Teknologi Malaysia 81310 Skudai Johor Malaysia Department of Computer Science Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia State Key Laboratory of Industrial Control Technology College of Control Science & Engineering Zhejiang University Hangzhou china Department of computer science bahria university Karachi campus sindh Pakistan

A vehicular ad hoc network (VANETs) is transforming public transport into a safer wireless network, increasing its safety and efficiency. The VANET consists of several nodes which include RSU (Roadside Units), vehicles, traffic signals, and other wireless communication devices that are communicating sensitive information in a network. Nevertheless, security threats are increasing day by day because of dependency on network infrastructure, dynamic nature, and control technologies used in VANET. The security threats could be addressed widely by using machine learning and artificial intelligence on the road transport nodes. In this paper, a comparison of trust and cryptography was presented based on applications and security requirements of VANET.

关键词： VANET Trust Model Machine Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：