In this paper, it advances the reasonable development programs of the waste dumping in the dumping areas and achieve the position, navigation and monitoring of the ship-borne navigation monitoring system which based on the GPS/ GPRS wireless remote monitoring technology on the embedded SPCE3200 platform. The software and the hardware which are consisted of a ship-borne information processing termination are introduced. Our work provides a low cost scheme for realizing the information-based management of the ship and the safety of the shipping and the effective management of the dumping areas.
Immersed boundary-lattice Boltzmann method (IB-LBM) has become a popular method for studying fluid-structure interaction (FSI) problems. However, the performance issues of the IB-LBM have to be considered when simulating the practical problems. The Graphics Processing Units (GPUs) from NVIDIA offer a possible solution for the parallel computing, while the CPU is a multicore processor that can also improve the parallel performance. This paper proposes a parallel algorithm for IB-LBM on a CPU-GPU heterogeneous platform, in which the CPU not only controls the launch of the kernel function but also performs calculations. According to the relatively local calculation characteristics of IB-LBM and the features of the heterogeneous platform, the flow field is divided into two parts: GPU computing domain and CPU computing domain. CUDA and OpenMP are used for parallel computing on the two computing domains, respectively. Since the calculation time is less than the data transmission time, a buffer is set at the junction of two computational domains. The size of the buffer determines the number of the evolution of the flow field before the data exchange. Therefore, the number of communications can be reduced by increasing buffer size. The performance of the method was investigated and analyzed using the traditional metric MFLUPS. The new algorithm is applied to the computational simulation of red blood cells (RBCs) in Poiseuille flow and through a microchannel.
In order to solve the problem of how to collect and manage large amount of location information and improve the accuracy of location service, interactive information supporting system based on ontology and location service is presented in this paper. It can transmit special information about users' location to front-end instantaneously, so it is very convenient for their daily life. It makes full use of the available wireless communication, which is easy to arrange and convenient for users.
In this paper, rough set theory is introduced to the domain ontology building process. We present a method for generating rough semi-automatic ontology on the basis of rough formal concept analysis, and give an example based on the field of marine.
The integration problem of heterogeneous data is the current hot issue of processing data.Its objective is to solve the multi-source heterogeneous data integration for efficient data sharing.As the figures proposed by the oceans,ocean increases the amount of data,coupled with a strong marine data heterogeneity characteristic of the marine-oriented applications,heterogeneous data integration has become the increasing prominent.The paper,a marine heterogeneous data integration framework is introduced using the mediator/wrapper architecture for query processing,querying decomposition used B-Tree querying XML nodes,which can be a good solution for the large amount of heterogeneous data of marine issues.
This paper introduce the modeling rules of ontology and exists building method, analyzes problems during the current building domain ontology, try to learn other ontology's building mode, combine of knowledge management SECI model, proposes a hierarchy-spiral domain ontology construction method EHSO (ECSI- hierarchy- spiral-ontology), use this method to build the East China Sea fishery knowledge classification ontology.
Study of teaching in Internet is better than conventional research.Internet helps teachers to communicate and collaborate with others freely.It's necessary to reflect on oneself,help each other and conduct by experts in Internet.
Objective
To analyze problems in the development of medical service at private hospitals, and provide references for promoting the development of these hospitals and implementing policies for encouraging this sector′s growth.
Methods
The data were collected from the statistical yearbook published by the National Health Commission of the People′s Republic of China, and descriptive analysis method was used to analyze the medical service workload and medical service efficiency of private hospitals in China since the new healthcare reform.
Results
Private hospitals accounted for 56.39% of the total number of hospitals in China, accounting for 21.69% of beds by the end of 2016.From the perspective of medical service workload, the service volume of these hospitals had increased yet at a small pace.The number of patients and inpatients received accounted for 12.90% and 15.84% respectively of all the hospitals in China. From the point of service efficiency, by the end of 2016, the bed utilization ratio was 62.8%, the daily medical visits to their doctors were 5.5 persons-times, and the daily number of hospitalized beds per doctor was 2.2 beds.These numbers lag far behind public hospitals.The development of private hospitals varied with regions in imbalance.
Conclusions
Improving the social image, attracting talents and improving service quality are key to improving the medical service capacity of private hospitals.
Key words:
Health resources; Private hospitals; Service volume; Service efficiency; Regional differences
Many networks, including social and biological networks, are naturally divided into communities. Community detection is an important task for the discovering underlying structure in networks. GN algorithm is one of the most influential detection algorithms based on betweenness scores of edges, but it is computationally costly, as all betweenness scores should be repeatedly computed once an edge is removed. Here, an algorithm is presented, which is also based on betweenness scores but more than one edge can be removed when all betweenness scores have been computed. This method is motivated by the consideration: many components, divided from networks, are independent each other in their recalculation of betweenness scores and their split into smaller components. It is shown that this method is fast and effective through theoretical analysis and experiments with several real data sets, which have been acted as test beds in many related works.
'/%3e%3cuse xlink:href='%23a' transform='rotate(23.036 .093 25.536)'/%3e%3cuse xlink:href='%23a' transform='rotate(45.87 1.273 16.18)'/%3e%3cuse xlink:href='%23a' transform='rotate(69.945 .996 12.078)'/%3e%3cuse xlink:href='%23a' transform='rotate(20.66 -19.689 31.932)'/%3e%3c/svg%3e)