Donghui Quan

Zihao Song, Huaxi Chen, Donghui Quan et al.

Identifying neutral hydrogen (\hi) galaxies from observational data is a significant challenge in \hi\ galaxy surveys. With the advancement of observational technology, especially with the advent of large-scale telescope projects such as FAST and SKA, the significant increase in data volume presents new challenges for the efficiency and accuracy of data processing.To address this challenge, in this study, we present a machine learning-based method for extracting \hi\ sources from the three-dimensional (3D) spectral data obtained from the Commensal Radio Astronomy FAST Survey (CRAFTS). We have carefully assembled a specialized dataset, HISF, rich in \hi\ sources, specifically designed to enhance the detection process. Our model, Unet-LK, utilizes the advanced 3D-Unet segmentation architecture and employs an elongated convolution kernel to effectively capture the intricate structures of \hi\ sources. This strategy ensures a reliable identification and segmentation of \hi\ sources, achieving notable performance metrics with a recall rate of 91.6\% and an accuracy of 95.7\%. These results substantiate the robustness of our dataset and the effectiveness of our proposed network architecture in the precise identification of \hi\ sources. Our code and dataset is publicly available at \url{https://github.com/fishszh/HISF}.

Heng Zhang, Guifei Jiang, Donghui Quan

There has been a longstanding dispute over which formalism is the best for representing knowledge in AI. The well-known "declarative vs. procedural controversy" is concerned with the choice of utilizing declarations or procedures as the primary mode of knowledge representation. The ongoing debate between symbolic AI and connectionist AI also revolves around the question of whether knowledge should be represented implicitly (e.g., as parametric knowledge in deep learning and large language models) or explicitly (e.g., as logical theories in traditional knowledge representation and reasoning). To address these issues, we propose a general framework to capture various knowledge representation formalisms in which we are interested. Within the framework, we find a family of universal knowledge representation formalisms, and prove that all universal formalisms are recursively isomorphic. Moreover, we show that all pairwise intertranslatable formalisms that admit the padding property are also recursively isomorphic. These imply that, up to an offline compilation, all universal (or natural and equally expressive) representation formalisms are in fact the same, which thus provides a partial answer to the aforementioned dispute.