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

Local to global Tracker: A Siamese Network for Long-term Tracking

Journal of Physics: Conference Series 2022年第1期2216卷

作者： Ya Yang Xinyu Zhou KaiXun Jiang XiaoNan Hou ChunLei Wang WenQiang Zhang The 21st Research Institute of China Electronics Technology Group Corporation Shanghai China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China

Visual object tracking is a basic task in computer vision, which can be applied to different applications. Former methods of single object tracking problem demands to perform target state estimation according to object position of previous frame, but these methods are poorly capable of handling the fast movement of the target. In this paper, we introduce a Siamese network for single object tracking task. The network consists of two branches, one of which is the classification branch used to predict positive or negative samples, and the other is the regression branch used to predict the specific location of the object in sequence. In addition, we propose a local to global algorithm for long-term tracking to expand the search region when the target is out-of-view or full occlusion. Experiments show that our tracker achieves very promising results on VOT2018LT datasets while running at over 89 FPS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Surface Charging Phenomena on HVDC Spacers for Compressed SF_(6) Insulation and Charge Tailoring Strategies

引用

CSEE Journal of Power and Energy Systems 2020年第1期6卷 83-99页

作者： Chuanyang Li Yuan Xu Chuanjie Lin Geng Chen Youping Tu Yao Zhou Zhipeng Lei Tao Han Simone Vincenzo Suraci Jian Wang Weidong Liu M.Tariq Nazir Shun He Andrea Cavallini Giovanni Mazzanti Davide Fabiani Jinliang He Electrical Insulation Research Center Institute of Materials ScienceElectrical and Computer EngineeringUniversity of ConnecticutStorrsCT 06269USA. China Electric Power Research Institute Beijing 100192China Department of Electrical Electronicand Information Engineering“Guglielmo Marconi”University of BolognaViale Risorgimento 2Bologna40136Italy State Key Laboratory of Power Systems Department of Electrical EngineeringTsinghua UniversityBeijing 100084China Beijing Area Major Laboratory of High Voltage and Electromagnetic Compatibility North China Electric Power UniversityBeijing 102206China Shanxi Key Laboratory of Mining Electrical Equipment and Intelligent Control National and Provincial Joint EngineeringTaiyuan University of TechnologyTaiyuan 030024China Key Laboratory of Smart Grid of Education Ministry School of Electrical and Information EngineeringTianjin UniversityTianjin 300072China School of Mechanical and Manufacturing Engineering University of New South Wales SydneyNSW 2052Australia Electric Power Research Institute Yunnan Electric Power Grid Co.ltd.KunmingYunnan 650217China

Surface flashover of spacers is a key factor limiting the application of HVDC GIS/GIL,while the charge accumula-tion on the surface of the spacer could have a potential adverse effect on the surface flashover *** paper discusses the laws regarding distribution patterns of surface charges and the related *** field-dependent property is discussed in detail to comprehensively illustrate the charge transport mecha-nism and explain the research differences regarding different surface charge patterns obtained by previous *** addition,the main surface charge control methods for epoxy resin are summarized and *** potential research directions of charge control methods and key points in manufacturing of spacers used in HVDC GIS/GIL are also explored.

关键词： GIL HVDC insulator SF6 surface charge accumulation surface flashover

来源：评论

学校读者我要写书评

暂无评论

Open-world Weakly-Supervised Object Localization

引用

Pattern Recognition 2026年 169卷

作者： Jinheng Xie Zhaochuan Luo Rouyi Li Yawen Huang Haozhe Liu Yuexiang Li Yefeng Zheng Yang Zhang Linlin Shen Mike Zheng Shou Computer Vision Institute School of Artificial Intelligence Shenzhen University Shenzhen 518060 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen 518060 China The Jarvis Research Center Tencent YouTu Lab Shenzhen 518057 China National University of Singapore Singapore 639798 Singapore Shenzhen Power Supply Bureau Co. Ltd. ShenZhen 518000 China

While remarkable success has been achieved in weakly supervised object localization (WSOL), current frameworks are not capable of locating objects of novel categories in open-world settings. To address this issue, we are the first to introduce a new weakly supervised object localization task called Open-world Weakly Supervised Object Localization ( OWSOL ). During training, all labeled data comes from known categories and, both known and novel categories exist in the unlabeled data. To handle such data, we propose a novel paradigm of contrastive representation co-learning using both labeled and unlabeled data to perform Generalized Class Activation Mapping ( GCAM ) for object localization, without the requirement of bounding box annotation. As no class label is available for the unlabeled data, we conduct clustering over the full training set and design a novel multiple semantic centroids-driven contrastive loss for representation learning. We re-organize two widely used datasets, i.e., ImageNet-1K and iNatLoc500, and propose OpenImages150 to serve as evaluation benchmarks for OWSOL. Extensive experiments demonstrate that the proposed method can surpass all baselines by a large margin. We believe that this work can shift the close-set localization towards the open-world setting and serve as a foundation for subsequent works. The code and dataset are available at https://***/ryylcc/OWSOL .

关键词：

来源：评论

学校读者我要写书评

暂无评论

Varying control intensity of synchronized chaotic system with time delay

Varying control intensity of synchronized chaotic system wit...

引用

2020 International Symposium on Automation, information and Computing, ISAIC 2020

作者： Onasanya, Babatunde O. Wen, Shiping Feng, Yuming Zhang, Wei Tang, Ning Ademola, Adeleke T. Key Laboratory of Intelligent Information Processing and Control Chongqing Three Gorges University Wanzhou Chongqing404100 China Department of Mathematics University of Ibadan Ibadan Nigeria Australian AI Institute University of Technology Sydney UltimoNSW2007 Australia School of Computer Science and Engineering Chongqing Three Gorges University Wanzhou Chongqing404100 China Chongqing Engineering Research Center of Internet of Things and Intelligent Control Technology Chongqing Three Gorges University Wanzhou Chongqing404100 China School of Three Gorges Artificial Intelligence Chongqing Three Gorges University Wanzhou Chongqing404100 China Department of Mathematics Obafemi Awolowo University Post Code Ile-Ife220005 Nigeria

Hyperchaotic system is a very useful tool in secure and encrypted communications. But situations arise when engineers and scientists seek to synchronize two hyperchaotic systems. This gives another (error) system. The goal is to minimize the error as much as can be in order to make one system look like the other by synchronization. This is a particularly challenging situation. In this paper, two hyperchaotic systems are synchronized by impulsive control. Also, the condition for uniform asymptotic stability of the synchronized error system was given. Finally, the simulation results to justify the reliability of this method is also presented. © 2021 Institute of Physics Publishing. All rights reserved.

关键词： Chaotic systems

来源：评论

学校读者我要写书评

暂无评论

Efficiency and bandwidth improvement of integrated acousto-optic modulators using dielectric acoustic reflectors

引用

APL Photonics 2025年第5期10卷

作者： Liu, Huilong Huang, Jiying Jiang, Jiantao Huang, Hongyi Chen, Huipeng Chen, Chengyu La, Haiwei Li, Huan Xu, Xiaochun Chen, Yuping Li, Zhaohui Wan, Lei School of Physics Ningxia University Yinchuan750021 China Department of Electronic Engineering College of Information Science and Technology Jinan University Guangzhou510632 China State Key Laboratory of Photonics and Communications School of Physics and Astronomy Shanghai Jiao Tong University Shanghai200240 China State Key Laboratory of Extreme Photonics and Instrumentation Center for Optical and Electromagnetic Research College of Optical Science and Engineering International Research Center for Advanced Photonics Zhejiang University Hangzhou310058 China North Minzu University Yinchuan750030 China Guangdong Provincial Key Laboratory of Optoelectronic Information Processing Chips and Systems Sun Yat-sen University Guangzhou510275 China Zhuhai519000 China

Manipulation and control of traveling surface acoustic waves (SAWs) are critical to the realization of high-performance integrated acousto-optic modulators (AOMs). In this paper, we present the chalcogenide glass (ChG) acoustic reflector-loaded thin-film lithium niobate (TFLN) Mach-Zehnder interferometer (MZI) AOMs with single-arm and single-finger configurations based on the forming mechanism of the acoustic standing wave. Through the engineering of dielectric acoustic reflectors, threefold modulation efficiency improvement is achieved for the TFLN MZI AOM with X-Z orientation, while twofold bandwidth extension is demonstrated for the counterpart with X-30°Y orientation. Propagation loss of the Rayleigh SAW around 0.85 GHz and the reflection coefficient of ChG acoustic grating are measured to be 3.04 dB/mm and 0.34, respectively. Introduction of dielectric acoustic reflectors opens a new pathway to the study of efficient and wideband acousto-optic interaction devices. © 2025 Author(s).

关键词： Light modulation

来源：评论

学校读者我要写书评

暂无评论

Evidence of mini-jet emission in a large emission zone from a magnetically-dominated gamma-ray burst jet

arXiv

引用

arXiv 2023年

作者： Yi, S.-X. Wang, C.-W. Shao, X. Moradi, R. Gao, H. Zhang, B. Xiong, S.-L. Zhang, S.-N. Tan, W.-J. Liu, J.-C. Xue, W.-C. Zhang, Y.-Q. Zheng, C. Wang, Y. Zhang, P. An, Z.-H. Cai, C. Feng, P.-Y. Gong, K. Guo, D.-Y. Huang, Y. Li, B. Li, X.-B. Li, X.-Q. Liu, X.-J. Liu, Y.-Q. Ma, X. Peng, W.-X. Qiao, R. Song, L.-M. Wang, J. Wang, P. Wang, Y. Wen, X.-Y. Xiao, S. Xu, Y.-B. Yang, S. Yi, Q.-B. Zhang, D.-L. Zhang, F. Zhang, H.-M. Zhang, J.-P. Zhang, Z. Zhao, X.-Y. Zhao, Y. Zheng, S.-J. Key Laboratory of Particle Astrophysics Institute of High Energy Physics Chinese Academy of Sciences Beijing100049 China University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing100049 China Department of Astronomy Beijing Normal University Beijing100875 China Nevada Center for Astrophysics University of Nevada Las Vegas NV89154 United States Department of Physics and Astronomy University of Nevada Las Vegas NV89154 United States ICRANet Piazza della Repubblica 10 PescaraI-65122 Italy ICRA Dipartamento di Fisica Sapienza Università di Roma Piazzale Aldo Moro 5 RomeI-00185 Italy INAF Osservatorio Astronomico d’Abruzzo Via M. Maggini snc TeramoI-64100 Italy College of Electronic and Information Engineering Tongji University Shanghai201804 China College of Physics Hebei Key Laboratory of Photophysics Research and Application Hebei Normal University Hebei Shijiazhuang050024 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China School of Physics and Optoelectronics Xiangtan University Yuhu District Hunan Xiangtan411105 China School of Computer and Information Dezhou University Dezhou253023 China

The second brightest GRB in history, GRB230307A, provides an ideal laboratory to study the mechanism of GRB prompt emission thanks to its extraordinarily high photon statistics and its single episode activity. Here we demonstrate that the rapidly variable components of its prompt emission compose an overall broad single pulse-like profile. Although these individual rapid components are aligned in time across all energy bands, this overall profile conspires to show a well-defined energy-dependent behavior which is typically seen in single GRB pulses. Such a feature demonstrates that the prompt emission of this burst is from many individual emitting units that are casually linked in a emission site at a large distance from the central engine. Such a scenario is in natural consistency with the internal-collision-induced magnetic reconnection and turbulence framework, which invokes many mini-jets due to local magnetic reconnection that constantly appear and disappear in a global magnetically-dominated jet. © 2023, CC BY.

关键词： Gamma radiography

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Spectrum Allocation in Cognitive Radio Networks Based on Truthful Online Double Auction Mechanism

引用

Procedia computer Science 2020年 174卷 304-308页

作者： Yue Yan Anming Dong Haili Zheng Yi Sun School of Information Science and Engineering Qufu Normal University Rizhao 276826 China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan 250353 China Computer Science Center (National Supercomputer Center in Jinan) Shandong Provincial Key Laboratory of Computer Networks Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China

Cognitive radio can improve spectrum utilization through spectrum sharing between primary and secondary users, thereby alleviating spectrum scarcity. Spectrum auction is one of the effective methods that can be utilized to achieve spectrum sharing. However, traditional spectrum auction is unable to guarantee the truth of the price given by bidders comprehensively, while neglecting the online characteristics of the buyers request arrival. Existing truthful online auction mechanisms do not consider the privacy leakage problem and fail to provide adequate privacy protection for bidders. In this paper, we propose a privacy-preserving spectrum allocation strategy based on a double online truthful auction mechanism. Specifically, we first propose a critical bid determination algorithm to guarantee the truth of the auction. Then, the channel allocation is modeled as a social welfare maximization optimization problem. Since the problem is NP-hard and it is difficult to solve in polynomial time. We propose a greedy algorithm that can effectively obtain a feasible solution to the problem. An online dynamic accessing mechanism is further designed by considering the arrival of requests of secondary users. Finally, differential privacy is introduced to encrypt sensitive information such as buyers location privacy and time dynamic. Experimental results validate our auction mechanism achieving higher social welfare and spectrum utilization.

关键词： spectrum allocation online auction privacy preservation truthfulness

来源：评论

学校读者我要写书评

暂无评论

A grouping approach based on non-uniform binary grid partitioning for crowd evacuation simulation

A grouping approach based on non-uniform binary grid partiti...

引用

作者： Liu, Hong Li, Yan Li, Wenhao Lu, Dianjie Zhang, Guijuan School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China University of South Australia Adelaide Australia

Small social groups based on kinship or friendships are ubiquitous in human crowds. Therefore, the effect of social groups on crowd evacuations and that of crowd evacuations on social groups must be investigated. To simulate the group phenomenon when an emergency occurs, we propose an improved social force model that takes into account the social group relationship among the population, and based on our proposed model, a novel grouping algorithm predicated on non-uniform binary grid partitioning is put forward. The approach initially maps the individuals into the plane space, and then it adopts top-down binary grid partitioning iteratively until the divided grid contains only the individuals with relations;then, the values of the relation and density of the non-empty grid cells are calculated, and the grids are sorted according to these values. After sorting, selecting, merging, and forming the core grids, the other grids are merged to the core grids. We have compared the algorithm with the hierarchical classification algorithm and the grid-based algorithm. The results show that the accuracy, speed, and scalability are all advantages. We also establish a simulation platform to illustrate the proposed grouping algorithm and the improved social force model for crowd evacuation simulation. © 2018 John Wiley & Sons, Ltd.

关键词： Simulation platform

来源：评论

学校读者我要写书评

暂无评论

Road-Condition-Aware Dynamic Path Planning for Intelligent Vehicles

引用

Procedia computer Science 2020年 174卷 419-423页

作者： Yan Chen Anming Dong Yi Sun School of Information Science and Engineering Qufu Normal University Rizhao 276826 China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan 250353 China Computer Science Center (National Supercomputer Center in Jinan) Shandong Provincial Key Laboratory of Computer Networks Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China

Intelligent vehicles face a more complex driving environment, which requires their path planning algorithms to have the ability to respond quickly to complex environmental changes. Therefore, it is very necessary to plan the optimal path for smart vehicles in real-time. Recently, the convergence of graph dynamics and its equivalence with the shortest path solution have been proved, and the biased minimum consensus algorithm has been successfully applied to the shortest path planning problem. In this paper, considering the road conditions (degree of congestion, whether an accident occurred, etc.) and the Euclidean distance of the route, we improve biased minimum consensus algorithm to achieve optimal path planning in the complex situation of real-time updating of road conditions. In the simulation, we used the algorithm for path planning in the road topological maps of Beijing City, and compared with the RRT (Rapidly-exploring Random Trees Algorithm) algorithm and the BRRT (Bidirectional Rapidly-exploring Random Trees Algorithm) algorithm. The improved biased minimum consensus algorithm has better performance in real-time path planning problems. The research results shed new light on the real-time dynamic path planning in real traffic, which has practical significance.

关键词： Intelligent Vehicle Path Planning Improved Biased Minimum Consensus Algorithm Optimal Path

来源：评论

学校读者我要写书评

暂无评论

Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix

arXiv

引用

arXiv 2021年

作者： Zhou, Xiaotian Wang, Run Li, Wei Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Academy for Engineering and Technology Fudan University Shanghai200433 China Shanghai Engineering Research Institute of Blockchains Fudan University Shanghai200433 China Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China

For a connected graph G = (V, E) with n nodes, m edges, and Laplacian matrix L, a grounded Laplacian matrix L(S) of G is a (n − k) × (n − k) principal submatrix of L, obtained from L by deleting k rows and columns corresponding to k selected nodes forming a set S ⊆ V . The smallest eigenvalue λ(S) of L(S) plays a pivotal role in various dynamics defined on G. For example, λ(S) characterizes the convergence rate of leader-follower consensus, as well as the effectiveness of a pinning scheme for the pinning control problem, with larger λ(S) corresponding to smaller convergence time or better effectiveness of a pinning scheme. In this paper, we focus on the problem of optimally selecting a subset S of fixed k n nodes, in order to maximize the smallest eigenvalue λ(S) of the grounded Laplacian matrix L(S). We show that this optimization problem is NP-hard and that the objective function is non-submodular but monotone. Due to the difficulty to obtain the optimal solution, we first propose a näıve heuristic algorithm selecting one optimal node at each time for k iterations. Then we propose a fast heuristic scalable algorithm to approximately solve this problem, using derivative matrix, matrix perturbations, and Laplacian solvers as tools. Our näıve heuristic algorithm takes ˜O(knm) time, while the fast greedy heuristic has a nearly linear time complexity of ˜O(km), where ˜O(・) notation suppresses the poly(log n) factors. We also conduct numerous experiments on different networks sized up to one million nodes, demonstrating the superiority of our algorithm in terms of efficiency and effectiveness compared to baseline methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：