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

arXiv 2024年

作者： Ding, Yi He, Xuan Nguyen, Tuan Thanh Song, Wentu Yakhini, Zohar Yaakobi, Eitan Pan, Linqiang Tang, Xiaohu Cai, Kui Information Coding and Transmission Key Lab of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China Cluster Singapore University of Technology and Design 487372 Singapore Faculty of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel School of Computer Science RUNI Herzliya4615200 Israel Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carried out large scale experiments to validate our proposed DNA-based data storage architecture. Specifically, 1.61 and 1.69 MB data were encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages of 4.5 and 6.0, respectively. This experiment achieved the highest net information density and lowest coverage among existing DNA-based data storage experiments (with standard DNA), with data recovery rates and coverage approaching theoretical optima. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel coding

来源：评论

学校读者我要写书评

暂无评论

An advanced actor-critic algorithm for training video game ai 1st

An advanced actor-critic algorithm for training video game a...

引用

1st International Conference on Neural Computing for Advanced Applications, NCAA 2020

作者： Zha, Zhong Yi Tang, Xue Song Wang, Bo Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Artificial Intelligence and Automation School Huazhong University of Science and Technology Wuhan430074 China College of Information and Science Donghua University Shanghai China

ISBN: (纸本)9789811576690

This paper presents an improved deep reinforcement learning (DRL) algorithm, namely Advanced Actor Critic (AAC), which is based on Actor Critic (AC) algorithm, to the video game Artificial intelligence (AI) training. The advantage distribution estimator, Normal Constraint (NC) function and exploration based on confidence are introduced to improve the AC algorithm, in order to achieve accurate value estimate, select continuous spatial action correctly, and explorate effectively. The aim is to improve the performance of conventional AC algorithm in a complex environment. A case study of video game StarCraft II mini-game AI training is employed. The results verify that the improved algorithm effectively improves the performance in terms of the convergence rate, maximum reward, average reward in every 100 episode, and time to reach a specific reward, etc. The analysis on how these modifications improve the performance is also given through interpretation of the feature layers in the mini-games. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

ParamCrop: Parametric cubic cropping for video contrastive learning

arXiv

引用

arXiv 2021年

作者： Qing, Zhiwu Huang, Ziyuan Zhang, Shiwei Tang, Mingqian Gao, Changxin Ang, Marcelo H. Jin, Rong Sang, Nong Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China ARC National University of Singapore Singapore Alibaba Group China

The central idea of contrastive learning is to discriminate between different instances and force different views from the same instance to share the same representation. To avoid trivial solutions, augmentation plays an important role in generating different views, among which random cropping is shown to be effective for the model to learn a generalized and robust representation. Commonly used random crop operation keeps the distribution of the difference between two views unchanged along the training process. In this work, we show that adaptively controlling the disparity between two augmented views along the training process enhances the quality of the learned representations. Specifically, we present a parametric cubic cropping operation, ParamCrop, for video contrastive learning, which automatically crops a 3D cubic by differentiable 3D affine transformations. ParamCrop is trained simultaneously with the video backbone using an adversarial objective and learns an optimal cropping strategy from the data. The visualizations show that ParamCrop adaptively controls the center distance and the IoU between two augmented views, and the learned change in the disparity along the training process is beneficial to learning a strong representation. Extensive ablation studies demonstrate the effectiveness of the proposed ParamCrop on multiple contrastive learning frameworks and video backbones. Copyright © 2021, The Authors. All rights reserved.

关键词： Crops

来源：评论

学校读者我要写书评

暂无评论

Memristor-based multilayer neural network with edge learning and weight update

引用

Neurocomputing 2025年 647卷

作者： Ningye Jiang Jupeng Xie Mingxuan Jiang Haoen Huang Zhigang Zeng School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan 430074 China Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan 430074 China

Memristor crossbar array (MCA) is a promising computing-in-memory architecture for accelerating vector-matrix multiplication (VMM). However, existing memristor-based circuits primarily perform forward computations without local learning capabilities. To address the issue, a memristor-based multilayer neural network (MNN) with edge learning is proposed, enabling error backpropagation and one-step weight update. In particular, the overall circuit design of a three-layer MNN is outlined, comprising three operational stages: forward computation, backpropagation, and weight update. Subsequently, the schematics of four adopted circuit blocks are detailed. By integrating the memory and weight update blocks with MCA, the proposed three-layer memristor-based MNN exhibits scalability and universality, allowing it to be extended to the deep neural network (DNN) architecture. Circuit simulations validate the effectiveness of the proposed scheme, while offline-online co-simulations demonstrate its strength in compensating for variations and non-ideal characteristics of physical devices. Comparative results further highlight the advantages of the proposed scheme in realizing full-analog edge learning circuits and performing error backpropagation processes efficiently.

关键词： Analog circuit design Computing-in-memory Edge learning Memristor crossbar array (MCA) Multilayer neural network

来源：评论

学校读者我要写书评

暂无评论

Causal Invariant Hierarchical Molecular Representation for Out-of-distribution Molecular Property Prediction

Causal Invariant Hierarchical Molecular Representation for O...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xinlong Wen Yifei Guo Shuoying Wei Wenhan Long Lida Zhu Rongbo Zhu Huazhong Agricultural University Wuhan China College of Informatics Huazhong Agricultural University Wuhan China Shenzhen Institute of Nutrition and Health Huazhong Agricultural University Shenzhen China Shenzhen Branch Guangdong Laboratory for Lingnan Modern Agriculture Genome Analysis Laboratory of the Ministry of Agriculture and Agricultural Genomics Institute at Shenzhen Chinese Academy of Agricultural Sciences Shenzhen China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China Huazhong University of Science and Technology Wuhan China Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Molecular representation learning is widely used in the field of drug discovery, due to its ability to accurately capture the complex features of compounds in high-dimensional space. However, existing molecular representation learning models are prone to be influenced by spurious parts during distribution shifts (also known as out-of-distribution, or OOD), which results in models mistakenly treating these spurious parts as crucial features of molecules, thereby limiting the generalization capability of the models. To tackle this issue, a novel invariant molecular representation learning model, called Causal Invariant Hierarchical Molecular Representation Graph Neural Networks (CHiMoGNN), is proposed for OOD molecular property prediction. In CHiMoGNN, a Feature Enhancement (FE) module is designed to leverage the multi-level molecular parts to enhance the expression of invariant features, thereby enhancing the model’s capability to capture key molecular information. In addition, a Cartesian Product based Environmental Impact (EI) module is adopted to generate counterfactual samples with environmental diversity. Consequently, these samples are utilized to train a classifier that maintains consistent performance across various environments. Extensive experiments on seven real-world datasets demonstrate that CHiMoGNN outperforms 9 state-of-the-art models, achieving a 5.73% increase in average ROC-AUC, and the results also show that CHiMoGNN can effectively maintain generalization in various distribution shifts. Code and datasets are available at https://***/Chertuion/CHiMoGNN.

关键词： Representation learning Limiting Codes Predictive models Feature extraction Iron Graph neural networks Drug discovery Data mining Compounds

来源：评论

学校读者我要写书评

暂无评论

Head-free,Human Gaze-driven Assistive Robotic System for Reaching and Grasping

Head-free,Human Gaze-driven Assistive Robotic System for Rea...

引用

第40届中国控制会议

作者： Bo Yang Jian Huang Menglin Sun Jun Huo Xiaolong Li Caihua Xiong The Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of Science and Technology the School of Mechanical Science and Engineering and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology

Patients with limb dysfunction have limited mobility,which prevents them from performing daily *** have developed an assistive robot system with an intuitive head free gaze *** system consists of multiple modules,including 3 D gaze estimation,head free coordinate transformation,intention recognition,and robot trajectory *** robotic assistive system obtains clues from the user’s gaze to decode their intentions and implement *** allows the user only needs to look at the objects to make the robot system reach,grasp,and bring them to the *** 3 D gaze estimation is evaluated with 5 subjects,showing an overall accuracy of 5.53±1.2 *** integrated system’s experimental results show that the success rate is 96% in the implementation of automatic trajectory planning,and the success rate is 92% in the implementation of fixation-based trajectory ***,the results and work required to improve the system are discussed.

关键词： 3D gaze estimation Intention estimation Gaze-based control Assistive robot

来源：评论

学校读者我要写书评

暂无评论

Large-scale Multiobjective Optimization via Problem Decomposition and Reformulation

Large-scale Multiobjective Optimization via Problem Decompos...

引用

Congress on Evolutionary Computation

作者： Lianghao Li Cheng He Ran Cheng Linqiang Pan Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

Large-scale multiobjective optimization problems (LSMOPs) are challenging for existing approaches due to the complexity of objective functions and the massive volume of decision space. Some large-scale multiobjective evolutionary algorithms (LSmoeAs) have recently been proposed, which have shown their effectiveness in solving some benchmarks and real-world applications. They merely focus on handling the massive volume of decision space and ignore the complexity of LSMOPs in terms of objective functions. The complexity issue is also important since the complexity grows along with the increment in the number of decision variables. Our previous study proposed a framework to accelerate evolutionary large-scale multiobjective optimization via problem reformulation for handling large-scale decision variables. Here, we investigate the effectiveness of LSMOF combined with decomposition-based moeA (moeA/D), aiming to handle the complexity of LSMOPs in both the decision and objective spaces. Specifically, moeA/D is embedded in LSMOF via two different strategies, and the proposed algorithm is tested on various benchmark LSMOPs. Experimental results indicate the encouraging performance improvement benefited from the solution of the complexity issue in large-scale multiobjective optimization.

关键词： Sociology Evolutionary computation Benchmark testing Linear programming Complexity theory Statistics Optimization

来源：评论

学校读者我要写书评

暂无评论

Do Not Disturb Me: Person Re-identification Under the Interference of Other Pedestrians 16th

Do Not Disturb Me: Person Re-identification Under the Interf...

引用

16th European Conference on Computer Vision, ECCV 2020

作者： Zhao, Shizhen Gao, Changxin Zhang, Jun Cheng, Hao Han, Chuchu Jiang, Xinyang Guo, Xiaowei Zheng, Wei-Shi Sang, Nong Sun, Xing Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Tencent Youtu Lab Shanghai China Sun Yat-sen University Guangzhou China

ISBN: (纸本)9783030585389

In the conventional person Re-ID setting, it is assumed that cropped images are the person images within the bounding box for each individual. However, in a crowded scene, off-shelf-detectors may generate bounding boxes involving multiple people, where the large proportion of background pedestrians or human occlusion exists. The representation extracted from such cropped images, which contain both the target and the interference pedestrians, might include distractive information. This will lead to wrong retrieval results. To address this problem, this paper presents a novel deep network termed Pedestrian-Interference Suppression Network (PISNet). PISNet leverages a Query-Guided Attention Block (QGAB) to enhance the feature of the target in the gallery, under the guidance of the query. Furthermore, the involving Guidance Reversed Attention Module and the Multi-Person Separation Loss promote QGAB to suppress the interference of other pedestrians. Our method is evaluated on two new pedestrian-interference datasets and the results show that the proposed method performs favorably against existing Re-ID methods. © 2020, Springer Nature Switzerland AG.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Decoupled and memory-reinforced networks: Towards effective feature learning for one-step person search

arXiv

引用

arXiv 2021年

作者： Han, Chuchu Zheng, Zhedong Gao, Changxin Sang, Nong Yang, Yi Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China ReLER University of Technology Sydney Australia Baidu Research China

The goal of person search is to localize and match query persons from scene images. For high efficiency, one-step methods have been developed to jointly handle the pedestrian detection and identification sub-tasks using a single network. There are two major challenges in the current one-step approaches. One is the mutual interference between the optimization objectives of multiple sub-tasks. The other is the sub-optimal identification feature learning caused by small batch size when end-to-end training. To overcome these problems, we propose a decoupled and memory-reinforced network (DMRNet). Specifically, to reconcile the conflicts of multiple objectives, we simplify the standard tightly coupled pipelines and establish a deeply decoupled multi-task learning framework. Further, we build a memory-reinforced mechanism to boost the identification feature learning. By queuing the identification features of recently accessed instances into a memory bank, the mechanism augments the similarity pair construction for pairwise metric learning. For better encoding consistency of the stored features, a slow-moving average of the network is applied for extracting these features. In this way, the dual networks reinforce each other and converge to robust solution states. Experimentally, the proposed method obtains 93.2% and 46.9% mAP on CUHK-SYSU and PRW datasets, which exceeds all the existing one-step methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Tight Formulations of Unit Commitment with General Start-Up Ramp Rate Constraints

Tight Formulations of Unit Commitment with General Start-Up ...

引用

Sustainable Power and Energy Conference (iSPEC)

作者： Yijie Gao Xuan Zhang Yaowen Yu Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Hitachi ABB Power Grid San Jose California US

ISBN: (纸本)9781665414401

Unit commitment (UC) is a central market clearing process in wholesale electricity markets. With the increasing size and complexity of market-clearing models, UC problems become more and more complicated. To improve the computation efficiency, this paper tightens UC formulations with the general start-up ramp rate. Through analyzing their parameters over three periods, units are categorized into several categories for constructing corresponding tight formulations, and three of the categories are beyond existing works. By applying a recent systematic formulation tightening approach on top of these categories, new tight constraints of the general start-up ramp rate have been obtained. Numeral testing results illustrate the tightening process and demonstrate the improvement of computational efficiency when using our tightened formulations.

关键词： Systematics Computational modeling Conferences Electricity supply industry Computational efficiency Complexity theory Testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：