Xianchao Wang

Dr. Xianchao Wang


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 September 2020 in IEEE Access
Verified
Journal Article
Open access
SGShan Gao
Shan Gao
JZJie Zhang
Jie Zhang
XWXianchao Wang
Xianchao Wang
This paper studies an M/G/1 retrial queue with two types of breakdowns. When the server is idle, it is subject to breakdowns according to a Poisson process with rate δ and it cannot be repaired immediately. While when the server is busy, it may break down according to a Poisson process with rate θ and can be immediately repaired. Firstly, based on embedded Markov chain technique and probability generating function (PGF) method, we present the necessary and sufficient condition for the system to be stable and the PGF of the orbit size at the departure epochs. Secondly, we give the steady-state joint queue length distribution by supplementary variable method, and present some important performance measures and reliability indices. Thirdly, we provide the analysis of sojourn time of an arbitrary customer in the system when the system is in stable state. Finally, some numerical examples are presented to illustrate the effect of the some system parameters on important performance measures and reliability indices.

1 November 2012 in Chinese Physics B
Verified
Journal Article
Closed access
PDF file
XWXianchao Wang
Xianchao Wang
BYBin Yan
Bin Yan
LLLei Li
Lei Li
GHGuo-En Hu
Guo-En Hu

11 August 2017
Verified
Book Chapter
Closed access
PDF file
XWXianchao Wang
Xianchao Wang
SZSulan Zhang
Sulan Zhang
MZMian Zhang
Mian Zhang
JZJia Zhao
Jia Zhao
XNXiangyang Niu
Xiangyang Niu

30 January 2013 in IEEE Transactions on Nuclear Science
Verified
Journal Article
Closed access
XWXianchao Wang
Xianchao Wang
GHGuoen Hu
Guoen Hu
BYBin Yan
Bin Yan
YHYu Han
Yu Han
LLLei Li
Lei Li
SBShanglian Bao
Shanglian Bao
To reduce the radiation dose in dental computed tomography (CT), backprojection-filtration (BPF) algorithm is the preferred choice as it can reconstruct images from truncated data within limited scanning angle, thereby reducing radiation dose and avoiding irradiation to the brain. However, the integral interval of backprojection is variable for every PI-line which causes the calculation efficiency and parallel performance to be low. In this paper, the tent BPF method (T-BPF) was developed, which was performed by firstly rearranging the cone-beam data to tent-like parallel-beam data, and then applying the proposed BPF-type algorithm to reconstruct images from the rearranged data. T-BPF turns the variable integral interval of backprojection into fixed integral interval, which means the reconstruction efficiency and the parallel performance of T-BPF are improvements over those of the original BPF algorithm. The experiments of numerical simulation and real data reconstruction show that the reconstruction efficiency of T-BPF is faster than the original BPF algorithm and the FDK algorithm in the case of comparable reconstruction quality. The results demonstrate that the proposed T-BPF is good at achieving fast low-dose reconstruction from truncated projection data in dental CT.

27 March 2020 in IEEE Access
Verified
Journal Article
Open access
XWXianchuan Wang
Xianchuan Wang
JZJie Zhang
Jie Zhang
SGShan Gao
Shan Gao
MZMian Zhang
Mian Zhang
XWXianchao Wang
Xianchao Wang
The ternary optical computer(TOC) has attracted increasing attention from its providers and potential customers because of the advantages of its optical processor, such as low power consumption, numerous trits, parallelism, dynamical reconfigurability and bitwise allocability. The analysis of its performance has become an urgent problem to be solved in recent years. This paper builds a four-stage TOC service model by introducing synchronous multi-vacations and tandem queueing. Here, a vacation refers specifically to an optical processor vacation. Additionally, we propose a processor-divided-equally(PDE) strategy and a task scheduling and optical processor allocation algorithm under this strategy. Assuming that the intervals of task arrival follow a homogeneous Poisson process, we obtain some important performance indicators, such as the mean response time, mean number of tasks, and optical processor utilization under the PDE strategy, which are based on the M/M/1 and M/M/n queueing systems with exhaustive service and synchronous multi-vacations. The numerical results illustrate that the number of small optical processors has an important effect on the performance of TOC and that high vacation rate can improve the system performance to some extent.

1 January 2023 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
XWXianchao Wang
Xianchao Wang
SLShaoyi Li
Shaoyi Li
CHChanghui Hou
Changhui Hou
GZGuoming Zhang
Guoming Zhang
The minimum spanning tree (MST) is widely used in planning the most economical network. The algorithm for finding the MST of a connected graph is essential. In this paper, a new algorithm for finding MST is proposed based on a deduced theorem of MST. The algorithm first sorts the edges in the graph according to their weight, from large to small. Next, on the premise of ensuring the connectivity of the graph, it deletes the edges in this order until the number of edges of the graph is equal to the number of vertexes minus 1. Finally, the remaining graph is an MST. This algorithm is equivalent to an inverse Kruskal algorithm. For sparse graphs, the proposed algorithm has higher efficiency than the Kruskal algorithm. Experiments and analysis verify the effectiveness of the algorithm proposed in this paper. The algorithm provides a better choice for finding the MST of the sparse graph.