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.
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.
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.
A large-scale image retrieval system for the WWW, named VAST (VisuAl & SemanTic image search), is presented in this paper. Based on the existing inverted file and visual feature clusters, we form a semantic networ...
详细信息
ISBN:
(纸本)9788955191356
A large-scale image retrieval system for the WWW, named VAST (VisuAl & SemanTic image search), is presented in this paper. Based on the existing inverted file and visual feature clusters, we form a semantic network on top of the keyword association on the visual feature clusters. The system is able to automatically combine keyword and visual features for retrieval by the semantic network The combination is automatic, simple, and very fast, which is suitable for large-scale web dataset Meanwhile, the retrieval takes advantage of the semantic contents of the images in addition to the low-level features, which remarkably improves the retrieval precision. The experimental results demonstrate the superiority of the system.
Current grid information service is centralized or hierarchical and proves inefficient as grid scale rapidly increases. The introduction of P2P techniques into grids breaks an encouraging path. However, frequent join ...
详细信息
ISBN:
(纸本)9781605580777
Current grid information service is centralized or hierarchical and proves inefficient as grid scale rapidly increases. The introduction of P2P techniques into grids breaks an encouraging path. However, frequent join and departure of resource nodes require strong self-organization capacity of system to maintain their rigid structure. Moreover, arranging identifier space for P2P nodes is knotty and has great impact on system performance. If the identifier space is too large, some nodes will be overloaded. On the contraiy, small identifier space will bring the same problem as millennium bug. To address the issues, this paper proposes a scalable DHT-based (Distributed Hash Table) Information Service (DIS) for grid system, which organizes grid resources into a DHT ring based on VO (Virtual Organization). To save the identifier space while retaining the scalability and system performance, only stable VOs can join DIS via a new DHT node, whereas volatile VOs join DIS through being the sub-domain of other VO. Experimental results show that DIS provides rapid resource query, strong scalability and high throughput, meanwhile avoiding the key node failure as well as the bottleneck problem. Copyright 2008 ACM.
In order to achieve low delay services in VoIP, we can use application-layer routing scheme, which is to find proper relay nodes to intermediate voice packets from the source peer to the destination peer. The difficul...
详细信息
ISBN:
(纸本)9781605581279
In order to achieve low delay services in VoIP, we can use application-layer routing scheme, which is to find proper relay nodes to intermediate voice packets from the source peer to the destination peer. The difficulty of the scheme is how to find the proper relay nodes, which we call relay problem. This paper presents a new application-layer routing scheme, called DPLM, to resolve relay problem. We introduced the mechanism in detail, and evaluated our mechanism in NS2 network simulation environment and got a high relay node hit ratio result, which confirms the feasibility of a real system. Also we make a comparison with traditional schemes, and the results show that DPLM scheme has good performances. Copyright 2008 ACM.
Peer-to-peer (P2P) has become an important computing model because of its adaptation, selforganization and autonomy. But how to organize dynamic nodes in P2P networks efficiently for gaming message passing services is...
详细信息
With the development of semantic Web, search efficiency is becoming a challenging issue. To address this problem, we design an approach which mainly has two features. First, we explore potential semantic relationship ...
详细信息
With the development of semantic Web, search efficiency is becoming a challenging issue. To address this problem, we design an approach which mainly has two features. First, we explore potential semantic relationship between different objects and make full use of them to build a semantic buffer on server end, enhancing search speed. Second, we put another relatively small semantic buffer on each client so as to adapt to each individual user's interests, further improving the whole search efficiency and reducing server's load. Through testing on a practical platform, we testified that this semantic double-buffer based search approach can not only effectively reduce user's request response time, but considerably release server's load, bringing a high scalability.
Many grid middleware such as Globus Toolkit and GPE have started to support virtual machines. They implement the remote control of virtual machine by grid service and make use of virtual machinespsila function of quic...
详细信息
ISBN:
(纸本)9781424425129
Many grid middleware such as Globus Toolkit and GPE have started to support virtual machines. They implement the remote control of virtual machine by grid service and make use of virtual machinespsila function of quick deployment to construct the execution environment of grid application fast. In order to support virtual machine in grid environment, VMgrid (Virtual Machine grid) is presented. All services in VMgrid are implemented based on secure shell host protocol (SSH) while Globus Toolkitpsilas Virtual Workspace is on WSRF. This paper gives a clear description of VMgrid. Some comparisons with Globus Toolkitpsilas Virtual Workspace in performance are made in this paper. Performance results show that VMgrid virtual workspace atomic services are more effective than that of Globus.
暂无评论