Time filter

Source Type

Shi J.,China Institute of Technology | Li H.,China Institute of Technology | Li H.,Jiangsu Province R and D Institute of Marine Resources | Hu Y.,China Institute of Technology | Huang E.,University of Detroit Mercy
International Journal of Digital Content Technology and its Applications | Year: 2012

Cloud computing is clearly one of today's most enticing technology areas due, at least in part, to its cost-efficiency and flexibility. The cloud infrastructure provider in a cloud computing platform must provide security and isolation guarantees to a service provider, who builds the service(s) for such a platform. As a new internet-based super computing model, the cloud computing technology has aroused great concern, and facing an increasing number of security threats at the same time. We describe how the combination of existing research thrusts has the potential to alleviate many of the concerns impeding adoption. In particular, we discuss some key technologies in cloud computing such as control to data in cloud computing, security and privacy guarantees for cloud data, virtualized safe technology, trusted cloud computing, encrypted data storage. Those methods improve the high availability of data. Protection measures from the data storage to transmission are taken to ensure safety.


Wang X.,China Institute of Technology | Li H.,China Institute of Technology | Li H.,Jiangsu Province R and D Institute of Marine Resources | Zhang S.,China Institute of Technology
International Journal of Digital Content Technology and its Applications | Year: 2012

Collaborative filtering is one of the most successful and widely used methods of automated product recommendation in online stores. With the gradual increase of customers and products in electronic commerce systems, the time consuming nearest neighbor collaborative filtering search of the target customer in the total customer space resulted in the failure of ensuring the real time requirement of recommender system. Sparsity of source data set is the major reason causing the poor quality. In order to provide high-quality recommendations even when data are sparse, this paper proposed a personalization recommendation algorithm based on rough set, The algorithm refine the user ratings data using attribution reduction, then uses a new similarity measure based on the quality of approximation of classification to find the target users' neighbors, and then generates recommendations. To prove our algorithm's effectiveness, the authors conduct experiments on the public dataset. Theoretical analysis and experimental results show that this method is efficient and effective.


Li H.,China Institute of Technology | Li H.,Jiangsu Province R and D Institute of Marine Resources | Zhang S.,China Institute of Technology | Wang X.,China Institute of Technology
International Journal of Digital Content Technology and its Applications | Year: 2012

Outlier detection has attracted substantial attention in many applications and research areas, and it has become a hot issue in the field of data mining. The task of outlier detection is to find small groups of data objects that are exceptional when compared with rest large amount of data. This paper proposes a new outlier detection algorithm combining the rough set and information entropy technology. The approach can obtain similar outlier sets by means of searching in an attributes subspace, which leads the analysis of outlier detection to focus on narrower and more specific object fields. This algorithm divides the original attribute space into several segments. Then to select those subjects with largest relative entropy and negative relative cardinality to be the outlier date set. To prove our algorithm's effectiveness, the authors conduct experiments on the public data sets. Theoretical analysis and experimental results show that this method is efficient and effective.


Hong L.,Huaihai Institute of Technology | Hong L.,Jiangsu Province R and D Institute of Marine Resources | Yang J.,Guizhou University
Chinese Control Conference, CCC | Year: 2012

Danger model theory is a new theory of immunology, and it breaks a new path for immunology research. The general situation and running mechanism of danger model are presented in this paper. A novel adaptive danger model algorithm is presented. The algorithm identifies 'dangerous' as the core idea and introduces antigen presenting cell and different danger signals. To solve the danger area selection problem, in the amelioration algorithm, the danger area radius is adaptive adjustment with the increase of iteration. Experimental results show that new algorithm provides by higher discrimination ratio. © 2012 Chinese Assoc of Automati.


Lichao F.,Huaihai Institute of Technology | Lichao F.,Jiangsu Province R and D Institute of Marine Resources | Chunwei G.,Harbin Institute of Technology | Yunpeng W.,Harbin Institute of Technology | And 2 more authors.
Advanced Materials Research | Year: 2013

Cement paste with addition of a small amount of (0.9wt%) nano-TiO2 were prepared. Flexural strength and compressive strength testing results showed that by adding a small amount of nano TiO2 with good dispersion, the 28-day flexural strength and compressive strength of cement paste modified by nano-TiO2 was increased by 16.12%, and 14.15%, respectively. © (2013) Trans Tech Publications, Switzerland.


Hong L.,Huaihai Institute of Technology | Hong L.,Jiangsu Province R and D Institute of Marine Resources
Journal of Information and Computational Science | Year: 2013

Clonal Selection Algorithm (CSA) has been applied widely in intelligent computationfield, but the global convergence theoretical analysis and research works about CSA were rare relatively. The global convergence of an improved clonal selection algorithm is investigated in this paper. Through the definition of global convergence in probability, the classical homogeneous Markov chain analyses is replaced by a new pure probability and iterative formula method, and the convergence results of the improved clonal selection algorithm are obtained. This method makes the global convergence research greatly simplified and enriches new contents for the theoretical foundation of the clonal selection algorithm. Copyright © 2013 Binary Information Press.


Jiajuan Q.,China University of Mining and Technology | Jiajuan Q.,Jiangsu Province R and D Institute of Marine Resources | Ting W.,China University of Mining and Technology | Ting W.,Jiangsu Province R and D Institute of Marine Resources | And 8 more authors.
Speciality Petrochemicals | Year: 2014

2-Methyl-5-(α-hydroxy-β-trichloroethyl)-8-hydroxyquinoline (I) and 2-methyl-8-hydroxylquinoline-5-sulfonic acid (II) was synthesized by reaction of 2-methyl-8-hydroxyl quinoline and chloral hydrate with sulfuric acid as solvent. 2-Methyl-8-hydroxyl quinoline-5-carbaldehyde was synthesized by reaction of (I) with KOH in methanol. The optimum conditions of (I) were found as follows:n(2-methyl-8-hydroxyquinoline): n(chloral hydrate): n(H 2SO4) = l: 1. 2:4. 6, reaction temperature was 80 °C, reaction time was 10 h and the yield of (I) was 54. 8%. The optimum conditions of(II)were found as follows: n(I): n(KOH) = l: 5. 1, reaction time was 7 h under reflow and the yield of (III) was 26. 9%. The structure of resultant was characterized with melting point detector, elemental analyzer, LC-MS, IR and 1H NMR.


Zhang Y.,Huaihai Institute of Technology | Zhang Y.,China University of Mining and Technology | Li C.,Huaihai Institute of Technology | Li H.,Huaihai Institute of Technology | And 2 more authors.
International Journal of Digital Content Technology and its Applications | Year: 2012

Result caching is an efficient technique for reducing the query processing load, hence it is commonly used in search engines. Caching is a crucial performance component of large-scale web search engines, as it greatly helps reducing average query response times and query processing workloads on backend search clusters. In this paper, we study query result caching and propose a cache management policy for achieving higher hit ratios compared to traditional heuristics methods. Our cache management policy comprises an eviction policy and an admission policy, and it divides the memory allocated for caching into two parts. In this paper, we propose a new set of feature-based cache eviction policies that achieve significant improvement over previous methods, and study an admission policy which uses state features to prevent infrequent queries from polluting the cache, substantially improving the hit ratios greatly. Evaluation using a real workload shows that our algorithm can achieve hit rate improvements as well as reduction in average hit ages.

Loading Jiangsu Province R and D Institute of Marine Resources collaborators
Loading Jiangsu Province R and D Institute of Marine Resources collaborators