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

A Hardware Architecture Design for High-Speed Vessel Orientation Recognition

IEEE ACCESS 2024年 12卷 155287-155294页

作者： Han, Dongjun Xu, Ming Wu, Yuhang Zhou, Fuhui Nanjing Univ Aeronaut & Astronaut Dept Elect & Informat Engn Nanjing Jiangsu Peoples R China

Vascular orientation recognition (VOR) holds widespread applications in biomedical domains such as vascular image processing. Although many methods based on deep learning (DL) running on CPUs have been proposed and achieved appreciable results, they encounter a speed bottleneck. Therefore, an FPGA-based hardware design scheme is proposed in this paper to achieve high-speed VOR using small circuits. The design employs a streaming processing method for image thresholding and replaces static lookup tables (LUT) with the CORDIC algorithm to reduce resource consumption. Additionally, further compression of the angle mapping range is employed to achieve superior hardware resource optimization. Compared to purely software solutions, experimental results obtained with the simulated and actual vascular images demonstrate a 12.9x computational acceleration employing the proposed scheme. Moreover, the proposed scheme, in contrast to hardware implementations based on Lookup Table and Function approximation, reduces LUT resource consumption by over 60%. Compared with two previous CORDIC algorithm studies, the proposed algorithm achieves a 14.6% and 20.5% reduction in LUT resource usage, thus showing enormous potential in real-time medical devices for tracking and computation of main vascular trajectory.

关键词： Hardware Real-time systems Field programmable gate arrays Computer architecture Image analysis approximation algorithms Optimization Image edge detection Feature extraction Accuracy Biomedical monitoring Circulatory system Medical image processing vascular orientation recognition improved CORDIC algorithm

来源：评论

学校读者我要写书评

暂无评论

Referral Strategy Based on Social Network Incentive

引用

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2024年第1期11卷 683-696页

作者： Li, Yongli Liu, Chao Wei, Chuang Ma, Xiaochen Harbin Inst Technol Sch Econ & Management Harbin 150001 Peoples R China Cent Univ Finance & Econ Business Sch Beijing 100081 Peoples R China

Customers' social network is often regarded as valuable capital for companies and individuals. Although quite a few studies have empirically demonstrated the positive influence of customers' social networks on boosting sale performance, it is still an open question that how to utilize customers' social networks to design profitable and feasible referral incentive strategies. To this end, this work establishes a game model by introducing the referral incentive strategies of different forms based on the analysis of the marketing process. Regarding the modeled incentive strategy as the target of solving the game model, this work finds it is an NP-hard problem of solving the model and further proposes an approximate algorithm. In order to cope with large-scale data sets, the proposed algorithm is further extended into a new one with low time complexity. Then, theoretical analysis, numerical experiments, and real applications are conducted to validate the performance of the model. In all, the proposed model, algorithm, and findings contribute to both theoretic models and practical operations in the field of social networks and social computation.

关键词： Social networking (online) Games Costs Time complexity Solid modeling approximation algorithms Analytical models Iteration algorithm network incentive referral strategy social marketing social network

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Approximate Divider Based on Logarithmic Conversion and Piecewise Constant approximation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2022年第7期69卷 2655-2668页

作者： Wu, Yong Jiang, Honglan Ma, Zining Gou, Pengfei Lu, Yong Han, Jie Yin, Shouyi Wei, Shaojun Liu, Leibo Tsinghua Univ Sch Integrated Circuits Beijing 100084 Peoples R China Shanghai Jiao Tong Univ Dept Micronano Elect Shanghai 200240 Peoples R China Hexin Technol Co Ltd Guangzhou 510530 Guangdong Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 1H9 Canada

Approximate computing (AC) has been considered as a promising paradigm to improve the energy-efficiency of computing hardware for error-tolerant applications, with negligible quality degradation to the output. Dividers frequently limit the performance of a computing system;however, they have not received as much attention as multipliers and adders in AC. In this paper, an energy-efficient and high-performance approximate divider is proposed based on logarithmic conversion and piecewise constant approximation. In this design, the range for the conversion between binary and logarithmic numbers is first expanded from [0,1] to [-0.5,1]. A heuristic search algorithm is then devised to find the most accurate constant set to approximate the reciprocal of the divisor, by minimizing a statistical error. The hardware implementation is presented for both floating-point (FP) and integer dividers. With a high configurability, the proposed divider results in a mean relative error distance (MRED) from 2.78% to 0.046%, indicating a high accuracy among state-of-the-art approximate dividers. Compared to the half-precision FP divider, the proposed divider with a MRED of 0.74% can achieve nearly 90x improvement in PDP. Moreover, compared to state-of-the-art approximate dividers, the proposed design is in the Pareto Frontier in terms of power delay product (PDP) and MRED. The three image processing application results demonstrate that the proposed divider can result in the highest peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) even with truncation.

关键词： Hardware approximation algorithms Standards Adders Degradation Approximate computing Transistors Approximate computing divider logarithmic conversion heuristic constant-set searching

来源：评论

学校读者我要写书评

暂无评论

Multiarmed Bandit algorithms on Zynq System-on-Chip: Go Frequentist or Bayesian?

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2024年第2期35卷 2602-2615页

作者： Santosh, S. V. Sai Darak, Sumit J. Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA IIIT Delhi Elect & Commun Dept New Delhi 110020 India

Multiarmed Bandit (MAB) algorithms identify the best arm among multiple arms via exploration-exploitation trade-off without prior knowledge of arm statistics. Their usefulness in wireless radio, Internet of Things (IoT), and robotics demand deployment on edge devices, and hence, a mapping on system-on-chip (SoC) is desired. Theoretically, the Bayesian-approach-based Thompson sampling (TS) algorithm offers better performance than the frequentist-approach-based upper confidence bound (UCB) algorithm. However, TS is not synthesizable due to Beta function. We address this problem by approximating it via a pseudorandom number generator (PRNG)-based architecture and efficiently realize the TS algorithm on Zynq SoC. In practice, the type of arms distribution (e.g., Bernoulli, Gaussian) is unknown, and hence, a single algorithm may not be optimal. We propose a reconfigurable and intelligent MAB (RI-MAB) framework. Here, intelligence enables the identification of appropriate MAB algorithms in an unknown environment, and reconfigurability allows on-the-fly switching between algorithms on the SoC. This eliminates the need for parallel implementation of algorithms resulting in huge savings in resources and power consumption. We analyze the functional correctness, area, power, and execution time of the proposed and existing architectures for various arm distributions, word length, and hardware-software codesign approaches. We demonstrate the superiority of the RI-MAB algorithm and its architecture over the TS and UCB algorithms.

关键词： Heuristic algorithms Computer architecture Software algorithms approximation algorithms Internet of Things Decision making Bayes methods Intelligent architecture multiarmed bandit (MAB) partial reconfiguration Thompson sampling (TS) Zynq SoC

来源：评论

学校读者我要写书评

暂无评论

Approximate Belief-Selective Propagation Detector for Massive MIMO Systems

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2024年第6期71卷 2938-2950页

作者： Zhou, Wenyue Ji, Zhenhao Tan, Zeqiong You, Zhuangzhuang Tan, Xiaosi You, Xiaohu Zhang, Chuan Southeast Univ LEADS Natl Mobile Commun Res Lab Nanjing 211189 Peoples R China Southeast Univ Frontiers Sci Ctr Mobile Informat Commun & Secur Nanjing 211189 Peoples R China Purple Mt Labs Nanjing 211100 Peoples R China

When faced with challenging antenna configu-rations or high-order modulations in realistic propagationenvironments, the Belief Propagation (BP) MIMO detector out-performs its linear counterparts. To mitigate the error floor issueand lower the complexity, a revised BP detector, named theBelief-selective Propagation (BsP) detector, has recently emergedby selectively utilizing trusted incoming messages for *** those promising potentials, the straightforward hardwareimplementation of the BsP detector still suffers from highcomplexity and necessitates further optimization. To bridge thegap between the BsP algorithm and implementation, this paperintroduces anapproximatebut implementation-friendly BsPdetector called aBsP, based on which the very first BsP hardwareis proposed. Two unexplored features:approximate initializa-tionandsimplified message updatessave the complexity (morethan 84%) with acceptable performance penalization. Multi-level optimization techniques involving group-layered messageupdating, approximate arithmetic circuits, and hybrid-precisequantization are developed to boost the hardware efficiency.A 128x8 256-QAM aBsP MIMO detector ASIC in 40 nmCMOS occupies an area of 0.68 mm(2)and reaches a throughputof 790.52 Mbps. Benchmarking with the recent arts, this workachieves 1.08xarea efficiency and 3.34xgate efficiency.

关键词： Detectors Hardware Symbols Complexity theory Lattices approximation algorithms Vectors MIMO detector BsP detector approximate BsP (aBsP) hardware implementation ASIC

来源：评论

学校读者我要写书评

暂无评论

Digraph k-Coloring Games: New algorithms and Experiments

引用

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2024年 81卷 163-202页

作者： D'Ascenzo, Andrea D'Emidio, Mattia Flammini, Michele Monaco, Gianpiero Luiss Univ Viale Romania 32 I-00197 Rome Italy Univ Laquila Dept Informat Engn Comp Sci & Math Via Vetoio Snc I-67100 Laquila Italy Gran Sasso Sci Inst Dept Comp Sci Viale F Crispi 7 I-67100 Laquila Italy Univ Calabria Dept Math & Comp Sci Via P Bucci I-87036 Arcavacata di Rende CS Italy Univ G dAnnunzio Dept Econ Studies Viale Pindaro I-65127 Pescara Italy

We study digraph k-coloring games where strategic agents are vertices of a digraph and arcs represent agents' mutual unidirectional conflicts/idiosyncrasies. Each agent can select, as strategy, one of k different colors, and her payoff in a given state (a k-coloring) is given by the number of outgoing neighbors with a color different from her one. Such games model lots of strategic real-world scenarios and are related to several fundamental classes of anti-coordination games. Unfortunately, the problem of understanding whether an instance of the game admits a pure Nash equilibrium (NE), i.e., a state where no agent can improve her payoff by changing strategy, is NP-complete. Thus, in this paper, we focus on algorithms to compute an approximate NE: informally, a coloring is an approximate gamma-NE, for some gamma >= 1, if no agent can improve her payoff, by changing strategy, by a multiplicative factor of gamma. Our contribution is manifold and of both theoretical and experimental nature. First, we characterize the hardness of finding pure and approximate equilibria in both general and special classes of digraphs. Second, we design and analyze three approximation algorithms with different theoretical guarantees on the approximation ratio, under different conditions;(i) algorithm APPROX-1 which computes, for any k >= 3, a Delta(o)-NE for any n vertex graph having a maximum outdegree of Delta(o) , in polynomial time;(ii) algorithm LLL-SPE, a randomized algorithm that, for any constant k >= 2, determines a gamma-NE for some constant gamma but only in digraphs whose minimum outdegree is sufficiently large, in polynomial time in expectation;(iii) algorithm APPROX-3 which, for any epsilon > 0, computes a (1+epsilon)-NE by using O ( log n/epsilon) colors, for any n-vertex digraph. Note that, the latter shows that a (1 + epsilon)-NE exists and can be computed in polynomial time for k = O(logn). Finally, to assess how proposed algorithms behave in the typical case, we complet

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Intervention in the Spread of Misinformation in Social Networks

引用

IEEE ACCESS 2024年 12卷 133489-133498页

作者： Sakiyama, Takumi Nakajima, Kazuki Aida, Masaki Tokyo Metropolitan Univ Grad Sch Syst Design Tokyo 1910065 Japan

The spread of misinformation through social media has often impacted public opinion and precipitated social disruption. In response to such real-world instances, strategies to intervene in the diffusion of misinformation among individuals have been developed. A basic intervention approach involves disseminating correct information to the largest possible population in a social network. In the present study, we investigate the problem of identifying a set of seed individuals that maximize the spread of correct information throughout a social network where the diffusion of misinformation has occurred. We find that a greedy algorithm for this problem lacks theoretical guarantees regarding the approximation ratio of the spread of correct information and requires considerable computation time in large-scale networks. To address this efficiency issue, we propose a heuristic algorithm called MCEaSyIM. The proposed algorithm exploits stochastic properties of the simultaneous diffusion of misinformation and correct information on the network to efficiently compute the seed individuals that approximately maximize the expected diffusion of correct information. Our algorithm achieves a comparable spread of correct information in a considerably faster computation time compared with the greedy algorithm. In addition, our algorithm achieves a broader spread of correct information in a reasonable computation time than topology-based heuristics, such as the method that selects seed individuals with the largest out-neighbors that have not been activated with misinformation. Moreover, we found that the effectiveness of our algorithm in spreading correct information is partially associated with the degree assortativity of the network. We expect that our algorithm will serve as an efficient and effective intervention strategy in combating the spread of misinformation in social networks.

关键词： Fake news Social networking (online) Greedy algorithms Integrated circuit modeling Heuristic algorithms Diffusion models approximation algorithms influence maximization misinformation online social networks

来源：评论

学校读者我要写书评

暂无评论

Co-Activity Maximization in Online Social Networks

引用

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2024年第1期11卷 66-75页

作者： Mao, Dongyu Wu, Weili Du, Ding-Zhu Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA

Social media with online social networks has risen to be a prevalent force in information diffusion and public discourse. Despite its popularity and convenience, social media has been criticized for contributing to societal and ideological polarization as the result of trapping users in an echo chamber and filter bubbles. An emerging line of research focuses on ways to redesign content or link recommendation algorithms to mitigate the polarization phenomenon. However, existing works mainly concentrate on node-level balancing, while omitting the balancing effect that can be incurred by edge interaction in social networks. In this article, we take the first step to study the problem (CoAM) that assuming two campaigns are present in a network, how we should select seeds for each so as to maximize the interaction/activity between the followers of two campaigns (co-activity) after the diffusion process is finished. We begin our analysis by showing the hardness of CoAM under two diffusion models that are generalized from wildly used diffusion models and its objective function is neither submodular nor supermodular. This encourages us to design a submodular function that acts as a lower bound to the objective, by exploiting which we are able to devise a greedy algorithm with a provable approximation guarantee. To overcome the #P-hardness of diffusion calculation, we further extend the notion of random reverse-reachable (RR) set to devise a scalable instantiation of our approximation algorithm. We experimentally demonstrate the quality of our approximation algorithm on datasets collected from real-world social networks.

关键词： Social networking (online) approximation algorithms Stochastic processes Linear programming Diffusion processes Voting Semantics approximation algorithm echo chamber filter bubbles martingale social network

来源：评论

学校读者我要写书评

暂无评论

iMCB-PGO: Incremental Minimum Cycle Basis Construction and Application to Online Pose Graph Optimization

引用

IEEE ROBOTICS AND AUTOMATION LETTERS 2024年第11期9卷 10185-10192页

作者： Chen, Keyu Bai, Fang Huang, Shoudong Sun, Yuxiang Hong Kong Polytech Univ Dept Mech Engn Kowloon Hong Kong Peoples R China Surg Augmented Real SURGAR F-63000 Clermont Ferrand France Nanyang Technol Univ Sch Elect & Elect Engn Singapore 641651 Singapore Univ Technol Robot Inst Fac Engn & Informat Technol Ultimo NSW 2007 Australia Univ Hong Kong Dept Mech Engn Kowloon Hong Kong Peoples R China

Pose graph optimization (PGO) is a fundamental technique for robot localization. It is typically encoded with a sparse graph. The recent work on the cycle-based PGO reveals the merits of solving PGOs in the graph cycle space, which brings the computation of the minimum cycle basis (MCB) into the robotics community. However, due to batch-MCB's inability to handle the graph topology changes, it is hard for its use in real-time applications. In practice, PGOs are constructed incrementally, which requires us to solve MCB problems in an incremental setting. In this letter, we propose an exact method to solve MCB problem in an incrementally constructed graph. Methodology-wise, we first compute a tight superset called isometric set which contains an MCB, and then apply independence tests to evaporate redundant cycles to form an MCB. Our main contribution is the construction of an effective algorithm to update the superset, namely the isometric set, in an incremental setting. Our update rules preserve the optimality, thus yielding an exact incremental MCB algorithm, which is termed as iMCB. We integrate our iMCB algorithm into the cycle-based PGO, forming the iMCB-PGO approach. We validate the superior performance of our iMCB-PGO on a range of simulated and real-world datasets.

关键词： Vectors Simultaneous localization and mapping Optimization Real-time systems Lenses Sun approximation algorithms Incremental minimum cycle basis cycle-based pose graph optimization SLAM back-end

来源：评论

学校读者我要写书评

暂无评论

Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2024年第4期21卷 5048-5061页

作者： Chandak, Nikhil Chour, Kenny Rathinam, Sivakumar Ravi, R. Int Inst Informat Technol Gachibowli 500032 Telangana India Texas A&M Univ Dept Mech Engn College Stn TX 77845 USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

We interleave sampling based motion planning methods with pruning ideas from minimum spanning tree algorithms to develop a new approach for solving a Multi-Goal Path Finding (MGPF) problem in high dimensional spaces. The approach alternates between sampling points from selected regions in the search space and de-emphasizing regions that may not lead to good solutions for MGPF. Our approach provides an asymptotic, 2-approximation guarantee for MGPF. We also present extensive numerical results to illustrate the advantages of our proposed approach over uniform sampling in terms of the quality of the solutions found and computation speed.

关键词： Costs Steiner trees Planning Space exploration Self-organizing feature maps Task analysis Collision avoidance Shortest path problem steiner trees approximation algorithms motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：