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

38th IEEE International Geoscience and Remote Sensing Symposium (IGARSS)

作者： Zhang, Hongping Cheng, Xinwen Zhao, dong Ma, Hairong China Univ Geosci Sch Informat Engn Wuhan 430074 Hubei Peoples R China Wuhan Univ Engn Sci Wuhan 430200 Hubei Peoples R China

ISBN: (纸本)9781538671504

Recent years, most areas of China were attacked by extreme rainstorm. The flood and waterlogging disasters tended to be a grim challenge for most cities in China as a result of impervious surface and "urban heat island" growth. Especially underground network construction is slower than urban expansion causing catchment area collecting water capacity greater than drainage capacity. As more and more high-resolution Remote data (such as "GF-1", "GF-2") provided for basic research, the consecutive and near real-time observation data have been played a great role in flood research. This article found that modified dEM by high resolution of water could increase the availability of dividing catchment based on d8 d*algorithm in cities with a lot water surface. We chose Nan Lake & Tangxun Lake sub-catchment in Wuhan city to analyze the contribution of water area. We found that dividing catchment with modified dEM could be more effective than the original dEM not only in the certainty of flow direction but also in the shape similarity with official sub-watershed classification version. We also believe that reasonable using data such as road, square, buildings extracted from remote sensing might affect catchment dividing positively.

关键词： GF-1 GF-2 flood and waterlogging disasters catchment d8 d*algorithm

来源：评论

学校读者我要写书评

暂无评论

A 3d denoising d*algorithm based on photon-counting imaging at low light level 10

A 3D denoising algorithm based on photon-counting imaging at...

引用

10th International Conference on digital Image Processing (ICdIP)

作者： Wu, Changqiang He, Weiji Gu, Guohua Chen, Qian Nanjing Univ Sci & Technol Jiangsu Key Lab Spectral Imaging & Intelligence S Nanjing 210094 Jiangsu Peoples R China

ISBN: (数字)9781510622005

ISBN: (纸本)9781510622005

The active 3d lidar imaging system usually spends a long time sampling many points for each spatial pixel in the target scene by raster scanning and generating a statistic histogram of photon counting. By relying on a variety of effective imaging d*algorithms, it extracts the depth, reflectivity and other informat ion of target to reconstruct the 3d scene image. Since signal photons will be clustered together near the truth depth, so we set a window to gather reflected signal photons. We propose a new denoising d*algorithm based on photon-counting without generating photon counting statistic histogram in order to get 3d image of targets quickly. To validate the new theory in this paper, we designed a contrast test. Experimental results demonstrate that this imaging method can suppress the noise while acquiring the scene depth and reduce the sampling time at low light level. The imaging accuracy of our method is increased by over 6-fold more than the maximum likelihood estimation and improving imaging performance significantly.

关键词： lidar 3d imaging photon-counting denoising d*algorithm low light level

来源：评论

学校读者我要写书评

暂无评论

A novel heuristic pathfinding d*algorithm for 3d security modeling and vulnerability assessment

引用

Nuclear Science and Techniques 2025年第5期36卷 152-166页

作者： Jun Yang Yue-Ming Hong Yu-Ming Lv Hao-Ming Ma Wen-Lin Wang School of Electric Power Engineering South China University of Technology381 Wushan RoadGuangzhou 510640China Sino-German College of Intelligent Manufacturing Shenzhen Technology UniversityShenzhen 518118China

Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection *** path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical ***,achieving efficient path optimization in complex large-scale three-dimensional(3d)scenes remains a significant challenge for vulnerability *** paper introduces a novel A^(*)-d*algorithmic framework for 3d security modeling and vulnerability *** this framework,the 3d facility models were first developed in 3ds Max and then incorporated into Unity for A^(*)heuristic *** A^(*)-heuristic pathfinding d*algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the *** admissible heuristic is ensured by incorporating the minimum probability of detection(P_(d)^(min))and diagonal distance to estimate the heuristic *** 3d A^(*)heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A^(*)and dijkstra d*algorithms for optimal path *** results indicate that the proposed A^(*)-heuristic d*algorithm effectively identifies the most vulnerable adversarial pathfinding with high ***,the paper discusses hidden phenomena and open issues in efficient 3d pathfinding for security applications.

关键词： Physical protection system 3d modeling and simulation Vulnerability assessment A^(*)Heuristic Pathfinding dijkstra d*algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast and scalable deepest-left-bottom-fill d*algorithm to solve irregular 3d cutting and packing problems using a semi-discrete representation

引用

INTERNATIONAL JOURNAL OF PROdUCTION RESEARCH 2025年

作者： Chehrazad, Sahar Roose, dirk Wauters, Tony Katholieke Univ Leuven Dept Comp Sci Leuven Belgium Katholieke Univ Leuven Dept Comp Sci Technol Campus Gent Ghent Belgium

In this paper, we introduce a fast and scalable d*algorithm to solve irregular 3d cutting and packing problems. The possibly non-convex pieces and the container are semi-discretised using a grid in two dimensions, resulting in line segments in the third dimension. The semi-discretization d*algorithm ensures that a non-overlapping placement of the segments, representing two pieces, does not result in any overlap of these pieces. We present a deepest-left-bottom-fill greedy placement d*algorithm using an optimised ordering of the segment overlap tests to solve the open dimension problem. We also introduce a parallel version of the d*algorithm with dynamic load balancing. The performance of this placement d*algorithm is compared with results for some benchmark data sets. Competitive results are obtained within a very short runtime, even when the rotation of pieces is considered. Moreover, our d*algorithm scales well when the number of pieces and number of allowed rotations increases. We evaluate the performance of the parallel d*algorithm on a multicore processor using different task sizes. To further improve the solution quality, we implement a hill climbing d*algorithm based on reordering the pieces on top of the deepest-left-bottom-fill d*algorithm and we compare its performance with results presented in the literature.

关键词： Cutting and packing semi-discrete representation deepest-left-bottom-fill d*algorithm parallelisation geometry

来源：评论

学校读者我要写书评

暂无评论

An improved d-S evidence fusion d*algorithm for sub-area collaborative guided wave damage monitoring of large-scale structures

引用

ULTRASONICS 2025年 152卷 107644页

作者： du, Yuelin Ning, Hongmei Li, Yehai Bao, Qiao Wang, Qiang Nanjing Univ Posts & Telecommun Coll Automat Nanjing Peoples R China Nanjing Univ Posts & Telecommun Coll AI Nanjing Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518055 Peoples R China

due to the development of new materials and advanced manufacturing technologies, the application of largescale composite structures has become increasingly widespread. Ensuring the safe and stable operation of such structures presents new challenges across various application domains. Addressing the limitations of existing guided wave structural health monitoring methods for online damage monitoring in large-scale structures, such as cumbersome equipment setup, insufficient signals coverage, and difficulties in processing massive data, a method for sub-area collaborative guided-wave-based structural damage monitoring and severity assessment based on sparse sensing is proposed. By employing a sparse sensing array layout, the structure is divided into multiple monitoring sub-areas with arranged sensing arrays to reduce overall complexity. The characteristic responses of the guided wave signals from different sub-areas are extracted to construct feature sub-spaces. Support vector machines are adopted to construct evaluation sub-networks in each feature sub-space, enabling regional monitoring. Additionally, an improved d-S evidence fusion d*algorithm is applied to fuse the decision-layer inputs from each evaluation sub-network, effectively utilizing the feature information from multiple sub-areas and enhancing the accuracy of damage severity assessment for large-scale structures. Experimental results on typical composite structure specimens demonstrate that by fusing the support vector machine evaluation results from each sub-area, the accuracy of damage severity assessment reaches 97.5%, with uncertainties in the severity assessment below 5%.

关键词： Guided wave Composite structures Sparse sensor array support vector machine (SVM) d -S evidence fusion d*algorithm

来源：评论

学校读者我要写书评

暂无评论

SCCd: A slicing d*algorithm for detecting geomorphic changes on topographically complex areas based on 3d point clouds

引用

REMOTE SENSING OF ENVIRONMENT 2024年 303卷

作者： Yang, Xin Hu, Jinfei Li, Pengfei Gao, Chendi Latifi, Hooman Bai, Xiao Gao, Jianjian dang, Tianmin Tang, Fuquan Xian Univ Sci & Technol Coll Geomat Xian 710054 Peoples R China K N Toosi Univ Technol Fac Geodesy & Geomatics Engn Dept Photogrammetry & Remote Sensing Tehran 15433 Iran Univ Wurzburg Inst Geog & Geol Dept Remote Sensing D-97074 Wurzburg Germany Yellow River Conservancy Comm Minist Water Resourc Suide Test Stn Soil & Water Conservat Yulin 719000 Peoples R China Yellow River Basin Monitoring Ctr Water Soil Conse Xian 710021 Peoples R China

Three-dimensional (3d) point clouds are widely used for geomorphic change detection. However, the lack of efficient change-detection d*algorithms for complex terrain limits the use of 3d point clouds in area-wide morphological change studies. In this study, a complex terrain development process was simulated on a natural slope in the hilly and gully Loess Plateau in China using 28 runoff scouring experiments conducted in two plots. Highly precise point clouds were obtained using terrestrial laser scanning (TLS) before and after each experiment. A slice contraction change detection (SCCd) d*algorithm was developed based on slicing, Laplacian-based contraction, and differential principles for detecting geomorphic and volumetric changes on complex terrain, and the level of detection (Lod) was derived with respect to that of the multiscale model to model the cloud comparison (M3C2) d*algorithm. The accuracy of SCCd was compared with that of the 3d-M3C2 d*algorithm (i.e., a 3d volumetric change calculation d*algorithm based on M3C2) and the digital elevation model (dEM) of difference (dod) d*algorithm based on the measured sediment yield from the plots. The comparison was performed also under different point cloud densities and morphologies. Results showed the following: (1) The precisions of SCCd and 3d-M3C2 were comparable and considerably higher than that of dod. The mean relative errors of SCCd, 3d-M3C2, and dod for the two plots were 13.32% and 10.37%, 10.07% and 10.84%, and 35.30% and 27.23%, respectively. The relative error fluctuations of the three d*algorithms for the individual experiments followed the sequence of dod (standard deviation (std.): 10.18) > 3d-M3C2 (std.: 8.29) > SCCd (std.: 5.79). (2) The sensitivity to point cloud density changes followed the sequence of 3d-M3C2 > SCCd > dod as the point cloud density varied between 10,000 and 1000 points m- 2. The mean relative errors of 3d-M3C2, SCCd, and dod for the two plots were 10.07-18.59% and 10.84-13.62%, 13.32-16.83

关键词： LidAR Slicing d*algorithm M3C2 d*algorithm dod d*algorithm Gully headcut erosion

来源：评论

学校读者我要写书评

暂无评论

An Improved Aerosol Retrieval d*algorithm Based on Nonlinear Surface Model From FY-3d/MERSI-II Remote Sensing data

引用

IEEE TRANSACTIONS ON GEOSCIENCE ANd REMOTE SENSING 2024年 62卷 1页

作者： Si, Yidan Chen, Lin Wang, Yuanyuan Xu, Na Zhang, Xingying Yang, Leiku Hu, Xiuqing Shi, Shuaiyi China Meteorol Adm Natl Satellite Meteorol Ctr Natl Ctr Space Weather Key Lab Radiometr Calibrat & Validat Environ Satel Beijing 100081 Peoples R China Innovat Ctr FengYun Meteorol Satellite Beijing 100081 Peoples R China China Meteorol Adm Dept Sci & Technol & Climate Change Beijing 100081 Peoples R China Henan Polytech Univ Sch Surveying & Land Informat Engn Jiaozuo 454003 Henan Peoples R China Chinese Acad Sci Aerosp Informat Res Inst Beijing Peoples R China

This study explores a new scheme to retrieve the global aerosol optical depth (AOd) over land for the advanced Medium Resolution Spectral Imager (MERSI-II) aboard the Fengyun-3d (FY-3d) satellite based on the dark target (dT) d*algorithm. The main improvement is that the global surface reflectance (SR) model nonlinearly varies with the solar zenith angle and normalized difference vegetation index (NdVIswir) is made, which is more complex relative to that of Moderate-Resolution Imaging Spectro-Radiometer (MOdIS) operational d*algorithm. Our AOd retrievals are compared with an aerosol robotic network (AERONET) AOd and cross evaluated with Aqua/MOdIS, respectively. Overall, the MERSI-II retrieved results over the global scale have good consistency with the AERONET observations;on the same condition, the percentage of matchups within the expected error (EE: +/- 0.05 +/- 0.15AOd) is 67.06%, which is slightly lower than the percentage of MOdIS (79.84%). On a spatial scale, the coverage of MERSI-II retrievals at one granule is significantly higher than that of MOdIS, which is related to successful inversion of haze pixels and has retrieval ability in urban, grassland, and other surface types. The monthly mean AOd values retrieved by MERSI-II are close to those of MOdIS, indicating that MERS-II has similar quantitative capability and application potential as its international counterparts.

关键词： MOdIS Aerosols Reflectivity Atmospheric modeling Sea surface Satellites Remote sensing Aerosol optical depth (AOd) dark target (dT) d*algorithm Fengyun-3d (FY-3d) land Medium Resolution Spectral Imager (MERSI-II)

来源：评论

学校读者我要写书评

暂无评论

A novel plaintext-related dynamic dNA image encryption d*algorithm based on a 4d conservative chaotic system

引用

PHYSICA SCRIPTA 2024年第10期99卷 105215-105215页

作者： Yan, Shaohui Zhang, Jiandong Jiang, defeng Cui, Yu Northwest Normal Univ Coll Phys & Elect Engn Lanzhou 730070 Peoples R China

Conservative chaotic systems can circumvent the flaws of dissipative systems, as they do not form chaotic attractors, thus enhancing their resilience to attacks. In this paper, a new non-Hamiltonian 4d conservative system is proposed, and the system's conservativeness and chaotic properties are confirmed through the analysis of equilibrium points, chaotic flow projections, Poincar & eacute;sections, Lyapunov exponents, and Hamiltonian energy. Moreover, the system exhibits rich dynamical behaviors such as multistability, spectral entropy complexity, and offset-boosting. Building on this, a plaintext-related initial state generation d*algorithm using hash function is proposed, increasing sensitivity to plaintext. Also, a dynamic dNA d*algorithm is proposed by using plaintext information to control dNA operations. This ensures that the encryption operation is unique for each image. This d*algorithm enriches the encoding rules, thus enhancing the d*algorithm's security. Experimental results show that the d*algorithm exhibits outstanding performance and strong resilience against various attacks.

关键词： conservative chaotic system image encryption dNA d*algorithm

来源：评论

学校读者我要写书评

暂无评论

Enhanced dV-Hop using shuffled shepherd d*algorithm for localizing sensor nodes in 3-d space

引用

WIRELESS NETWORKS 2024年第1期30卷 295-307页

作者： Gouda, Ahmed El. Abouelseoud, Yasmine Abd El-Malek, Ahmed H. Osman, Radwa Ahmed Alexandria Univ Dept Engn Math & Phys Alexandria 21544 Egypt Egypt Japan Univ Sci & Technol E JUST Elect & Commun Engn Dept Alexandria 21934 Egypt Arab Acad Sci Technol & Maritime Transport Dept Basic & Appl Sci AbuQuir CampusPOB 1029 Alexandria Egypt

For many wireless sensor networks applications, a powerful localization d*algorithm is required to determine the exact positions of sensor nodes. In this paper, a new localization d*algorithm is presented which combines the distance vector hop (dV-Hop) d*algorithm with the shuffled shepherd optimization d*algorithm to determine the position for each unknown node within 3-d space. Studying the localization problem in 3-d space is more realistic, but more challenging due to the enlarged search space. Comparison of our proposed d*algorithm with its alternatives in literature shows that it offers improved accuracy and more stable performance with respect to changes in nodes density and communication range.

关键词： dV-Hop d*algorithm Shuffled shepherd optimization d*algorithm Wireless sensor networks Anchor nodes

来源：评论

学校读者我要写书评

暂无评论

Enhanced simulated annealing d*algorithm for 3d reconstruction of cathode catalyst layers in proton exchange membrane fuel cell

引用

JOURNAL OF POWER SOURCES 2024年 613卷

作者： Gao, Yuan Men, Jida Chen, Chaogang Tongji Univ Clean Energy Automot Engn Ctr Sch Automot Studies Shanghai Peoples R China

Optimizing the pore structure of the cathode catalyst layer of proton exchange membrane fuel cells (PEMFC) is crucial for improving oxygen transport and overall cell performance. In this paper, the simulated annealing (SA) d*algorithm was improved to iteratively optimize the catalyst layer reconstruction model, improve the d*algorithm ' s computational efficiency, and construct a model with physical properties close to the pore structure of the actual catalyst layer. The phase exchange process during the computation is performed using an improved different Phase Neighbors (dPN) d*algorithm, which prioritizes the nodes with significant phase differences for phase exchange and improves the efficiency of generating candidate solutions. The Hierarchical Annealing Strategy accelerated convergence, reducing computational complexity without compromising accuracy. Comparative analyses of pore size distributions and performance evaluations between the reconstructed models and the actual CL structures confirmed the model ' s effectiveness and accuracy.

关键词： Simulated annealing d*algorithm Catalyst layer reconstruction Proton exchange membrane fuel cell (PEMFC) different phase neighbors (dPN) d*algorithm Hierarchical annealing strategy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：