Design and practice of network migration and reconstruction for one hospital with two addresses / 医疗卫生装备

Object To migrate and reconstruct the hospital network to solve its problems in obsolete equipment, network architecture, software configuration and etc.Methods A network migration and reconstruction scheme was proposed based on the physical environment of one hospital with two addresses as well as some network technologies such as open shortest path first (OSPF) protocol, port trunking and stacking.Results The network migration and reconstruction were implemented as desired, and the core switching network was upgraded to ten gigabit Ethernet.Conclusion The hospital network is optimizedin architecture, software configuration, reliability and performances, and lays a foundation for hospital informatization.

Study on intra-retinal layers imaged with ultra - high resolution optical coherence tomography / 国际眼科杂志(Guoji Yanke Zazhi)

To evaluate the automated segmentation algorithm for detection of intra - retinal layers to process images obtained from ultra- high resolution optical coherence tomography ( OCT ) . Graph theory and the shortest path search based on dynamic programming were applied to automatically segment the 8 intra - retinal layers. We experimentally verified the accuracy and reliability of the algorithm. The results showed that the intra-retinal layer boundaries between automated and manual segmentations matched well. The algorithm successfully segmented the intra- retinal layers in glaucoma, high myopia, and retinitis pigmentosa patients. The proposed automatic segmentation for intra-retinal layers provides a promising tool for quantitative analysis in clinical diagnosis and treatment.

Mathematical modeling for selecting center locations for medical and health supplies reserve in Hainan Province

OBJECTIVE@#To explore how to choose the center locations to build the medical and health supplies reserve among many island towns.@*METHODS@#The center locations were selected from 18 towns Hainan Province, it's maximum service range (distance) was required to reach the minimum, or to minimize.@*RESULTS@#Three scenarios were considered, the center locations included only one town, two towns, three towns. By the use of graph theory and MATLAB programming, a mathematical model was established to obtain the shortest distance and the shortest path between arbitrary two towns.@*CONCLUSIONS@#We find out the center sites under certain conditions, and determine the specific service ranges of the center sites.