arXiv subjects

Hua Wang

Publications and source records attributed to Hua Wang.

At least 127 records · Page 7Linked to original sources

arXiv2023

A Lite Fireworks Algorithm with Fractal Dimension Constraint for Feature Selection

As the use of robotics becomes more widespread, the huge amount of vision data leads to a dramatic increase in data dimensionality. Although deep learning methods can effectively process these high-dimensional vision data. Due to the limitation of computational resources, some special scenarios still rely on traditional machine learning methods. However, these high-dimensional visual data lead to great challenges for traditional machine learning methods. Therefore, we propose a Lite Fireworks Algorithm with Fractal Dimension constraint for feature selection (LFWA+FD) and use it to solve the feature selection problem driven by robot vision. The "LFWA+FD" focuses on searching the ideal feature subset by simplifying the fireworks algorithm and constraining the dimensionality of selected features by fractal dimensionality, which in turn reduces the approximate features and reduces the noise in the original data to improve the accuracy of the model. The comparative experimental results of two publicly available datasets from UCI show that the proposed method can effectively select a subset of features useful for model inference and remove a large amount of noise noise present in the original data to improve the performance.

cs.LG↗

arXiv2023

Crowdsourcing Autonomous Traffic Simulation

We present an innovative framework, Crowdsourcing Autonomous Traffic Simulation (CATS) framework, in order to safely implement and realize orderly traffic flows. We firstly provide a semantic description of the CATS framework using theories of economics to construct coupling constraints among drivers, in which drivers monitor each other by making use of transportation resources and driving credit. We then introduce an emotion-based traffic simulation, which utilizes the Weber-Fechner law to integrate economic factors into drivers' behaviors. Simulation results show that the CATS framework can significantly reduce traffic accidents and improve urban traffic conditions.

cs.GR↗

arXiv2023

Several inequalities concerning interpolation in classical Fourier analysis

In this note, we establish several interpolation inequalities in $\mathbb R^n$ in the Lebesgue spaces and Morrey spaces. By using the classical Calderon--Zygmund decomposition, we will reprove that $L^{p}(\mathbb R^n)\cap\mathrm{BMO}(\mathbb R^n)\subset L^{q}(\mathbb R^n)$ for all $q$ with $p<q<\infty$, where $1\leq p<\infty$. We also reprove that there exists a constant $C(p,q,n)$ depending on $p,q,n$ such that the following inequality \begin{equation*} \|f\|_{L^q}\leq C(p,q,n)\cdot\big(\|f\|_{L^p}\big)^{p/q}\cdot\big(\|f\|_{\mathrm{BMO}}\big)^{1-p/q} \end{equation*} holds for all $f\in L^{p}(\mathbb R^n)\cap\mathrm{BMO}(\mathbb R^n)$ with $1\leq p<\infty$. Moreover, this embedding constant has the optimal growth order $q$ as $q\to\infty$, which was given by Chen--Zhu, and Kozono--Wadade. We will show that $L^{p,κ}(\mathbb R^n)\cap\mathrm{BMO}(\mathbb R^n)\subset L^{q,κ}(\mathbb R^n)$ for all $q$ with $p<q<\infty$, where $1\leq p<\infty$ and $0<κ<1$. Moreover, there exists a constant $\widetilde{C}(p,q,n)$ depending on $p,q,n$ such that \begin{equation*} \|f\|_{L^{q,κ}}\leq \widetilde{C}(p,q,n)\cdot\big(\|f\|_{L^{p,κ}}\big)^{p/q}\cdot\big(\|f\|_{\mathrm{BMO}}\big)^{1-p/q} \end{equation*} holds for all $f\in L^{p,κ}(\mathbb R^n)\cap\mathrm{BMO}(\mathbb R^n)$ with $1\leq p<\infty$ and $0<κ<1$. This embedding constant is shown to have the linear growth order as $q\to\infty$, that is, $\widetilde{C}(p,q,n)\leq C_n\cdot q$ with the constant $C_n$ depending only on the dimension $n$, when $q$ is large. As an application of the above results, some new bilinear estimates are also established, which can be used in the study of the global existence and regularity of weak solutions to elliptic and parabolic partial differential equations of the second order.

math.CA↗

arXiv2023

Laser Cooling of Nuclear Magnons

The initialization of nuclear spin to its ground state is challenging due to its small energy scale compared with thermal energy, even at cryogenic temperature. In this Letter, we propose an opto-nuclear quadrupolar effect, whereby two-color optical photons can efficiently interact with nuclear spins. Leveraging such an optical interface, we demonstrate that nuclear magnons, the collective excitations of nuclear spin ensemble, can be cooled down optically. Under feasible experimental conditions, laser cooling can suppress the population and entropy of nuclear magnons by more than two orders of magnitude, which could facilitate the application of nuclear spins in quantum information science.

quant-ph↗

arXiv2023

Two-photon Interface of Nuclear Spins Based on the Opto-Nuclear Quadrupolar Effect

Photons and nuclear spins are two well-known building blocks in quantum information science and technology. Establishing an efficient interface between optical photons and nuclear spins, while highly desirable for hybridizing these two quantum systems, is challenging because the interactions between nuclear spins and the environment are usually weak in magnitude, and there is also a formidable gap between nuclear spin frequencies and optical frequencies. In this work, we propose an opto-nuclear quadrupolar (ONQ) effect, whereby optical photons can be efficiently coupled to nuclear spins, similar to Raman scattering. Compared to previous works, ancilla electron spins are not required for the ONQ effect. This leads to advantages such as applicability in defect-free nonmagnetic crystals and longer nuclear spin coherence time. In addition, the frequency of the optical photons can be arbitrary, so they can be fine-tuned to minimize the material heating and to match telecom wavelengths for long-distance communications. Using perturbation theory and first-principles calculations, we demonstrate that the ONQ effect is stronger by several orders of magnitude than other nonlinear optical effects that could couple to nuclear spins. Based on this rationale, we propose promising applications of the ONQ effect, including quantum memory, quantum transduction, and materials isotope spectroscopy. We also discuss issues relevant to the experimental demonstration of the ONQ effect.

quant-ph↗

arXiv2023

Multilinear $θ$-type Calderon--Zygmund operators and their commutators on products of weighted amalgam spaces

In this paper, we first introduce several new classes of weighted amalgam spaces. Then we discuss both strong type and weak type estimates for certain multilinear $θ$-type Calderón--Zygmund operators $T_θ$ recently introduced in the literature on products of these spaces with multiple weights. Furthermore, the strong type and weak end-point estimates for both multilinear commutators and iterated commutators of $T_θ$ and pointwise multiplication with BMO functions are established as well.

math.CA↗

arXiv2023

Multilinear $θ$-type Calderón--Zygmund operators and commutators on products of weighted Morrey spaces

In this paper, we consider the boundedness properties of multilinear $θ$-type Calderón--Zygmund operators $T_θ$ recently introduced in the literature. First, we prove strong type and weak type estimates for multilinear $θ$-type Calderón--Zygmund operators on products of weighted Morrey spaces with multiple weights. Then we discuss strong type estimates for both multilinear commutators and iterated commutators of $T_θ$ on products of these spaces with multiple weights. Furthermore, the weak end-point estimates for commutators of $T_θ$ and pointwise multiplication with functions in bounded mean oscillation are established too.

math.CA↗

arXiv2023

Extremal values for Steiner distances and the Steiner $k$-Wiener index

Various questions related to distances between vertices of simple, finite graphs are of interest to extremal graph theorists. The Steiner distance of a set of $k$ vertices is a natural generalization of the regular distance. We extend several theorems on the middle parts and extremal values of trees from their regular distance variants to their Steiner distance variants. More specifically, we show that for a tree $T$, the Steiner $k$-distance, Steiner $k$-leaf-distance, and Steiner $k$-internal-distance are all concave along a path. We also calculate distances between the Steiner $k$-median, Steiner $k$-internal-median, and Steiner $k$-leaf-median. Letting the Steiner $k$-distance of a vertex $v \in V(T)$ be $\dd_k^T(v)$, we find bounds based on the order of $T$ for the ratios $\frac{\dd^T_{k}(u)}{\dd^T_{k}(v)}$, $\frac{\dd^T_{k}(w)}{\dd^T_{k}(z)}$, and $\frac{\dd^T_{k}(u)}{\dd^T_{k}(y)}$ where $u$ and $v$ are leaves, $w$ and $z$ are internal vertices, and $y$ is a Steiner $k$-centroid. Also, denoting the Steiner $k$-Wiener index as $\mathsf{SW}_k(T)$, we find upper and lower bounds for $\frac{\mathsf{SW}_k(T)}{\dd^G_{k}(v)}$. The extremal graphs that produce these bounds are also presented.

math.CO↗

arXiv2023

Non-Hermitian Physics-Inspired Voltage-Controlled Oscillators with Resistive Tuning

This paper presents a non-Hermitian physics-inspired voltage-controlled oscillator (VCO) topology, which is termed parity-time-symmetric topology. The VCO consists of two coupled inductor-capacitor (LC) cores with a balanced gain and loss profile. Due to the interplay between the gain/loss and their coupling, an extra degree of freedom is enabled via resistive tuning, which can enhance the frequency tuning range (FTR) beyond the bounds of conventional capacitive or inductive tuning. A silicon prototype is implemented in a standard 130 nm bulk CMOS process with a core area of 0.15mm^2. Experimental results show that it achieves a 3.1x FTR improvement and 30% phase noise reduction of the baseline VCO with the same amount of capacitive tuning ability.

cs.ET↗

arXiv2023

Enhanced photovoltaic effect in graphene-silicon Schottky junction under mechanical manipulation

Graphene-silicon Schottky junction (GSJ) which has the potential for large-scale manufacturing and integration can bring new opportunities to Schottky solar cells for photovoltaic (PV) power conversion. However, the essential power conversion limitation for these devices lies in the small open-circuit voltage ($V_{oc}$), which depends on the Schottky barrier height (SBH). In this study, we introduce an electromechanical method based on the flexoelectric effect to enhance the PV efficiency in GSJ. By atomic force microscope (AFM) tip-based indentation and in situ current measurement, the current-voltage (I-V) responses under flexoelectric strain gradient are obtained. The $V_{oc}$ is observed to increase for up to 20$\%$, leading to an evident improvement of the power conversion efficiency. Our studies suggest that strain gradient may offer unprecedented opportunities for the development of GSJ based flexo-photovoltaic applications.

cond-mat.mtrl-sci↗

arXiv2022

Ultrafast switching dynamics of the ferroelectric order in stacking-engineered ferroelectrics

The recently discovered ferroelectricity of van der Waals bilayers offers an unconventional route to improve the performance of devices. Key parameters such as switching field and speed depend on the static and dynamic properties of domain walls (DWs). Here we theoretically explore the properties of textures in stacking-engineered ferroelectrics from first principles. Employing a machine-learning potential model, we present results of large-scale atomistic simulations of stacking DWs and Moiré structure of boron nitride bilayers. We predict that the competition between the switching barrier of stable ferroelectric states and the in-plane lattice distortion leads to a DW width of the order of ten nanometers. DWs motion reduces the critical ferroelectric switching field of a monodomain by two orders of magnitude, while high domain-wall velocities allow domain switching on a picosecond-timescale. The superior performance compared to conventional ferroelectrics (or ferromagnets) may enable ultrafast and power-saving non-volatile memories. By twisting the bilayer into a stacking Moiré structure, the ferroelectric transforms into a super-paraelectric since DWs move under ultralow electric fields.

cond-mat.mtrl-sci↗

arXiv2022

Homogeneous fractional integral operators on Lebesgue and Morrey spaces, Hardy--Littlewood--Sobolev and Olsen-type inequalities

Let $T_{Ω,α}$ be the homogeneous fractional integral operator defined as \begin{equation*} T_{Ω,α}f(x):=\int_{\mathbb R^n}\frac{Ω(x-y)}{|x-y|^{n-α}}f(y)\,dy, \end{equation*} and the related fractional maximal operator $M_{Ω,α}$ is given by \begin{equation*} M_{Ω,α}f(x):=\sup_{r>0}\frac{1}{|B(x,r)|^{1-α/n}}\int_{|x-y|<r}|Ω(x-y)f(y)|\,dy. \end{equation*} In this article, we will use the idea of Hedberg to reprove that the operators $T_{Ω,α}$ and $M_{Ω,α}$ are bounded from $L^p(\mathbb R^n)$ to $L^q(\mathbb R^n)$ provided that $Ω\in L^s(\mathbf{S}^{n-1})$, $s'<p<n/α$ and $1/q=1/p-α/n$, which was obtained by Muckenhoupt and Wheeden. We also reprove that under the assumptions that $Ω\in L^s(\mathbf{S}^{n-1})$, $s'\leq p<n/α$ and $1/q=1/p-α/n$, the operators $T_{Ω,α}$ and $M_{Ω,α}$ are bounded from $L^p(\mathbb R^n)$ to $L^{q,\infty}(\mathbb R^n)$, which was obtained by Chanillo, Watson and Wheeden. We will use the idea of Adams to show that $T_{Ω,α}$ and $M_{Ω,α}$ are bounded from $L^{p,κ}(\mathbb R^n)$ to $L^{q,κ}(\mathbb R^n)$ whenever $s'<p<n/α$ and $1/q=1/p-α/{n(1-κ)}$, and bounded from $L^{p,κ}(\mathbb R^n)$ to $WL^{q,κ}(\mathbb R^n)$ whenever $s'\leq p<n/α$ and $1/q=1/p-α/{n(1-κ)}$. Some new estimates in the limiting cases are also established. The results obtained are substantial improvements and extensions of some known results. Moreover, we will apply these results to several well-known inequalities such as Hardy--Littlewood--Sobolev and Olsen-type inequalities.

math.CA↗

arXiv2022

A new estimate for homogeneous fractional integral operators on the weighted Morrey space $L^{p,κ}$ when $αp=(1-κ)n$

For any $0<α<n$, the homogeneous fractional integral operator $T_{Ω,α}$ is defined by \begin{equation*} T_{Ω,α}f(x)=\int_{\mathbb R^n}\frac{Ω(x-y)}{|x-y|^{n-α}}f(y)\,dy. \end{equation*} In this paper, we prove that if $Ω$ satisfies certain Dini smoothness conditions on $\mathbf{S}^{n-1}$, then $T_{Ω,α}$ is bounded from $L^{p,κ}(w^p,w^q)$ (weighted Morrey space) to $\mathrm{BMO}(\mathbb R^n)$.

math.CA↗

arXiv2022

Trajectory Privacy Protection Mechanism based on Social Attributes

The current trajectory privacy protection technology only considers the temporal and spatial attributes of trajectory data, but ignores the social attributes. However, there is an intrinsic relationship between social attributes and human activity trajectories, which brings new challenges to trajectory privacy protection, making existing trajectory privacy protection technologies unable to resist trajectory privacy attacks based on social attributes. To this end, this paper first studies the social privacy attack in the trajectory data, builds a social privacy attack model based on the fusion of "space-time" features, and reveals the internal impact of the spatial and temporal features in the trajectory data on social privacy leaks. -Anonymous algorithm and trajectory release privacy protection provide theoretical support. On this basis, integrate social attributes into trajectory privacy protection technology, design trajectory k-anonymity algorithm based on "space-time-social" three-dimensional mobile model, and construct trajectory data based on "space-time-social-semantic" multi-dimensional correlation Publish privacy-preserving models.

cs.CR↗

arXiv2022

A fast and Accurate Sketch Method for Estimating User Similarities over Trajectory Data

In a complex urban environment, due to the unavoidable interruption of GNSS positioning signals and the accumulation of errors during vehicle driving, the collected vehicle trajectory data is likely to be inaccurate and incomplete. A weighted trajectory reconstruction algorithm based on a bidirectional RNN deep network is proposed. GNSS/OBD trajectory acquisition equipment is used to collect vehicle trajectory information, and multi-source data fusion is used to realize bidirectional weighted trajectory reconstruction. At the same time, the neural arithmetic logic unit (NALU) is introduced into the trajectory reconstruction model to strengthen the extrapolation ability of the deep network and ensure the accuracy of trajectory prediction, which can improve the robustness of the algorithm in trajectory reconstruction when dealing with complex urban road sections. The actual urban road section was selected for testing experiments, and a comparative analysis was carried out with existing methods. Through root mean square error (RMSE, root-mean-square error) and using Google Earth to visualize the reconstructed trajectory, the experimental results demonstrate the effectiveness and reliability of the proposed algorithm.

cs.CR↗

arXiv2022

Deep-Learning-Based Computer Vision Approach For The Segmentation Of Ball Deliveries And Tracking In Cricket

There has been a significant increase in the adoption of technology in cricket recently. This trend has created the problem of duplicate work being done in similar computer vision-based research works. Our research tries to solve one of these problems by segmenting ball deliveries in a cricket broadcast using deep learning models, MobileNet and YOLO, thus enabling researchers to use our work as a dataset for their research. The output from our research can be used by cricket coaches and players to analyze ball deliveries which are played during the match. This paper presents an approach to segment and extract video shots in which only the ball is being delivered. The video shots are a series of continuous frames that make up the whole scene of the video. Object detection models are applied to reach a high level of accuracy in terms of correctly extracting video shots. The proof of concept for building large datasets of video shots for ball deliveries is proposed which paves the way for further processing on those shots for the extraction of semantics. Ball tracking in these video shots is also done using a separate RetinaNet model as a sample of the usefulness of the proposed dataset. The position on the cricket pitch where the ball lands is also extracted by tracking the ball along the y-axis. The video shot is then classified as a full-pitched, good-length or short-pitched delivery.

cs.CV↗

arXiv2022

Gallai's Conjecture for Complete and "Nearly Complete" Graphs

The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide an explicit construction for a path decomposition of complete graphs that satisfies Gallai's Conjecture. We then use that construction to prove that we can remove stars and certain tadpoles such that the resulting graph still satisfies Gallai's Conjecture. We also introduce a potential general approach through analyzing non-isomorphic path decompositions of complete graphs.

math.CO↗

arXiv2022

SLAM-TKA: Real-time Intra-operative Measurement of Tibial Resection Plane in Conventional Total Knee Arthroplasty

Total knee arthroplasty (TKA) is a common orthopaedic surgery to replace a damaged knee joint with artificial implants. The inaccuracy of achieving the planned implant position can result in the risk of implant component aseptic loosening, wear out, and even a joint revision, and those failures most of the time occur on the tibial side in the conventional jig-based TKA (CON-TKA). This study aims to precisely evaluate the accuracy of the proximal tibial resection plane intra-operatively in real-time such that the evaluation processing changes very little on the CON-TKA operative procedure. Two X-ray radiographs captured during the proximal tibial resection phase together with a pre-operative patient-specific tibia 3D mesh model segmented from computed tomography (CT) scans and a trocar pin 3D mesh model are used in the proposed simultaneous localisation and mapping (SLAM) system to estimate the proximal tibial resection plane. Validations using both simulation and in-vivo datasets are performed to demonstrate the robustness and the potential clinical value of the proposed algorithm.

cs.RO↗