In the field of computer-aided diagnosis， accurate segmentation of IntraCranial Hemorrhages （ICHs） in Computed Tomography （CT） images is crucial for subsequent treatment and prognosis. To address the challenge of segmenting small hemorrhage regions， an information bottleneck-guided ICH segmentation method was proposed. Based on this method，an Information Bottleneck-Guided Segmentation Network （IBGS-Net） was proposed. Firstly， the U-Net architecture was used as a base， and an information bottleneck layer was introduced to enhance the recognition of key features related to ICH segmentation. Then， through the designed Residual SPatially-ADaptivE normalization （ResSPADE） module， the Information Activation Map （IAM） was integrated effectively into the segmentation process， thereby improving the network’s ability to identify and locate hemorrhage regions. Finally， an Interactive Guided Loss （IGL） function was introduced to optimize the model’s processing of difficult-to-segment regions， thereby further enhancing the model’s generalization performance. Evaluation results on the internal dataset indicate that the proposed method achieves 78.1% in Dice Similarity Coefficient （DSC）， 90.1% in Normalization Surface Dice （NSD）， and 11.5% in Relative Volume Difference （RVD）. On the public dataset INSTANCE 2022， the results of comparison with other segmentation methods show that compared to the suboptimal results， the three indicators of the proposed method increased by 1.9， 2.4， and decreased by 3.2 percentage points， respectively. The above validates the effectiveness and superiority of the proposed method in ICH segmentation tasks， so that the method is suitable for assisting clinicians in segmenting ICHs.

The subgraph isomorphism problem is a Non-deterministic Polynomial （NP）-complete problem， and the pivoted subgraph isomorphism is a special subgraph isomorphism problem. There are many existing efficient subgraph isomorphism algorithms， but there is no GPU-based search algorithm for the pivoted subgraph isomorphism problem at present， and a large number of unnecessary intermediate results will be generated when the pivoted subgraph matching problem is solved by the existing subgraph isomorphism algorithms. Therefore， a GPU-based pivoted subgraph isomorphism algorithm was proposed. Firstly， through a novel coding tree method， nodes were encoded by the combination of node labels， degrees and the structural features of node neighbors. And the query graph nodes were pruned on GPU in parallel， so that the size of search space tree generated by the data graph candidate nodes was significantly reduced. Then， the candidate nodes of the query graph node were visited level by level， and the unsatisfied nodes were filtered out. Finally， the obtained subgraph was verified whether it was an isomorphic subgraph of the query graph， and the search of pivoted subgraph isomorphism was realized efficiently. Experimental results show that compared with GPU-friendly Subgraph Matching （GpSM） algorithm， the proposed algorithm has the execution time reduced by one-half， and the proposed algorithm can efficiently perform the pivoted subgraph isomorphism search with scalability. The proposed pivoted subgraph isomorphism algorithm can reduce the time required to solve the pivoted subgraph isomorphism problem， while reducing GPU memory consumption and improving the performance of algorithm.

The paper proposed a precise full-array-synchronization data acquisition clock generation and transmission method to handle the hydrophone's data acquisition synchronization problem in the ocean underwater acoustic detection. By using the independent high-precision clock source and asynchronous differential transmission lines, the long distance synchronous acquisition of the hydro-phone's array was realized, which was characterized with high anti-jamming capability and so on. The detailed model of the full-array-synchronization principle was analyzed and the prototype system was established. Circuits experiment was carried out to verify the feasibility of the entire system. Recovered clock's time delay in the acquisition node was less than 165ns when the low-speed synchronous clock signal was transmitted by the unshielded twisted pair of 18 meters length. The experimental results show that the proposed method has good effect when being applied to transfer the standard clock of data acquisition in the linear array.