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

Leveraging Modern C plus plus in High-Level Synthesis

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2023年第4期42卷 1123-1132页

作者： Lahti, Sakari Rintala, Matti Hamalainen, Timo D. Tampere Univ Unit Comp Sci Tampere 33720 Finland

High-level synthesis (HLS) enables the automated conversion of high-level language algorithms into synthesizable register-transfer level code, allowing computation-intensive algorithms to be accelerated on FPGAs. Most HLS tools have C++ as their input language, as it is widely known in both software and hardware industry. However, even though C++ receives a new standard every three years, the HLS tool vendors have mostly provided support and examples using C++98/03. Limiting to early C++ standards imposes a productivity penalty, since the newer standards provide both compilation time reductions and more concise, expressive, and maintainable way of writing code. In this study, we make the case for adopting modern C++ in HLS. We inspect the language features of C++11 and forward, and consider their benefits for HLS. We also test the present support for the modern language features with two state-of-the-art commercial HLS tools. Finally, we provide an extended example, demonstrating the increased clarity of code achieved using the newer standards. We note that the investigated HLS tools already have good support for modern C++ features, and urge their adoption to increase designer productivity.

关键词： C plus plus languages Codes Hardware software Productivity Standards software algorithms algorithms implemented in hardware C plus plus language high-level synthesis (HLS) reconfigurable hardware

来源：评论

学校读者我要写书评

暂无评论

Analysis of Chaotic Maps for Global Optimization and a Hybrid Chaotic Pattern Search Algorithm for Optimizing the Reliability of a Bank

引用

IEEE ACCESS 2023年 11卷 24497-24510页

作者： Rani, G. Sandhya Jayan, Sarada Alatas, Bilal Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Math Bengaluru 560035 India Firat Univ Dept Software Engn TR-23119 Elazig Turkiye

Optimization is an imperative feature in almost all fields of Engineering, Economics, and Sciences. Due to the advent of high-end computers and the gradual increase in the complexity of optimization problems, algorithms for numerical optimization have been developed. Numerous existing numerical optimization algorithms suffer from premature convergence, poor local/global search abilities, and high computational complexity. A chaotic optimization algorithm and a chaotic map could help overcome most of these setbacks. This paper offers a detailed study and analysis of five chaotic maps used for global Optimization, namely Chebyshev, Cubic, ICMIC, Neuron, and Sine maps. This work also proposes a pioneering global optimization method, Hybrid Chaotic Pattern Search Algorithm (HCPSA), for finding the global minimum for multivariable unconstrained optimization problems. Numerical results over 12 benchmark functions and comparative results (comparison of accuracy and computational time) with some popular algorithms evidence the effectiveness of the proposed algorithm for higher dimensional non-linear functions. The efficient usage of chaotic maps has helped reduce the computational time to evaluate the optimum for higher dimensional non-linear functions. To showcase the use of HCPSA in a real-world problem, we have taken the problem of analyzing financial ratios for predicting bankruptcy. Banks predict bankruptcy from the start of their businesses to determine their financial stability. In this work, we initially perform Logistic Regression (LR) on the data obtained from the banks to get the reliability function with financial ratios as decision variables. After this, the function is maximized using HCPSA and a Chebyshev map. This methodology is beneficial for decision-makers within a bank to maximize the reliability of the financial ratios and, most essential, to protect the bank from disasters. Comparative results of reliability prediction using HCPSA and PSO and a non-par

关键词： Optimization Reliability Search problems Chaotic communication Bankruptcy software algorithms Chebyshev approximation Global optimization multi-variable optimization chaotic maps pattern search reliability financial ratios bankruptcy logistic regression

来源：评论

学校读者我要写书评

暂无评论

Traffic Priority-Aware Multi-User Distributed Dynamic Spectrum Access: A Multi-Agent Deep RL Approach

引用

IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING 2023年第6期9卷 1454-1471页

作者： Zhang, Shuying Ni, Zuyao Kuang, Linling Jiang, Chunxiao Zhao, Xiaohui Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China Jilin Univ Coll Commun Engn Changchun 130012 Peoples R China

Real-time information exchange on traffic and channel selection results among users in dynamic spectrum access (DSA) system consumes scarce spectrum resources. However, it is difficult to avoid collision and improve system-wide global utility simultaneously without assistance of these information in a distributed way. To solve this problem, we propose a multi-agent deep reinforcement learning (RL) based traffic priority-aware multi-user distributed DSA scheme for a multiple orthogonal channels scenario. Different from the conventional approaches for throughput sum maximization, we maximize a total network utility parameterized by the situation of each user's traffic buffer queue. This scheme includes off-line centralized training and distributed execution. The deep Q-learning neural network (DQN) of each user is trained by an offline simulator with global information to learn near-optimal channel selection policies from the transition history. The input of DQN requires only user's local observation to ensure that the scheme based on the trained DQNs can be executed in a distributed way. Simulation results show that the proposed scheme compared with benchmark algorithms can achieve about 90% or more of performance of Genie-aided algorithm based on global information, and is much better than random-type algorithms.

关键词： Wireless networks Throughput software algorithms Simulation Q-learning Optimization Heuristic algorithms Multi-user wireless networks distributed dynamic spectrum access priority-aware multi-agent deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Panoramic Video Coding for Immersive Metaverse Experience

引用

IEEE NETWORK 2023年第6期37卷 58-66页

作者： Yang, Xu Huang, Minfeng Luo, Lei Guo, Hongwei Zhu, Ce Chongqing Univ Posts & Telecommun Sch Commun & Informat Engn Chongqing 400065 Peoples R China Chengdu Normal Univ Sch Phys & Engn Chengdu 611130 Peoples R China China Mobile Hangzhou Informat Technol Co Ltd Hangzhou 310000 Peoples R China Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu 611731 Peoples R China Honghe Univ Sch Engn Mengzi 661100 Peoples R China

Efficient panoramic video coding plays a crucial role in the metaverse and Web 3.0 by enhancing content delivery, accessibility, and scalability. However, panoramic video is viewed in the spherical domain, while it is coded in the typical two-dimensional plane. Such a framework renders the compression-distortion metric unable to align well with the spherical- distortion perceived by viewers, resulting in inefficient rate-distortion optimization (RDO) in the coding process. Additionally, independent RDO on an individual panoramic video frame is also inefficient as it disregards the distortion propagation caused by the inter-prediction of video coding. To address these issues, a temporal-dependent spherical-distortion model is proposed for efficient panoramic video coding. Using the geometric projection principle, an independent mapping model between the spherical-distortion and the compression-distortion is first established for individual frames. Subsequently, the temporal-dependent spherical-distortion model for consecutive frames is deduced based on the inter-prediction structure. This model is then employed to guide the RDO process for panoramic video coding. Experimental results demonstrate that the proposed algorithm outperforms state-of-the-art methods, achieving an average bitrate reduction of 4.2% compared to the reference software VTM with the 360Lib extension.

关键词： Encoding Distortion Video coding Streaming media Rate-distortion Bit rate Metaverse software algorithms Semantic Web

来源：评论

学校读者我要写书评

暂无评论

FlexKA: A Flexible Karatsuba Multiplier Hardware Architecture for Variable-Sized Large Integers

引用

IEEE ACCESS 2023年 11卷 55212-55222页

作者： Kang, Byeongmin Cho, Hyungmin Sungkyunkwan Univ Dept Comp Sci & Engn Suwon 16419 South Korea

The Karatsuba algorithm is an effective way to accelerate large integer multiplications through recursive function calls. However, existing hardware implementations of Karatsuba multipliers are limited to fixed operand sizes. To enable their application in diverse domains, including homomorphic encryption with varying multiplicative depths, it is necessary to support variable operand sizes. In this paper, we propose a novel Karatsuba multiplier design, named FlexKA, which supports variable operand sizes through a state machine that manages the dynamic call states of the operation. We evaluate FlexKA on the Xilinx ZynqMP FPGA and demonstrate that it supports variable operand sizes up to 256K bits, achieving a 9.2x speedup compared to a highly-optimized software library running on a CPU. Our results show that FlexKA is an efficient and effective solution for large integer multiplications with flexible operand sizes in hardware.

关键词： Hardware Signal processing algorithms algorithms software algorithms Memory modules software Memory management Multiplying circuits field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Advanced-Step Real-Time Iterations With Four Levels - New Error Bounds and Fast Implementation in acados

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1703-1708页

作者： Frey, Jonathan Nurkanovic, Armin Diehl, Moritz Univ Freiburg Dept Microsyst Engn IMTEK D-79110 Freiburg Germany Univ Freiburg Dept Math D-79110 Freiburg Germany

The Real-Time Iteration (RTI) is an online nonlinear model predictive control algorithm that performs a single Sequential Quadratic Programming (SQP) per sampling time. The algorithm is split into a preparation and a feedback phase, where the latter one performs as little computations as possible solving a single prepared quadratic program. To further improve the accuracy of this method, the Advanced-Step RTI (AS-RTI) performs additional Multi-Level Iterations (MLI) in the preparation phase, such as inexact or zero-order SQP iterations on a problem with a predicted state estimate. This letter extends and streamlines the existing local convergence analysis of AS-RTI, such as analyzing MLI of level A and B for the first time, and significantly simplifying the proofs for levels C and D. Moreover, this letter provides an efficient open-source implementation in acados, making it widely accessible to practitioners.

关键词： Real-time systems software algorithms Prediction algorithms Vectors Quadratic programming Predictive control Optimal control Model predictive control numerical algorithms software

来源：评论

学校读者我要写书评

暂无评论

ARMISTICE: Microarchitectural Leakage Modeling for Masked software Formal Verification

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2022年第11期41卷 3733-3744页

作者： de Grandmaison, Arnaud Heydemann, Karine Meunier, Quentin L. Arm France F-92400 Paris France Sorbonne Univ LIP6 CNRS F-75005 Paris France

Side-channel attacks are powerful attacks for retrieving secret data by exploiting physical measurements, such as power consumption or electromagnetic emissions. Masking is a popular countermeasure as it can be proven secure against an attacker model. In practice, software-masked implementations suffer from a security reduction due to a mismatch between the considered leakage sources in the security proof and the real ones, which depend on the microarchitecture. We propose ARMISTICE, a framework for formally verifying the absence of leakage in first-order masked implementations taking into account modeled microarchitectural sources of leakage. As a proof of concept, we present the modeling of an Arm Cortex-M3 core from its RTL description and leakage test vectors, as well as the modeling of the memory of an STM32F1 board, exclusively using leakage test vectors. We show that, with these models, ARMISTICE pinpoints vulnerable instructions in real-world masked implementations and helps the design of masked software implementations which are practically secure.

关键词： Computational modeling software Registers Codes Security software algorithms Integrated circuit modeling Masking microarchitectural leakage side-channel attacks (SCA) verification

来源：评论

学校读者我要写书评

暂无评论

The Nature of Computational Models

引用

COMPUTING IN SCIENCE & ENGINEERING 2023年第1期25卷 61-66页

作者： Hinsen, Konrad Ctr Natl Rech Sci Ctr Biophys Mol F-45071 Orleans France

Computational models lie at the heart of computational science, yet few scientists have a clear idea of what a computational model actually is. Is it software? Or an algorithm? How does it relate to mathematical models? What are suitable languages or notations for expressing a computational model in the literature? And will AI make computational models obsolete?

关键词： Scientific computing Computational modeling software algorithms Mathematical models software engineering Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Group Recommendation Based on Heterogeneous Graph Algorithm for EBSNs

引用

IEEE ACCESS 2023年 11卷 1854-1866页

作者： Wu, Yue Huang (Wayne), Wei Yu'd, Lean Tiand, Yingjie Xi An Jiao Tong Univ Sch Management Natl Lab Mech Manufacture Syst Xian 710049 Peoples R China NCAMS DeFin Shenzhen 518055 Peoples R China Southern Univ Sci & Technol Coll Business Shenzhen 518055 Peoples R China Univ Chinese Acad Sci Sch Econ & Management Beijing 101408 Peoples R China

Emerging event-based social networks (EBSNs), such as Meetup, have grown rapidly and become popular in recent years. EBSNs differ from conventional social networks such as Facebook in that they not only involve online social interactions but also include offline, in-person interactions. Thus, EBSNs are naturally heterogeneous and possess more valuable social information. Group recommendations in EBSNs are typically only based on the interest information filled in by users, or friends' group information. Both these methods may not well reflect users' real intentions. In this study, we propose a recommender system to predict groups that may interest EBSN users, based on a novel heterogeneous augmented graph method and a random walk with restart algorithm. In this approach, online and offline social interactions are combined into a single heterogeneous augmented graph capturing all useful relationships, including user-to-group relationships, user-to-event relationships, user-to-attribute relationships, and group-to-attribute relationships, and among others. To our knowledge, this work is the first attempt to apply a random walk algorithm into group recommendation in EBSNs. Extensive experiments on Meetup datasets demonstrate that our proposed recommender system achieves better results in terms of recall, precision, F-Measure and MRR metrics in comparison with the other four commonly used algorithms, including random recommendation, interest-based recommendation, interest- and neighborhood-based recommendation, and Katz Centrality. The significant recommendation performance of our approach may further enhance user satisfaction of EBSNs. Moreover, our approach to group recommendation may also be extended to other recommendation-related applications such as event or friend recommendation.

关键词： Social networking (online) Internet Recommender systems Economics software algorithms Periodic structures Multimedia Web sites Online group recommendation heterogeneous graph random walk

来源：评论

学校读者我要写书评

暂无评论

Balancing Constraints and Objectives by Considering Problem Types in Constrained Multiobjective Optimization

引用

IEEE TRANSACTIONS ON CYBERNETICS 2023年第1期53卷 88-101页

作者： Xiang, Yi Yang, Xiaowei Huang, Han Wang, Jiahai South China Univ Technol Sch Software Engn Guangzhou 510006 Peoples R China South China Univ Technol Sch Software Engn Minist Educ Guangzhou 510006 Peoples R China South China Univ Technol Minist Educ Key Lab Big Data & Intelligent Robot Guangzhou 510006 Peoples R China Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510275 Peoples R China

Constrained multiobjective optimization problems widely exist in real-world applications. To handle them, the balance between constraints and objectives is crucial, but remains challenging due to non-negligible impacts of problem types. In our context, the problem types refer particularly to those determined by the relationship between the constrained Pareto-optimal front (PF) and the unconstrained PF. Unfortunately, there has been little awareness on how to achieve this balance when faced with different types of problems. In this article, we propose a new constraint handling technique (CHT) by taking into account potential problem types. Specifically, inspired by the prior work, problems are classified into three primary types: 1) I;2) II;and 3) III, with the constrained PF being made up of the entire, part and none of the unconstrained counterpart, respectively. Clearly, any problem must be one of the three types. For each possible type, there exists a tailored mechanism being used to handle the relationships between constraints and objectives (i.e., constraint priority, objective priority, or the switch between them). It is worth mentioning that exact problem types are not required because we just consider their possibilities in the new CHT. Conceptually, we show that the new CHT can make a tradeoff among different types of problems. This argument is confirmed by experimental studies performed on 38 benchmark problems, whose types are known, and a real-world problem (with unknown types) in search-based software engineering. Results demonstrate that within both decomposition-based and nondecomposition-based frameworks, the new CHT can indeed achieve a good tradeoff among different problem types, being better than several state-of-the-art CHTs.

关键词： Optimization Switches Statistics Sociology software engineering Taxonomy software algorithms Constrained multiobjective optimization constraint handling techniques (CHTs) problem types tradeoff model (ToM)

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：