arXiv subjects
Publications and source records attributed to Yan Lin.
In this paper, the weighted Lp boundedness of multilinear commutators and iterated commutators of multilinear singular integral operators with generalized kernels is established, where the weight is multiple weight. Our results are generalizations of the corresponding results for multilinear singular integral operators with standard kernels and Dini kernels.
Proactive edge association is capable of improving wireless connectivity at the cost of increased handover (HO) frequency and energy consumption, while relying on a large amount of private information sharing required for decision making. In order to improve the connectivity-cost trade-off without privacy leakage, we investigate the privacy-preserving joint edge association and power allocation (JEAPA) problem in the face of the environmental uncertainty and the infeasibility of individual learning. Upon modelling the problem by a decentralized partially observable Markov Decision Process (Dec-POMDP), it is solved by federated multi-agent reinforcement learning (FMARL) through only sharing encrypted training data for federatively learning the policy sought. Our simulation results show that the proposed solution strikes a compelling trade-off, while preserving a higher privacy level than the state-of-the-art solutions.
Researchers have proposed kinds of malware detection methods to solve the explosive mobile security threats. We argue that the experiment results are inflated due to the research bias introduced by the variability of malware dataset. We explore the impact of bias in Android malware detection in three aspects, the method used to flag the ground truth, the distribution of malware families in the dataset, and the methods to use the dataset. We implement a set of experiments of different VT thresholds and find that the methods used to flag the malware data affect the malware detection performance directly. We further compare the impact of malware family types and composition on malware detection in detail. The superiority of each approach is different under various combinations of malware families. Through our extensive experiments, we showed that the methods to use the dataset can have a misleading impact on evaluation, and the performance difference can be up to over 40%. We argue that these research biases observed in this paper should be carefully controlled/eliminated to enforce a fair comparison of malware detection techniques. Providing reasonable and explainable results is better than only reporting a high detection accuracy with vague dataset and experimental settings.
The fractional Hilbert transform was introduced by Zayed [30, Zayed, 1998] and has been widely used in signal processing. In view of is connection with the fractional Fourier transform, Chen, the first, second and fourth authors of this paper in [6, Chen et al., 2021] studied the fractional Hilbert transform and other fractional multiplier operators on the real line. The present paper is concerned with a natural extension of the fractional Hilbert transform to higher dimensions: this extension is the fractional Riesz transform which is defined by multiplication which a suitable chirp function on the fractional Fourier transform side. In addition to a thorough study of the fractional Riesz transforms, in this work we also investigate the boundedness of singular integral operators with chirp functions on rotation invariant spaces, chirp Hardy spaces and their relation to chirp BMO spaces, as well as applications of the theory of fractional multipliers in partial differential equations. Through numerical simulation, we provide physical and geometric interpretations of high-dimensional fractional multipliers. Finally, we present an application of the fractional Riesz transforms in edge detection which verifies a hypothesis insinuated in [26, Xu et al., 2016]. In fact our numerical implementation confirms that amplitude, phase, and direction information can be simultaneously extracted by controlling the order of the fractional Riesz transform.
In this paper, multiple reconfigurable intelligent surfaces (RIS) aided secure precise wireless transmission (SPWT) schemes are proposed in the three-dimensional (3D) wireless communication scenario. Unavailable direct path channels from transmitter to receivers are considered when the direct paths are obstructed by obstacles. Then, multiple RISs are utilized to achieve SPWT through the reflection path among transmitter, RISs and receivers in order to enhance the communication performance and energy efficiency simultaneously. First, a maximum-signal-to-interference-and-noise ratio (MSINR) scheme is proposed in a single user scenario. Then, the multi-user scenario is considered where the illegitimate users are regarded as eavesdroppers. A maximum-secrecy-rate (MSR) scheme and a maximum-signal-to-leakage-and-noise ratio (MSLNR) are proposed. The former achieves a better secrecy rate (SR) performance but incurs a higher complexity. The latter has a lower complexity than the MSR scheme with an SR performance loss. Simulation results show that both single-user scheme and multi-user scheme can achieve SPWT which transmits confidential message precisely to location of desired users. Moreover, MSLNR scheme has a lower complexity than the MSR scheme, while the SR performance is close to that of the MSR scheme.
In this paper, the authors prove the boundedness of commutators generated by the weighted Hardy operator on weighted $λ$-central Morrey space with the weight $ω$ satisfying the doubling condition. Moreover, the authors give the characterization for the weighted $λ$-central Campanato space by introducing a new kind of operator which is related to the commutator of weighted Hardy operator.
In this paper, two regional robust secure precise wireless transmission (SPWT) schemes for multi-user unmanned aerial vehicle (UAV) :1) regional signal-to-leakage-and-noise ratio (SLNR) and artificial-noise-to-leakage-and-noise ratio (ANLNR) (R-SLNR-ANLNR) maximization and 2) point SLNR and ANLNR (P-SLNR-ANLNR) maximization, are proposed to tackle with the estimation errors of the target users' location. In SPWT system, the estimation error for SPWT can not be ignored. However the conventional robust methods in secure wireless communications optimize the beamforming vector in the desired positions only in statistical means and can not guarantee the security for each symbol. Proposed regional robust schemes are designed for optimizing the secrecy performance in the whole error region around the estimated location. Specifically, with known maximal estimation error, we define target region and wiretap region. Then design an optimal beamforming vector and an artificial noise projection matrix, which achieve the confidential signal in the target area having the maximal power while only few signal power is conserved in the potential wiretap region. Instead of considering the statistical distributions of the estimated errors into optimization, we optimize the SLNR and ANLNR of the whole target area, which significantly decreases the complexity. Moreover, the proposed schemes can ensure that the desired users are located in the optimized region, which are more practical than conventional methods. Simulation results show that our proposed regional robust SPWT design is capable of substantially improving the secrecy rate compared to the conventional non-robust method. The P-SLNR-ANLNR maximization-based method has the comparable secrecy performance with a lower complexity than that of the R-SLNR-ANLNR maximization-based method.
Vehicle tracking has become one of the key applications of wireless sensor networks (WSNs) in the fields of rescue, surveillance, traffic monitoring, etc. However, the increased tracking accuracy requires more energy consumption. In this letter, a decentralized vehicle tracking strategy is conceived for improving both tracking accuracy and energy saving, which is based on adjusting the intersection area between the fixed sensing area and the dynamic activation area. Then, two deep reinforcement learning (DRL) aided solutions are proposed relying on the dynamic selection of the activation area radius. Finally, simulation results show the superiority of our DRL aided design.
Curve skeleton extraction from unorganized point cloud is a fundamental task of computer vision and three-dimensional data preprocessing and visualization. A great amount of work has been done to extract skeleton from point cloud. but the lack of standard datasets of point cloud with ground truth skeleton makes it difficult to evaluate these algorithms. In this paper, we construct a brand new tree-structured point cloud dataset, including ground truth skeletons, and point cloud models. In addition, four types of point cloud are built on clean point cloud: point clouds with noise, point clouds with missing data, point clouds with different density, and point clouds with uneven density distribution. We first use tree editor to build the tree skeleton and corresponding mesh model. Since the implicit surface is sufficiently expressive to retain the edges and details of the complex branches model, we use the implicit surface to model the triangular mesh. With the implicit surface, virtual scanner is applied to the sampling of point cloud. Finally, considering the challenges in skeleton extraction, we introduce different methods to build four different types of point cloud models. This dataset can be used as standard dataset for skeleton extraction algorithms. And the evaluation between skeleton extraction algorithms can be performed by comparing the ground truth skeleton with the extracted skeleton.
In conventional secure precise wireless transmission (SPWT), fully digital beamforming (FDB) has a high secrecy performance in transmit antenna system, but results in a huge RF-chain circuit budget for medium-scale and large-scale systems. To reduce the complexity, this letter considers a hybrid digital and analog (HDA) structure with random frequency mapped into the RF-chains to achieve SPWT. Then, a hybrid SPWT scheme based on maximizing signal-to-leakage-and-noise ratio (SLNR) and artificial-noise-to-leakage-and-noise ratio (ANLNR) (M-SLNR-ANLNR) is proposed. Compared to the FDB scheme, the proposed scheme reduces the circuit budget with low computational complexity and comparable secrecy performance.
An aluminum nitride (AlN) Schottky barrier diode (SBD) was fabricated on a nonpolar AlN crystal grown on tungsten substrate by physical vapor transport. The Ni/Au-AlN SBD features a low ideality factor n of 3.3 and an effective Schottky barrier height (SBH) of 1.05 eV at room temperature. The ideality factor n decreases and the effective SBH increases at high temperatures. The temperature dependences of n and SBH were explained using an inhomogeneous model. A mean SBH of 2.105 eV was obtained for the Ni-AlN Schottky junction from the inhomogeneity analysis of the current-voltage characteristics. An equation in which the parameters have explicit physical meanings in thermionic emission theory is proposed to describe the current-voltage characteristics of inhomogeneous SBDs.
The security of spatial modulation (SM) aided networks can always be improved by reducing the desired link's power at the cost of degrading its bit error ratio performance and assuming the power consumed to artificial noise (AN) projection (ANP). We formulate the joint optimization problem of maximizing the secrecy rate (Max-SR) over the transmit antenna selection and ANP in the context of secure SM-aided networks, which is mathematically a non-linear mixed integer programming problem. In order to solve this problem, we provide a pair of solutions, namely joint and separate solutions. Specifically, an accurate approximation of the SR is used for reducing the computational complexity, and the optimal AN covariance matrix (ANCM) is found by convex optimization for any given active antenna group (AAG). Then, given a large set of AAGs, simulated annealing mechanism is invoked for optimizing the choice of AAG, where the corresponding ANCM is recomputed by this optimization method as well when the AAG changes. To further reduce the complexity of the above-mentioned joint optimization, a low-complexity two-stage separate optimization method is also proposed. Furthermore, when the number of transmit antennas tends to infinity, the Max-SR problem becomes equivalent to that of maximizing the ratio of the desired user's signal-to-interference-plus-noise ratio to the eavesdropper's. Thus our original problem reduces to a fractional programming problem, hence a significant computational complexity reduction can be achieved for the optimization problem. Our simulation results show that the proposed algorithms outperform the existing leakage-based null-space projection scheme in terms of the SR performance attained, and drastically reduces the complexity at a slight SR performance reduction.
This paper introduces a computational framework for reasoning in Bayesian belief networks that derives significant advantages from focused inference and relevance reasoning. This framework is based on d -separation and other simple and computationally efficient techniques for pruning irrelevant parts of a network. Our main contribution is a technique that we call relevance-based decomposition. Relevance-based decomposition approaches belief updating in large networks by focusing on their parts and decomposing them into partially overlapping subnetworks. This makes reasoning in some intractable networks possible and, in addition, often results in significant speedup, as the total time taken to update all subnetworks is in practice often considerably less than the time taken to update the network as a whole. We report results of empirical tests that demonstrate practical significance of our approach.