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

IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY 2025年 6卷 2780-2791页

作者： Wang, Nan Liu, Jiqiang Du, Bing Zhao, Qinxin Sun, Yuanlin Zhang, Tao Fan, Dunqiu Li, Wenjin Li, Binyong Beijing Jiaotong Univ Sch Cyberspace Sci & Technol Beijing 100044 Peoples R China China Acad Railway Sci Corp Ltd Railway Engn Res Inst Beijing 100081 Peoples R China Nanjing Univ Dept Comp Sci & Technol State Key Lab Novel Software Technol Nanjing 210023 Peoples R China NSFOCUS Technol Grp Co Ltd Res Dept Beijing 100085 Peoples R China NSFOCUS Inc Secur Capabil Ctr Beijing 100085 Peoples R China Chengdu Univ Informat Technol Adv Cryptog & Syst Secur Key Lab Sichuan Prov Chengdu 610000 Peoples R China

Generative AI is revolutionizing software Engineering (SE), as both engineers and academics embrace this technology in their work. To better leverage this technology for software generation, it is essential to propose effective IoT software defect prediction methods. However, this task is challenging due to the unclear high-order correlation underlying the data. Moreover, in real-world IoT software defect prediction applications, different types of misclassifications generally lead to distinct losses and associated costs. However, accurately determining these specific costs is often not feasible. Under such circumstances, we propose a cost-sensitive hypergraph learning method with structure quality preservation (csHLQ) to optimize the cost information and preserve the graph quality in a principled way. Due to the representational ability on high-order relationship exploring, we employ hypergraph structure instead of graph structure to model the complex correlations among the datasets. We note that if a cost-sensitive hypergraph has a high quality, its classification results may exhibit a large margin separation. Thus, csHLQ exploits the large margin cost-sensitive hypergraph while avoiding using of a cost-sensitive hypergraph with a small margin. To measure the performance of our proposed method, we performed experiments on three distinct groups of datasets, i.e., the NASA Metrics Data Program (NASA) dataset, CK metric dataset and UCI Machine Learning Repository (UCI) dataset. Experimental results and comparisons with state-of-the-art methods demonstrate the superiority of our method.

关键词： software Costs software engineering software measurement software algorithms Mathematical models Generative AI Feature extraction Ensemble learning Correlation Cost-sensitive hypergraph learning hypergraph structure optimization IoT software defect prediction

来源：评论

学校读者我要写书评

暂无评论

Accelerated Medical Microwave Tomography via Heterogeneous Computing

引用

IEEE ACCESS 2025年 13卷 39117-39134页

作者： Vasileiou, Thomas Kosmas, Panagiotis Meta Mat Europe Maroussi 15123 Greece Univ West Attica Dept Mech Engn Egaleo 12241 Greece Kings Coll London Dept Engn London WC2R 2LS England

In practical applications, such as medical microwave imaging, the implementation of three-dimensional (3D) numerical electromagnetic (EM) inverse scattering algorithms has been limited for over two decades owing to their high computational cost. The emergence of graphics processing unit (GPU) computing has offered new possibilities to alleviate the computational burden related to EM calculations;the optimized deployment of EM inverse scattering algorithms on GPUs or other accelerators, however, has not been explored. To this end, we present the first complete GPU implementation of an iterative EM inverse scattering algorithm, which employs a suite of optimization tools in both the forward and inverse problems solved at each iteration. Importantly, we study the impact of various implementation alternatives on computational savings in different computing platforms. Our results demonstrate the significance and benefits of jointly optimizing the forward and inverse problems in implementations in heterogeneous systems. Importantly, our optimization achieves the fastest fully numerical implementation of nonlinear, iterative, EM inverse scattering algorithms that has ever been reported in the literature, resulting in real-time, 3D MWT-based reconstructions. This can pave the way for the development of clinical systems for microwave-based applications such as breast cancer or stroke detection, which are designed to take full advantage of 3D MWT scanning and expand their imaging capabilities.

关键词： Inverse problems Finite difference methods Time-domain analysis Three-dimensional displays Mathematical models Codes Image reconstruction Graphics processing units software algorithms Microwave theory and techniques Microwave imaging tomography distorted born iterative method (DBIM) heterogeneous computing general purpose computing on graphics processing units (GPGPU)

来源：评论

学校读者我要写书评

暂无评论

Continuous Sculpting: Persistent Swarm Shape Formation Adaptable to Local Environmental Changes

引用

IEEE TRANSACTIONS ON ROBOTICS 2025年 41卷 1019-1038页

作者： Curtis, Andrew G. Yim, Mark Rubenstein, Michael Northwestern Univ McCormick Sch Engn Ctr Robot & Biosyst Evanston IL 60208 USA Univ Penn Gen Robot Automat Sensing & Percept GRASP Lab Philadelphia PA 19104 USA

Despite their growing popularity, swarms of robots remain limited by the operating time of each individual. We present algorithms that allow a human to sculpt a swarm of robots into a shape that persists in space perpetually, independent of onboard energy constraints, such as batteries. Robots generate a path through a shape such that robots cycle in and out of the shape. Robots inside the shape react to human initiated changes and adapt the path through the shape accordingly. Robots outside the shape recharge and return to the shape so that the shape can persist indefinitely. The presented algorithms communicate shape changes throughout the swarm using message passing and robot motion. These algorithms enable the swarm to persist through any arbitrary changes to the shape. We describe these algorithms in detail and present their performance in simulation and on a swarm of mobile robots. The result is a swarm behavior more suitable for extended duration, dynamic shape-based tasks in applications, such as entertainment, agriculture, and emergency response.

关键词： Shape Robots Charging stations Robot sensing systems Path planning Drones Swarm robotics Crops Collision avoidance software algorithms Distributed robot systems path planning for multiple mobile robots or agents shape formation swarms

来源：评论

学校读者我要写书评

暂无评论

A Retrospective of ChangeDistiller: Tree Differencing for Fine-Grained Source Code Change Extraction

引用

IEEE TRANSACTIONS ON software ENGINEERING 2025年第3期51卷 852-857页

作者： Fluri, Beat Wuersch, Michael Pinzger, Martin Gall, Harald Univ Zurich CH-8006 Zurich Switzerland Univ Klagenfurt A-9020 Klagenfurt Austria

In the early development of source code change analysis, methodologies primarily relied on simple textual differencing, which treated code as mere text and identified changes through lines that were added, modified, or deleted. This approach overlooked the rich semantic information embedded within the code, highlighting significant limitations in textual analysis and differencing that required a more precise and language-aware foundation. Our research on ChangeDistiller pioneered the use of abstract syntax trees and associated tree edits for change analysis. We were among the first to introduce a tree-differencing algorithm for source code, enabling a fine-grained examination of modifications. ChangeDistiller has since been widely adopted by researchers in the field of mining software repositories. This paper reflects on the evolution of our technique, its influence on subsequent research, and its role in the advancement of change analysis methodologies. In addition, we explore how contemporary techniques and tools can draw on our foundational work to enhance their effectiveness.

关键词： Codes Source coding software algorithms software Data mining Taxonomy Syntactics software engineering Heuristic algorithms Computer bugs Source code change analysis change types tree edits mining software repositories

来源：评论

学校读者我要写书评

暂无评论

Sensitivity Studies of Power Deposition Computed on Tokamak First Wall

引用

IEEE TRANSACTIONS ON PLASMA SCIENCE 2025年第3期53卷 463-475页

作者： Arter, Wayne UK Atom Energy Author Culham Sci Ctr Abingdon OX14 3DB England

Profiles of power deposition on the first wall of the Joint European Torus (JET) tokamak experiment are fit by tracing an analytic representation for the distribution of power from midplane along lines of magnetic field. The technique is used to help design plasma-facing components (PFCs) in reactor-scale magnetic confinement devices;hence, understanding how to employ it both efficiently and accurately is important. Focusing on JET divertor geometry, the work examines the sensitivity of the integrated power and maximum power per PFC tile to the representation of the magnetic field and to the discretization of the tile's own geometry and that of other PFCs. For design, it is helpful to reduce computation costs per realization to a few seconds of elapsed time, and the work concludes with recommendations and guidelines for minimizing cost while retaining adequate accuracy.

关键词： Geometry Tokamak devices Magnetic fields Sensitivity software Europe Accuracy Uncertainty Shadow mapping software algorithms Joint European Torus (JET) numerical sensitivity plasma-facing components (PFCs) power deposition tokamak uncertainty quantification

来源：评论

学校读者我要写书评

暂无评论

High-Radix Generalized Hyperbolic CORDIC and Its Hardware Implementation

引用

IEEE TRANSACTIONS ON COMPUTERS 2025年第3期74卷 983-995页

作者： Chen, Hui Quan, Lianghua Chen, Ke Liu, Weiqiang Nanjing Univ Aeronaut & Astronaut Coll Integrated Circuits Nanjing 211106 Peoples R China Nanjing Univ Sch Elect Sci & Engn Nanjing 210093 Peoples R China

In this paper, we propose a high-radix generalized hyperbolic coordinate rotation digital computer (HGHCORDIC). This algorithm not only computes logarithmic and exponential functions with any fixed base but also significantly reduces the number of iterations required compared to traditional CORDIC methods. Initially, we present the general iteration formulas for HGH-CORDIC. Subsequently, we discuss its pivotal convergence properties and selection criteria, exemplifying these with commonly used cases. Through extensive software simulations, we validate the theoretical foundations of our approach. Finally, we explore efficient hardware implementation strategies. Our analysis indicates that, relative to state-of-the-art radix-2 GH-CORDIC, the proposed HGH-CORDIC can decrease the number of iterations by more than 50% while maintaining comparable accuracy. Synthesized under the 28nm CMOS technology, the reports show that the reference circuit can save about 40% area and power consumption averagely for 2x and log(2)x calculations compared with the latest CORDIC method.

关键词： Hardware Computers Vectors Accuracy Convergence software Mathematical models Computer architecture software algorithms Real-time systems High-radix hyperbolic CORDIC generalized logarithmic exponential hardware implementation

来源：评论

学校读者我要写书评

暂无评论

Arithmetically Fast Position Transformation for View Synthesis and Depth Estimation

引用

IEEE ACCESS 2025年 13卷 24661-24671页

作者： Wegner, Krzysztof Grajek, Tomasz Klimaszewski, Krzysztof Mucha Sp Zoo PL-61626 Poznan Poland Poznan Univ Tech Inst Multimedia Telecommun PL-60965 Poznan Poland

In this paper we present a method of fast computation of matrix transformation in the process of position transformation of objects of the scene between different, virtual or real, camera positions. The process finds extensive use in virtual view generation in Free Viewpoint Video (FVV) and virtual reality applications as well as in depth estimation algorithms. The proposed method relies on the reformulation of the matrix equation used in the process. As a result, the number of necessary arithmetic operations is reduced and some of the calculations can be reused for consecutive pixel position transformations. The presented algorithm produces identical output as an unoptimized algorithm with approximately 22% reduction of the processing time averaged over the examined representative test sequences.

关键词： Cameras Vectors Three-dimensional displays software algorithms Depth measurement Mathematical models Training TV Recording Image resolution Depth estimation DIBR multiview and depth position transformation view synthesis

来源：评论

学校读者我要写书评

暂无评论

HARPOCRATES: An Approach Towards Efficient Encryption of Data-at-Rest

引用

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING 2025年第1期13卷 173-184页

作者： Ali, Md Rasid Pal, Debranjan Das, Abhijit Chowdhury, Dipanwita Roy Indian Inst Technol Kharagpur Dept Comp Sci Engn Kharagpur 721302 West Bengal India

This paper proposes a new block cipher called HARPOCRATES, which is different from traditional SPN, Feistel, or ARX designs. The new design structure that we use is called the substitution convolution network. The novelty of the approach lies in that the substitution function does not use fixed S-boxes. Instead, it uses a key-driven lookup table storing a permutation of all 8-bit values. If the lookup table is sufficiently randomly shuffled, the round sub-operations achieve good confusion and diffusion to the cipher. While designing the cipher, the security, cost, and performances are balanced, keeping the requirements of encryption of data-at-rest in mind. The round sub-operations are massively parallelizable and designed such that a single active bit may make the entire state (an $8 \times 16$8x16 binary matrix) active in one round. We analyze the security of the cipher against linear, differential, and impossible differential cryptanalysis. The cipher's resistance against many other attacks like algebraic attacks, structural attacks, and weak keys are also shown. We implemented the cipher in software and hardware;found that the software implementation of the cipher results in better throughput than many well-known ciphers. Although HARPOCRATES is appropriate for the encryption of data-at-rest, it is also well-suited in data-in-transit environments.

关键词： Ciphers Table lookup Encryption Matrices Hardware Convolution software algorithms Block cipher cryptanalysis data-at-rest diffusion substitution convolution network lookup table

来源：评论

学校读者我要写书评

暂无评论

Ultrafast Ultrasound Imaging System With Beamforming on Single FPGA

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2025年 74卷

作者： Zhang, Xi Qi, Sheng Li, Yifan Xu, Lijun Ma, Jianguo Beihang Univ Sch Instrumentat & Optoelect Engn Beijing 100191 Peoples R China Shandong Jianzhu Univ Sch Sci Jinan 250100 Peoples R China

Ultrafast ultrasound imaging technologies, such as ultrasound localization microscopy (ULM) and functional ultrasound (FUS), are gaining significant attention in the ultrasound field, driving the demand for higher frame rates in open ultrasound systems. However, current open ultrasound systems face the challenge of balancing high imaging frame rates with the complexity of hardware architecture. This work reports the detailed implementation and hardware architecture of a 128-channel ultrafast ultrasound platform based on a single field-programmable gate array (FPGA). This platform connects the ultrasound card to a personal computer (PC) via peripheral component interconnect express (PCIe) 3.0, providing excellent compatibility. The platform uses custom instructions to implement flexible parameter configuration in the FPGA. It can control the transmission and reception of signals, the output of raw or beamformed RF data, and the sampling depth. Additionally, a 64 sub-aperture delay-and-sum (DAS) beamformer within the FPGA is implemented in the platform. This beamformer gives output as a 128x2048 image at 10000 frames/s (fps) using plane wave. The core components of the platform measure only 12x21 cm, achieving a compact design while delivering high-frame-rate (HFR) imaging.

关键词： Ultrasonic imaging Field programmable gate arrays Delays Array signal processing Imaging Hardware Computer architecture software Radio frequency software algorithms Beamforming field-programmable gate array (FPGA) ultrasound system ultrafast ultrasound

来源：评论

学校读者我要写书评

暂无评论

Simplified Fast List PAC Decoder for Broadcasting Services in 6G: Algorithm and Implementation

引用

IEEE TRANSACTIONS ON BROADCASTING 2025年

作者： Dai, Jingxin Yin, Hang Lv, Yansong Wang, Yuhuan Xu, Yin Lv, Rui Commun Univ China State Key Lab Media Convergence & Commun Beijing 100024 Peoples R China Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Cooperat Medianet Innovat Ctr Shanghai 200240 Peoples R China

In the 6G network, integrating broadcasting and mobile networks will significantly improve the transmission capability. Considering the excellent error-correction performance, polarized-adjusted convolutional (PAC) codes are promising for ensuring reliable data transmission in 6G broadcasting services. However, the inherent high decoding latency of PAC codes poses challenges for seamless switching between broadcasting and mobile services. In this paper, we propose a simplified fast list (SFL) PAC decoder, which jointly exploits the node thresholds and adaptive path-pruning technology to reduce the decoding latency while maintaining high reliability. Firstly, we present a novel path expansion rule based on the node thresholds to avoid unnecessary computations. Secondly, the introduction of the adaptive path-pruning technology efficiently reduces the number of sorting operations. Moreover, we implement the proposed decoder on general purpose processors (GPPs) by software. Simulation results show that the proposed SFL decoding algorithm significantly reduces the decoding latency by up to 75.18% compared to the state-of-the-art (SOTA) work with no noticeable degradation in error-correction performance. software implementation of the proposed decoder achieves an 18.80% improvement in throughput performance over the SOTA PAC software decoder.

关键词： Decoding Picture archiving and communication systems software Codes 6G mobile communication Broadcasting software algorithms Throughput Polar codes Signal processing algorithms PAC codes broadcasting decoding latency threshold decoder software

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：