{"title":"An extended soft set model: Type-2 fuzzy soft sets","authors":"Xi'ao Ma, Guoyin Wang","doi":"10.1109/CCIS.2011.6045046","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045046","url":null,"abstract":"The soft set theory has been initiated by Molodtsov as a useful mathematical tool for dealing with uncertainty, fuzzy, not clearly defined objects. However, it is inappropriate to be used to deal with fuzzy parameters that involve uncertain words, linguistic terms and have a non-measurable domain. In this paper, we present an extended soft set model which is called type-2 fuzzy soft sets by combining the type-2 fuzzy set and soft set models. The complement, ”and”, “or”, union and intersection operations are defined on the type-2 fuzzy soft sets. The related properties of type-2 fuzzy soft sets are also presented and discussed.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"185 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115582263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A non-standard-substance pesticide residue qualitative analysis method based on SVM","authors":"Yi Chen, Rui Wang, Hongqian Chen","doi":"10.1109/CCIS.2011.6045038","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045038","url":null,"abstract":"Currently, most pesticide residue analysis methods are based on mass spectrometry instruments, such as Gas Chromatography-Mass Spectrometry (GC-MS) analyzers. However, using these methods, user has to send the chemical standard-substances (pure pesticides) and the samples needed checking simultaneously in order to detect the pesticide residues in foods and agricultural products. Support Vector Machines (SVM) is a statistical learning method based on small-sample set. It has the advantages in solving the small-sample set, nonlinear and high dimension problems and is widely used in classification. A non-standard-substance pesticide residue qualitative analysis method (NSS-QAM) is presented in this paper. NSS-QAM transforms qualitative analysis problem into a problem of classification of pesticide residues based on SVM and existing official standards for pesticide residue detection and experiment results. NSS-QAM is divided into two steps. The first one is to let SVM learning according to characteristic parameters of pesticide residue from existing standards and experiment results and get classification model. This step is executed by offline and applies one-versus-one multi-class classification SVM. The second step is to use the model to classify detecting data from GC-MS analyzer and implement qualitative analysis for pesticide residue without using chemical standard-substance. NSS-QAM has been experimented with 1500 samples from 50 pesticides. The classification results demonstrate that NSS-QAM is an effective qualitative analyzing method.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116251081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhipeng Tan, Yanli Yuan, D. Feng, Tian Zhan, X. Tu
{"title":"Implementation of method object in active object-based storage systems","authors":"Zhipeng Tan, Yanli Yuan, D. Feng, Tian Zhan, X. Tu","doi":"10.1109/CCIS.2011.6045061","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045061","url":null,"abstract":"The concept of active storage was investigated through adding computational capabilities to I/O contexts, in which increasing data-locality in parallel or placing post-/preprocessing functionality for storage self-maintainability. The advantages of this scheme are tow fold, because it is able to leverage the processing power of the storage nodes and considerably reduce the network traffic at the same time. The emergence of object interface provides a good opportunity for the development of active storage to fight back with highly expressive interface semantics, and the functionality and scalability of active storage in the object storage system, The active storage that we proposed is targeting object-based storage system upon the building block of extended international standard T10 OSD (Object-based Storage Device) command set. Different with the existing work, our work focuses on researching and developing two new kinds of method object to realize active storage, in which user method object is used to manipulate the common user data object, triggered to perform by the user's read and write requests, and the system method object is used in accordance with the policy object and status of the system to implement self-management of the system respectively. Then these active objects are put together to integrated into proposed active storage framework.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"11 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123663868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Control algorithm based on shape recognition","authors":"Jian Lan, Shuiqing Yu, Liangliang Xu, Xuejuan Chen","doi":"10.1109/CCIS.2011.6045131","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045131","url":null,"abstract":"This paper compared and improved different control algorithm in flatness measurement system. And an improved threshold control algorithm was proposed, based on simple moving average algorithm. Experimental data show that the improved algorithm has good stability and controllability in flatness measurement system.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122790508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"User interest modeling by labeled LDA with topic features","authors":"Wenfeng Li, Xiaojie Wang, Rile Hu, Jilei Tian","doi":"10.1109/CCIS.2011.6045022","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045022","url":null,"abstract":"As well known, the user interest is carried in the user's web browsing history that can be mined out. This paper presents an innovative method to extract user's interests from his/her web browsing history. We first apply an efficient algorithm to extract useful texts from the web pages in user's browsed URL sequence. We then proposed a Labeled Latent Dirichlet Allocation with Topic Feature (LLDA-TF) to mine user's interests from the texts. Unlike other works that need a lot of training data to train a model to adopt supervised information, we directly introduce the raw supervised information to the procedure of LLDA-TF. As shown in the experimental results, results given by LLDA-TF fit predefined categories well. Furthermore, LLDA-TF model can name the user interests by category words as well as a keyword list for each category.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126452903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An integrated optimization model for the location of distribution centers with multiple practical constraints","authors":"Yundong Gu, Yajing An, Yanchao Chen, Jin Xu","doi":"10.1109/CCIS.2011.6045112","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045112","url":null,"abstract":"The problem of distribution centers location with multiple practical constraints, such as soft service time window, rigid work time window, vehicle being reused and so on, is shown firstly. Secondly, a multi-factor integrated optimization model is given, which not only optimizes distribution centers location and vehicle routes, but also meets all the multiple practical constraints. A bi-level nested genetic algorithm is proposed thirdly, where the design of the lower algorithm meets various constraints of optimization. Finally, the feasibility of the model and the efficiency of the algorithm are tested by a numerical example.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126051533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shuai Wang, Fang Du, Xinming Li, Yi Li, Xingye Han
{"title":"Research on dynamic reconfiguration technology of cloud computing virtual services","authors":"Shuai Wang, Fang Du, Xinming Li, Yi Li, Xingye Han","doi":"10.1109/CCIS.2011.6045088","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045088","url":null,"abstract":"Based on the characteristic of cloud computing, We have operated a research on the dynamic reconfiguration technique of cloud computing virtual services aiming at the management and maintenance of virtual services. The paper plots out three level dynamic reconfigure granularity about virtual services; according to different reconfiguration occasions puts forward dynamic reconfigure policies respectively in allusion to failure, system updating and user request; and designs a concrete scenario.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130139116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ensuring data storage security through a novel third party auditor scheme in cloud computing","authors":"Shuai Han, Jianchuan Xing","doi":"10.1109/CCIS.2011.6045072","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045072","url":null,"abstract":"Cloud computing technology has been looked upon as the next-generation architecture of IT solution. It enables the users to move their data and application software to the network which is different from traditional solutions. Due to this IT services are not under logical, physical and users' controls, it brings many new different security challenges. Ensuring data storage security is one more urgent of them. The representative network architecture for cloud data storage includes a third party auditor which affords trustful authentication for user to operate their data security in cloud. In this paper, we study the problem of data storage security in cloud computing. A novel third party auditor scheme is proposed. The obvious advantage of our scheme is the cloud service provider can offer the functions which were provided by the traditional third party auditor and make it trustful. So it indeed reduces the constitution's complexity in Cloud Computing.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124566086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dirichlet Process Mixture Models for lexical category acquisition","authors":"Bichuan Zhang, Xiaojie Wang, Guannan Fang","doi":"10.1109/CCIS.2011.6045045","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045045","url":null,"abstract":"In this work, we apply Dirichlet Process Mixture Models (DPMMs) to a cognitive computational task in natural language processing (NLP): lexical category acquisition. The model takes a corpus of child-directed speech from CHILDES as input. We assess the performance using a new measure we proposed that meets three criteria: informativeness, diversity and purity. The quantitative and qualitative evaluation performed highlights the choice of the feature dimension and inherent parameters can influence the performance of DPMMs towards lexical category solutions.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124668997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A comparative review of job scheduling for MapReduce","authors":"Dongjin Yoo, K. Sim","doi":"10.1109/CCIS.2011.6045089","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045089","url":null,"abstract":"MapReduce is an emerging paradigm for data intensive processing with support of cloud computing technology. MapReduce provides convenient programming interfaces to distribute data intensive works in a cluster environment. The strengths of MapReduce are fault tolerance, an easy programming structure and high scalability. A variety of applications have adopted MapReduce including scientific analysis, web data processing and high performance computing. Data Intensive computing systems, such as Hadoop and Dryad, should provide an efficient scheduling mechanism for enhanced utilization in a shared cluster environment. The problems of scheduling map-reduce jobs are mostly caused by locality and synchronization overhead. Also, there is a need to schedule multiple jobs in a shared cluster with fairness constraints. By introducing the scheduling problems with regards to locality, synchronization and fairness constraints, this paper reviews a collection of scheduling methods for handling these issues in MapReduce. In addition, this paper compares different scheduling methods evaluating their features, strengths and weaknesses. For resolving synchronization overhead, two categories of studies; asynchronous processing and speculative execution are discussed. For fairness constraints with locality improvement, delay scheduling in Hadoop and Quincy scheduler in Dryad are discussed.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121957015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}