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

ISAR Imaging of Targets with Complex Motions Based on the Non-uniformed Sampled Integrated Modified Chirp Rate-Quadratic Chirp Rate Distribution 26

ISAR Imaging of Targets with Complex Motions Based on the No...

引用

26th ACIS International Winter Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed computing, SNPD-Winter 2023

作者： Sun, Zongyang Bai, Linting Xu, Kangfa Xi'an Aeronautics Computing Technique Research Institute Avic Aviation Key Laboratory of Science and Technology on Airborne and Missle-borne Computer Xi'an China

ISBN: (纸本)9798350345865

This paper proposes a new ISAR algorithm for obtaining well-focused images of targets with complex motions in low signal-to-noise ratio (SNR) environments. The algorithm models the echo signals of targets with complex motions as cubic phase signals (CPS) after motion compensations and uses the Non-uniformed Sampled Integrated Modified Chirp Rate-Quadratic Chirp Rate Distribution (NIM-CRQCRD) to estimate CPS parameters. The proposed algorithm compensates the echo signals using the parameter estimates and generates ISAR images of targets with complex motions. Simulation results show that the proposed algorithm has superior anti-noise performance. © 2023 IEEE.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Boosting Meaningful Dependency Mining with Clustering and Covariance Analysis 40

Boosting Meaningful Dependency Mining with Clustering and Co...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Wang, Xi Jin, Ruochun Huang, Wanrong 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 College of Computer Science and Technology Department of Intelligent Data Science National University of Defense Technology Changsha China

ISBN: (纸本)9798350317152

Functional dependencies (FDs) form a valuable ingredient for various data management tasks. However, existing methods can hardly discover practical and interpretable FDs, especially in large noisy real-life datasets. This paper studies the problem of discovering meaningful functional dependencies (FDms) that utilize support and error parameters to capture interesting dependencies in such datasets and proposes an efficient discovery algorithm called FDM?. In order to scale with large datasets, FDM ? employs an efficient sampling method with accuracy guarantees to capture the differences between tuple pairs and to quantify the connection between support/error of dependencies on samples and those on the entire dataset. Moreover, it adopts a clustering-based correlated attributes extraction to divide the exponentially large search space into multiple small sub-spaces and proposes an easy-first traversal strategy with covariance-based guidance that quickly detects candidate dependencies and validates them. Additionally, we prove a covariance lower bound as an additional pruning criterion to reduce the search space. Extensive experiments on real-life and synthetic datasets demonstrate that FDM ? is 14 times faster than existing discovery algorithms on average, up to 31 times, and scales to larger datasets with the least memory cost. © 2024 IEEE.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

DRL-Based Time-Varying Workload Scheduling With Priority and Resource Awareness

引用

IEEE Transactions on Network and Service Management 2025年第3期22卷 2838-2852页

作者： Liu, Qifeng Fan, Qilin Zhang, Xu Li, Xiuhua Wang, Kai Xiong, Qingyu Chongqing University School of Big Data and Software Engineering Chongqing400044 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing400044 China Nanjing University School of Electronic Science and Engineering Nanjing210023 China Haihe Laboratory of Information Technology Application Innovation Tianjin300072 China Harbin Institute of Technology School of Computer Science and Technology Weihai264209 China Shandong Key Laboratory of Industrial Network Security Weihai264209 China

With the proliferation of cloud services and the continuous growth in enterprises' demand for dynamic multi-dimensional resources, the implementation of effective strategy for time-varying workload scheduling has become increasingly significant. In this paper, we propose a deep reinforcement learning (DRL)-based method for time-varying workload scheduling, aiming to allocate resources efficiently across servers in the cluster. Specifically, we integrate a classifier and queue scorer to construct a priority queue that exploits temporal resource utilization patterns across different workload classes. Then, we design parallel graph attention layers to capture the dimensional features and temporal dynamics of cloud server cluster. Moreover, we propose a DRL algorithm to generate scheduling strategies that can adapt to dynamic environments. Validation on real-world traces from Google cluster demonstrates that our method outperforms existing approaches in key metrics of cloud server cluster management. © 2004-2012 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Hybrid particle swarm optimization with adaptive learning strategy

引用

Soft computing 2024年第17-18期28卷 9759-9784页

作者： Wang, Lanyu Tian, Dongping Gou, Xiaorui Shi, Zhongzhi School of Mathematics and Information Sciences Baoji University of Arts and Science Shaanxi Baoji721007 China Institute of Computer Software Baoji University of Arts and Sciences Shaanxi Baoji721007 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Particle swarm optimization (PSO) is a meta-heuristic algorithm that can be used to solve different real-world optimization problems. However, PSO suffers from some intrinsic drawbacks, including falling into local optimal and slow convergence in the latter evolution process. To deal with these issues, a hybrid PSO with adaptive learning strategy (abbreviated as HPSO-ALS) is proposed in this paper. To start with, the chaotic opposition-learning method is employed to generate the uniformly distributed particles so as to enhance the quality of the initial swarm. Next, a self-logical mapping-based nonlinear decreasing inertia weight is formulated to trade off the global search and local search abilities. Meanwhile, different adaptive position updating strategies are leveraged to achieve better convergence according to different evolution status. In addition, inspired by the cask effect, the global worst particle (gworst) is introduced into the velocity updating to make full use of the potential information of the particles. Finally, extensive experiments on sixteen benchmark functions and CEC’13 test suite have verified the promising performance of HPSO-ALS proposed in this paper. Alternatively, HPSO-ALS is also applied to the classical traveling salesman problem (TSP) and the experimental results have further validated the effectiveness and efficiency of our proposal. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

DSAFF-Net:A Backbone Network Based on Mask R-CNN for Small Object Detection

引用

computers, Materials & Continua 2023年第2期74卷 3405-3419页

作者： Jian Peng Yifang Zhao Dengyong Zhang Feng Li Arun Kumar Sangaiah Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha410114China School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China School of Computing Science and Engineering Vellore Institute of Technology(VIT)Vellore632014India

Recently,object detection based on convolutional neural networks(CNNs)has developed *** backbone networks for basic feature extraction are an important component of the whole detection ***,we present a new feature extraction strategy in this paper,which name is *** this strategy,we design:1)a sandwich attention feature fusion module(SAFF module).Its purpose is to enhance the semantic information of shallow features and resolution of deep features,which is beneficial to small object detection after feature fusion.2)to add a new stage called D-block to alleviate the disadvantages of decreasing spatial resolution when the pooling layer increases the receptive *** method proposed in the new stage replaces the original method of obtaining the P6 feature map and uses the result as the input of the regional proposal network(RPN).In the experimental phase,we use the new strategy to extract *** experiment takes the public dataset of Microsoft Common Objects in Context(MS COCO)object detection and the dataset of Corona Virus Disease 2019(COVID-19)image classification as the experimental object *** results show that the average recognition accuracy of COVID-19 in the classification dataset is improved to 98.163%,and small object detection in object detection tasks is improved by 4.0%.

关键词： Small object detection classification RPN MS COCO COVID-19

来源：评论

学校读者我要写书评

暂无评论

SOOP: Efficient Distributed Graph Computation Supporting Second-Order Random Walks

引用

Journal of computer Science & technology 2021年第5期36卷 985-1001页

作者： Songjie Niu Dongyan Zhou State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190China University of Chinese Academy of Sciences Beijing 100049China Bytedance Technology Beijing 100086China

The second-order random walk has recently been shown to effectively improve the accuracy in graph analysis *** work mainly focuses on centralized second-order random walk(SOW)*** algorithms rely on edge-to-edge transition probabilities to generate next random ***,it is prohibitively costly to store all the probabilities for large-scale graphs,and restricting the number of probabilities to consider can negatively impact the accuracy of graph analysis *** this paper,we propose and study an alternative approach,SOOP(second-order random walks with on-demand probability computation),that avoids the space overhead by computing the edge-to-edge transition probabilities on demand during the random ***,the same probabilities may be computed multiple times when the same edge appears multiple times in SOW,incurring extra cost for redundant computation and *** propose two optimization techniques that reduce the complexity of computing edge-to-edge transition probabilities to generate next random steps,and reduce the cost of communicating out-neighbors for the probability computation,*** experiments on real-world and synthetic graphs show that SOOP achieves orders of magnitude better performance than baseline precompute solutions,and it can efficiently computes SOW algorithms on billion-scale graphs.

关键词： second-order random walk(SOW) Node2Vec second-order PageRank distributed graph computation SOOP(second-order random walks with on-demand probability computation)

来源：评论

学校读者我要写书评

暂无评论

Layer-Puzzle: Allocating and Scheduling Multi-task on Multi-core NPUs by Using Layer Heterogeneity

Layer-Puzzle: Allocating and Scheduling Multi-task on Multi-...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Chengsi Gao Ying Wang Cheng Liu Mengdi Wang Weiwei Chen Yinhe Han Lei Zhang SKLP Institute of Computing Technology CAS University of Chinese Academy of Sciences Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology CAS State Key Laboratory of Computer Architecture Institute of Computing Technology

In this work, we propose Layer-Puzzle, a multi-task allocation and scheduling framework for multi-core NPUs. Based on the proposed latency-prediction model and dynamic parallelization scheme, Layer-Puzzle can generate near-optimal results for each layer under given hardware resources and traffic congestion levels. As an online scheduler, Layer-Puzzle performs a QoS-aware and dynamic scheduling method that picks the superior version from the previously compiled results and co-runs the selected tasks to improve system performance. Our experiments on MLPerf show that Layer-Puzzle can achieve up to 1.61X, 1.53X, and 1.95X improvement in ANTT, STP, and PE utilization, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AutoSketch: Automatic Sketch-Oriented Compiler for Query-driven Network Telemetry 21

AutoSketch: Automatic Sketch-Oriented Compiler for Query-dri...

引用

21st USENIX Symposium on Networked Systems Design and Implementation, NSDI 2024

作者： Sun, Haifeng Huang, Qun Sun, Jinbo Wang, Wei Li, Jiaheng Li, Fuliang Bao, Yungang Yao, Xin Zhang, Gong National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University China Institute of Computing Technology CAS China Northeastern University China Huawei Theory Department

ISBN: (纸本)9781939133397

Recent network telemetry witnesses tremendous progress in two directions: query-driven telemetry that targets expressiveness as the primary goal, and sketch-based algorithms that address resource-accuracy trade-offs. In this paper, we propose AutoSketch that aims to integrate the advantages of both classes. In a nutshell, AutoSketch automatically compiles high-level operators into sketch instances that can be readily deployed with low resource usage and incur limited accuracy drop. However, there remains a gap between the expressiveness of high-level operators and the underlying realization of sketch algorithms. AutoSketch bridges this gap in three aspects. First, AutoSketch extends its interface derived from existing query-driven telemetry such that users can specify the desired telemetry accuracy. The specified accuracy intent will be utilized to guide the compiling procedure. Second, AutoSketch leverages various techniques, such as syntax analysis and performance estimation, to construct efficient sketch instances. Finally, AutoSketch automatically searches for the most suitable parameter configurations that fulfill the accuracy intent with minimum resource usage. Our experiments demonstrate that AutoSketch can achieve high expressiveness, high accuracy, and low resource usage compared to state-of-the-art telemetry solutions. © 2024 Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, NSDI 2024. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algorithm on the New Sunway Supercomputer 29

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algori...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Tian, Min Liu, Qi Li, Yanlong Du, Wei Ren, Zenghui Liu, Yue Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks China Jinan Institute of Supercomputing Technology Jinan Key Laboratory of High Performance Computing China

ISBN: (纸本)9798350330717

The solution of tridiagonal linear systems is used in in various fields and plays a crucial role in numerical simulations. However, there is few efficient solver for tridiagonal linear systems on the new Sunway supercomputer. Based on a three-dimensional heat conduction problem, we propose an adaptive heterogeneous tridiagonal matrix algorithm (AH-TDMA). Our major innovations include: (1) To address computational hotspots within AH-TDMA, a multi-level parallel approach involving MPI+Athread has been adopted. (2) An adaptive data partitioning scheme has been set up to achieve load balance. (3) Employing direct memory access and establishing shared space between registers and main memory, instead of employing discrete memory access, is done to enhance memory access efficiency. (4) The optimization of the loop structure has been made in adjusting the sequencing of the dual-layered loops to reduce communication overhead. The experimental results show that, with one core group, the AH-TDMA achieves a speedup of 99.6 times for hotspot and total time speedup up to 59.4 times compared to the Parallel and Scalable Library for Tridiagonal Matrix Algorithm (PaScal TDMA). The AH-TDMA is scalable up to 2048 core groups, with a parallel efficiency of 69.2%. © 2023 IEEE.

关键词： adaptive heterogeneous algorithm MPI+Athread Sunway supercomputer three-dimensional heat conduction problem tridiagonal linear systems

来源：评论

学校读者我要写书评

暂无评论

hcaPCG: A Heterogeneous and communication-avoid PCG with Jacobi preconditioner on SW26010-Pro architecture 29

hcaPCG: A Heterogeneous and communication-avoid PCG with Jac...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Tian, Min Liu, Yue Wang, Li Chen, Yanyan Liu, Qi Pan, Jingshan Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks China Jinan Institute of Supercomputing Technology Jinan Key Laboratory of High Performance Computing China

ISBN: (纸本)9798350330717

Due to its efficiency and versatility, the preconditioned conjugate gradient algorithm has long been a staple in the realm of iterative linear system solvers. In this paper, we proposed an optimized preconditioned conjugate gradient algorithm tailored for the SW26010-Pro manycore processor, The main work includes: Optimizing data block sizes based on the processor's storage structure;combining thread-level and data-level parallelism, utilizing manual SIMD to improve efficiency;optimizing the memory access pattern by employing direct memory access and overlapping of computation and communication;employing a shared-memory approach to store long vectors across all cores. Furthermore, we design an accelerated algorithm for reduction operations, to avoid data communication. Experimental results show that the hcaPCG yields up to 28.1× speedups on average compared to the original implementation. © 2023 IEEE.

关键词： Communication-avoid Heterogeneous System Jacobi preconditioner PCG algorithm SW26010-Pro

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：