Full disk encryption is a good choice to solve the problem of information leakage. In this paper, a full disk encryption based on virtual machine is proposed for computers without TPM. The program to decrypt the operating system is stored in a USB device which is more secure than in hard disk together with confidential information. Its key recovery scheme is with the help of a smartcard which is used for enhancing security. The experiments, security analysis and comparison demonstrate the efficiency, security and advantage of the proposed scheme.

In  this  paper  we  show  that  the  binary  Hamming  codes $(2^r-1, 2^{2^r-r-1}-2, 3)$ satisfy $(2^r-r-2) -2^{2^r-r-1}-1, \{3,4,...,2^r-4\}, 1)$ designs, where $r\ge 3,$ a positive integer. For different values of $r$ most of the $t$-wise balanced designs obtained from our constructions appear to be new.

Studies show that reducing the gap between security services and semantic web is important. In this paper we present an ontology-based access-control (OBAC) to support semantic web service. For that, security ontologies are developed to specify concepts and terms involved in this model. Our proposed access control model is expressive and general with these important features: (i) The use of ontology provides reasoning ability for access control decision making, and allows access control information to be automatically searched, queried and discovered. (ii) Our proposed model has a higher degree of interoperability compared to other approaches of access control mechanism. This is because of the nature of ontologies in providing semantic interoperability. (iii) Our proposed model is context sensitive; the constraint ontology represents different types of context constraint. (iv) Our proposed model is designed based on the widely accepted semantic web languages, Web Ontology Language (OWL) and Web Ontology Language for Service (OWL-S), therefore its implementation can be easily achieved by using already existing tools designed for working with these languages.

This paper proposed a simple and robust lane markers detection method for intelligent vehicle navigation. It needs not calculate inverse perspective map. The method uses multiple threshold segmentation instead of single threshold segmentation. And straight and curve lane markers are directly extracted in Run- Length accumulation (RLA) images. It performs well in various complex conditions and costs less than 50 ms for a 352 by 288 image. Experiments on many kinds of real complex image sequences demonstrate the effectiveness and efficiency of the proposed method.

Currently, the low-level image features such as color, texture, and shape are widely used for content-based image retrieval. However, it is rather difficult to realize an exact match between two images by using a single feature. To address this problem, a method combining color spatial distribution and shape of the object is presented. In this method, firstly, an improved mean shift algorithm is presented to segment an image into clusters. Secondly, based on these clusters a novel histogram is defined. Thirdly, based on each cluster, the shape curve of an object is extracted. Finally, integrating the information of color and shape of the objects in an image, a novel similarity measure is presented to realize an exact match between two images. Experimental results show that our method can efficiently increase match precision.

In this paper, we described dynamic evolution of network information, as well as identify and analysis the document collection on the same topic in different stages. Dynamic summarization considers the different documents’ temporal relationship in multi-document and analyzes the relationship between emerged information and emerging information. In order to construct a dynamic evolution of content differences, a dynamic multi-document summarization model was presented, called the Matrix Subspace Analysis Method model. On this basis, proposed some efficient dynamic sentence weighting methods, and experiments on the test data of Update Summarization in TAC2008, we showed effectiveness results.

It is a crucial problem in the studies of the fluid on numerical simulations of the interfaces movement in multi-component fluids. In the present paper, a discontinuous Galerkin method is developed to simulate two-fluid flow. A level set method is used to capturing moving interfaces and a ghost fluid method with isobaric fix is used to disposing the interfaces boundary. Several test problems of two fluid flowing is solved and the comparisons between the numerical results and exact case are performed, which indicate the effectiveness of the method.