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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jingfeng Ou Jiawei Li Zhiliang Xia Shurui Dai Yulian Ding Yan Guo Limin Jiang Jijun Tang College of Engineering Southern University of Science and Technology Shenzhen China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China Department of Public Health Sciences University of Miami Miami FL USA

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The advent of single-cell transcriptomics has revolutionized our ability to analyze cellular heterogeneity and dynamics at a fine resolution, yet covering the vast array of potential perturbations remains challenging due to biological variability. To address this, we propose scCADE, a novel computational approach utilizing contrastive learning and an attention mechanism to decouple gene expression signatures and predict cellular responses to perturbations. scCADE excels in predicting responses in cells to perturbations observed in other cells but not yet seen in the target cells. Through rigorous ablation studies and validation across three datasets involving drug and gene editing perturbations, scCADE consistently outperformed existing methods, underscoring its efficacy and potential to advance genomics and personalized medicine by accurately forecasting responses to novel perturbations.

关键词： Attention mechanisms Perturbation methods Precision medicine Transcriptomics Contrastive learning Predictive models Robustness Gene expression Bioinformatics Testing

来源：评论

学校读者我要写书评

暂无评论

Non-Convex Potential Games for Finding Global Solutions to Sensor Network Localization

Non-Convex Potential Games for Finding Global Solutions to S...

引用

European control Conference (ECC)

作者： Gehui Xu Guanpu Chen Yiguang Hong Baris Fidan Thomas Parisini Karl H. Johansson Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Control Science and Engineering Tongji University Shanghai China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai China Department of Mechanical and Mechatronics Engineering University of Waterloo Waterloo ON Canada Department of Electrical and Electronic Engineering Imperial College London London UK Department of Engineering and Architecture University of Trieste Trieste Italy

ISBN: (数字)9783907144107

ISBN: (纸本)9798331540920

Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and the available measurements between non-anchor and anchor nodes. Attributed to the intrinsic non-convexity, obtaining a globally optimal solution to SNL is challenging, as well as implementing corresponding algorithms. In this paper, we formulate a non-convex multi-player potential game for a generic SNL problem to investigate the identification condition of the global Nash equilibrium (NE) therein, where the global NE represents the global solution of SNL. We employ canonical duality theory to transform the non-convex game into a complementary dual problem. Then we develop a conjugation-based algorithm to compute the stationary points of the complementary dual problem. On this basis, we show an identification condition of the global NE: the stationary point of the proposed algorithm satisfies a duality relation. Finally, simulation results are provided to validate the effectiveness of the theoretical results.

关键词： Location awareness Coordinate measuring machines Simulation Current measurement Noise Europe Games

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further reduced to O)(log(T)), and the network cumulative constraint violation bound is reduced to O(log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Image Inpainting and Classification Agent Training Based on Reinforcement Learning and Generative Models with Attention Mechanism

Image Inpainting and Classification Agent Training Based on ...

引用

2021 International Conference on Microelectronics, ICM 2021

作者： Ukwuoma, Chiagoziem C. Belal Bin Heyat, Md Masadeh, Mahmoud Akhtar, Faijan Zhiguang, Qin Bondzie-Selby, Emmanuel Alshorman, Omar Alkahtani, Fahad University of Electronic Science and Technology of China School of Information and Software Engineering Sichuan Chengdu China Shenzhen University IoT Research Center College of Computer Science and Software Engineering Guangdong Shenzhen China Yarmouk University Hijjawi Faculty for Engineering Computer Engineering Deprtment Irbid21163 Jordan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu China Najran University Faculty of Engineering AlShrouk Trading Company Najran Saudi Arabia Najran University Faculty of Engineering Electrical Engineering Department Najran Saudi Arabia

ISBN: (纸本)9781665408394

What distinguishes the field of artificial intelligence (AI) from others is to develop fully independent agents that learn optimal behavior, change, and evolve solely through the communication of trial and error with the surrounding environment. Reinforcement learning (RL) can be seen in multiple aspects of Machine Learning (ML), provided the environment, reward, actions, the state will be defined. Agent training in previous years is seen to only relate to robotics, games, and self-driving cars. While trying to divert the focus of researchers from the view of self-driving cars, games, robots, etc. Here, we investigated using reinforcement learning in the aspect of task completion. We deployed our architecture in an inpainting task where the agent generates the distorted or missing image content into an eminent fidelity completed the image by using reinforcement learning to influence the generative model utilized. The Generative Adversary Network (GAN) problem of not being steady and challenging to train was overwhelmed by utilizing latent space representation. The dimension is reduced compared to the distorted or corrupted image in training the GAN. Then reinforcement learning was deployed to pick the correct GAN input to get the image's latent space representation that is most suitable for the current input of the missing or distorted image region. In this paper, we also learned that the trained agent enhances the accuracy in a classification task of images with missing data. We successfully examined the classification enhancement on images missing 30%, 50%, and 70%. © 2021 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

arXiv

引用

arXiv 2024年

作者： Wu, Xuan Wang, Di Wen, Lijie Xiao, Yubin Wu, Chunguo Wu, Yuesong Yu, Chaoyu Maskell, Douglas L. Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin university Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore School of Software Tsinghua University Beijing100084 China College of Computing and Data Science Nanyang Technological University 639798 Singapore

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted, they did not cover the state-of-the-art (SOTA) NCO solvers emerged recently. More importantly, to establish a comprehensive and up-to-date taxonomy of NCO solvers, we systematically review relevant publications and preprints, categorizing them into four distinct types, namely Learning to Construct, Learning to Improve, Learning to Predict-Once, and Learning to Predict-Multiplicity solvers. Subsequently, we present the inadequacies of the SOTA solvers, including poor generalization, incapability to solve large-scale VRPs, inability to address most types of VRP variants simultaneously, and difficulty in comparing these NCO solvers with the conventional Operations Research algorithms. Simultaneously, we discuss on-going efforts, identify open inadequacies, as well as propose promising and viable directions to overcome these inadequacies. Notably, existing efforts focus on only one or two of these inadequacies, with none attempting to address all of them concurrently. In addition, we compare the performance of representative NCO solvers from the Reinforcement, Supervised, and Unsupervised Learning paradigms across VRPs of varying scales. Finally, following the proposed taxonomy, we provide an accompanying web page as a live repository for NCO solvers. Through this survey and the live repository, we aim to foster further advancements in the NCO community. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Question generation based on chat-response conversion

Question generation based on chat-response conversion

引用

作者： Zhong, Sheng-Hua Peng, Jianfeng Liu, Peiqi College of Computer Science and Software Engineering Shenzhen University Shenzhen China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

Today, thanks to the major breakthrough of sequences to sequences model in the field of natural language, most of the dialogue generation tasks are focused on generating more effective responses. However, the responses proposed by the chat-bot are only a passive answer or assentation, which does not arouse the desire of people to continue communicating. How to transform the chat robot from a passive reply to an active questioner has become an urgent problem. In this paper, a question generalization method with four types of question proposing schemes are designed, implemented, and tested to automate question generation process. The proposed system is controlled by a probability-triggered multiple conversion mechanism to actively propose different types of questions. We embed our methods in the mainstream dialogue generation model and demonstrate its effectiveness in dialogue response generalization on a standard dataset. In addition, it achieves good performance in subjective conversational assessment. © 2019 John Wiley & Sons, Ltd.

关键词： dialogue response generalization system probability-triggered question generation

来源：评论

学校读者我要写书评

暂无评论

NBMon: NB-IoT-based UAV Network Routing Monitoring System

NBMon: NB-IoT-based UAV Network Routing Monitoring System

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Ji'ao Tang Xiaojun Zhu Chao Dong Lei Zhang College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics China College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics China State Key Laboratory of Novel Software Technology Nanjing University Nanjing China

The routing state of UAV networks is difficult to monitor, making many new routing protocols hard to evaluate on UAVs. In this paper, we propose NBMon, an NB-IoT-based routing monitoring system for UAV networks, which can upload the routing table information from the host device to a control station through the NB-IoT network. At the same time, the control station can also send commands to the monitored devices to change routes. However, one challenge is that both NB-IoT modules and the control station are behind NAT without global IP addresses. We propose a NAT traversal method on top of NB- IoT. It allows communication between the NB-IoT modules and the control station in different networks. Finally, we implement NBMon and evaluate the performance of NB-IoT devices through real-world experiments.

关键词： Performance evaluation Wireless networks Data visualization Routing Routing protocols Delays Servers

来源：评论

学校读者我要写书评

暂无评论

Design, techno-economic evaluation, and experimental testing of grid connected rooftop solar photovoltaic systems for commercial buildings

引用

Frontiers in Energy Research 2024年 12卷

作者： Habib, Salman Tamoor, Muhammad Gulzar, Muhammad Majid Chauhdary, Sohaib Tahir Ahmad, Hasnain Alqahtani, Mohammed Khalid, Muhammad Control and Instrumentation Engineering Department King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Interdisciplinary Research Center for Smart Mobility and Logistics King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Department of Electrical Engineering and Technology Government College University Faisalabad Faisalabad Pakistan King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Department of Electrical and Computer Engineering College of Engineering Dhofar University Salalah Oman Department of Electrical Engineering Pakistan Institute of Engineering and Applied Sciences PIEAS Islamabad Pakistan Department of Industrial Engineering and Center for Engineering and Technology Innovations King Khalid University Abha Saudi Arabia Dhahran Saudi Arabia

This study aims to investigate the potential of rooftop solar photovoltaic systems for commercial buildings. Helio-Scope software is utilized to perform simulations to determine the ideal rooftop area for photovoltaic panels. The efficiency of photovoltaic systems is impacted by the shading effects of photovoltaic modules installed in parallel rows. To enhance energy output, the optimal distance between rows is determined, and it is found that 5-feet inter-row spacing provides the best results. The simulation results indicate that with 5-feet inter-row spacing, photovoltaic system has an energy generation of 371.6 MWh, specific yield of 1508.0 kWh/kWp, performance ratio of 82.1%, solar access rate of 98.9%, total solar resource fraction of 96.3% and a total irradiance of 1655.9 kWh/m2. The annual nameplate energy is 425.1 MWh, output energy at irradiance levels is 423.1 MWh, optimal DC output is 378.5 MWh, inverter output is 373.5 MWh, and total energy delivered to the national power grid is 371.6 MWh. The average daily DC inverter input power is 158881.5110 W and the average daily AC inverter output power is 152231.6311 W, showing an inverter efficiency of approximately 95.93%. Moreover, detailed testing of the installed PV system is performed on-site to make sure that equipment’s performance guarantees are achieved, the system is properly installed and its configuration is suitable for commercial operations. The maximum daily output energy generation of an installed photovoltaic (PV) system is 1.33 MWh, and its average energy generation is 1.09 MWh. The voltage of all strings is within the rated range of the inverter, with a maximum voltage of 835 V and a minimum of 698 V, as tested by PV string open-circuit voltage. The inverter efficiency test is also performed, with a maximum efficiency of 98.83% and fill factors ranging from 81.37% to 82.34%. The payback period of a photovoltaic system is 4.22 years and LCOE is 0.0229$/kWh. PV system saved 215569.818 metric to

关键词： Solar power generation

来源：评论

学校读者我要写书评

暂无评论

Categorical data clustering: 25 years beyond K-modes

arXiv

引用

arXiv 2024年

作者： Dinh, Tai Hauchi, Wong Fournier-Viger, Philippe Lisik, Daniil Ha, Minh-Quyet Dam, Hieu-Chi Huynh, Van-Nam The Kyoto College of Graduate Studies for Informatics 7 Tanaka Monzencho Sakyo Ward Kyoto City Kyoto Japan College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen City China University of Gothenburg Medicinaregatan 1F Göteborg413 90 Sweden Japan Advanced Institute of Science and Technology 1-1 Asahidai Ishikawa Nomi Japan

The clustering of categorical data is a common and important task in computer science, offering profound implications across a spectrum of applications. Unlike purely numerical data, categorical data often lack inherent ordering as in nominal data, or have varying levels of order as in ordinal data, thus requiring specialized methodologies for efficient organization and analysis. This review provides a comprehensive synthesis of categorical data clustering in the past twenty-five years, starting from the introduction of K-modes. It elucidates the pivotal role of categorical data clustering in diverse fields such as health sciences, natural sciences, social sciences, education, engineering, and economics. Practical comparisons are conducted for algorithms having public implementations, highlighting distinguishing clustering methodologies and revealing the performance of recent algorithms on several benchmark categorical datasets. Finally, challenges and opportunities in the field are discussed. © 2024, CC BY.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Local Neighbor Propagation on Graphs for Robust Feature Matching

SSRN

引用

SSRN 2023年

作者： Guo, Hanlin Xiao, Guobao Su, Lumei Zhou, Jiaxing Wang, Dahan Xiamen Key Laboratory of Frontier Electric Power Equipment and Intelligent Control School of Electrical Engineering and Automation Xiamen University of Technology China Fujian Key Laboratory of Sensing and Computing for Smart Cities School of Information Science and Engineering Xiamen University China College of Computer and Control Engineering Minjiang University China Fujian Key Laboratory of Pattern Recognition and Image Understanding School of Computer and Information Engineering Xiamen University of Technology China

Establishing reliable correspondences between two sets of feature points is a critical preprocessing step in many computer vision and pattern recognition tasks. In this paper, we propose a novel robust Local Neighbor Propagation on Graphs based feature matching (LNPG) method, to obtain good correspondences for feature matching. LNPG starts from a novel neighborhood graph construction strategy. The strategy leverages the spatial consistency constraint to generate a series of neighborhood sets, and employs the residual information to preserve the local neighborhood relationships of potential inliers (i.e., true matches). Subsequently, LNPG incorporates local neighbor propagation into the graph to enhance connections between data in different neighborhoods, by using the path-based similarity measurement and the adaptive graph partition. In addition, LNPG includes a novel consistency-filtering-based clustering algorithm for robust feature matching. This clustering algorithm introduces a reliable neighborhood consistency measure function and an effective cluster merging criterion for cluster detection and cluster merging during the clustering process, respectively. Overall, LNPG not only effectively distinguishes inliers from outliers, but also reliably classifies inliers into different transformation models between pairs of images. Experiments on publicly available datasets with different types of image transformations show the superiority of our LNPG in comparison with other state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：