arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 757 records · Page 42Linked to original sources

arXiv2023

deepPERFECT: Novel Deep Learning CT Synthesis Method for Expeditious Pancreatic Cancer Radiotherapy

Pancreatic cancer with more than 60,000 new cases each year has less than 10 percent 5-year overall survival. Radiation therapy (RT) is an effective treatment for Locally advanced pancreatic cancer (LAPC). The current clinical RT workflow is lengthy and involves separate image acquisition for diagnostic CT (dCT) and planning CT (pCT). Studies have shown a reduction in mortality rate from expeditious radiotherapy treatment. dCT and pCT are acquired separately because of the differences in the image acquisition setup and patient body. We are presenting deepPERFECT: deep learning-based model to adapt the shape of the patient body on dCT to the treatment delivery setup. Our method expedites the treatment course by allowing the design of the initial RT planning before the pCT acquisition. Thus, the physicians can evaluate the potential RT prognosis ahead of time, verify the plan on the treatment day-one CT and apply any online adaptation if needed. We used the data from 25 pancreatic cancer patients. The model was trained on 15 cases and tested on the remaining ten cases. We evaluated the performance of four different deep-learning architectures for this task. The synthesized CT (sCT) and regions of interest (ROIs) were compared with ground truth (pCT) using Dice similarity coefficient (DSC) and Hausdorff distance (HD). We found that the three-dimensional Generative Adversarial Network (GAN) model trained on large patches has the best performance. The average DSC and HD for body contours were 0.93, and 4.6 mm. We found no statistically significant difference between the synthesized CT plans and the ground truth. We showed that employing deepPERFECT shortens the current lengthy clinical workflow by at least one week and improves the effectiveness of treatment and the quality of life of pancreatic cancer patients.

physics.med-ph↗

arXiv2023

Target-Mounted Intelligent Reflecting Surface for Joint Location and Orientation Estimation

Intelligent reflecting surface (IRS) has been widely recognized as an efficient technique to reconfigure the electromagnetic environment in favor of wireless communication performance. In this paper, we propose a new application of IRS for device-free target sensing via joint location and orientation estimation. In particular, different from the existing works that use IRS as an additional anchor node for localization/sensing, we consider mounting IRS on the sensing target, whereby estimating the IRS's location and orientation as that of the target by leveraging IRS's controllable signal reflection. To this end, we first propose a tensor-based method to acquire essential angle information between the IRS and the sensing transmitter as well as a set of distributed sensing receivers. Next, based on the estimated angle information, we formulate two optimization problems to estimate the location and orientation of the IRS/target, respectively, and obtain the locally optimal solutions to them by invoking two iterative algorithms, namely, gradient descent method and manifold optimization. In particular, we show that the orientation estimation problem admits a closed-form solution in a special case that usually holds in practice. Furthermore, theoretical analysis is conducted to draw essential insights into the proposed sensing system design and performance. Simulation results verify our theoretical analysis and demonstrate that the proposed methods can achieve high estimation accuracy which is close to the theoretical bound.

eess.SP↗

arXiv2023

Adaptive Depth Graph Attention Networks

As one of the most popular GNN architectures, the graph attention networks (GAT) is considered the most advanced learning architecture for graph representation and has been widely used in various graph mining tasks with impressive results. However, since GAT was proposed, none of the existing studies have provided systematic insight into the relationship between the performance of GAT and the number of layers, which is a critical issue in guiding model performance improvement. In this paper, we perform a systematic experimental evaluation and based on the experimental results, we find two important facts: (1) the main factor limiting the accuracy of the GAT model as the number of layers increases is the oversquashing phenomenon; (2) among the previous improvements applied to the GNN model, only the residual connection can significantly improve the GAT model performance. We combine these two important findings to provide a theoretical explanation that it is the residual connection that mitigates the loss of original feature information due to oversquashing and thus improves the deep GAT model performance. This provides empirical insights and guidelines for researchers to design the GAT variant model with appropriate depth and well performance. To demonstrate the effectiveness of our proposed guidelines, we propose a GAT variant model-ADGAT that adaptively selects the number of layers based on the sparsity of the graph, and experimentally demonstrate that the effectiveness of our model is significantly improved over the original GAT.

cs.LG↗

arXiv2023

A Comprehensive Study on Optimizing Systems with Data Processing Units

New hardware, such as SmartNICs, has been released to offload network applications in data centers. Off-path SmartNICs, a type of multi-core SoC SmartNICs, have attracted the attention of many researchers. Unfortunatelly, they lack the fully exploration of off-path SmartNICs. In this paper, we use a BlueField SmartNIC as an example to conduct a systematical study on the advantages and disadvantages of off-path SmartNICs. We make a detailed performance characterization on an off-path SmartNIC including computing power and network communication overhead, and propose the following advices: 1) Directly utilize the specific accelerators on the SmartNIC to offload applications; 2) Offload latency-insensitive background processing to the SmartNIC to reduce the load on the host; 3) Regard the SmartNIC as a new endpoint in the network to expand the computing power and storage resources of the server host; 4) Avoid directly employing the design method for systems based on on-path SmartNICs. We apply these advices to several use cases and show the performance improvements.

cs.NI↗

arXiv2022

Active and Passive IRS Jointly Aided Communication: Deployment Design and Achievable Rate

In this letter, we study the wireless point-to-point communication from a transmitter (Tx) to a receiver (Rx), which is jointly aided by an active intelligent reflecting surface (AIRS) and a passive IRS (PIRS). We consider two practical transmission schemes by deploying the two IRSs in different orders, namely, Tx$\rightarrow$PIRS$\rightarrow$AIRS$\rightarrow$Rx (TPAR) and Tx$\rightarrow$AIRS$\rightarrow$PIRS$\rightarrow$Rx (TAPR). Assuming line-of-sight channels, we derive the achievable rates for the two schemes by optimizing the placement of the AIRS with the location of the PIRS fixed. Our analysis shows that when the number of PIRS elements and/or the AIRS amplification power is small, the AIRS should be deployed closer to the Rx in both schemes, and TAPR outperforms TPAR with their respective optimized AIRS/PIRS placement. Simulation results validate our analysis and show the considerable performance gain achieved by the jointly optimized AIRS/PIRS deployment over the baseline double-PIRS system under the same power and IRS element budgets.

eess.SP↗

arXiv2022

UAV-Assisted Image Acquisition: 3D UAV Trajectory Design and Camera Control

In this paper, we consider a new unmanned aerial vehicle (UAV)-assisted oblique image acquisition system where a UAV is dispatched to take images of multiple ground targets (GTs). To study the three-dimensional (3D) UAV trajectory design for image acquisition, we first propose a novel UAV-assisted oblique photography model, which characterizes the image resolution with respect to the UAV's 3D image-taking location. Then, we formulate a 3D UAV trajectory optimization problem to minimize the UAV's traveling distance subject to the image resolution constraints. The formulated problem is shown to be equivalent to a modified 3D traveling salesman problem with neighbourhoods, which is NP-hard in general. To tackle this difficult problem, we propose an iterative algorithm to obtain a high-quality suboptimal solution efficiently, by alternately optimizing the UAV's 3D image-taking waypoints and its visiting order for the GTs. Numerical results show that the proposed algorithm significantly reduces the UAV's traveling distance as compared to various benchmark schemes, while meeting the image resolution requirement.

cs.MM↗

arXiv2022

Online Score Statistics for Detecting Clustered Change in Network Point Processes

We consider online monitoring of the network event data to detect local changes in a cluster when the affected data stream distribution shifts from one point process to another with different parameters. Specifically, we are interested in detecting a change point that causes a shift of the underlying data distribution that follows a multivariate Hawkes process with exponential decay temporal kernel, whereby the Hawkes process is considered to account for spatio-temporal correlation between observations. The proposed detection procedure is based on scan score statistics. We derive the asymptotic distribution of the statistic, which enables the self-normalizing property and facilitates the approximation of the instantaneous false alarm probability and the average run length. When detecting a change in the Hawkes process with non-vanishing self-excitation, the procedure does not require estimating the post-change network parameter while assuming the temporal decay parameter, which enjoys computational efficiency. We further present an efficient procedure to accurately determine the false discovery rate via importance sampling, as validated by numerical examples. Using simulated and real stock exchange data, we show the effectiveness of the proposed method in detecting change while enjoying computational efficiency.

stat.ME↗

arXiv2022

AnchorGAE: General Data Clustering via $O(n)$ Bipartite Graph Convolution

Since the representative capacity of graph-based clustering methods is usually limited by the graph constructed on the original features, it is attractive to find whether graph neural networks (GNNs) can be applied to augment the capacity. The core problems mainly come from two aspects: (1) the graph is unavailable in the most clustering scenes so that how to construct high-quality graphs on the non-graph data is usually the most important part; (2) given n samples, the graph-based clustering methods usually consume at least $\mathcal O(n^2)$ time to build graphs and the graph convolution requires nearly $\mathcal O(n^2)$ for a dense graph and $\mathcal O(|\mathcal{E}|)$ for a sparse one with $|\mathcal{E}|$ edges. Accordingly, both graph-based clustering and GNNs suffer from the severe inefficiency problem. To tackle these problems, we propose a novel clustering method, AnchorGAE, with the self-supervised estimation of graph and efficient graph convolution. We first show how to convert a non-graph dataset into a graph dataset, by introducing the generative graph model and anchors. We then show that the constructed bipartite graph can reduce the computational complexity of graph convolution from $\mathcal O(n^2)$ and $\mathcal O(|\mathcal{E}|)$ to $\mathcal O(n)$. The succeeding steps for clustering can be easily designed as $\mathcal O(n)$ operations. Interestingly, the anchors naturally lead to siamese architecture with the help of the Markov process. Furthermore, the estimated bipartite graph is updated dynamically according to the features extracted by GNN, to promote the quality of the graph. However, we theoretically prove that the self-supervised paradigm frequently results in a collapse that often occurs after 2-3 update iterations in experiments, especially when the model is well-trained. A specific strategy is accordingly designed to prevent the collapse.

cs.LG↗

arXiv2022

Exploring a multi_stage feedback teaching mode for graduate students of software engineering discipline based on project_driven competition

Aiming at the current problems of theory-oriented,practice-light,and lack of innovation ability in the teaching of postgraduate software engineering courses,a multi-stage feedback teaching mode for software engineering postgraduates based on competition project_driven is proposed. The model is driven by the competition project,and implementing suggestions are given in terms of stage allocation of software engineering course tasks and ability cultivation,competition case design and process evaluation improvement,etc. Through the implementation of this teaching mode,students enthusiasm and initiative are expected to be stimulated,and the overall development of students professional skills and comprehension ability would be improved to meet the demand of society for software engineering technical talents.

cs.SE↗

arXiv2022

Adaptive Low-Precision Training for Embeddings in Click-Through Rate Prediction

Embedding tables are usually huge in click-through rate (CTR) prediction models. To train and deploy the CTR models efficiently and economically, it is necessary to compress their embedding tables at the training stage. To this end, we formulate a novel quantization training paradigm to compress the embeddings from the training stage, termed low-precision training (LPT). Also, we provide theoretical analysis on its convergence. The results show that stochastic weight quantization has a faster convergence rate and a smaller convergence error than deterministic weight quantization in LPT. Further, to reduce the accuracy degradation, we propose adaptive low-precision training (ALPT) that learns the step size (i.e., the quantization resolution) through gradient descent. Experiments on two real-world datasets confirm our analysis and show that ALPT can significantly improve the prediction accuracy, especially at extremely low bit widths. For the first time in CTR models, we successfully train 8-bit embeddings without sacrificing prediction accuracy. The code of ALPT is publicly available.

cs.LG↗

arXiv2022

Lower deviation for the supremum of the support of super-Brownian motion

We study the asymptotic behavior of the supremum $M_t$ of the support of a supercritical super-Brownian motion. In our recent paper (Stoch. Proc. Appl. 137 (2021), 1-34), we showed that, under some conditions, $M_t-m(t)$ converges in distribution to a randomly shifted Gumbel random variable, where $m(t)=c_0t-c_1\log t$. In the same paper, we also studied the upper large deviation of $M_t$, i.e., the asymptotic behavior of $\mathbb{P}(M_t>δc_0t) $ for $δ\ge 1$. In this paper, we study the lower large deviation of $M_t$, i.e., the asymptotic behavior of $\mathbb{P}(M_t\le δc_0t|\mathcal{S}) $ for $δ<1$, where $\mathcal{S}$ is the survival event.

math.PR↗

arXiv2022

Electromagnetic Environment Analysis of High-Power Wireless Charging Device

Objective Aiming at the problems of many interference factors in the electromagnetic radiation simulation of electric vehicles, a field measurement scheme for charging devices is designed. Through the monitoring of wireless charging equipment, the radiation level and distribution of the electric field value and magnetic field value around the charging equipment is explored, to analyze the influence law of the electromagnetic environment. Method This paper introduces the principle and development status of electric vehicle charging, and analyzes the classification and methods of wireless charging. In this paper, the electric field and magnetic field of cars and minibuses are monitored, at positions such as: around the body, attenuation section, inside the car and inside the minibus. Result The range of electric field strength is 0.9 V/m to 48.1 V/m for cars, and 0.8 V/m to 74.7 V/m for minibuses. The electric field strength decays rapidly with the increase of the distance from the vehicle body, and the law is obvious. The range of magnetic induction intensity is 0.12μT-12.70μT for cars, and 0.15μT-27.06μT for minibuses. The magnetic induction intensity decays rapidly with the increase of the distance from the vehicle body, and the law is obvious. Conclusion This paper explores the radiation level and distribution of the electromagnetic field around this type of charging equipment. It is recommended that manufacturers of wireless charging devices for electric vehicles strengthen research on electromagnetic radiation shielding and take corresponding measures to control the level of electromagnetic radiation in areas accessible to the public.

eess.SY↗

arXiv2022

Research on Early Warning and NB-IoT Real-time Monitoring System for Radiation Source Shedding of Gamma Flaw Detection Machine

The system takes the embedded system single chip as the core, and organizes the gamma ray induction module, keying switch, radiation source braid locking mechanism, on-site alarm equipment, NB-IoT communication module, GPS positioning system and other related equipment to realize real-time operators warning and remote alarming to the monitoring platform. Thus, timely management of the fallen radiation source can be realized. What's more, position of radiation source braid is monitored by radiation source braid locking mechanism, gamma-ray induction module and keying switch. This idea solves the bottleneck problem of difficulty in transmitting real-time remote monitoring signal by NB-IoT technology. Single-chip microcontroller is innovatively embedded around the radiation source to monitor whether the source falls off. As a result, when part or all of the source braid are not returned to the storage location of the flaw detector, the gamma ray induction module, keying switch, and radiation source braid locking mechanism remind the operator of the dangerous situation. At the same time, NB-IoT transmission system alarms companies and regulators of safety risks. In conclusion, radiation source can be found timely when it falls off, to avoid radiation accident. Two bottlenecks related to installing GPS positioning system can be solved, that the GPS positioning system is installed on the flaw detector, and the radioactive source is still unable to be controlled, and that the GPS positioning system requires power to transmit the signal back to the regulatory platform or to the platform of the flaw detection enterprise. This article's ideas can solve this problem through the advantages of NB-IoT.

eess.SY↗

arXiv2022

Mining On Alzheimer's Diseases Related Knowledge Graph to Identity Potential AD-related Semantic Triples for Drug Repurposing

To date, there are no effective treatments for most neurodegenerative diseases. Knowledge graphs can provide comprehensive and semantic representation for heterogeneous data, and have been successfully leveraged in many biomedical applications including drug repurposing. Our objective is to construct a knowledge graph from literature to study relations between Alzheimer's disease (AD) and chemicals, drugs and dietary supplements in order to identify opportunities to prevent or delay neurodegenerative progression. We collected biomedical annotations and extracted their relations using SemRep via SemMedDB. We used both a BERT-based classifier and rule-based methods during data preprocessing to exclude noise while preserving most AD-related semantic triples. The 1,672,110 filtered triples were used to train with knowledge graph completion algorithms (i.e., TransE, DistMult, and ComplEx) to predict candidates that might be helpful for AD treatment or prevention. Among three knowledge graph completion models, TransE outperformed the other two (MR = 13.45, Hits@1 = 0.306). We leveraged the time-slicing technique to further evaluate the prediction results. We found supporting evidence for most highly ranked candidates predicted by our model which indicates that our approach can inform reliable new knowledge. This paper shows that our graph mining model can predict reliable new relationships between AD and other entities (i.e., dietary supplements, chemicals, and drugs). The knowledge graph constructed can facilitate data-driven knowledge discoveries and the generation of novel hypotheses.

cs.AI↗

arXiv2022

3-D Positioning and Resource Allocation for Multi-UAV Base Stations Under Blockage-Aware Channel Model

In this paper, we propose to deploy multiple unmanned aerial vehicle (UAV) mounted base stations to serve ground users in outdoor environments with obstacles. In particular, the geographic information is employed to capture the blockage effects for air-to-ground (A2G) links caused by buildings, and a realistic blockage-aware A2G channel model is proposed to characterize the continuous variation of the channels at different locations. Based on the proposed channel model, we formulate the joint optimization problem of UAV three-dimensional (3-D) positioning and resource allocation, by power allocation, user association, and subcarrier allocation, to maximize the minimum achievable rate among users. To solve this non-convex combinatorial programming problem, we introduce a penalty term to relax it and develop a suboptimal solution via a penalty-based double-loop iterative optimization framework. The inner loop solves the penalized problem by employing the block successive convex approximation (BSCA) technique, where the UAV positioning and resource allocation are alternately optimized in each iteration. The outer loop aims to obtain proper penalty multipliers to ensure the solution of the penalized problem converges to that of the original problem. Simulation results demonstrate the superiority of the proposed algorithm over other benchmark schemes in terms of the minimum achievable rate.

eess.SP↗

arXiv2022

A Novel SCA-Based Method for Beamforming Optimization in IRS/RIS-Assisted MU-MISO Downlink

In this letter, we consider the fundamental problem of jointly designing the transmit beamformers and the phase-shifts of the intelligent reflecting surface (IRS) / reconfigurable intelligent surface (RIS) to minimize the transmit power, subject to quality-of-service constraints at individual users in an IRS-assisted multiuser multiple-input single-output downlink communication system. In particular, we propose a new successive convex approximation based second-order cone programming approach in which all the optimization variables are simultaneously updated in each iteration. Our proposed scheme achieves superior performance compared to state-of-the-art benchmark solutions. In addition, the complexity of the proposed scheme is $O(N_{\mathrm s}^{3.5})$, while that of state-of-the-art benchmark schemes is $O(N_{\mathrm s}^{7})$, where $N_{\mathrm s}$ denotes the number of reflecting elements at the IRS.

eess.SP↗

arXiv2022

An F-shape Click Model for Information Retrieval on Multi-block Mobile Pages

To provide click simulation or relevance estimation based on users' implicit interaction feedback, click models have been much studied during recent years. Most click models focus on user behaviors towards a single list. However, with the development of user interface (UI) design, the layout of displayed items on a result page tends to be multi-block (i.e., multi-list) style instead of a single list, which requires different assumptions to model user behaviors more accurately. There exist click models for multi-block pages in desktop contexts, but they cannot be directly applied to mobile scenarios due to different interaction manners, result types and especially multi-block presentation styles. In particular, multi-block mobile pages can normally be decomposed into interleavings of basic vertical blocks and horizontal blocks, thus resulting in typically F-shape forms. To mitigate gaps between desktop and mobile contexts for multi-block pages, we conduct a user eye-tracking study, and identify users' sequential browsing, block skip and comparison patterns on F-shape pages. These findings lead to the design of a novel F-shape Click Model (FSCM), which serves as a general solution to multi-block mobile pages. Firstly, we construct a directed acyclic graph (DAG) for each page, where each item is regarded as a vertex and each edge indicates the user's possible examination flow. Secondly, we propose DAG-structured GRUs and a comparison module to model users' sequential (sequential browsing, block skip) and non-sequential (comparison) behaviors respectively. Finally, we combine GRU states and comparison patterns to perform user click predictions. Experiments on a large-scale real-world dataset validate the effectiveness of FSCM on user behavior predictions compared with baseline models.

cs.IR↗

arXiv2022

A Bird's-eye View of Reranking: from List Level to Page Level

Reranking, as the final stage of multi-stage recommender systems, refines the initial lists to maximize the total utility. With the development of multimedia and user interface design, the recommendation page has evolved to a multi-list style. Separately employing traditional list-level reranking methods for different lists overlooks the inter-list interactions and the effect of different page formats, thus yielding suboptimal reranking performance. Moreover, simply applying a shared network for all the lists fails to capture the commonalities and distinctions in user behaviors on different lists. To this end, we propose to draw a bird's-eye view of \textbf{page-level reranking} and design a novel Page-level Attentional Reranking (PAR) model. We introduce a hierarchical dual-side attention module to extract personalized intra- and inter-list interactions. A spatial-scaled attention network is devised to integrate the spatial relationship into pairwise item influences, which explicitly models the page format. The multi-gated mixture-of-experts module is further applied to capture the commonalities and differences of user behaviors between different lists. Extensive experiments on a public dataset and a proprietary dataset show that PAR significantly outperforms existing baseline models.

cs.IR↗