Construction of Agricultural Information Service System in China——under the Eyeshot of Communication Science

The paper aims to study the current communication condition,configuration,characteristic and regulation of Chinese agricultural information in terms of the eyeshot of communication studies,and provide reference to build Chinese agricultural information service system based on the analysis of their advantages and disadvantages.

Capability-based context ontology modeling and reasoning for C^4ISR communication

Modeling and reasoning on domain contexts play a key role for adding intelligence to communication services, and the approach of capability-based requirement engineering ensures the scientificity and accuracy of requirement elicitation. This paper presents a capability-based context ontology modeling approach for command and control, communication, computer, intelligence, surveillance and reconnaissance（C^4ISR） communication. Primarily, a capability-based C^4ISR communication meta-concept model and a C^4ISR communication context meta-ontology are constructed. The context ontology is established under the constraints of the C^4ISR communication context meta-ontology, and furthermore, algorithms are proposed to support context reasoning based on description logic. A case study is presented to demonstrate applicability of the proposed method.

Effects of Service Standards Communication and Servant Leadership on Strategic Competence and Customer Orientation

Service standards communication and servant leadership are both important mechanisms to improve an organization＇s service process. Therefore, they are likely to affect strategic competence and customer orientation skills of organizations. In this research, customer orientation and strategic competence are undertaken in relation with servant leadership and service standards communication, using a sample of 106 Turkish firms＇ executive assistants. The results prove that service standards communication and servant leadership have a strong positive relationship with both strategic competence and customer orientation.

Algorithm for Delay-Constrained Minimal Cost Group Multicasting

Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.

he Design and Implementation of Medical Image Processing System based on DICOM Format

In order to fast transmission and processing of medical images and do not need to install client and plug-ins, the paper designed a kind of medical image reading system based on BS structure. This system improved the existing IWEB in the framework of PACS client image processing, medical image based on the service WEB completion port model. To realize the fast loading images with high concurrency, compared with the traditional WEB PACS, this system has the advantages of no client without plug-in installation, at the same time in the transmission and processing performance image has been greatly improved.

Layered heuristic algorithm for multiple restriction routes

A layered algorithm by bidirectional searching is proposed in this paper to solve the problem that it is difficult and time consuming to reach an optimal solution of the route search with multiple parameter restrictions for good quality of service. Firstly, a set of reachable paths to each intermediate node from the source node and the sink node based on adjacent matrix transformation are calculated respectively. Then a temporal optimal path is selected by adopting the proposed heuristic method according to a non-linear cost function. When the total number of the accumulated nodes by bidirectional searching reaches n-2, the paths from two directions to an intermediate node should be combined and several paths via different nodes from the source node to the sink node can be obtained, then an optimal path in the whole set of paths can be taken as the output route. Some simulation examples are included to show the effectiveness and efficiency of the proposed method. In addition, the proposed algorithm can be implemented with parallel computation and thus, the new algorithm has better performance in time complexity than other algorithms. Mathematical analysis indicates that the maximum complexity in time, based on parallel computation, is the same as the polynomial complexity of O(kn2-3kn+k), and some simulation results are shown to support this analysis.