Searcharxiv⌕ Search

arXiv subjects

Yuhan Jiang

Publications and source records attributed to Yuhan Jiang.

24 records · Page 2Linked to original sources

Critical transitions on route to chaos of natural convection on a heated horizontal circular surface

The transition route and bifurcations of the buoyant flow developing on a heated circular horizontal surface are elaborated using direct numerical simulations and direct stability analysis. A series of bifurcations, as a function of Rayleigh numbers (Ra) ranging from $10^1$ to $6\times10^7$, are found on the route to the chaos of the flow at $Pr=7$. When $Ra<1.0\times10^3$, the buoyant flow above the heated horizontal surface is dominated by conduction, because of which distinct thermal boundary layer and plume are not present. At $Ra=1.1\times10^6$, a Hopf bifurcation occurs, resulting in the flow transition from a steady state to a periodic puffing state. As Ra increases further, the flow enters a periodic rotating state at $Ra=1.9\times10^6$, which is a unique state that was rarely discussed in the literature. These critical transitions, leaving from a steady state and subsequently entering a series of periodic states (puffing, rotating, flapping and doubling) and finally leading to chaos, are diagnosed using spectral analysis and two-dimensional Fourier Transform (2DFT). Moreover, direct stability analysis is conducted by introducing random numerical perturbations into the boundary condition of the surface heating. We find that when the state of a flow is in the vicinity of bifurcation points (e.g., $Ra=2.0\times10^6$), the flow is conditionally unstable to perturbations, and it can bifurcate from the rotating state to the flapping state in advance. However, for relatively stable flow states, such as at $Ra=1.5\times10^6$, the flow remains its periodic puffing state even though it is being perturbed.

physics.flu-dyn↗

Joint Reconfigurable Intelligent Surface Location and Passive Beamforming Optimization for Maximizing the Secrecy-Rate

The physical layer security (PLS) is investigated for reconfigurable intelligent surface (RIS) assisted wireless networks, where a source transmits its confidential information to a legitimate destination with the aid of a single small RIS in the presence of a malicious eavesdropper. A new joint RIS location and passive beamforming (J-LPB) optimization scheme is proposed for the sake of maximizing the secrecy rate under the RIS location constraint and the constraint that the modulus of the reflecting coefficient at each RIS's unit is not larger than 1. Specifically, we analyze the optimal location of the RIS, and conclude that the product involving the source-RIS distance and the RIS-destination distance should be minimized. Since the product minimization problem is nonconvex, we then propose a two-tier optimization algorithm for solving it. Based on the near-optimal RIS 3D location obtained, we further formulate the passive beamforming optimization problem, and then propose to apply the Charnes-Cooper transformation along with the sequential rank-one constraint relaxation (SROCR) algorithm to solve it. Our numerical results show that the secrecy rate of the proposed J-LPB optimization scheme is higher than that of the benchmarks. Explicitly, we use the following benchmarks: the near-source-based RIS location and passive beamforming (NSB-LPB) optimization scheme, the near-destination-based RIS location and passive beamforming (NDB-LPB) optimization scheme, and the random RIS location and passive beamforming (R-LPB) optimization scheme. Finally, the benefits of our J-LPB scheme are further increased with the number of RIS units.

cs.IT↗

Bad Projections of the PSD Cone

The image of the cone of positive semidefinite matrices under a linear map is a convex cone. Pataki characterized the set of linear maps for which that image is not closed. The Zariski closure of this set is a hypersurface in the Grassmannian. Its components are the coisotropic hypersurfaces of symmetric determinantal varieties. We develop the convex algebraic geometry of such bad projections, with focus on explicit computations.

math.AG↗

Linear Spaces of Symmetric Matrices with Non-Maximal Maximum Likelihood Degree

We study the maximum likelihood degree of linear concentration models in algebraic statistics. We relate the geometry of the reciprocal variety to that of semidefinite programming. We show that the Zariski closure in the Grassmanian of the set of linear spaces that do not attain their maximal possible maximum likelihood degree coincides with the Zariski closure of the set of linear spaces defining a projection with non-closed image of the positive semidefinite cone. In particular, this shows that this closure is a union of coisotropic hypersurfaces.

math.AG↗

Singularities and Genus of the k-Ellipse

A k-ellipse is a plane curve consisting of all points whose distances from k fixed foci sum to a constant. We determine the singularities and genus of its Zariski closure in the complex projective plane. The paper resolves an open problem stated by Nie, Parrilo and Sturmfels in 2008.

math.AG↗

Secrecy Energy Efficiency Optimization for Artificial Noise Aided Physical-Layer Security in OFDM-Based Cognitive Radio Networks

In this paper, we investigate the power allocation of primary base station (PBS) and cognitive base station (CBS) across different orthogonal frequency division multiplexing (OFDM) subcarriers for energy-efficient secure downlink communication in OFDM-based cognitive radio networks (CRNs) with the existence of an eavesdropper having multiple antennas. We propose a secrecy energy efficiency maximization (SEEM) scheme by exploiting the instantaneous channel state information (ICSI) of the eavesdropper, called ICSI based SEEM (ICSI-SEEM) scheme with a given total transmit power budget for different OFDM subcarriers of both PBS and CBS. As for the case when the eavesdropper's ICSI is unknown, we also propose an SEEM scheme through using the statistical CSI (SCSI) of the eavesdropper, namely SCSI based SEEM (SCSI-SEEM) scheme. Since the ICSI-SEEM and SCSI-SEEM problems are fractional and non-convex, we first transform them into equivalent subtractive problems, and then achieve approximate convex problems through employing the difference of two-convex functions approximation method. Finally, new two-tier power allocation algorithms are proposed to achieve $\varepsilon$-optimal solutions of our formulated ICSI-SEEM and SCSI-SEEM problems. Simulation results illustrate that the ICSI-SEEM has a better secrecy energy efficiency (SEE) performance than SCSI-SEEM, and moreover, the proposed ICSI-SEEM and SCSI-SEEM schemes outperform conventional SR maximization and EE maximization approaches in terms of their SEE performance.

cs.IT↗