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

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Kun Hu Mingyu Cao Mengzhu Wang Long Lan Wenjing Yang Huibin Tan Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China

Discriminative correlation filter (DCF) is a highly efficient tracking technique using the circulant shifted samples of search images to update the template, so the reliability of input samples determines template quality. In this paper, we rethink the reliability problem of input samples in advance during template updating and propose an enhanced DCF tracking method regularized by a novel sparse representation based reliable sample construction term, called enhanced sparse correlation filter (ESCF). Specifically, the reconstructed reliable samples are the sparse representation of circulant shifted samples of unfiltered input samples, in which the target will approach the center to preserve target visual cues into the template when using the cosine window. Besides, we jointly perform template learning and reliable sample construction into a unified learning paradigm to benefit from each other, which further can be carried out in the frequency domain without incurring excessive time cost by skillful decomposition. Experiments on several popular visual tracking datasets verify the efficacy of ESCF and show that ESCF performs favorably against several well-established representative counterparts.

关键词： Training Visualization Correlation Costs Target tracking Frequency-domain analysis Signal processing

来源：评论

学校读者我要写书评

暂无评论

Decomposition, Interaction, Reconstruction Meets Global Context Learning In Visual Tracking

Decomposition, Interaction, Reconstruction Meets Global Cont...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Huibin Tan Kun Hu Mingyu Cao Mengzhu Wang Liyang Xu Wenjing Yang Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China

Tensor decomposition and reconstruction attention is a promising global context learning approach because it can remain efficient while avoiding feature compression. To exploit its potential even further in visual tracking, we redesign a 3D tensor modeling paradigm, namely tensor Decomposition, Interaction, Reconstruction attention (DIR), respectively corresponding to three function components, Tensor Decomposition Module (TDM), Tensor Interaction Module (TIM) and Context Reconstruction Module (CRM). Specifically, TDM decomposes a 3D tensor feature into rank-1 context fragments in different dimension views. The ingenuity here lies in the introduction of Circular Convolution for processing features at arbitrary scales and channel-sharing segments to enhance the interaction of the two branches in the Siamese network architecture. TIM obtains the tensor planes of each dimension by the Cross-Similarity operation of rank-1 tensors and fused cubic features, which brings more interactions between all feature dimensions. CRM reconstructs 3D context representations with the outputs of the above modules. In experiments, DIR is embedded into the tracker to verify its effectiveness.

关键词： Visualization Tensors Three-dimensional displays Target tracking Convolution Customer relationship management Time division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Task2Morph: Differentiable Task-Inspired Framework for Contact-Aware Robot Design

Task2Morph: Differentiable Task-Inspired Framework for Conta...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Yishuai Cai Shaowu Yang Minglong Li Xinglin Chen Yunxin Mao Xiaodong Yi Wenjing Yang State Key Laboratory of High Performance Computing Institute for Quantum Information College of Computer Science and Technology National University of Defense Technology Changsha China

Optimizing the morphologies and the controllers that adapt to various tasks is a critical issue in the field of robot design, aka. embodied intelligence. Previous works typically model it as a joint optimization problem and use search-based methods to find the optimal solution in the morphology space. However, they ignore the implicit knowledge of task-to-morphology mapping which can directly inspire robot design. For example, flipping heavier boxes tends to require more muscular robot arms. This paper proposes a novel and general differentiable task-inspired framework for contact-aware robot design called Task2Morph. We abstract task features highly related to task performance and use them to build a task-to-morphology mapping. Further, we embed the mapping into a differentiable robot design process, where the gradient information is leveraged for both the mapping learning and the whole optimization. The experiments are conducted on three scenarios, and the results validate that Task2Morph outperforms DiffHand, which lacks a task-inspired morphology module, in terms of efficiency and effectiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Memory-based Exploration-value Evaluation Model for Visual Navigation

Memory-based Exploration-value Evaluation Model for Visual N...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Yongquan Feng Liyang Xu Minglong Li Ruochun Jin Da Huang Shaowu Yang Wenjing Yang Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China

We propose a hierarchical visual navigation solution, called Memory-based Exploration-value Evaluation Model (MEEM), to improve the agent's navigation performance. MEEM employs a hierarchical policy to tackle the challenge of sparse rewards, holds an episodic memory to store the historical information of the agent, and applies an Exploration-value Evaluation Model to calculate an exploration-value for action planning at each location in the observable area. We experimentally verify MEEM by navigation performance comparison on two datasets including the grid-map dataset and the 3D scenes Gibson dataset, where our approach achieves state-of-the-art performance on both. Specifically, the overall success rate of MEEM is 95% on the grid-map dataset while the best competitor reaches 68% only. As for the Gibson dataset, the success rate of ours and the best competitor SemExp are 69.8% and 54.4%, respectively. Ablation analysis on the tile-map dataset indicates that all three components of MEEM have positive effects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrating Velox into TinkerPop for Graph Queries on Vectorized Engine

Integrating Velox into TinkerPop for Graph Queries on Vector...

引用

Electronic Information Engineering and Computer technology (EIECT), International Conference on

作者： Zihao Li Liyang Xu Ruochun Jin Huan Chen Yuhua Tang Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China

To enhance the query efficiency of relational databases and build a unified computing backend, Meta has developed Velox, a vectorized execution engine library based on columnar storage, Currently, there is no standardized specification for computation engine, and storage in graph databases, leading to failed to effectively utilize the vectorized processing capability of modern CPU. In this paper, we propose a middleware that primarily focuses on (1) non-invasively integrating Velox into the TinkerPop framework to provide unified vectorized engine acceleration for all graph databases supporting the TinkerPop specification; (2) conducting graph queries based on the relational data storage model, eliminating the overhead of transforming the storage model into a graph storage model; (3) validating the acceleration effect of the vectorized engine on interactive workload of graph queries under a single-node environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OL-CBBA: An Online Task Allocation Algorithm under Weak Communication Conditions

OL-CBBA: An Online Task Allocation Algorithm under Weak Comm...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Jun Li Wanrong Huang Honglin Wu Zhongxuan Cai Yongjun Zhang Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China

Multiple unmanned aerial vehicles (UAVs) and multiple tasks allocation problem is difficult to solve. Existing task allocation algorithms assume that the UAVs’ position is static, and cannot assign tasks with the changing UAVs’ position simultaneously during task execution. Those algorithms reduce the efficiency of task allocation. In this paper, we propose an online consensus-based bundle algorithm (OL-CBBA) under weak communication for dynamic task allocation. We consider the situation that the location information of UAVs will constantly change during the dynamic execution of tasks. The algorithm first improves the static CBBA to an online algorithm by updating the task marginal score in task path. Moreover, we specify a flag for the convergence of individual tasks, allowing UAVs to start executing tasks earlier. Extensive comparative experiments prove the highly consistent efficiency of OL-CBBA under weak communication conditions. Specifically, the proposed OL-CBBA attains up to 22% improvement compared with CBBA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic properties of a class of van der Pol-Duffing oscillators

arXiv

引用

arXiv 2024年

作者： Kuang, Yelei Li, Xuemei Key Laboratory of High Performance Computing and Stochastic Information Processing Department of Mathematics Hunan Normal University Hunan Changsha410081 China

In this paper, we study the existence of bifurcation of a van der Pol-Duffing oscillator with quintic terms and its quasi-periodic solutions by means of qualitative and bifurcation theories. Firstly, we analyze the autonomous system and find that it has two kinds of local bifurcations and a global bifurcation: pitchfork bifurcation, Hopf bifurcation, homoclinic bifurcation. It is worth noting that the disappearance of the homoclinic orbit is synchronized with the emergence of a large limit cycle. Then, by discussing the stability of equilibria at infinity and the orientation of the trajectory, the existence and stability of limit circles of the autonomous system are analyzed by combining the Poincaré-Bendixson theorem and the index theory. The global phase portrait and the numerical simulation of the autonomous system in different parameter values are given. Finally, the existence of periodic and quasi-periodic solutions to periodic forced system is proved by a KAM theorem. © 2024, CC BY.

关键词： Hopf bifurcation

来源：评论

学校读者我要写书评

暂无评论

TOWARDS RADAR EMITTER RECOGNITION IN CHANGING ENVIRONMENTS WITH DOMAIN GENERALIZATION

arXiv

引用

arXiv 2023年

作者： Wu, Honglin Li, Xueqiong Lan, Long Xu, Liyang Tang, Yuhua Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China

Analyzing radar signals from complex Electronic Warfare (EW) environment is a non-trivial task. However, in the real world, the changing EW environment results in inconsistent signal distribution, such as the pulse repetition interval (PRI) mismatch between different detected scenes. In this paper, we propose a novel domain generalization framework to improve the adaptability of signal recognition in changing environments. Specifically, we first design several noise generators to simulate varied scenes. Different from conventional augmentation methods, our introduced generators carefully enhance the diversity of the detected signals and meanwhile maintain the semantic features of the signals. Moreover, we propose a signal scene domain classifier that works in the manner of adversarial learning. The proposed classifier guarantees the signal predictor to generalize to different scenes. Extensive comparative experiments prove the proposed method’s superiority. Copyright © 2023, The Authors. All rights reserved.

关键词： Electronic warfare

来源：评论

学校读者我要写书评

暂无评论

Effect of thickness variations of lithium niobate on insulator waveguide on the frequency spectrum of spontaneous parametric down-conversion

引用

Chinese Physics B 2021年第11期30卷 268-273页

作者： Guang-Tai Xue Xiao-Hui Tian Chi Zhang Zhenda Xie Ping Xu Yan-Xiao Gong Shi-Ning Zhu National Laboratory of Solid State Microstructures School of PhysicsSchool of Electronic Science and EngineeringCollege of Engineering and Applied Sciencesand Collaborative Innovation Center of Advanced MicrostructuresNanjing UniversityNanjing 210093China Institute for Quantum Information and State Key Laboratory of High Performance Computing College of ComputingNational University of Defense TechnologyChangsha 410073China

We study the effect of waveguide thickness variations on the frequency spectrum of spontaneous parametric downconversion in the periodically-poled lithium niobate on insulator(LNOI)*** analyze several variation models and our simulation results show that thickness variations in several nanometers can induce distinct effects on the central peak of the spectrum,such as narrowing,broadening,and *** also prove that the effects of positive and negative variations can be canceled and thus lead to a variation-robust feature and an ultra-broad *** study may promote the development of on-chip photon sources in the LNOI platform,as well as opens up a way to engineer photon frequency state.

关键词： lithium niobate on insulator spontaneous parametric down-conversion waveguide thickness variation frequency spectrum

来源：评论

学校读者我要写书评

暂无评论

CoChain: high Concurrency Blockchain Sharding via Consensus on Consensus 42

CoChain: High Concurrency Blockchain Sharding via Consensus ...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Li, Mingzhe Lin, You Zhang, Jin Wang, Wei Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Research Institute of Trustworthy Autonomous Systems Computer Science and Engineering Department China Hong Kong University of Science and Technology Computer Science and Engineering Department Hong Kong Institute of High Performance Computing and Agency for Science Technology and Research Singapore

ISBN: (纸本)9798350334142

Sharding is an effective technique to improve the scalability of blockchain. It splits nodes into multiple groups so that they can process transactions in parallel. To achieve higher parallelism and concurrency at large scales, it is desirable to maintain a large number of small shards. However, simply configuring small shards easily results in a higher fraction of malicious nodes inside shards, causing shard corruption and compromising system security. Existing sharding techniques hence demand large shards, at the expense of limited concurrency. To address this limitation, we propose CoChain: a blockchain sharding system that can securely configure small shards for enhanced concurrency. CoChain allows some shards to be corrupted. For security, each shard is monitored by multiple other shards. The latter reach a cross-shard Consensus on the Consensus results of their monitored shard. Once a corrupted shard is found, its subsequent consensus will be taken over by another shard, hence recovering the system. Via Consensus on Consensus, CoChain allows the existence of shards with more fraction of malicious nodes ( © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：