Skip to main content

and
  1. No Access

    Article

    A universal calibration method for eliminating topography-dependent current in conductive AFM and its application in nanoscale imaging

    The topography and electrical properties are two crucial characteristics that determine the roles and functionalities of materials. Conductive atomic force microscopy (CAFM) is widely recognized for its abilit...

    Chunlin Hao, Hao Xu, Shiquan Lin, Yaju Zhang, **miao He, Bei Liu in Nano Research (2024)

  2. Article

    Open Access

    metaSpectraST: an unsupervised and database-independent analysis workflow for metaproteomic MS/MS data using spectrum clustering

    The high diversity and complexity of the microbial community make it a formidable challenge to identify and quantify the large number of proteins expressed in the community. Conventional metaproteomics approac...

    Chunlin Hao, Joshua E. Elias, Patrick K. H. Lee, Henry Lam in Microbiome (2023)

  3. No Access

    Chapter and Conference Paper

    Frank Wolfe Algorithm for Nonmonotone One-Sided Smooth Function Maximization Problem

    In this paper, we study the problem of maximizing a nonmonotone one-sided- \(\eta \) smooth (OSS for short) function ...

    Hongxiang Zhang, Chunlin Hao, Wenying Guo in Computational Data and Social Networks (2023)

  4. No Access

    Chapter and Conference Paper

    On Stochastic k-Facility Location

    In the stochastic facility location problem, there are two-stage processes for the decision. A set of facilities may be opened without information for the demand of clients at the first stage; an additional se...

    Yicheng Xu, Chunlin Hao, Chenchen Wu in Algorithmic Aspects in Information and Man… (2021)

  5. No Access

    Chapter and Conference Paper

    A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with MinSum Movement

    Energy efficiency is a critical issue that attracts numerous interest of many researchers in wireless mobile sensor networks. Emerging IoT applications have brought the MinSum Sink-based Linear Barrier Coverag...

    Wenjie Zou, Longkun Guo, Chunlin Hao in Algorithmic Aspects in Information and Man… (2021)

  6. No Access

    Chapter and Conference Paper

    Approximation Algorithms for the Lower-Bounded Knapsack Median Problem

    In this paper, we introduce the lower-bounded knapsack median problem (LB knapsack median). In this problem, we are given a set of facilities, a set of clients, a budget B and a lower bound L. Every facility is a...

    Lu Han, Chunlin Hao, Chenchen Wu in Algorithmic Aspects in Information and Man… (2020)

  7. No Access

    Chapter and Conference Paper

    Approximation Algorithms for the Lower-Bounded k-Median and Its Generalizations

    In this paper, we consider the lower-bounded k-median problem (LB k-median) that extends the classical k-median problem. In the LB k-median, a set of facilities, a set of clients and an integer k are given. Every...

    Lu Han, Chunlin Hao, Chenchen Wu, Zhenning Zhang in Computing and Combinatorics (2020)

  8. Article

    Open Access

    Mutational analysis of renal angiomyolipoma associated with tuberous sclerosis complex and the outcome of short-term everolimus therapy

    To identify clinical characteristics and mutation spectra in Chinese patients with renal angiomyolipoma (AML) associated with the tuberous sclerosis complex (TSC, TSC-AML), examined the efficacy and safety of ...

    Jianxin Ni, Fengqi Yan, Weijun Qin, Lei Yu, Geng Zhang, Fei Liu in Scientific Reports (2019)

  9. No Access

    Article

    Local search approximation algorithms for the k-means problem with penalties

    In this paper, we study the k-means problem with (nonuniform) penalties (k-MPWP) which is a natural generalization of the classic k-means problem. In the k-MPWP, we are given an n-client set

    Dongmei Zhang, Chunlin Hao, Chenchen Wu in Journal of Combinatorial Optimization (2019)

  10. No Access

    Chapter and Conference Paper

    A Local Search Approximation Algorithm for the k-means Problem with Penalties

    In this paper, we study the k-means problem with (nonuniform) penalties (k-MPWP) which is a natural generalization of the classic k-means problem. In the k-MPWP, we are given an n-client set

    Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu in Computing and Combinatorics (2017)