Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045109
Jun Wang, Lei Li, F. Ren
Social network plays an important role in this network age. With development of social network, people hope more attribute and more precise description about relation which is the key element of network. This paper proposes an improved method of extracting emotional attribute of relations from Chinese events based on syntactical analysis. In our work, we improved the defect of previous method that can not deal with multiple entities in one sentence. In addition, a large-scale Chinese emotional dictionary not only emotional verbs was used in the extraction of emotional attribute. Experiment showed our method achieved satisfied performance.
{"title":"An improved method of extracting emotional attribute of relations based on syntactical analysis","authors":"Jun Wang, Lei Li, F. Ren","doi":"10.1109/CCIS.2011.6045109","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045109","url":null,"abstract":"Social network plays an important role in this network age. With development of social network, people hope more attribute and more precise description about relation which is the key element of network. This paper proposes an improved method of extracting emotional attribute of relations from Chinese events based on syntactical analysis. In our work, we improved the defect of previous method that can not deal with multiple entities in one sentence. In addition, a large-scale Chinese emotional dictionary not only emotional verbs was used in the extraction of emotional attribute. Experiment showed our method achieved satisfied performance.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"22 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":"121375970","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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045089
Dongjin Yoo, K. Sim
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.
{"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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045072
Shuai Han, Jianchuan Xing
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.
{"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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045140
Jie Yang, Yongshi Xu, R. Xu
Taking full advantage of limited number of trains to obtain the best transport efficiency is the foremost question in Urban Rail Transit (URT) operation. The paper analyzes the deficiencies in current theory of URT train running program, and then puts forward its objective: comparing and optimizing the operating projects according to average passenger waiting time and total trainload. Firstly, the paper establishes a platform-train-passengers interchange model, set up corresponding real-time arithmetic for average waiting time and total trainload. Secondly, this article advances a double-target optimum model for URT train running program, and then figure out the optimu m solution by using artificial intelligence technique. Finally, an example is given to validate the optimu m method.
{"title":"Optimization method of Urban Rail Transit train running scheme","authors":"Jie Yang, Yongshi Xu, R. Xu","doi":"10.1109/CCIS.2011.6045140","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045140","url":null,"abstract":"Taking full advantage of limited number of trains to obtain the best transport efficiency is the foremost question in Urban Rail Transit (URT) operation. The paper analyzes the deficiencies in current theory of URT train running program, and then puts forward its objective: comparing and optimizing the operating projects according to average passenger waiting time and total trainload. Firstly, the paper establishes a platform-train-passengers interchange model, set up corresponding real-time arithmetic for average waiting time and total trainload. Secondly, this article advances a double-target optimum model for URT train running program, and then figure out the optimu m solution by using artificial intelligence technique. Finally, an example is given to validate the optimu m method.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"76 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":"131077409","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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045112
Yundong Gu, Yajing An, Yanchao Chen, Jin Xu
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.
{"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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045115
Hang Yin, Xiaojun Jing, Songlin Sun
Fingerprint recognition is a widely used biometric identification mechanism. The singular points of fingerprints are important referential points for the fingerprint classification and fingerprint matching. In this paper, we propose a novel algorithm for detecting the singular points. The method is based on vector orthogonal theory and the fact that the singular points have special pattern of the orientation field. We use the same mask to detect the core points and delta points in different field. After applying the special mask, the core points and delta points will be detected in the orientation field and double orientation field respectively. To substantiate the performance of our approach, we have experimented with fvc2002 and fvc2004 database. Experimental results show that our algorithm is accurate and robust, giving better results than competing approaches.
{"title":"A novel algorithm for fingerprint singular points detection based on vecrot orthogonal theory","authors":"Hang Yin, Xiaojun Jing, Songlin Sun","doi":"10.1109/CCIS.2011.6045115","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045115","url":null,"abstract":"Fingerprint recognition is a widely used biometric identification mechanism. The singular points of fingerprints are important referential points for the fingerprint classification and fingerprint matching. In this paper, we propose a novel algorithm for detecting the singular points. The method is based on vector orthogonal theory and the fact that the singular points have special pattern of the orientation field. We use the same mask to detect the core points and delta points in different field. After applying the special mask, the core points and delta points will be detected in the orientation field and double orientation field respectively. To substantiate the performance of our approach, we have experimented with fvc2002 and fvc2004 database. Experimental results show that our algorithm is accurate and robust, giving better results than competing approaches.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"33 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":"127347672","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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045145
Xuesong Dai, Yuan Ma
The intent waned value is a connection between concepts. In this article a kind of incremental algorithm of concept lattice formation calculated by waned value altogether with extent and intent is provided. As in this algorithm the intend waned value is contained in intermediate result so it is easy and rapid to determine if the concept is a “top element” and the speed of “top element” checking will be very quick. Therefore the speed of concept lattice formation is improved obviously.
{"title":"An incremental algorithm for formation a concept lattice based on the intent waned value","authors":"Xuesong Dai, Yuan Ma","doi":"10.1109/CCIS.2011.6045145","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045145","url":null,"abstract":"The intent waned value is a connection between concepts. In this article a kind of incremental algorithm of concept lattice formation calculated by waned value altogether with extent and intent is provided. As in this algorithm the intend waned value is contained in intermediate result so it is easy and rapid to determine if the concept is a “top element” and the speed of “top element” checking will be very quick. Therefore the speed of concept lattice formation is improved obviously.","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":"127561048","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}
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.
{"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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045143
Fang Zhu, Zongtian Liu, Juanli Yang, Ping Zhu
This paper provides a new method combining Maximum Entropy with rules for identify event place phrase. Firstly, all phrases which not include event trigger are extracted from event mention, and a rule base about event place phrases analyzes and filters these phrases for obtaining the phrase candidate set. Secondly, we explore some rich text features from three kinds of linguistics features that contain phrase, event trigger and context information. Thirdly, in order to establish a train set, we use some feature words representing these text features to build feature vector space. Then, a machine learning model to identify event place phrase is trained by using L-BFGS functions algorithm. At last, this predictive model is used to classify the test set. The result shows that the method is efficient. In open test, the recall, precision and F-measure reach 0.6296296, 0.8095238 and 0.7083333 respectively.
{"title":"Chinese event place phrase recognition of emergency event using Maximum Entropy","authors":"Fang Zhu, Zongtian Liu, Juanli Yang, Ping Zhu","doi":"10.1109/CCIS.2011.6045143","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045143","url":null,"abstract":"This paper provides a new method combining Maximum Entropy with rules for identify event place phrase. Firstly, all phrases which not include event trigger are extracted from event mention, and a rule base about event place phrases analyzes and filters these phrases for obtaining the phrase candidate set. Secondly, we explore some rich text features from three kinds of linguistics features that contain phrase, event trigger and context information. Thirdly, in order to establish a train set, we use some feature words representing these text features to build feature vector space. Then, a machine learning model to identify event place phrase is trained by using L-BFGS functions algorithm. At last, this predictive model is used to classify the test set. The result shows that the method is efficient. In open test, the recall, precision and F-measure reach 0.6296296, 0.8095238 and 0.7083333 respectively.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"30 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121092664","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}
Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045022
Wenfeng Li, Xiaojie Wang, Rile Hu, Jilei Tian
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：