Arrow Research search

Author name cluster

Bo Hou

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

9 papers
2 author rows

Possible papers

9

TCS Journal 2026 Journal Article

An approximation algorithm for the asymmetric profitable tour problem with submodular penalties

  • Zhenzhen Pang
  • Wen Liu
  • Bo Hou

In this paper, we study the asymmetric profitable tour problem with submodular penalties. The objective is to find a directed tour that visits a subset of vertices such that the length of the tour plus the penalty for the rejected vertex set, which is determined by a submodular function, is minimized. Following the framework as in the Bienstock et al. ’s algorithm [1], we design an approximation algorithm for this problem. Our algorithm achieves an approximation ratio of n ( 1 + ⌈ log ( n ) ⌉ ), where n is the number of vertices.

TCS Journal 2026 Journal Article

Approximation algorithm for k-Product uncapacitated facility location problem with submodular penalties

  • Chenzheng Feng
  • Wen Liu
  • Gengsheng Zhang
  • Bo Hou

In this paper, we consider the k -product uncapacitated facility location problem with submodular penalties. In this problem, we are given a set of demand points where clients are located, a set of potential locations where unlimited capacity facilities can be opened and a set of k different kinds of products. Each open facility can only supply one kind of product, and its open cost is determined by the product it supplies. There is a service cost between each pair of locations. Assume these costs of service are metric. Each client is either supplied k different kinds of products by a set of k different open facilities or completely rejected and a rejection cost has to be paid, which is determined by a submodular function. The objective is to minimize the total cost, including the cost of opening facilities at sites, the service cost for providing products to clients from the open facilities, and the penalty cost of the set of the rejected clients. Based on the LP rounding technique, we propose a ( 2 k + 2 ) -approximation algorithm for this problem.

EAAI Journal 2026 Journal Article

Global-to-Local Deep Interaction and Boundary-Aware Transformer for accurate polyp segmentation

  • Xiaojuan Liu
  • Xuan Li
  • Zhi Liu
  • Ke Peng
  • Shanxiong Chen
  • Yijue Zhang
  • Bo Hou

Colorectal cancer is a highly preventable disease. Colonoscopy allows for the detection and removal of polyps, which enables early diagnosis and timely intervention. In clinical practice, automatic polyp segmentation techniques based on colonoscopy images can improve both detection efficiency and accuracy, while helping physicians accurately locate polyps. However, existing methods still have limitations in coordinating global and local features, fusing multi-scale features, and handling ambiguous boundaries. To address these challenges, this paper proposes the Global-to-Local Deep Interaction and Boundary-Aware Transformer. This approach incorporates a Global–Local Aggregation module to coordinate fine-grained details with semantic information; employs a Multi-Scale Residual Decoder to enhance cross-layer feature fusion efficiency; and introduces a Dynamic Feature Fusion Module comprising Hierarchical Fusion and Error-Aware Refinement, for adaptive optimisation in boundary regions. We conducted extensive experiments and comparative analyses on five publicly available polyp datasets, evaluating our model against 15 state-of-the-art approaches. To further validate the model’s generalisation capabilities, we also designed experiments targeting small polyps. The experimental results show that our method performs well across multiple datasets, especially with mean Dice scores of 93. 9% on CVC-ClinicDB and 84. 7% on ETIS-LaribPolypDB.

ECAI Conference 2025 Conference Paper

Safe APG: Accelerated Policy Gradient Algorithm for Secure Policy Updating in Reinforcement Learning

  • Jianan Lin
  • Yao Chen 0003
  • Zhengyang Ji
  • Yuan Meng
  • Bo Hou
  • Shaolin Tan

Inverse reinforcement learning (IRL) aims to infer the reward function from expert demonstrations. However, as IRL techniques are increasingly applied in high-stakes domains such as autonomous driving and military decision-making, reward function leakage has emerged as a critical risk, potentially leading to severe security threats and unintended consequences. To address this challenge, we propose Safe Accelerated Policy Gradient (Safe APG), a method designed to enhance learning security of the demonstrating agent by preventing observers from inferring its reward function. The core idea behind Safe APG is to incorporate a delicately constructed and theoretically guaranteed structural noise into Nesterov’s Accelerated Gradient (NAG) for policy updating, with the goal of concealing critical gradient information from the learning agent as well as keeping the geometric convergence property of NAG. The results from numerical experiments and simulations in reinforcement learning environments demonstrate that the proposed method not only significantly mitigates reward function leakage, but also achieves superior convergence rates even under the perturbation of the introduced structural noise.

YNIMG Journal 2024 Journal Article

Linguistic network in early deaf individuals: A neuroimaging meta-analysis

  • Tengyu Yang
  • Xinmiao Fan
  • Bo Hou
  • Jian Wang
  • Xiaowei Chen

This meta-analysis summarizes evidence from 44 neuroimaging experiments and characterizes the general linguistic network in early deaf individuals. Meta-analytic comparisons with hearing individuals found that a specific set of regions (in particular the left inferior frontal gyrus and posterior middle temporal gyrus) participates in supramodal language processing. In addition to previously described modality-specific differences, the present study showed that the left calcarine gyrus and the right caudate were additionally recruited in deaf compared with hearing individuals. In addition, this study showed that the bilateral posterior superior temporal gyrus is shaped by cross-modal plasticity, whereas the left frontotemporal areas are shaped by early language experience. Although an overall left-lateralized pattern for language processing was observed in the early deaf individuals, regional lateralization was altered in the inferior frontal gyrus and anterior temporal lobe. These findings indicate that the core language network functions in a modality-independent manner, and provide a foundation for determining the contributions of sensory and linguistic experiences in shaping the neural bases of language processing.

YNICL Journal 2021 Journal Article

Altered regional activity and connectivity of functional brain networks in congenital unilateral conductive hearing loss

  • Tengyu Yang
  • Qiang Liu
  • Xinmiao Fan
  • Bo Hou
  • Jian Wang
  • Xiaowei Chen

Neuroimaging studies have shown marked alterations in brain function after auditory deprivation, with these alterations mainly caused by sensorineural hearing loss. To date, however, little is known about the patterns of functional brain reorganization in conductive hearing loss (CHL). The effects of congenital unilateral CHL on human brain were assessed by resting-state functional magnetic resonance imaging in 24 patients with unilateral microtia (UM) and 25 healthy controls. Focal brain function and seed-based functional connectivity were analyzed to characterize spontaneous activity and network changes in UM. Patients with UM showed common alterations in focal brain activities in the left inferior temporal gyrus across different measurements, with these alterations significantly associated with the duration of hearing loss. Additionally, focal brain activities were decreased in the auditory system and increased in the visual system, with a disassociated pattern shown in the default-mode system. Using the left inferior temporal gyrus as the seed region, patients with UM showed lower connectivity with the default-mode system and right visual regions but higher connectivity with the left frontoparietal regions when compared with controls. These results indicate that congenital partial hearing deprivation, despite normal bone conduction hearing, can induce widespread reorganizations that continue into adolescence and adulthood.

TCS Journal 2021 Journal Article

Approximation algorithms for the submodular edge cover problem with submodular penalties

  • Xin Wang
  • Suogang Gao
  • Bo Hou
  • Lidong Wu
  • Wen Liu

In this paper, we consider the submodular edge cover problem with submodular penalties. In this problem, we are given an undirected graph G = ( V, E ) with vertex set V and edge set E. Assume the covering cost function c: 2 E → R + and the penalty function p: 2 V → R + are both submodular with p non-decreasing, c ( ∅ ) = 0 and p ( ∅ ) = 0. The goal of the submodular edge cover problem with submodular penalties is to select an edge subset to cover some vertices and penalize the vertex subset containing uncovered vertices such that the total cost of covering and penalty is minimized. For this problem, we first give a 2Δ-approximation algorithm by using a primal-dual technique, where Δ is the maximal degree of the graph G. Then we transform this problem into a submodular set cover problem, and by applying a known result for the submodular set cover problem we conclude that there is an approximation algorithm with an approximation ratio Δ + 1.

TCS Journal 2021 Journal Article

On approximation algorithm for the edge metric dimension problem

  • Yufei Huang
  • Bo Hou
  • Wen Liu
  • Lidong Wu
  • Stephen Rainwater
  • Suogang Gao

In this paper, we study the edge metric dimension problem (EMDP). We establish a potential function and give a corresponding greedy algorithm with approximation ratio 1 + ln ⁡ n + ln ⁡ ( log 2 ⁡ n ), where n is the number of vertices in the graph G.

TCS Journal 2020 Journal Article

An approximation algorithm for the k-prize-collecting multicut on a tree problem

  • Xin Hou
  • Wen Liu
  • Bo Hou

In this paper, we consider the k-prize-collecting multicut on a tree (k-PCM(T)) problem. In this problem, we are given an undirected tree T = ( V, E ), a set of m distinct pairs of vertices P = { ( s 1, t 1 ), …, ( s m, t m ) } and a parameter k with k ≤ m. Every edge in E has a nonnegative cost c e. Every pair ( s i, t i ) in P has a nonnegative penalty cost π i. Our goal is to find a multicut M that separates at least k pairs in P such that the total cost, including the edge cost of the multicut M and the penalty cost of the pairs not separated by M, is minimized. This problem generalizes the well-known multicut on a tree problem. Our main work is to present a ( 4 + ε ) -approximation algorithm for the k-PCM(T) problem via the methods of primal-dual and Lagrangean relaxation, where ε is any fixed positive number.

v2026.09.13