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

Visual Object Tracking via Cascaded RPN Fusion and Coordinate Attention

Computer Modeling in Engineering & sciences 2022年第9期132卷 909-927页

作者： Jianming Zhang Kai Wang Yaoqi He Lidan Kuang School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha410114China

Recently,Siamese-based trackers have achieved excellent performance in object ***,the high speed and deformation of objects in the movement process make tracking ***,we have incorporated cascaded region-proposal-network(RPN)fusion and coordinate attention into Siamese *** proposed network framework consists of three parts:a feature-extraction sub-network,coordinate attention block,and cascaded RPN *** exploit the coordinate attention block,which can embed location information into channel attention,to establish long-term spatial location dependence while maintaining channel ***,the features of different layers are enhanced by the coordinate attention *** then send these features separately into the cascaded RPN for classification and *** to the two classification and regression results,the final position of the target is *** verify the effectiveness of the proposed method,we conducted comprehensive experiments on the OTB100,VOT2016,UAV123,and GOT-10k *** with other state-of-the-art trackers,the proposed tracker achieved good performance and can run at real-time speed.

关键词： Object tracking deep learning coordinate attention cascaded RPN

来源：评论

学校读者我要写书评

暂无评论

Fast Multivariate Time Series Anomaly Detection Based on Matrix Completion

Fast Multivariate Time Series Anomaly Detection Based on Mat...

引用

2023 International Conference on Frontiers of Robotics and Software Engineering, FRSE 2023

作者： He, Shiming Yi, Tongzhijian Yang, Bo Guo, Chenxi Changsha University of Science & Technology School of Computer and Communication Engineering The Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha China

ISBN: (纸本)9798350301113

Increasingly complex systems contain large numbers of devices that generate great number of multivariate time series that are monitored and recorded. For anomaly detection of these complex time series, deep learning technology is often used to build a learning model for anomaly detection. The method based on deep learning usually takes a long time to train data in practice, and the online service system is deployed or changed very frequently, which makes the online service system need to frequently spend a lot of time updating the anomaly detection model. To overcome this challenge, this paper proposes a fast multivariate time series anomaly detection (FMAD) approach based on matrix completion. After sampling the primitive low-rank matrix, FMAD uses matrix completion to reconstruct the original low-rank matrix to detect anomalies in multivariate time series. We conducted related experimental analysis and discussion. The experimental results on three real data sets show that FMAD has improved the problem of too long model training time and improved the detection efficiency. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Dynamic Task Scheduling for Coordinated Truck-Drone Parcel Delivery: A Hybrid Genetic Tabu Algorithm Approach 22

Dynamic Task Scheduling for Coordinated Truck-Drone Parcel D...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Li, Ruitai Yuan, Quan Liao, Tongxin Luo, Lijun Hu, Menglan Lai, Pan Zhang, Xiao South-Central Minzu University College of Computer Science China State Ethnic Affairs Commission Key Laboratory of Cyber-Physical Fusion Intelligent Computing China Huazhong University of Science and Technology School of Electronic Information and Communications China Hubei Key Laboratory of Smart Internet Technology China

ISBN: (纸本)9798331509712

With the rapid growth of the on-demand economy, logistics companies and merchants increasingly struggle to meet customer demands in dynamic and uncertain conditions. This paper studies the coordinated delivery of parcels by trucks and drones under such demands, proposing a Dynamic Task Scheduling Algorithm based on Hybrid Genetic Tabu algorithm (DTSAGT) for route optimization. Simulating dynamic customer demands with a Poisson distribution and statistical methods, the algorithm addresses timeliness issues due to variations in customer needs. It optimizes drone path planning and task allocation considering drone endurance and payload limits to minimize total delivery time. The algorithm includes three steps: initial solution construction, iterative optimization, and dynamic operations. Experimental results show that DTSAGT reduces the total service time by 15.05%, 34.13%, and 35.71% on average compared to the baseline algorithms. This paper's contribution is the combination of hybrid genetic and tabu search algorithms applied to dynamic task scheduling in truck-drone delivery, enhancing logistics efficiency. © 2024 IEEE.

关键词： Poisson distribution

来源：评论

学校读者我要写书评

暂无评论

Online Dynamic Scaling of Microservices with Fair Probabilistic Routing 22

Online Dynamic Scaling of Microservices with Fair Probabilis...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Chen, Yang Lin, Shisheng Hu, Yi Wang, Liangyuan Hu, Menglan Lai, Pan Xie, Yuanai College of Computer Science South-Central Minzu University China Key Laboratory of Cyber-Physical Fusion Intelligent Computing State Ethnic Affairs Commission China School of Electronic Information and Communications Huazhong University of Science and Technology China Hubei Key Laboratory of Smart Internet Technology China

ISBN: (纸本)9798331509712

Microservice architecture, as an emerging network architecture, has gained widespread adoption in latency-sensitive applications within the realm of mobile edge computing (MEC). In MEC networks, these latency-sensitive applications necessitate the concurrent processing of numerous service requests, which are composed of microservices. The complex dependencies between microservices and frequent data communication between servers contribute to the intricacy of deploying and routing microservice instances within the network. Moreover, the dynamic and unpredictable nature of service request traffic significantly complicates the timeliness and efficiency of service deployment and request routing strategies. However, existing research predominantly focuses on static network environments and neglects the time-varying characteristics of service request traffic in realistic scenarios. Consequently, we address the joint optimization problem of service deployment and request routing in the presence of dynamic service request traffic. To model the inherent data dependencies and analyze service request response latency, we employ the open Jackson queuing network. We propose a fine-grained microservice dynamic scaling (FMDS) algorithm to capture the dynamic fluctuations in service request traffic within the network. This algorithm scales microservice instances based on the principle of equal proportional change, obtaining a service deployment scheme that minimizes costs while satisfying latency constraints. Furthermore, we introduce a recursive path search algorithm that explores the service deployment scheme to determine the node forwarding probability for the entire network, adhering to the principles of fair routing. Simulation results show that the proposed method effectively improves network latency stability by 75% and enhances the timeliness of the service deployment strategy. © 2024 IEEE.

关键词： microservice request routing service deployment services computing

来源：评论

学校读者我要写书评

暂无评论

Copper-Catalyzed Asymmetric Three-Component Radical 1,2-Carboamination of Acrylamides with Arylamines: Access to Chiral α-Tertiary N-Arylamines

引用

CCS Chemistry 2024年第11期6卷 2652-2661页

作者： Jia-Heng Fang Ji-Jun Chen Xuan-Yi Du Zhe Dong Run-Yan Tian Chang-Jiang Yang Fu-Li Wang Cheng Luan Zhong-Liang Li Xin-Yuan Liu School of Chemistry and Chemical Engineering Harbin Institute of TechnologyHarbin 150001 Shenzhen Grubbs Institute Department of ChemistryGuangming Advanced Research InstituteShenzhen Key Laboratory of CrossCoupling ReactionsSouthern University of Science and TechnologyShenzhen 518055 Department of Chemistry and Dongguan Key Laboratory for Data Science and Intelligent Medicine Great Bay UniversityDongguan 523000 Dongguan Key Laboratory of Interdisciplinary Science for Advanced Materials and Large-Scale Scientific Facilities School of Physical SciencesGreat Bay UniversityDongguan 523000

The asymmetric radical carboamination of 1,1-disubstituted alkenes from readily available alkyl halides and arylamines provides expedient access to valueadded chiralα-tertiary N-arylamines but has been less recognized.A challenge arises mainly from the difficult reaction initiation inherent in alkyl halides and the construction of fully substituted chiral C–N bonds from sterically congested tertiary alkyl ***,we report a copper-catalyzed asymmetric three-component radical carboamination of acrylamides utilizing an anionic chiral N,N,N-ligand under mild *** ligand was essential for the reaction initiation by enhancing the reducing capability of copper and enabling the enantiocontrol over tertiary alkyl *** substrate scope was broad,covering an array of acrylamides,aryl-and heteroaryl-amines,as well as alkyl halides and sulfonyl chlorides,enabling good functional group *** combined with the follow-up transformation,this strategy provides a versatile platform for accessing structurally diverse chiralα-tertiary N-arylamine building blocks of interest in organic synthesis.

关键词： asymmetric catalysis copper alkenes radical reactions chiral amines

来源：评论

学校读者我要写书评

暂无评论

Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite Graph 41

Towards General Algorithm Discovery for Combinatorial Optimi...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Kuang, Yufei Wang, Jie Zhou, Yuyan Li, Xijun Zhu, Fangzhou Hao, Jianye Wu, Feng CAS Key Laboratory of Technology in GIPAS University of Science and Technology of China China MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition University of Science and Technology of China China Noah's Ark Lab Huawei Technologies China College of Intelligence and Computing Tianjin University China

Machine learning (ML) approaches have been successfully applied to accelerating exact combinatorial optimization (CO) solvers. However, many of them fail to explain what patterns they have learned that accelerate the CO algorithms due to the black-box nature of ML models like neural networks, and thus they prevent researchers from further understanding the tasks they are interested in. To tackle this problem, we propose the first graph-based algorithm discovery framework-namely, graph symbolic discovery for exact combinatorial optimization solver (GS4CO)-that learns interpretable branching policies directly from the general bipartite graph representation of CO problems. Specifically, we mainly focus on the variable selection part of the branching policy. We design a unified representation for symbolic variable selection policies with graph inputs, and then we employ a Transformer with multiple tree-structural encodings to generate symbolic trees end-to-end, which effectively reduces the cumulative error from iteratively distilling graph neural networks. Experiments show that GS4CO learned interpretable and lightweight policies outperform all the baselines on CPU machines, including both the human-designed and the learning-based. GS4CO shows an encouraging step towards general algorithm discovery on modern CO solvers. Codes are available at https://***/MIRALab-USTC/L2O-GS4CO. Copyright 2024 by the author(s)

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A Cross-Domain Ontology Semantic Representation Based on NCBI-BlueBERT Embedding

引用

Chinese Journal of Electronics 2022年第5期31卷 860-869页

作者： ZHAO Lingling WANG Junjie WANG Chunyu GUO Maozu Faculty of Computing Harbin Institute of Technology Department of Medical Informatics School of Biomedical Engineering and InformaticsNanjing Medical University Beijing Key Laboratory of Intelligent Processing for Building Big Data School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture

A common but critical task in biological ontologies data analysis is to compare the difference between ontologies. There have been numerous ontologybased semantic-similarity measures proposed in specific ontology domain, but it still remains a challenge for crossdomain ontologies comparison. An ontology contains the scientific natural language description for the corresponding biological aspect. Therefore, we develop a new method based on natural language processing(NLP) representation model bidirectional encoder representations from transformers(BERT) for cross-domain semantic representation of biological ontologies. This article uses the BERT model to represent the word-level of the ontologies as a set of vectors, facilitating the semantic analysis or comparing the biomedical entities named in an ontology or associated with ontology terms. We evaluated the ability of our method in two experiments: calculating similarities of pair-wise disease ontology and human phenotype ontology terms and predicting the pair-wise of proteins interaction. The experimental results demonstrated the comparative performance. This gives promise to the development of NLP methods in biological data analysis.

关键词： human phenotype ontology cross-domain semantic representation natural language description pair-wise disease ontology data analysis bidirectional encoder representations NLP protein interaction diseases proteins natural language processing ontologies (artificial intelligence) natural language processing representation neural nets bioinformatics semantic-similarity measures cross-domain ontology semantic representation semantic analysis NCBI-BlueBERT embedding biological ontology data analysis

来源：评论

学校读者我要写书评

暂无评论

DeepPointMap2: Accurate and Robust LiDAR-Visual SLAM with Neural Descriptors 24

DeepPointMap2: Accurate and Robust LiDAR-Visual SLAM with Ne...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhang, Xiaze Ding, Ziheng Jing, Qi Cheng, Ying Ding, Wenchao Feng, Rui Fudan University Shanghai China The School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University China The Academy for Engineering and Technology Fudan University China The Shanghai Collaborative Innovation Center of Intelligent Visual Computing China

ISBN: (纸本)9798400706868

Simultaneous Localization and Mapping (SLAM) plays a pivotal role in autonomous driving and robotics. Existing methods often rely on hand-craft feature extraction and cross-modal fusion techniques, resulting in limited feature representation capability and reduced robustness. To address this challenge, we introduce DeepPointMap2, a novel learning-based LiDAR-Visual SLAM architecture that leverages neural descriptors to tackle multiple SLAM sub-tasks in a unified manner. Our approach employs neural networks to extract multi-modal tokens, which are then adaptively fused by the Visual-Point Fusion Module to generate sparse 3D neural descriptors, ensuring precise and robust performance. As a pioneering work, our method achieves state-of-the-art localization performance among various Visual-, LiDAR-, and Visual-LiDAR-based methods in widely-used benchmarks, as shown in the experiment results. Furthermore, the approach proves to be robust in scenarios involving camera failure and LiDAR obstruction. © 2024 ACM.

关键词： SLAM robotics

来源：评论

学校读者我要写书评

暂无评论

MFN: Explainable DNA triple helixes Stabilized Design based on mCGR and flow network

MFN: Explainable DNA triple helixes Stabilized Design based ...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Wen, Xiaoru Sun, Lijun Xie, Lei Zheng, Yanfen Cao, Ben Wang, Bin Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian China Dalian University of Technology School of Computer Science and Technology Dalian China

ISBN: (纸本)9798350386226

DNA triple helix structure, as a highly specific gene targeting tool, enable gene regulation by precisely identifying and binding to target DNA sequences. However, the limits of design quality and efficiency affect their wide application in gene therapy. Therefore, in this paper, we propose an antiparallel DNA triple helixes design method-MFN based on matrix chaotic game representation (mCGR) and flow network. Leveraging the structural characteristics of DNA sequences, this method employs the mCGR algorithm to construct an initial matrix, generating a set of DNA sequences that conform to foundational constraints. Then, these sequences are mapped as stream network nodes to screen crosstalk structures by path search, and the whole process is observable and interpretable. Experimental results show that MFN significantly improves the design efficiency of triple helix structure and reduces crosstalk phenomenon. Wet experiments further verify the effectiveness of the method. In summary, MFN achieves an efficient and high-quality design of DNA triple helixes and provides a new idea for targeted gene therapy. © 2024 IEEE.

关键词： Crosstalk

来源：评论

学校读者我要写书评

暂无评论

SynWorld: Virtual Scenario Synthesis for Agentic Action Knowledge Refinement

arXiv

引用

arXiv 2025年

作者： Fang, Runnan Wang, Xiaobin Liang, Yuan Qiao, Shuofei Wu, Jialong Xi, Zekun Zhang, Ningyu Jiang, Yong Xie, Pengjun Huang, Fei Chen, Huajun Zhejiang University China Alibaba Group China Zhejiang Key Laboratory of Big Data Intelligent Computing China

In the interaction between agents and their environments, agents expand their capabilities by planning and executing actions. However, LLM-based agents face substantial challenges when deployed in novel environments or required to navigate unconventional action spaces. To empower agents to autonomously explore environments, optimize workflows, and enhance their understanding of actions, we propose SynWorld, a framework that allows agents to synthesize possible scenarios with multi-step action invocation within the action space and perform Monte Carlo Tree Search (MCTS) exploration to effectively refine their action knowledge in the current environment. Our experiments demonstrate that SynWorld is an effective and general approach to learning action knowledge in new environments.1 Copyright © 2025, The Authors. All rights reserved.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：