Search

High-precision gyroscopes in space are essential for fundamental physics research and navigation. Due to its potential high precision, the cold atom gyroscope is expected to be the next generation of gyroscopes in space. Here, we report the first realization of a cold atom gyroscope, which was demonstrated by the atom interferometer installed in the China Space Station (CSS) as a payload. By compensating for CSS's high dynamic rotation rate using a built-in piezoelectric mirror, spatial interference fringes in the interferometer are successfully obtained. Then, the optimized ratio of the Raman laser's angles is derived, the coefficients of the piezoelectric mirror are self-calibrated in orbit, and various systemic effects are corrected. We achieve a rotation measurement resolution of 50*10^-6 rad/s for a single shot and 17*10^-6 rad/s for an average number of 32. The measured rotation is (-1142+/-29)*10^-6 rad/s and is compatible with that recorded by the classical gyroscope of the CSS. This study paves the way for developing high-precision cold atom gyroscopes in space., Comment: 14 pages, 3 figures

The systematic error induced by the quadratic Zeeman effect is non-negligible in atom interferometers and must be precisely evaluated. We theoretically analyze the phase shift induced by the Zeeman effect, and use a hyperfine ground state exchange (HGSE) method to evaluate the systematic error in the long-baseline $^{85}$Rb-$^{87}$Rb dual-species atom interferometer due to the quadratic Zeeman effect. Compared to the two evaluation methods, mapping the absolute magnetic field in the interference region and performing phase measurements at different bias fields, the HGSE method could obtain the systematic error in real time in case of slow drifts of either the ambient magnetic field or other systematic effects irrelevant to the hyperfine ground states. To validate the effectiveness of the HGSE method, we also employ the mapping magnetic field method and modulating bias field method independently to cross-check and yield consistent results of three methods within an accuracy of $10^{-11}$ level. The HGSE method is helpful in evaluating and suppressing the quadratic Zeeman-effect-induced systematic error in long-baseline atom interferometer-based precision measurements, such as equivalence principle tests.

We present a study of star-forming galaxies (SFGs) with pseudobulges (bulges with S\'ersic index $\rm n < 2$) in a local close major-merger galaxy pair sample (H-KPAIR). With data from new aperture photometries in the optical and near-infrared bands (aperture size of 7\;kpc) and from the literature, we find that the mean Age of central stellar populations in Spirals with pseudobulges is consistent with that of disky galaxies and is nearly constant against the bulge-to-total ratio (B/T). Paired Spirals have a slightly lower fraction of pure disk galaxies ($\rm B/T \leq 0.1$) than their counterparts in the control sample. Compared to SFGs with classical bulges, those with pseudobulges have a higher ($>2\;\sigma$) mean of specific star formation rate (sSFR) enhancement ($\rm sSFR_{enh} = 0.33\pm0.07$ vs $\rm sSFR_{enh} = 0.12\pm0.06$) and broader scatter (by $\sim 1$\;dex). The eight SFGs that have the highest $\rm sSFR_{enh}$ in the sample all have pseudobulges. A majority (69\%) of paired SFGs with strong enhancement (having sSFR more than 5 times the median of the control galaxies) have pseudobulges. The Spitzer data show that the pseudobulges in these galaxies are tightly linked to nuclear/circum-nuclear starbursts. Pseudobulge SFGs in S+S and in S+E pairs have significantly ($>3\;\sigma$) different sSFR enhancement, with the means of $\rm sSFR_{enh} = 0.45\pm0.08$ and $-0.04\pm0.11$, respectively. We find a decrease in the sSFR enhancements with the density of the environment for SFGs with pseudobulges. Since a high fraction (5/11) of pseudobulge SFGs in S+E pairs are in rich groups/clusters (local density $\rm N_{1Mpc} \geq 7$), the dense environment might be the cause for their low $\rm sSFR_{enh}$., Comment: Accepted for publication in RAA, ?? pages, 10 figures, 4 tables

In this paper we consider a nonconvex unconstrained optimization problem minimizing a twice differentiable objective function with H\"older continuous Hessian. Specifically, we first propose a Newton-conjugate gradient (Newton-CG) method for finding an approximate first-order stationary point (FOSP) of this problem, assuming the associated the H\"older parameters are explicitly known. Then we develop a parameter-free Newton-CG method without requiring any prior knowledge of these parameters. To the best of our knowledge, this method is the first parameter-free second-order method achieving the best-known iteration and operation complexity for finding an approximate FOSP of this problem. Furthermore, we propose a Newton-CG method for finding an approximate second-order stationary point (SOSP) of the considered problem with high probability and establish its iteration and operation complexity. Finally, we present preliminary numerical results to demonstrate the superior practical performance of our parameter-free Newton-CG method over a well-known regularized Newton method., Comment: arXiv admin note: text overlap with arXiv:2301.03139

In practice, many machine learning (ML) problems come with constraints, and their applied domains involve distributed sensitive data that cannot be shared with others, e.g., in healthcare. Collaborative learning in such practical scenarios entails federated learning (FL) for ML problems with constraints, or FL with constraints for short. Despite the extensive developments of FL techniques in recent years, these techniques only deal with unconstrained FL problems or FL problems with simple constraints that are amenable to easy projections. There is little work dealing with FL problems with general constraints. To fill this gap, we take the first step toward building an algorithmic framework for solving FL problems with general constraints. In particular, we propose a new FL algorithm for constrained ML problems based on the proximal augmented Lagrangian (AL) method. Assuming convex objective and convex constraints plus other mild conditions, we establish the worst-case complexity of the proposed algorithm. Our numerical experiments show the effectiveness of our algorithm in performing Neyman-Pearson classification and fairness-aware learning with nonconvex constraints, in an FL setting., Comment: Accepted by Transactions on Machine Learning Research. Code associated with this paper can be found in https://github.com/PL97/Constr_FL

The continuous development of computer network technology has accelerated the pace of informatization, and at the same time, network security issues are becoming increasingly prominent. Networking technology with different network topologies is one of the important means to solve network security problems. The security of VPN is based on the division of geographical boundaries, but the granularity is relatively coarse, which is difficult to cope with the dynamic changes of the security situation. Zero trust network solves the VPN problem through peer to peer authorization and continuous verification, but most of the solutions use a central proxy device, resulting in the central node becoming the bottleneck of the network. This paper put forward the hard-Nat traversal formula based on the birthday paradox, which solves the long-standing problem of hard NAT traversal. A full mesh networking mechanism with variable parameter full-dimensional spatial peer-to-peer grid topology was proposed, which covers all types of networking schemes and achieve peer-2-peer resource interconnection on both methodological and engineering level., Comment: 9th International Conference on Networks & Communications (NWCOM 2023)

We carried out deep mapping observations of the atomic hydrogen (HI) 21 cm line emission in a field centered on the famous galaxy group Stephan's Quintet (SQ), using the Five-hundred-meter Aperture Spherical Telescope (FAST) equipped with the 19-Beam Receiver. The final data cube reaches an HI column density sensitivity of $5 \sigma = 2.1\times 10^{17}$ cm$^{-2}$ per 20 km s$^{-1}$ channel with an angular resolution of $4'.0$. The discovery of a large diffuse feature of the HI emission in the outskirt of the intragroup medium of SQ was reported in a previous paper (Xu et al. 2022). Here we present a new study of the total HI emission of SQ and the detection of several neighboring galaxies, exploiting the high sensitivity and the large sky coverage of the FAST observations. A total HI mass of $M_{\rm HI} = 3.48 \pm 0.35 \times 10^{10}\; M_\odot$ is found for SQ, which is significantly higher than previous measurements in the literature. This indicates that, contrary to earlier claims, SQ is not HI deficient. The excessive HI gas is mainly found in the velocity ranges of 6200 - 6400 km s$^{-1}$ and 6800 - 7000 km s$^{-1}$, which was undetected in previous observations that are less sensitive than ours. Our results suggest that the ``missing HI" in compact groups may be hidden in the low-density diffuse neutral gas instead of in the ionized gas., Comment: 20 pages, 5 figures, Accepted by ApJ

The precision of the weak equivalence principle (WEP) test using atom interferometers (AIs) is expected to be extremely high in microgravity environment. The microgravity scientific laboratory cabinet (MSLC) in the China Space Station (CSS) can provide a higher-level microgravity than the CSS itself, which provides a good experimental environment for scientific experiments that require high microgravity. We designed and realized a payload of a dual-species cold rubidium atom interferometer. The payload is highly integrated and has a size of 460 mm * 330 mm * 260 mm. It will be installed in the MSLC to carry out high-precision WEP test experiment. In this article, we introduce the constraints and guidelines of the payload design, the compositions and functions of the scientific payload, the expected test precision in space, and some results of the ground test experiments, Comment: 24 pages,7 figures

In this paper we consider a composite optimization problem that minimizes the sum of a weakly smooth function and a convex function with either a bounded domain or a uniformly convex structure. In particular, we first present a parameter-dependent conditional gradient method for this problem, whose step sizes require prior knowledge of the parameters associated with the H\"older continuity of the gradient of the weakly smooth function, and establish its rate of convergence. Given that these parameters could be unknown or known but possibly conservative, such a method may suffer from implementation issue or slow convergence. We therefore propose a parameter-free conditional gradient method whose step size is determined by using a constructive local quadratic upper approximation and an adaptive line search scheme, without using any problem parameter. We show that this method achieves the same rate of convergence as the parameter-dependent conditional gradient method. Preliminary experiments are also conducted and illustrate the superior performance of the parameter-free conditional gradient method over the methods with some other step size rules., Comment: 33 pages, 3 figures

In this paper we consider finding an approximate second-order stationary point (SOSP) of general nonconvex conic optimization that minimizes a twice differentiable function subject to nonlinear equality constraints and also a convex conic constraint. In particular, we propose a Newton-conjugate gradient (Newton-CG) based barrier-augmented Lagrangian method for finding an approximate SOSP of this problem. Under some mild assumptions, we show that our method enjoys a total inner iteration complexity of $\widetilde{\cal O}(\epsilon^{-11/2})$ and an operation complexity of $\widetilde{\cal O}(\epsilon^{-11/2}\min\{n,\epsilon^{-5/4}\})$ for finding an $(\epsilon,\sqrt{\epsilon})$-SOSP of general nonconvex conic optimization with high probability. Moreover, under a constraint qualification, these complexity bounds are improved to $\widetilde{\cal O}(\epsilon^{-7/2})$ and $\widetilde{\cal O}(\epsilon^{-7/2}\min\{n,\epsilon^{-3/4}\})$, respectively. To the best of our knowledge, this is the first study on the complexity of finding an approximate SOSP of general nonconvex conic optimization. Preliminary numerical results are presented to demonstrate superiority of the proposed method over first-order methods in terms of solution quality., Comment: To appear in Computational Optimization and Applications. arXiv admin note: text overlap with arXiv:2301.03139

In this paper we consider finding a second-order stationary point (SOSP) of nonconvex equality constrained optimization when a nearly feasible point is known. In particular, we first propose a new Newton-CG method for finding an approximate SOSP of unconstrained optimization and show that it enjoys a substantially better complexity than the Newton-CG method [56]. We then propose a Newton-CG based augmented Lagrangian (AL) method for finding an approximate SOSP of nonconvex equality constrained optimization, in which the proposed Newton-CG method is used as a subproblem solver. We show that under a generalized linear independence constraint qualification (GLICQ), our AL method enjoys a total inner iteration complexity of $\widetilde{\cal O}(\epsilon^{-7/2})$ and an operation complexity of $\widetilde{\cal O}(\epsilon^{-7/2}\min\{n,\epsilon^{-3/4}\})$ for finding an $(\epsilon,\sqrt{\epsilon})$-SOSP of nonconvex equality constrained optimization with high probability, which are significantly better than the ones achieved by the proximal AL method [60]. Besides, we show that it has a total inner iteration complexity of $\widetilde{\cal O}(\epsilon^{-11/2})$ and an operation complexity of $\widetilde{\cal O}(\epsilon^{-11/2}\min\{n,\epsilon^{-5/4}\})$ when the GLICQ does not hold. To the best of our knowledge, all the complexity results obtained in this paper are new for finding an approximate SOSP of nonconvex equality constrained optimization with high probability. Preliminary numerical results also demonstrate the superiority of our proposed methods over the ones in [56,60]., Comment: 29 pages, accepted by SIAM Journal on Optimization