The large population exerts high burdens to Chinese health census works. In this paper, we propose our PDCAS (pulmonary disease census aiding system) based on medical image grid, which aims to utilize the superioritie...
详细信息
The large population exerts high burdens to Chinese health census works. In this paper, we propose our PDCAS (pulmonary disease census aiding system) based on medical image grid, which aims to utilize the superiorities of gridtechnology to improve the efficiency of high-incidence and occupational pulmonary disease census. PDCAS integrates the individual medical information distributed in different hospitalspsila information systems into Medical Information Centre of one area. The census records are classified through one risk rate based cross clustering model to direct the medical diagnosis and review. The main processing algorithms of PDCAS are subdivided and encapsulated as detachable Web services with adapted granularity to support the grid workflow composition corresponding to different pulmonary diseases or aiding aims. The prototype of PDCAS proves the possible improvement of gridtechnology to diseases census and other data intensive medical applications.
Development of Internet brings the great increasing communication requirement. This demand impels the developing progress of Voice over Internet Protocol (VoIP). It is difficult to supply the high quality user experie...
详细信息
Development of Internet brings the great increasing communication requirement. This demand impels the developing progress of Voice over Internet Protocol (VoIP). It is difficult to supply the high quality user experience for VoIP services, which has brought great challenges to VoIP developer because of the dynamic property of Internet. We obtain the following results in lots of existing VoIP systems: (1) many relay peer selections are suboptimal; (2) the waiting time to select a relay node can be quite long; (3) there are a large number of unnecessary probes, resulting in heavy network traffic. This paper presents a way called novel application-layer relay strategy (NARS) to solve relay problem and improve scalability. We introduce the mechanism in detail, and test our mechanism in NS2 network simulation environment and get a high relay node hit ratio result, which confirms the feasibility of NARS. Also we make a comparison with the other existing models.
Scheduling is essential in peer-to-peer (P2P) video-on-demand (VoD) applications to obtain desirable user experience and high sharing efficiency. Existing systems and proposals largely utilize scheduling mechanisms th...
详细信息
Scheduling is essential in peer-to-peer (P2P) video-on-demand (VoD) applications to obtain desirable user experience and high sharing efficiency. Existing systems and proposals largely utilize scheduling mechanisms that are periodical in nature. We refer these as time-driven scheduling. In this paper we argue that the time-driven scheduling algorithm is not efficient for P2P VoD due to its inadequate resource utilization and inability in quickly adapting to the potential dynamics in such systems. We propose an event-driven scheduling algorithm for P2P VoD systems, in which the scheduler is triggered by events such as peer churn or/and random seeks. We evaluate our design through extensive simulations, and the experimental results show that event-driven scheduling outperforms time-driven scheduling in terms of both user experience and system scalability.
Recently there have been increasing attentions on the security aspects in Peer-to-Peer (P2P) networks, especially with respect to worm epidemics. However, existing worm containment mechanisms can be largely ineffectiv...
详细信息
Recently there have been increasing attentions on the security aspects in Peer-to-Peer (P2P) networks, especially with respect to worm epidemics. However, existing worm containment mechanisms can be largely ineffective due to the long delay exhibited in worm identification and patch generation. In this paper, we propose a new worm containment algorithm based on the concept of overlay partition, which can effectively quarantine worms into small and more manageable sub-networks. This algorithm relies on a simple anomaly detection which takes effect much faster than existing schemes. With ldquobridge linksrdquo, the alert of an anomaly can be disseminated faster than random scanning and dedicated worms. Further, in order to deal with false positives, we propose a granularity based clustering algorithm, called CAGA, which, through extensive simulation, is shown to realize better service sustenance during unnecessary partition caused by false positives and can effectively contain fast worms. Finally, we examine the effects of topologies and network dynamics.
Binary translation system usually maps guest registers into host registers to accelerate the translation speed. QEMU can be treated as a typical binary translator and it uses a fixed register allocation. On most hosts...
详细信息
ISBN:
(纸本)9781424449095
Binary translation system usually maps guest registers into host registers to accelerate the translation speed. QEMU can be treated as a typical binary translator and it uses a fixed register allocation. On most hosts, QEMU simply maps all the target registers to memory and only store a few temporary variables in host registers. However, QEMU does not consider the dependence of two or more adjacent instructions. So even a guest register's value has been loaded into the temporary variables when executing the previous instruction, the next instruction could not use the value from the temporary variable directly, which is mapped into host register. The next instruction has to reload the value from memory again. This paper presents an approach to eliminate these unnecessary operations. Tests of benchmarks from nbench show that this approach can achieve 10%~20% speed improvement.
With the development of speech recognition, speech data mining becomes a hot topic in fields of data mining and natural language processing. In this paper, a novel clustering algorithm is presented to describe how to ...
详细信息
With the development of speech recognition, speech data mining becomes a hot topic in fields of data mining and natural language processing. In this paper, a novel clustering algorithm is presented to describe how to do semantic mining and how to understand the developing trend of event implied in speech sequence. At first, the speech sequences are extracted into a Bayesian network presenting the relationship between different speech elements. Then, we utilize a 3-dimensional space and sequence cluster techniques to excavate implied information from speech. Considering speech data features, we improve traditional distance-based clustering algorithm to get semantic information and enhance performance. The experimental results show that our algorithm is correct and effective.
This paper describes the scheme of thread migration in a language virtual machine LAOVM - lightweight application-oriented virtual machine. To maintain high portability and flexibility, thread migration is implemented...
详细信息
This paper describes the scheme of thread migration in a language virtual machine LAOVM - lightweight application-oriented virtual machine. To maintain high portability and flexibility, thread migration is implemented at language level. To migrate process or thread in runtime in LAOVM, the following issues are addressed: (1) supporting kinds of applications implemented by different programming language; (2) enabling transparent process migration indifferent operating system; (3) implementing fine-grained mobility. Experimental results show that the downtime of thread migration is reasonably small, even the application runtime image is required for occupying massive memory blocks.
This paper provides a new data fusion mechanism based on regulation and reliability to solve the data conflict problems of multi-source heterogeneous data fusion in traffic information engineering. This mechanism eval...
详细信息
This paper provides a new data fusion mechanism based on regulation and reliability to solve the data conflict problems of multi-source heterogeneous data fusion in traffic information engineering. This mechanism evaluates each data source on historical reliability and data source QoS (Quality of Service), and then gives its reliability result. Userspsila reliability on the data source is calculated and dynamically adjusted, then new reliability data of the data source is given, finally the conflict data is fused. The validation of experiment result indicates that the method enhances accuracy and adoption ratio of the collected data in real time greatly.
In this paper, we propose a scheme that manages the computational resource of virtual machines that are used to host high performance computing applications. Different from the static configuration methodology employe...
详细信息
In this paper, we propose a scheme that manages the computational resource of virtual machines that are used to host high performance computing applications. Different from the static configuration methodology employed by the state-of-art virtual machine monitors, in our scheme, the virtual machines are automatically configured according to the actual load generated by the applications. NPB, HPL and kernel compilation are chosen as representative high performance computing applications to run inside the virtual machine constructed using our scheme, and the performance of such applications are compared with that obtained from the statically configured virtual machines. The comparison indicates that besides the great flexibility it brings, the performance penalty resulted by our scheme is below 5% in most cases, and the performance of the application running inside the automatically configured virtual machine is even better than that running inside the statically configured ones in some cases.
Based on increasing popularity of cloud computing, social computing and web 2.0 technology, Internet resources are extremely increasing. How to provide service invoking interfaces ceaselessly while minimizing the cost...
详细信息
Based on increasing popularity of cloud computing, social computing and web 2.0 technology, Internet resources are extremely increasing. How to provide service invoking interfaces ceaselessly while minimizing the cost of service development, which can meet the growing needs of end users, becomes a challenging issue for service providers. Meanwhile, service mashup technology is getting more attention in both enterprise and academia for building new end users applications fast in the complex and heterogeneous network environment. Therefore, we propose a new method of service mashup with the advantages of the cloud, grid, web services and other technologies. We develop cloud oriented Service MashUp system prototype (SMU). In SMU, we support the service information interaction, classification, and process during the procedure of service mashup to meet various needs of the multi-level and the multi-role of service applications. Our experiments show that SMU can reach the purpose of building personal service applications quickly and easily.
暂无评论