Nonuniform linear arrays,such as coprime array and nested array,have received great attentions because of the increased degrees of freedom(DOFs)and weakened mutual coupling.In this paper,inspired by the existing copri...Nonuniform linear arrays,such as coprime array and nested array,have received great attentions because of the increased degrees of freedom(DOFs)and weakened mutual coupling.In this paper,inspired by the existing coprime array,we propose a high-order extended coprime array(HoECA)for improved direction of arrival(DOA)estimation.We first derive the closed-form expressions for the range of consecutive lags.Then,by changing the inter-element spacing of a uniform linear array(ULA),three cases are proposed and discussed.It is indicated that the HoECA can obtain the largest number of consecutive lags when the spacing takes the maximum value.Finally,by comparing it with the other sparse arrays,the optimized HoECA enjoys a larger number of consecutive lags with mitigating mutual coupling.Simulation results are shown to evaluate the superiority of HoECA over the others in terms of DOF,mutual coupling leakage and estimation accuracy.展开更多
Modular truss space deployable antennas are key for future large aperture,high precision antennas,already proven in various in-orbit applications globally.This paper introduces a design method for a tetrahedral basic ...Modular truss space deployable antennas are key for future large aperture,high precision antennas,already proven in various in-orbit applications globally.This paper introduces a design method for a tetrahedral basic unit mechanism with dual height positioning nodes.A parametric model is established,and its DOF are analyzed to confirm the mechanism's validity.The new tetrahedral basic unit mechanism constructed by this method is a single DOF mechanism and can locate different parabolic node heights.In order to further adapt to the parabolic and large aperture requirements of the deployable antenna of the truss,a combination unit and modular unit mechanism are developed based on this tetrahedral unit.The DOF and deployment characteristics of the modular unit mechanism are analyzed and validated through simulations.Various networking methods for the modular units are proposed,followed by a comprehensive performance comparison of different modular truss deployable antenna mechanisms.A prototype model of the modular unit mechanism is also developed,with deployment experiments demonstrating the mechanism's simplicity,low DOF,and large deployment ratio.The findings of this study provide a theoretical and technical basis for the future design and development of truss deployable antenna mechanisms.展开更多
The three-dimensional structure of a biomolecule rather than its one-dimensionM sequence determines its biological function. At present, the most accurate structures are derived from experimental data measured mainly ...The three-dimensional structure of a biomolecule rather than its one-dimensionM sequence determines its biological function. At present, the most accurate structures are derived from experimental data measured mainly by two techniques： X-ray crystallog- raphy and nuclear magnetic resonance （NMR） spec- troscopy. Because neither X-ray crystallography nor NMR spectroscopy could directly measure the positions of atoms in a biomolecule, algorithms must be designed to compute atom coordinates from the data. One salient feature of most NMR structure computation algorithms is their reliance on stochastic search to find the lowest energy conformations that satisfy the experimentally- derived geometric restraints. However, neither the cor- rectness of the stochastic search has been established nor the errors in the output structures could be quantified. Though there exist exact algorithms to compute struc- tures from angular restraints, similar algorithms that use distance restraints remain to be developed. An important application of structures is rational drug design where protein-ligand docking plays a crit- ical role. In fact, various docking programs that place a compound into the binding site of a target protein have been used routinely by medicinal chemists for both lead identification and optimization. Unfortunately, de- spite ongoing methodological advances and some success stories, the performance of current docking algorithms is still data-dependent. These algorithms formulate the docking problem as a match of two sets of feature points. Both the selection of feature points and the search for the best poses with the minimum scores are accomplished through some stochastic search methods. Both the un- certainty in the scoring function and the limited sam- pling space attained by the stochastic search contribute to their failures. Recently, we have developed two novel docking algorithms： a data-driven docking algorithm and a general docking algorithm that does not rely on experimental data. Our algorithms search the pose space exhaustively with the pose space itself being limited to a set of hierarchical manifolds that represent, respectively, surfaces, curves and points with unique geometric and energetic properties. These algorithms promise to be es- pecially valuable for the docking of fragments and small compounds as well as for virtual screening.展开更多
基金supported by the National Natural Science Foundation of China(62071476,62022091,61801488,61921001)the China Postdoctoral Science Foundation(2021T140788,2020M683728)+1 种基金the Science and Technology Innovation Program of Hunan Province(2020RC2041)the Research Program of National University of Defense Technology(ZK19-10,ZK20-33).
文摘Nonuniform linear arrays,such as coprime array and nested array,have received great attentions because of the increased degrees of freedom(DOFs)and weakened mutual coupling.In this paper,inspired by the existing coprime array,we propose a high-order extended coprime array(HoECA)for improved direction of arrival(DOA)estimation.We first derive the closed-form expressions for the range of consecutive lags.Then,by changing the inter-element spacing of a uniform linear array(ULA),three cases are proposed and discussed.It is indicated that the HoECA can obtain the largest number of consecutive lags when the spacing takes the maximum value.Finally,by comparing it with the other sparse arrays,the optimized HoECA enjoys a larger number of consecutive lags with mitigating mutual coupling.Simulation results are shown to evaluate the superiority of HoECA over the others in terms of DOF,mutual coupling leakage and estimation accuracy.
基金sponsored by the National Natural Science Foundation of China(No.52075467)Hebei Province Fund Outstanding Youth Fund Project,China(No.E2024203107)。
文摘Modular truss space deployable antennas are key for future large aperture,high precision antennas,already proven in various in-orbit applications globally.This paper introduces a design method for a tetrahedral basic unit mechanism with dual height positioning nodes.A parametric model is established,and its DOF are analyzed to confirm the mechanism's validity.The new tetrahedral basic unit mechanism constructed by this method is a single DOF mechanism and can locate different parabolic node heights.In order to further adapt to the parabolic and large aperture requirements of the deployable antenna of the truss,a combination unit and modular unit mechanism are developed based on this tetrahedral unit.The DOF and deployment characteristics of the modular unit mechanism are analyzed and validated through simulations.Various networking methods for the modular units are proposed,followed by a comprehensive performance comparison of different modular truss deployable antenna mechanisms.A prototype model of the modular unit mechanism is also developed,with deployment experiments demonstrating the mechanism's simplicity,low DOF,and large deployment ratio.The findings of this study provide a theoretical and technical basis for the future design and development of truss deployable antenna mechanisms.
文摘The three-dimensional structure of a biomolecule rather than its one-dimensionM sequence determines its biological function. At present, the most accurate structures are derived from experimental data measured mainly by two techniques： X-ray crystallog- raphy and nuclear magnetic resonance （NMR） spec- troscopy. Because neither X-ray crystallography nor NMR spectroscopy could directly measure the positions of atoms in a biomolecule, algorithms must be designed to compute atom coordinates from the data. One salient feature of most NMR structure computation algorithms is their reliance on stochastic search to find the lowest energy conformations that satisfy the experimentally- derived geometric restraints. However, neither the cor- rectness of the stochastic search has been established nor the errors in the output structures could be quantified. Though there exist exact algorithms to compute struc- tures from angular restraints, similar algorithms that use distance restraints remain to be developed. An important application of structures is rational drug design where protein-ligand docking plays a crit- ical role. In fact, various docking programs that place a compound into the binding site of a target protein have been used routinely by medicinal chemists for both lead identification and optimization. Unfortunately, de- spite ongoing methodological advances and some success stories, the performance of current docking algorithms is still data-dependent. These algorithms formulate the docking problem as a match of two sets of feature points. Both the selection of feature points and the search for the best poses with the minimum scores are accomplished through some stochastic search methods. Both the un- certainty in the scoring function and the limited sam- pling space attained by the stochastic search contribute to their failures. Recently, we have developed two novel docking algorithms： a data-driven docking algorithm and a general docking algorithm that does not rely on experimental data. Our algorithms search the pose space exhaustively with the pose space itself being limited to a set of hierarchical manifolds that represent, respectively, surfaces, curves and points with unique geometric and energetic properties. These algorithms promise to be es- pecially valuable for the docking of fragments and small compounds as well as for virtual screening.
