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

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Wang, He Wang, Qitong Huang, Leilei Shi, Chunqi Zhang, Runxi East China Normal Univ Inst Microelect Circuits & Syst Shanghai Peoples R China East China Normal Univ Shanghai Key Lab Multidimens Informat Proc Shanghai 200241 Peoples R China

ISBN: (纸本)9798350330991;9798350331004

Currently, we are entering the wearable internet era. The use of WiFi signals to perceive human activities or changes in vital signs has gradually become a topic that people are enthusiastic about. Principal Component Analysis (PCA), as a universal data dimensionality reduction algorithm, has been widely applied in the field ofWiFi sensing. It is utilized to expedite data processing time and enhance real-time detection capabilities. This paper proposes an acceleration algorithm for PCA in the field of WiFi sensing along with its corresponding hardware architecture. The experimental results indicate that the accuracy of this algorithm can reach 0.9965, and the processing time is approximately 10 ms. Based on the TSMC 22nm technology, the Design Complier (DC) results show that the data throughput of this hardware architecture can reach 24 Gbps@800M, with a gate count of 7571, and the power consumption is 1.6321mW.

关键词： WiFi sensing PCA acceleration algorithm Hardware architecture

来源：评论

学校读者我要写书评

暂无评论

An Improved Ray Tracing acceleration algorithm Based on Bounding Volume Hierarchies 96

An Improved Ray Tracing Acceleration Algorithm Based on Boun...

引用

IEEE 96th Vehicular Technology Conference (VTC-Fall)

作者： Wang, Chen Wang, Yinghua Li, Yuxiao Huang, Jialing Huang, Jie Wang, Cheng-Xiang Southeast Univ Sch Informat Sci & Engn Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China

ISBN: (纸本)9781665454681

Ray tracing is an efficient channel modeling method. However, the traditional ray tracing method has high computation complexity. To solve this problem, an improved bounding volume hierarchies (BVH) algorithm is proposed in this paper. Based on surface area heuristic (SAH) and spatial distance, the proposed algorithm can effectively reduce the number of unnecessary intersection tests between ray and triangular facets. In addition, the algorithm fully considers the influence of ray action range, which can not only make up for the defects of spatial division based on uniform grid method and k-dimensional (KD) tree, but also solve the problem of unsatisfactory spatial division based on traditional BVH algorithm. The simulation results show that compared with the traditional BVH algorithm, the proposed algorithm can improve the computation efficiency by 20% to 35% while ensuring the computation accuracy.

关键词： Ray tracing acceleration algorithm object division BVH SAH

来源：评论

学校读者我要写书评

暂无评论

A Class-Specific Attribute Reduction acceleration algorithm Based on Neighborhood Rough Set 11th

A Class-Specific Attribute Reduction Acceleration Algorithm ...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Xia, Mingfei Hu, Jun Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing China The Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China

ISBN: (纸本)9783031927461

Neighborhood rough sets are proficient in managing continuous data, but the selection of the neighborhood radius often necessitates multiple tests, leading to substantial time expenditure. To solve this problem, this paper proposes an acceleration algorithm for class-specific attribute reduction. Initially, the concept of class-specific multi-granularity reduction within the framework of neighborhood rough sets is clarified. The relationship between reductions induced by different neighborhood radii is demonstrated by analyzing the variation of approximate quality across different granularities. Subsequently, by integrating local neighborhood rough sets with sequential three-way decision, the sets of candidate samples and attributes are simultaneously reduced at a single granularity, thereby further diminishing the computational complexity. Finally, the corresponding multi-granularity acceleration algorithm is proposed. The experimental results derived from ten UCI datasets indicate that the proposed algorithm significantly decreases the time required for class-specific attribute reduction while maintaining the classification capability of neighborhood decision systems. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： acceleration algorithm Class-Specific Attribute Reduction Multi-Granularity Neighborhood Radii Neighborhood Rough Sets

来源：评论

学校读者我要写书评

暂无评论

Uncertainty and multi-criteria global sensitivity analysis of structural systems using acceleration algorithm and sparse polynomial chaos expansion

引用

MECHANICAL SYSTEMS AND SIGNAL PROCESSING 2022年 163卷 108120-108120页

作者： Qian, Jing Dong, You Hong Kong Polytech Univ Dept Civil & Environm Engn Hung Hom Kowloon Hong Kong Peoples R China

Sparse polynomial chaos expansion (PCE) can be used to emulate the stochastic model output where the original model is computationally expensive. It is a powerful tool in efficient uncertainty quantification and sensitivity analysis. Structural systems are usually associated with high dimensional and probabilistic input. The number of candidate basis functions increases significantly with input dimension, resulting in high computational burden for establishing sparse PCE. In this study, acceleration techniques are integrated to formulate an algorithm for efficient computation of sparse PCE (ASPCE). The integrated algorithm can improve efficiency of computational process compared with conventional greedy algorithm while ensuring the satisfying predictive performance. Once the sparse PCE model is obtained, the statistic moments, probability density function of stochastic output, and global sensitivity index could be computed efficiently. Traditional PCE based global sensitivity analysis only assesses the sensitivity on individual structural performance criterion. Assessing the global sensitivity considering multiple criteria is challenging as the sensitive parameters may not be consistent for different performance criteria. To address this issue, a two-stage multi-criteria global sensitivity analysis algorithm is proposed by coupling ASPCE and the technique for order preference by similarity to ideal solution (TOPSIS). A holistic global sensitivity index is proposed to identify the sensitive parameters incorporating multiple performance criteria. In order to illustrate the efficiency, accuracy, and applicability of the proposed approach, two illustrative cases are presented.

关键词： Uncertainty quantification Multi-criteria global sensitivity analysis Structural systems Sparse polynomial chaos expansion acceleration algorithm

来源：评论

学校读者我要写书评

暂无评论

acceleration Framework and Solution algorithm for Distribution System Restoration Based on End-to-End Optimization Strategy

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2024年第1期39卷 429-441页

作者： Wang, Yifei Yan, Ziheng Sang, Linwei Hong, Lucheng Hu, Qinran Shahidehpour, Mohammad Xu, Qingshan Southeast Univ Sch Elect Engn Nanjing 211189 Peoples R China Tsinghua Univ Tsinghua Berkeley Shenzhen Inst Tsinghua Shenzhen Int Grad Sch Shenzhen 100190 Peoples R China IIT Elect & Comp Engn Dept Chicago IL 60616 USA

The distribution system restoration (DSR) problem is traditionally modeled as a mixed-integer linear programming (MILP) model. However, a significant number of integer variables are introduced to describe the DSR process, which introduce additional complexities in both time and space dimensions. Moreover, an enormous number of constraints are constructed to establish a rational DSR decision, while some of them may not be considered tight in practice. The enormous number of binary variables and inactive constraints could make the DSR problem very hard to solve and apply in real-time. The DSR computation burden would be reduced significantly if binary variables and binding constraints are pre-determined. This paper proposes an acceleration framework and solution algorithm based on the end-to-end optimization, which applies deep neural network (DNN) and gradient boosting decision tree (GBDT) methods to DSR. The DSR problem, which is solved in offline and online stages, will accordingly be reduced to a linear programming problem which can be solved more efficiently and reliably. Case studies are carried out on the modified IEEE 33-bus and 123-bus systems and a practical 1069-bus system. The proposed results indicate that the DSR problem with the proposed end-to-end acceleration framework is solved more than tenfold faster than those of traditional solvers.

关键词： Optimization Generators Indexes Computational modeling Decision trees Voltage Network topology Distribution system restoration deep neutral network acceleration algorithm gradient boosting decision tree

来源：评论

学校读者我要写书评

暂无评论

Research on acceleration algorithm of Common Terrain in Ray Tracing

Research on Acceleration Algorithm of Common Terrain in Ray ...

引用

7th Asia-Pacific Conference on Environmental Electromagnectics

作者： Yuan Chen Shi Dan Gao You-gang Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China

ISBN: (纸本)9781467394451

Generally speaking, the intersection point between the ray and the terrain can be judged in the simulation software adopting the method of ray tracing, and then where the ray is intersected, reflected or diffracted with the specific terrain can be judged. At present, most terrains are simulated in the form of triangular facet, while the judgment process for one time of intersection between one ray with all triangular facets of a large terrain is relatively long. In this paper, the ray path can be estimated during the process of judging the intersection and confirming the position of the intersection point as per the ray and the terrain, the intersection judgment can be reduced, it can be accelerated, and consequently the time for ray tracing is largely shortened and the efficiency of the software simulation can be improved.

关键词： electromagnetic environment simulation software ray tracing acceleration algorithm

来源：评论

学校读者我要写书评

暂无评论

acceleration of Offshore Electromagnetic Energy Distribution Prediction algorithm Based on Ray-Tracing Method and PM Wave Spectrum

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2021年第12期20卷 2363-2367页

作者： Wang, Lihui Chen, Zhenjia Zhang, Yonghui Hainan Univ Sch Informat & Commun Engn Haikou 570228 Peoples R China

In order to improve the spectral resource utilization, the sea electromagnetic energy distribution prediction algorithm is proposed, which is the basic study of spectrum interference and offshore communication channels. This letter studies the acceleration of the prediction algorithm for offshore electromagnetic energy distribution. In conjunction with the Pierson-Moscowitz (PM) wave spectrum, the effective rays are discretized by establishing the normal vector matrix of the reflection plane. We propose to introduce the effective reflecting surface of the PM wave spectrum to improve the estimation accuracy of the electromagnetic spectrum distribution in the complex marine environment. We provided an effective ray decision algorithm to accelerate the prediction of reflected ray field strength distribution. In particular, combining the free-space propagation loss characteristics of electromagnetic waves, ray distribution with uneven Angle Variation is proposed. Based on the PM wave spectrum, atmospheric refraction, and earth curvature of the complex marine environment model, the ray-tracing method can quickly calculate the marine electromagnetic spectrum distribution.

关键词： Sea surface Surface roughness Rough surfaces Electromagnetics Ray tracing Predictive models Electromagnetic spectrum acceleration algorithm offshore electromagnetic energy distribution Pierson-Moscowitz (PM) wave spectrum ray tracing

来源：评论

学校读者我要写书评

暂无评论

Research on acceleration algorithm of Common Terrain in Ray Tracing

Research on Acceleration Algorithm of Common Terrain in Ray ...

引用

The Seventh Asia-Pacific Conference on Environmental Electromagnetics (CEEM'2015)

作者： Yuan Chen Shi Dan Gao You-gang School of Electric Engineering Beijing University of Posts and Telecommunications

Generally speaking,the intersection point between the ray and the terrain can be judged in the simulation software adopting the method of ray tracing,and then where the ray is intersected,reflected or diffracted with the specific terrain can be *** present,most terrains are simulated in the form of triangular facet,while the judgment process for one time of intersection between one ray with all triangular facets of a large terrain is relatively *** this paper,the ray path can be estimated during the process of judging the intersection and confirming the position of the intersection point as per the ray and the terrain,the intersection judgment can be reduced,it can be accelerated,and consequently the time for ray tracing is largely shortened and the efficiency of the software simulation can be improved.

关键词： electromagnetic environment simulation software ray tracing acceleration algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-directional Sobel operator kernel on GPUs

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2023年第1期177卷 160-170页

作者： Chang, Qiong Li, Xiang Li, Yun Miyazaki, Jun Tokyo Inst Technol Sch Comp Tokyo Japan Nanjing Univ Sch Elect Sci & Engn Nanjing Peoples R China

Sobel is one of the most popular edge detection operators used in image processing. To date, most users utilize the two-directional 3x3 Sobel operator as detectors because of its low computational cost and reasonable performance. Simultaneously, many studies have been conducted on using large multi-directional Sobel operators to satisfy their needs considering the high stability, but at an expense of speed. This paper proposes a fast graphics processing unit (GPU) kernel for the four-directional 5x5 Sobel operator. To improve kernel performance, we implement the kernel based on warp-level primitives, which can significantly reduce the number of memory accesses. In addition, we introduce the prefetching mechanism and operator transformation into the kernel to significantly reduce the computational complexity and data transmission latency. Compared with the OpenCV-GPU library, our kernel shows high performances of 6.7x speedup on a Jetson AGX Xavier GPU and 13x on a GTX 1650Ti GPU. (C) 2023 Elsevier Inc. All rights reserved.

关键词： Sobel operator Multi -directional acceleration algorithm Graphics processor

来源：评论

学校读者我要写书评

暂无评论

Analyses of the Contour Integral Method for Time Fractional Normal-Subdiffusion Transport Equation

引用

JOURNAL OF SCIENTIFIC COMPUTING 2023年第2期97卷 1-40页

作者： Ma, Fugui Zhao, Lijing Deng, Weihua Wang, Yejuan Lanzhou Univ Sch Math & Stat Gansu Key Lab Appl Math & Complex Syst Lanzhou 730000 Gansu Peoples R China Northwestern Polytech Univ Sch Math & Stat Xian 710129 Peoples R China Northwestern Polytech Univ Res & Dev Inst Shenzhen 518057 Peoples R China

In this work, we theoretically and numerically discuss a class of time fractional normal-subdiffusion transport equation, which depicts a crossover from normal diffusion (as t -> 0) to sub-diffusion (as t -> infinity). Firstly, the well-posedness and regularities of the model are studied by using the bivariate Mittag-Leffler function. Theoretical results show that after introducing the first-order derivative operator, the regularity of the solution can be improved in substance. Then, a numerical scheme with high-precision is developed nomatter the initial value is smooth or non-smooth. More specifically, we use the contour integral method (CIM) with parameterized hyperbolic contour to approximate the temporal local and non-local operators, and employ the standard Galerkin finite element method for spatial discretization. Rigorous error estimates show that the proposed numerical scheme has spectral accuracy in time and optimal convergence order in space. Besides, we further improve the algorithm and reduce the computational cost by using the barycentric Lagrange interpolation. Finally, the obtained theoretical results as well as the acceleration algorithm are verified by several 1-D and 2-D numerical experiments, which also show that the numerical scheme developed in this paper is effective and robust.

关键词： Time fractional equations Contour integral method Regularity analysis Error estimates acceleration algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：