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

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

Continuous-Time Damping-Based Mirror Descent for a Class of Non-Convex Multi-Player Games with Coupling Constraints

Continuous-Time Damping-Based Mirror Descent for a Class of ...

引用

International Conference on control and Automation (ICCA)

作者： Guanpu Chen Kun Cao Karl Henrik Johansson Yiguang Hong Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Control Science and Engineering Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China

ISBN: (数字)9798350354409

ISBN: (纸本)9798350354416

We study the computation of the global generalized Nash equilibrium (GNE) for a class of non-convex multi-player games, where players' actions are subject to both local and coupling constraints. Due to the non-convex payoff functions, we employ canonical duality to reformulate the setting as a complementary problem. Under given conditions, we reveal the relation between the stationary point and the global GNE. According to the convex-concave properties within the complementary function, we propose a continuous-time mirror descent to compute GNE by generating functions in the Bregman divergence and the damping-based design. Then, we devise several Lyapunov functions to prove that the trajectory along the dynamics is bounded and convergent.

关键词： Couplings Damping Automation Games Nash equilibrium Trajectory Mirrors

来源：评论

学校读者我要写书评

暂无评论

Invisible Servoing: A Visual Servoing Approach with Return-Conditioned Latent Diffusion

Invisible Servoing: A Visual Servoing Approach with Return-C...

引用

International Conference on Unmanned Aircraft Systems (ICUAS)

作者： Bishoy Gerges Barbara Bazzana Nicolò Botteghi Youssef Aboudorra Antonio Franchi Robotics and Mechatronics group Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Enschede The Netherlands Department of Applied Mathematics University of Twente Enschede The Netherlands Department of Computer Control and Management Engineering Sapienza University of Rome Rome Italy

ISBN: (数字)9798331513283

ISBN: (纸本)9798331513290

In this paper, we present a novel visual servoing (VS) approach based on latent Denoising Diffusion Probabilistic Models (DDPMs), that explores the application of generative models for vision-based navigation of UAVs (Uncrewed Aerial Vehicles). Opposite to classical VS methods, the proposed approach allows reaching the desired target view, even when the target is initially not visible. This is possible thanks to the learning of a latent representation that the DDPM uses for planning and a dataset of trajectories encompassing target-invisible initial views. A compact representation is learned from raw images using a Cross-Modal Variational Autoencoder. Given the current image, the DDPM generates trajectories in the latent space driving the robotic platform to the desired visual target. The approach has been validated in simulation using two generic multi-rotor UAVs (a quadrotor and a hexarotor). The results show that we can successfully reach the visual target, even if not visible in the initial view. A video summary with simulations can be found in: https://***/2Hb3nkkcszE.

关键词： Location awareness Visualization Pipelines Noise reduction Autonomous aerial vehicles Visual servoing Trajectory Planning Standards Robots

来源：评论

学校读者我要写书评

暂无评论

Equilibrium-Independent control of Continuous-Time Nonlinear Systems via the LPV Framework - Extended Version

arXiv

引用

arXiv 2023年

作者： Koelewijn, Patrick J.W. Weiland, Siep Tóth, Roland The Control Systems Group Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands The Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

In this paper, we consider the analysis and control of continuous-time nonlinear systems to ensure universal shifted stability and performance, i.e., stability and performance w.r.t. each forced equilibrium point of the system. This "equilibrium-free" concept is especially beneficial for control problems that require the tracking of setpoints and rejection of persistent disturbances, such as input loads. In this paper, we show how the velocity form, i.e., the time-differentiated dynamics of the system, plays a crucial role in characterizing these properties and how the analysis of it can be solved by the application of Linear Parameter-Varying (LPV) methods in a computationally efficient manner. Furthermore, by leveraging the properties of the velocity form and the LPV framework, a novel controller synthesis method is presented which ensures closed-loop universal shifted stability and performance. The proposed controller design is verified in a simulation study and also experimentally on a real system. Additionally, we compare the proposed method to a standard LPV control design, demonstrating the improved stability and performance guarantees of the new approach. Copyright © 2023, The Authors. All rights reserved.

关键词： controllers

来源：评论

学校读者我要写书评

暂无评论

Boolean matrix compressed sensing

Boolean matrix compressed sensing

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qiang Soleymani, Mahdi Mahdavifar, Hessam National Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China Halıcıoğlu Data Science Institute University of California La Jolla San DiegoCA92093 United States Department of Electrical and Computer Engineering Northeastern University BostonMA02115 United States

ISBN: (纸本)9798350368741

In real-world datasets, leveraging the low-rank and sparsity properties enables developing efficient algorithms across a diverse array of data-related tasks, including compression, compressed sensing, matrix completion, etc. Notably, these two properties often coexist in certain real-world datasets, especially in Boolean datasets and quantized real-valued datasets. To harness the advantages of low-rank and sparsity simultaneously, we adopt a technique inspired by compressed sensing and Boolean matrix completion. Our approach entails compressing a low-rank sparse Boolean matrix by performing inner product operations with a randomly generated Boolean matrix. We then propose a decoding algorithms based on message-passing techniques to recover the original matrix. Our experiments demonstrate superior recovery performance of our proposed algorithms compared to Boolean matrix completion, with equal measurement requirements. © 2025 IEEE.

关键词： Belief Propagation Boolean Matrix Compressed Sensing Matrix Completion

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Grained Label Distribution Learning 39

Adaptive-Grained Label Distribution Learning

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lu, Yunan Li, Weiwei Liu, Dun Li, Huaxiong Jia, Xiuyi School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China School of Economics and Management Southwest Jiaotong University Chengdu China Department of Control Science and Intelligence Engineering Nanjing University Nanjing China

ISBN: (纸本)157735897X

Label polysemy, where an instance can be associated with multiple labels, is common in real-world tasks. LDL (label distribution learning) is an effective learning paradigm for handling label polysemy, where each instance is associated with a label distribution. Although numerous LDL algorithms have been proposed and achieved satisfactory performance on most existing datasets, they are typically trained directly on the collected label distributions which often lack quality guarantees in real-world tasks due to annotator subjectivity and algorithm assumptions. Consequently, direct learning from such uncertain label distributions can lead to unpredictable generalization performance. To address this problem, we propose an adaptive-grained label distribution learning framework whose main idea is to extract relatively reliable supervision information from unreliable label distributions, and thus the label distribution learning task can be decomposed into three subtasks: coarsening label distributions, learning coarse-grained labels and refining coarse-grained labels. In this framework, we design an adaptive label coarsening algorithm to extract an optimal coarsen-grained labels and a label refining function to enhance the coarse-grained label into the final label distributions. Finally, we conduct extensive experiments on real-world datasets to demonstrate the advantages of our proposal. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints

arXiv

引用

arXiv 2025年

作者： Nurkanovic, Armin Leyffer, Sven Systems Control and Optimization Laboratory Department of Microsystems Engineering University of Freiburg Germany Mathematics and Computer Science Division Argonne National Laboratory United States

This paper introduces a method that globally converges to Bstationary points of mathematical programs with equilibrium constraints (MPECs) in a finite number of iterations. B-stationarity is necessary for optimality and means that no feasible first-order direction improves the objective. Given a feasible point of an MPEC, B-stationarity can be certified by solving a linear program with equilibrium constraints (LPEC) constructed at this point. The proposed method solves a sequence of LPECs, which either certify B-stationarity or provide an active-set estimate for the complementarity constraints, and nonlinear programs (NLPs) - referred to as branch NLPs (BNLPs) - obtained by fixing the active set in the MPEC. A BNLP is more regular than the MPEC, easier to solve, and with the correct active set, its solution coincides with the solution of the MPEC. The method has two phases: the first phase identifies a feasible BNLP or certifies local infeasibility, and the second phase solves a finite sequence of BNLPs until a B-stationary point of the MPECis found. The paper provides a detailed convergence analysis and discusses implementation details. In addition, extensive numerical experiments and an open-source software implementation are provided. The experiments demonstrate that the proposed method is more robust and faster than relaxation-based methods, while also providing a certificate of B-stationarity without requiring the usual too-restrictive *** Codes 90C30, 90C33, 49M37, 65K10, 90C11 © 2025, CC BY.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

AI-aided power electronic converters automatic online real-time efficiency optimization method

引用

Fundamental Research 2025年第3期5卷 1111-1116页

作者： Tang, Yuanhong Cao, Di Xiao, Jian Jiang, Chenying Huang, Qi Li, Yunwei Chen, Zhe Blaabjerg, Frede Hu, Weihao Power System Wide-area Measurement and Control Sichuan Provincial Key Laboratory School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China Chengdu 611731 China MORNSUN Guangzhou Science & Technology Co. Ltd. Guangzhou 510663 China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu 611731 China Yangtze Delta Region Institute (Quzhou) University of Electronic Science and Technology of China Quzhou 324000 China Department of Chengdu State Grid Corporation of China Chengdu 610599 China Southwest University of Science and Technology Mianyang 621010 China Department of Electrical and Computer Engineering University of Alberta Edmonton AB T6G 2V4 Canada Department of Energy Technology Aalborg University Aalborg 9220 Denmark

Energy losses during the conversion and supply of electric power are considered a significant issue and cannot be estimated. Improvement in the efficiency of energy conversion systems is highly restricted because of their internal nonlinearity and complexity. Thus, inspired by the successful utilization of robotic chemists, we demonstrate a pioneering concept of artificial intelligence (AI)-aided automatic online real-time optimization of a power electronics converter using a dual active bridge (DAB) converter as an example. An optimal modulation strategy was obtained through repeated automatic exploration experiments on a practical DAB converter platform. Specifically, the DAB experimental platform operated autonomously around the clock for approximately 71 h. It performed 120,000 consecutive experiments (12,000 episodes) within a six-variable experimental space driven by a deep deterministic policy gradient (DDPG) algorithm. The proposed AI-aided automatic online real-time optimization method achieved significantly improved efficiency of power conversion and supply. Consequently, zero carbon emissions may be obtained in the future. © 2023

关键词： Artificial intelligence Automatic online real-time exploration DC-DC converter Dual active bridge converter Energy conversion system Power electronics

来源：评论

学校读者我要写书评

暂无评论

Complexity results and active-set identification of a derivative-free method for bound-constrained problems

arXiv

引用

arXiv 2024年

作者： Brilli, Andrea Cristofari, Andrea Liuzzi, Giampaolo Lucidi, Stefano Department of Computer Control and Management Engineering Sapienza University of Rome Via Ariosto 25 Rome00185 Italy Department of Civil Engineering and Computer Science Engineering University of Rome "Tor Vergata" Via del Politecnico 1 Rome00133 Italy

In this paper, we analyze a derivative-free line search method designed for bound-constrained problems. Our analysis demonstrates that this method exhibits a worst-case complexity comparable to other derivative-free methods for unconstrained and linearly constrained problems. In particular, when minimizing a function with n variables, we prove that at most O (nϵ−2) iterations are needed to drive a criticality measure below a predefined threshold ǫ, requiring at most O (n2ϵ−2) function evaluations. We also show that the total number of iterations where the criticality measure is not below ǫ is upper bounded by O (n2ϵ−2). Moreover, we investigate the method capability to identify active constraints at the final solutions. We show that, after a finite number of iterations, all the active constraints satisfying the strict complementarity condition are correctly identified. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proposal of a novel peeling of nano-particle (PNP) process for localized material removal on a hard material surface by controllable magnetic fields 22

Proposal of a novel peeling of nano-particle (PNP) process f...

引用

22nd International Conference of the European Society for Precision engineering and Nanotechnology, EUSPEN 2022

作者： Permpatdechakul, Thitipat Khajornrungruang, Panart Suzuki, Keisuke Kutomi, Shotaro Graduate School of Computer Science and System Engineering Mechanical Information Science and Technology Course Kyushu Institute of Technology Fukuoka Japan Department of Intelligent and Control Systems Avanced Mechanical Division Kyushu Institute of Technology Fukuoka Japan School of Computer Science and System Engineering Advanced Mechanical Course Kyushu Institute of Technology Fukuoka Japan

ISBN: (纸本)9781998999118

This article proposes a novel Peeling of Nano-Particle (PNP) process to locally remove material on a hard material surface using controllable magnetic fields. Fe3O4 particles in the size range of 50-100 nm in aqueous solution (pH value 11 adjusted by KOH) were magnetically controlled to adhere and remove from a 4H-SiC surface by two electromagnetic coils, which were sandwiched between the substrate. The particle controlling phenomenon on the surface was experimentally observed and verified by our developed apparatus applying an evanescent field. According to the results, particles could be controlled to approach and remove from the substrate surface with 12mT of magnetic field at the selective area on the substrate surface to realise the proposed PNP process. © European Society for Precision engineering and Nanotechnology, Conference Proceedings - 22nd International Conference and Exhibition, EUSPEN 2022. All rights reserved.

关键词： Magnetic fields

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：