Search

Medical institutions and health care billing system is mostly independent of the hospital information system software, such as the presence of a heavy workload and inconsistent information due to the Hospital Information System would like to produce a secondary entry problems. Design of Medicare billing software based on the interface, is the fundamental solution to the problem. This paper describes a specific Medicare interface specification, implementation of information exchange with the medical center by the dynamic link library functions, including the structure and format of the input and output parameters of the library function call, as well as medical insurance information processing flow. Select Delphi as a development tools, the definition of the interface specification stored in arrays, Achieve various Medicare functions of the Medicare interface specification with custom functions. A Medicare billing software system is completed with Medicare directory information management, Medicare card information management, Medicare fee settlement management, and the other Medicare functions.

By analyzing the problem of k-means, we find the traditional k-means algorithm suffers from some shortcomings, such as requiring the user to give out the number of clusters k in advance, being sensitive to the initial cluster centers, being sensitive to the noise and isolated data, only being applied to the type found in globular clusters, and being easily trapped into a local solution et cetera. This improved algorithm uses the potential of data to find the center data and eliminate the noise data. It decomposes big or extended cluster into several small clusters, then merges adjacent small clusters into a big cluster using the information provided by the Safety Area. Experimental results demonstrate that the improved k-means algorithm can determine the number of clusters, distinguish irregular cluster to a certain extent, decrease the dependence on the initial cluster centers, eliminate the effects of the noise data and get a better clustering accuracy.

This article poses an algorithm of the hierarchical topology in wireless sensor network based on shortest path tree algorithm to cover the shortage of LAC Routing Algorithm (LAC-T), which based on SPT(Shortest Path Tree). LAC-T algorithm elects cluster head by the remaining energy of nodes and the distance between node and base station. Meanwhile, it uses SPT to communicate among cluster heads in WSNs. The result of stimulation shows that LAC-T algorithm is not only easy to achieve, but could be better balance the energy consumption of each node, extend the lifespan of WSN (Wireless Sensor Network).