SearcharxivSearch

arXiv subjects

Qinghui Zhang

Publications and source records attributed to Qinghui Zhang.

13 recordsLinked to original sources

WINO: A Weak-Form Physics Informed Neural Operator for Hyperelasticity on Variable Domains

We propose a Weak-form Physics-Informed Neural Operator (WINO), a data-free framework that combines the efficiency of neural operators with the geometric flexibility of the $φ$-finite element method ($φ$-FEM). $φ$-FEM is an unfitted method that accommodates geometric variations without body-fitted meshes, where the domain geometry is represented by the level-set function $φ$. To impose the boundary conditions, Dirichlet problems adopt the $φ$-FEM lifting so only the homogeneous displacement contribution is learned, whereas traction-driven Neumann problems additionally predict the auxiliary fields necessary for the unfitted weak formulation. Parameters are trained by minimizing squared weak-form residuals aligned with $φ$-FEM together with squared penalties on the cut-cell auxiliary equations, which removes the need for large paired datasets of converged reference solutions. When labeled reference data are available, an optional data-augmented variant (WINO+data) can further combine this physics-informed loss with a supervised term. After training, WINO outputs can seed the nonlinear $φ$-FEM solvers as neural operator warm starts (NOWS), which reduce iteration counts relative to traditional cold-started solvers. Numerical benchmarks show substantial accuracy of WINO together with total training times of about 15%-70% of those of supervised $φ$-FEM-FNO across all cases, without requiring reference-solution generation.

math.NA

High-Throughput and Scalable Secure Inference Protocols for Deep Learning with Packed Secret Sharing

Most existing secure neural network inference protocols based on secure multi-party computation (MPC) typically support at most four participants, demonstrating severely limited scalability. Liu et al. (USENIX Security'24) presented the first relatively practical approach by utilizing Shamir secret sharing with Mersenne prime fields. However, when processing deeper neural networks such as VGG16, their protocols incur substantial communication overhead, resulting in particularly significant latency in wide-area network (WAN) environments. In this paper, we propose a high-throughput and scalable MPC protocol for neural network inference against semi-honest adversaries in the honest-majority setting. The core of our approach lies in leveraging packed Shamir secret sharing (PSS) to enable parallel computation and reduce communication complexity. The main contributions are three-fold: i) We present a communication-efficient protocol for vector-matrix multiplication, based on our newly defined notion of vector-matrix multiplication-friendly random share tuples. ii) We design the filter packing approach that enables parallel convolution. iii) We further extend all non-linear protocols based on Shamir secret sharing to the PSS-based protocols for achieving parallel non-linear operations. Extensive experiments across various datasets and neural networks demonstrate the superiority of our approach in WAN. Compared to Liu et al. (USENIX Security'24), our scheme reduces the communication upto 5.85x, 11.17x, and 6.83x in offline, online and total communication overhead, respectively. In addition, our scheme is upto 1.59x, 2.61x, and 1.75x faster in offline, online and total running time, respectively.

cs.CR

A Primal-Dual-Based Power Control Approach for Capacitated Edge Servers

The intensity of radio waves decays rapidly with increasing propagation distance, and an edge server's antenna needs more power to form a larger signal coverage area. Therefore, the power of the edge server should be controlled to reduce energy consumption. In addition, edge servers with capacitated resources provide services for only a limited number of users to ensure the quality of service (QoS). We set the signal transmission power for the antenna of each edge server and formed a signal disk, ensuring that all users were covered by the edge server signal and minimizing the total power of the system. This scenario is a typical geometric set covering problem, and even simple cases without capacity limits are NP-hard problems. In this paper, we propose a primal-dual-based algorithm and obtain an $m$-approximation result. We compare our algorithm with two other algorithms through simulation experiments. The results show that our algorithm obtains a result close to the optimal value in polynomial time.

cs.NI

A Local-Ratio-Based Power Control Approach for Capacitated Access Points in Mobile Edge Computing

Terminal devices (TDs) connect to networks through access points (APs) integrated into the edge server. This provides a prerequisite for TDs to upload tasks to cloud data centers or offload them to edge servers for execution. In this process, signal coverage, data transmission, and task execution consume energy, and the energy consumption of signal coverage increases sharply as the radius increases. Lower power leads to less energy consumption in a given time segment. Thus, power control for APs is essential for reducing energy consumption. Our objective is to determine the power assignment for each AP with same capacity constraints such that all TDs are covered, and the total power is minimized. We define this problem as a \emph{minimum power capacitated cover } (MPCC) problem and present a \emph{minimum local ratio} (MLR) power control approach for this problem to obtain accurate results in polynomial time. Power assignments are chosen in a sequence of rounds. In each round, we choose the power assignment that minimizes the ratio of its power to the number of currently uncovered TDs it contains. In the event of a tie, we pick an arbitrary power assignment that achieves the minimum ratio. We continue choosing power assignments until all TDs are covered. Finally, various experiments verify that this method can outperform another greedy-based way.

cs.NI

Memory Group Sampling Based Online Action Recognition Using Kinetic Skeleton Features

Online action recognition is an important task for human centered intelligent services, which is still difficult to achieve due to the varieties and uncertainties of spatial and temporal scales of human actions. In this paper, we propose two core ideas to handle the online action recognition problem. First, we combine the spatial and temporal skeleton features to depict the actions, which include not only the geometrical features, but also multi-scale motion features, such that both the spatial and temporal information of the action are covered. Second, we propose a memory group sampling method to combine the previous action frames and current action frames, which is based on the truth that the neighbouring frames are largely redundant, and the sampling mechanism ensures that the long-term contextual information is also considered. Finally, an improved 1D CNN network is employed for training and testing using the features from sampled frames. The comparison results to the state of the art methods using the public datasets show that the proposed method is fast and efficient, and has competitive performance

cs.CV

Condensed Generalized Finite Element Method (CGFEM)

Generalized or extended finite element methods (GFEM/XFEM) are in general badly conditioned and have numerous additional degrees of freedom (DOF) compared with the FEM because of introduction of enriched functions. In this paper, we develop an approach to establish a subspace of a conventional GFEM/XFEM approximation space using partition of unity (PU) techniques and local least square procedures. The proposed GFEM is referred to as condensed GFEM (CGFEM), which (i) possesses as many DOFs as the preliminary FEM, (ii) enjoys similar approximation properties with the GFEM/XFEM, and (iii) is well-conditioned in a sense that its conditioning is of the same order as that of the FEM. The fundamental approximation properties of CGFEM is proven mathematically. The CGFEM is applied to a problem of high order polynomial approximations and a Poisson crack problem; optimal convergence orders of the former are proven rigorously. The numerical experiments and comparisons with the conventional GFEM/XFEM and FEM are made to verify the theory and effectiveness of CGFEM.

math.NA

Rotation Effects on the Target-Volume Margin Determination

Rotational setup errors are usually neglected in most clinical centers. An analytical formula is developed to determine the extra margin between clinical target volume (CTV) and planning target volume (PTV) to account for setup errors. The proposed formula corrects for both translational and rotational setup errors and then incorporated into margin determination for PTV.

physics.med-ph

Transient and secular radioactive equilibrium revisited

The two definitions of radioactive equilibrium are revisited in this paper. The terms activity equilibrium and effective life equilibrium are proposed to take the place of currently used terms transient equilibrium and secular equilibrium. The proposed new definitions have the advantage of providing a clearer physics meaning. Besides the well known instant activity equilibrium, another class of exact effective life-time equilibrium is also discussed in this letter.

physics.med-ph

Feasibility Study of Real-Time Planning for Stereotactic Radiosurgery

Purpose: 3D rotational setup errors in radiotherapy are often ignored by most clinics due to inability to correct or simulate them accurately and efficiently. There are two types of rotation-related problems in a clinical setting. One is to assess the affected dose distribution in real-time if correction is not applied and the other one is to correct the rotational setup errors prior to the initiation of the treatment. Here, we present our analytical solutions to both problems.

physics.med-ph

Three independent one-dimensional margins for single-fraction frameless stereotactic radiosurgery brain cases using CBCT

Setting a proper margin is crucial for not only delivering the required radiation dose to a target volume, but also reducing the unnecessary radiation to the adjacent organs at risk. This study investigated the independent one-dimensional symmetric and asymmetric margins between the clinical target volume (CTV) and the planning target volume (PTV) for linac-based single-fraction frameless stereotactic radiosurgery (SRS).

physics.med-ph

Three Dimensional Expansion of Margins for Single-fraction Treatments: Stereotactic Radiosurgery Brain Cases

Purpose: To derive a clinically-practical margin formula between clinical target volume (CTV) and planning target volume (PTV) for single-fraction stereotactic radiosurgery (SRS).Methods: In previous publications on the margin between the CTV and the PTV, a Gaussian function with zero mean was assumed for the systematic error and the ma-chine systematic error was completely ignored. In this work we adopted a Dirac delta function for the machine system-atic error for a given machine with nonzero mean systematic error. Mathematical formulas for calculating the CTV-PTV margin for single-fraction SRS treatments were proposed. Results: Margins for single fraction treatments were derived such that the CTVs received the prescribed dose in 95% of the SRS patients. The margin defined in this study was machine specific and accounted for nonzero mean systematic error. The differences between our formulas and a previously published formula were discussed. Conclusion: Clinical margin formulas were proposed for deter-mining the margin between the CTV and the PTV in SRS treatments. Previous margin's recipes, being derived specifi-cally for conventional treatments, may be inappropriate for single-fraction SRS and could result in geometric miss of the target and even treatment failure for machines possessing of large systematic errors.

physics.med-ph

Refinement of Operator-valued Reproducing Kernels

This paper studies the construction of a refinement kernel for a given operator-valued reproducing kernel such that the vector-valued reproducing kernel Hilbert space of the refinement kernel contains that of the given one as a subspace. The study is motivated from the need of updating the current operator-valued reproducing kernel in multi-task learning when underfitting or overfitting occurs. Numerical simulations confirm that the established refinement kernel method is able to meet this need. Various characterizations are provided based on feature maps and vector-valued integral representations of operator-valued reproducing kernels. Concrete examples of refining translation invariant and finite Hilbert-Schmidt operator-valued reproducing kernels are provided. Other examples include refinement of Hessian of scalar-valued translation-invariant kernels and transformation kernels. Existence and properties of operator-valued reproducing kernels preserved during the refinement process are also investigated.

cs.LG

A patient-specific respiratory model of anatomical motion for radiation treatment planning

Modeling of respiratory motion is important for a more accurate understanding and accounting of its effect on dose to cancers in the thorax and abdomen by radiotherapy. We have developed a model of respiration-induced organ motion in the thorax, without the commonly adopted assumption of repeatable breath cycles. The model describes the motion of a volume of interest within the patient, based on a reference 3-dimensional image (at end-expiration), and the diaphragm positions at different time points. The input data are respiration-correlated CT images of patients treated for nonsmall cell lung cancer, consisting of 3D images, including the diaphragm positions, at 10 phases of the respiratory cycle. A deformable image registration algorithm calculates the deformation field that maps each 3D image to the reference 3D image. A principle component analysis is performed to parameterize the 3D deformation field in terms of the diaphragm motion. We show that the first two principal components are adequate to accurately and completely describe the organ motion in the data of 4 patients. Artifacts in the RCCT images that commonly occur at the mid-respiration states are reduced in the model-generated images. Further validation of the model is demonstrated in the successful application of the parameterized 3D deformation field to RCCT data of the same patient but acquired several days later. We have developed a method for predicting respiration-induced organ motion in patients that has potential for improving the accuracy of dose calculation in radiotherapy.

physics.med-ph