Searcharxiv⌕ Search

arXiv subjects

Yiming Hu

Publications and source records attributed to Yiming Hu.

At least 37 records · Page 2Linked to original sources
arXiv2025

Beam test result and digitization of TaichuPix-3: A Monolithic Active Pixel Sensors for CEPC vertex detector

The Circular Electron-Positron Collider (CEPC), as the next-generation electron-positron collider, is tasked with advancing not only Higgs physics but also the discovery of new physics. Achieving these goals requires high-precision measurements of particles. Taichu seires, Monolithic Active Pixel Sensor (MAPS), a key component of the vertex detector for CEPC was designed to meet the CEPC's requirements. For the geometry of vertex detector is long barrel with no endcap, and current silicon lacks a complete digitization model, precise estimation of cluster size particularly causing by particle with large incident angle is needed. Testbeam results were conducted at the Beijing Synchrotron Radiation Facility (BSRF) to evaluate cluster size dependence on different incident angles and threshold settings. Experimental results confirmed that cluster size increases with incident angle. Simulations using the Allpix$^2$ framework replicated experimental trends at small angles but exhibited discrepancies at large angles, suggesting limitations in linear electric field assumptions and sensor thickness approximations. The results from both testbeam and simulations have provided insights into the performance of the TaichuPix chip at large incident angles, offering a crucial foundation for the establishment of a digital model and addressing the estimation of cluster size in the forward region of the long barrel. Furthermore, it offers valuable references for future iterations of TaichuPix, the development of digital models, and the simulation and estimation of the vertex detector's performance.

physics.ins-det↗
arXiv2024

Consensus-Based Dynamic Task Allocation for Multi-Robot System Considering Payloads Consumption

This paper presents a consensus-based payload algorithm (CBPA) to deal with the condition of robots' capability decrease for multi-robot task allocation. During the execution of complex tasks, robots' capabilities could decrease with the consumption of payloads, which causes a problem that the robot coalition would not meet the tasks' requirements in real time. The proposed CBPA is an enhanced version of the consensus-based bundle algorithm (CBBA) and comprises two primary core phases: the payload bundle construction and consensus phases. In the payload bundle construction phase, CBPA introduces a payload assignment matrix to track the payloads carried by the robots and the demands of multi-robot tasks in real time. Then, robots share their respective payload assignment matrix in the consensus phase. These two phases are iterated to dynamically adjust the number of robots performing multi-robot tasks and the number of tasks each robot performs and obtain conflict-free results to ensure that the robot coalition meets the demand and completes all tasks as quickly as possible. Physical experiment shows that CBPA is appropriate in complex and dynamic scenarios where robots need to collaborate and task requirements are tightly coupled to the robots' payloads. Numerical experiments show that CBPA has higher total task gains than CBBA.

cs.RO↗
arXiv2024

A new code for low-resolution spectral identification of white dwarf binary candidates

Close white dwarf binaries (CWDBs) are considered to be progenitors of several exotic astronomical phenomena (e.g., type Ia supernovae, cataclysmic variables). These violent events are broadly used in studies of general relativity and cosmology. However, obtaining precise stellar parameter measurements for both components of CWDBs is a challenging task given their low luminosities, swift time variation, and complex orbits. High-resolution spectra (R$> 20 000$) are preferred but expensive, resulting in a sample size that is insufficient for robust population study. To release the full potential of the less expensive low-resolution spectroscopic surveys, and thus greatly expand the CWDB sample size, it is necessary to develop a robust pipeline for spectra decomposition and analysis. We used an artificial neural network (ANN) to build spectrum generators for DA/DB white dwarfs and main-sequence stars. The best-fit stellar parameters were obtained by finding the least $χ^2$ solution to these feature lines and the continuum simultaneously. We demonstrate the reliability of our code with two well-studied CWDBs, WD 1534+503 and PG 1224+309. We also estimate the stellar parameters of 14 newly identified CWDB candidates, most of which are fitted with double component models for the first time. Our estimates agree with previous results for the common stars and follow the statistical distribution in the literature. The application of our code to a large volume of white dwarf binary candidates will offer important statistic samples to stellar evolution studies and future gravitational wave monitoring.

astro-ph.IM↗
arXiv2024

Beam test of a baseline vertex detector prototype for CEPC

The Circular Electron Positron Collider (CEPC) has been proposed to enable more thorough and precise measurements of the properties of Higgs, W, and Z bosons, as well as to search for new physics. In response to the stringent performance requirements of the vertex detector for the CEPC, a baseline vertex detector prototype was tested and characterized for the first time using a 6 GeV electron beam at DESY II Test Beam Line 21. The baseline vertex detector prototype is designed with a cylindrical barrel structure that contains six double-sided detector modules (ladders). Each side of the ladder includes TaichuPix-3 sensors based on Monolithic Active Pixel Sensor (MAPS) technology, a flexible printed circuit, and a carbon fiber support structure. Additionally, the readout electronics and the Data Acquisition system were also examined during this beam test. The performance of the prototype was evaluated using an electron beam that passed through six ladders in a perpendicular direction. The offline data analysis indicates a spatial resolution of about 5 um, with detection efficiency exceeding 99 % and an impact parameter resolution of about 5.1 um. These promising results from this baseline vertex detector prototype mark a significant step toward realizing the optimal vertex detector for the CEPC.

physics.ins-det↗
arXiv2024

Multi-Convergence-Angle Ptychography with Simultaneous Strong Contrast and High Resolution

Advances in bioimaging methods and hardware facilities have revolutionised the determination of numerous biological structures at atomic or near-atomic resolution. Among these developments, electron ptychography has recently attracted considerable attention because of its superior resolution, remarkable sensitivity to light elements, and high electron dose efficiency. Here, we introduce an innovative approach called multi-convergence-angle (MCA) ptychography, which can simultaneously enhance both contrast and resolution with continuous information transfer across a wide spectrum of spatial frequency. Our work provides feasibility of future applications of MCA-ptychography in providing high-quality two-dimensional images as input to three-dimensional reconstruction methods, thereby facilitating more accurate determination of biological structures.

physics.optics↗
arXiv2024

MobileVLM V2: Faster and Stronger Baseline for Vision Language Model

We introduce MobileVLM V2, a family of significantly improved vision language models upon MobileVLM, which proves that a delicate orchestration of novel architectural design, an improved training scheme tailored for mobile VLMs, and rich high-quality dataset curation can substantially benefit VLMs' performance. Specifically, MobileVLM V2 1.7B achieves better or on-par performance on standard VLM benchmarks compared with much larger VLMs at the 3B scale. Notably, our 3B model outperforms a large variety of VLMs at the 7B+ scale. Our models will be released at https://github.com/Meituan-AutoML/MobileVLM .

cs.CV↗
arXiv2023

MobileVLM : A Fast, Strong and Open Vision Language Assistant for Mobile Devices

We present MobileVLM, a competent multimodal vision language model (MMVLM) targeted to run on mobile devices. It is an amalgamation of a myriad of architectural designs and techniques that are mobile-oriented, which comprises a set of language models at the scale of 1.4B and 2.7B parameters, trained from scratch, a multimodal vision model that is pre-trained in the CLIP fashion, cross-modality interaction via an efficient projector. We evaluate MobileVLM on several typical VLM benchmarks. Our models demonstrate on par performance compared with a few much larger models. More importantly, we measure the inference speed on both a Qualcomm Snapdragon 888 CPU and an NVIDIA Jeston Orin GPU, and we obtain state-of-the-art performance of 21.5 tokens and 65.3 tokens per second, respectively. Our code will be made available at: https://github.com/Meituan-AutoML/MobileVLM.

cs.CV↗
arXiv2023

Beam test of a 180 nm CMOS Pixel Sensor for the CEPC vertex detector

The proposed Circular Electron Positron Collider (CEPC) imposes new challenges for the vertex detector in terms of pixel size and material budget. A Monolithic Active Pixel Sensor (MAPS) prototype called TaichuPix, based on a column drain readout architecture, has been developed to address the need for high spatial resolution. In order to evaluate the performance of the TaichuPix-3 chips, a beam test was carried out at DESY II TB21 in December 2022. Meanwhile, the Data Acquisition (DAQ) for a muti-plane configuration was tested during the beam test. This work presents the characterization of the TaichuPix-3 chips with two different processes, including cluster size, spatial resolution, and detection efficiency. The analysis results indicate the spatial resolution better than 5 $μm$ and the detection efficiency exceeds 99.5 % for both TaichuPix-3 chips with the two different processes.

physics.ins-det↗
arXiv2023

4D-Explorer: A visual software for 4D-STEM data processing and image reconstruction

With the development of high-speed electron detectors, four-dimensional scanning transmission electron microscopy (4D-STEM) has emerged as a powerful tool for characterizing microstructures in material science and life science. However, the complexity of 4D-STEM data processing necessitates an intuitive graphical user interface software for researchers. In this regard, we have developed 4D-Explorer, an open-source, lightweight and extensible software for processing 4D-STEM data. It offers a visual and interactive workflow, including data preparation, calibration, image reconstruction and generating quantitative results. Furthermore, during calibration, our software includes a novel algorithm for rotational offset correction that uses a defocused 4D-STEM dataset and its axial bright field image, which has lower experimental requirements than conventional methods. We anticipate that 4D-Explorer will help researchers harness the capabilities of 4D-STEM technology.

physics.ins-det↗
arXiv2023

Exploring the impact of weather on Metro demand forecasting using machine learning method

Urban rail transit provides significant comprehensive benefits such as large traffic volume and high speed, serving as one of the most important components of urban traffic construction management and congestion solution. Using real passenger flow data of an Asian subway system from April to June of 2018, this work analyzes the space-time distribution of the passenger flow using short-term traffic flow prediction. Stations are divided into four types for passenger flow forecasting, and meteorological records are collected for the same period. Then, machine learning methods with different inputs are applied and multivariate regression is performed to evaluate the improvement effect of each weather element on passenger flow forecasting of representative metro stations on hourly basis. Our results show that by inputting weather variables the precision of prediction on weekends enhanced while the performance on weekdays only improved marginally, while the contribution of different elements of weather differ. Also, different categories of stations are affected differently by weather. This study provides a possible method to further improve other prediction models, and attests to the promise of data-driven analytics for optimization of short-term scheduling in transit management.

cs.LG↗
arXiv2021

DPUV3INT8: A Compiler View to programmable FPGA Inference Engines

We have a FPGA design, we make it fast, efficient, and tested for a few important examples. Now we must infer a general solution to deploy in the data center. Here, we describe the FPGA DPUV3INT8 design and our compiler effort. The hand-tuned SW-HW solution for Resnet50\_v1 has (close to) 2 times better images per second (throughput) than our best FPGA implementation; the compiler generalizes the hand written techniques achieving about 1.5 times better performance for the same example, the compiler generalizes the optimizations to a model zoo of networks, and it achieves 80+\% HW efficiency.

cs.CL↗
arXiv2020

Angle-based Search Space Shrinking for Neural Architecture Search

In this work, we present a simple and general search space shrinking method, called Angle-Based search space Shrinking (ABS), for Neural Architecture Search (NAS). Our approach progressively simplifies the original search space by dropping unpromising candidates, thus can reduce difficulties for existing NAS methods to find superior architectures. In particular, we propose an angle-based metric to guide the shrinking process. We provide comprehensive evidences showing that, in weight-sharing supernet, the proposed metric is more stable and accurate than accuracy-based and magnitude-based metrics to predict the capability of child models. We also show that the angle-based metric can converge fast while training supernet, enabling us to get promising shrunk search spaces efficiently. ABS can easily apply to most of NAS approaches (e.g. SPOS, FairNAS, ProxylessNAS, DARTS and PDARTS). Comprehensive experiments show that ABS can dramatically enhance existing NAS approaches by providing a promising shrunk search space.

cs.NE↗
arXiv2019

Constraining modified gravity with ringdown signals: an explicit example

An explicit example is found showing how a modified theory of gravity can be constrained with the ringdown signals from merger of binary black holes. This has been made possible by the fact that the modified gravitational theory considered in this work has an exact rotating black hole solution and that the corresponding quasi-normal modes can be calculated. With these, we obtain the possible constraint that can be placed on the parameter describing the deviation of this particular alternative theory from general relativity by using the detection of the ringdown signals from binary black holes's merger with future space-based gravitational wave detectors.

gr-qc↗
arXiv2019

Science with the TianQin observatory: Preliminary results on testing the no-hair theorem with ringdown signals

We study the capability of the space-based gravitational wave observatory TianQin to test the no-hair theorem of General Relativity, using the ringdown signal from the coalescence of massive black hole binaries. We parameterize the ringdown signal by the four strongest quasinormal modes and estimate the signal to noise ratio for various source parameters. We consider constraints both from single detections and from all the events combined throughout the lifetime of the observatory, for different astrophysical models. We find that at the end of the mission, TianQin will have constrained deviations of the frequency and decay time of the dominant 22 mode from the general relativistic predictions to within 0.2% and 1.5% respectively, the frequencies of the subleading modes can be also constrained within 0.3%. We also find that TianQin and LISA are highly complementary, by virtue of their different frequency windows. Indeed, LISA can best perform ringdown tests for black hole masses in excess of $\sim 3\times 10^6 M_\odot$, while TianQin is best suited for lower masses.

gr-qc↗
arXiv2019

Multi-loss-aware Channel Pruning of Deep Networks

Channel pruning, which seeks to reduce the model size by removing redundant channels, is a popular solution for deep networks compression. Existing channel pruning methods usually conduct layer-wise channel selection by directly minimizing the reconstruction error of feature maps between the baseline model and the pruned one. However, they ignore the feature and semantic distributions within feature maps and real contribution of channels to the overall performance. In this paper, we propose a new channel pruning method by explicitly using both intermediate outputs of the baseline model and the classification loss of the pruned model to supervise layer-wise channel selection. Particularly, we introduce an additional loss to encode the differences in the feature and semantic distributions within feature maps between the baseline model and the pruned one. By considering the reconstruction error, the additional loss and the classification loss at the same time, our approach can significantly improve the performance of the pruned model. Comprehensive experiments on benchmark datasets demonstrate the effectiveness of the proposed method.

cs.CV↗
arXiv2019

Cluster Regularized Quantization for Deep Networks Compression

Deep neural networks (DNNs) have achieved great success in a wide range of computer vision areas, but the applications to mobile devices is limited due to their high storage and computational cost. Much efforts have been devoted to compress DNNs. In this paper, we propose a simple yet effective method for deep networks compression, named Cluster Regularized Quantization (CRQ), which can reduce the presentation precision of a full-precision model to ternary values without significant accuracy drop. In particular, the proposed method aims at reducing the quantization error by introducing a cluster regularization term, which is imposed on the full-precision weights to enable them naturally concentrate around the target values. Through explicitly regularizing the weights during the re-training stage, the full-precision model can achieve the smooth transition to the low-bit one. Comprehensive experiments on benchmark datasets demonstrate the effectiveness of the proposed method.

cs.CV↗
arXiv2019

Better Guider Predicts Future Better: Difference Guided Generative Adversarial Networks

Predicting the future is a fantasy but practicality work. It is the key component to intelligent agents, such as self-driving vehicles, medical monitoring devices and robotics. In this work, we consider generating unseen future frames from previous obeservations, which is notoriously hard due to the uncertainty in frame dynamics. While recent works based on generative adversarial networks (GANs) made remarkable progress, there is still an obstacle for making accurate and realistic predictions. In this paper, we propose a novel GAN based on inter-frame difference to circumvent the difficulties. More specifically, our model is a multi-stage generative network, which is named the Difference Guided Generative Adversarial Netwok (DGGAN). The DGGAN learns to explicitly enforce future-frame predictions that is guided by synthetic inter-frame difference. Given a sequence of frames, DGGAN first uses dual paths to generate meta information. One path, called Coarse Frame Generator, predicts the coarse details about future frames, and the other path, called Difference Guide Generator, generates the difference image which include complementary fine details. Then our coarse details will then be refined via guidance of difference image under the support of GANs. With this model and novel architecture, we achieve state-of-the-art performance for future video prediction on UCF-101, KITTI.

cs.CV↗