Pub Date : 2012-10-04DOI: 10.1109/URKE.2012.6319551
S. Zarmehi, I. Elyasi, Z. Kowsar
Small RFID tag is a wireless device for identifying individuals and item. RFID tags are frequently used to track goods, personal properties and sometimes humans. The following research presents the latest technical studies on security and privacy in RFID. To achieve this, privacy and authentication are defined firstly, and then, various strategies are presented for each part to provide security.
{"title":"A study on security and privacy in RFID","authors":"S. Zarmehi, I. Elyasi, Z. Kowsar","doi":"10.1109/URKE.2012.6319551","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319551","url":null,"abstract":"Small RFID tag is a wireless device for identifying individuals and item. RFID tags are frequently used to track goods, personal properties and sometimes humans. The following research presents the latest technical studies on security and privacy in RFID. To achieve this, privacy and authentication are defined firstly, and then, various strategies are presented for each part to provide security.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125437780","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319553
Li Qing-shan, Zou Yan-xin, Sun Ying-cheng
Ontology as a concept and model description way, is widely used in various fields, and achieved good effect. Ontology based on intelligent Agent how to realize its definition of the concept in Meta search engine, help system realize the personalized, still need further research. This paper put forward a meta search engine personalized mechanism based on ontology with the use of the Agent technology, this mechanism through mining user behavior of characteristics with Agent for information retrieval, combining ontology technology set up and update the user general view, can well reflect user current interest and to the user's interest to the renewal of the dynamic. Based on ontology users can also according to the user's query scene reasoning and used in filter search results, can make the search results to meet user needs, has the personalized. Finally, in the intelligent Meta search engine prototype platform of the related experimental study, results verified the feasibility of personalized mechanism, and reached a certain degree of intelligent effect.
{"title":"Ontology based user personalization mechanism in meta search engine","authors":"Li Qing-shan, Zou Yan-xin, Sun Ying-cheng","doi":"10.1109/URKE.2012.6319553","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319553","url":null,"abstract":"Ontology as a concept and model description way, is widely used in various fields, and achieved good effect. Ontology based on intelligent Agent how to realize its definition of the concept in Meta search engine, help system realize the personalized, still need further research. This paper put forward a meta search engine personalized mechanism based on ontology with the use of the Agent technology, this mechanism through mining user behavior of characteristics with Agent for information retrieval, combining ontology technology set up and update the user general view, can well reflect user current interest and to the user's interest to the renewal of the dynamic. Based on ontology users can also according to the user's query scene reasoning and used in filter search results, can make the search results to meet user needs, has the personalized. Finally, in the intelligent Meta search engine prototype platform of the related experimental study, results verified the feasibility of personalized mechanism, and reached a certain degree of intelligent effect.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131281884","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}
A method of information entropy optimized time delays is proposed for the chaotic time series reconstruction. First, it establishes an information entropy optimum model in phase space for high-dimensional time delays by using conditional entropy. Then solved these parameters using genetic algorithm(GA). This method constructs an optimum phase space, which maintains independence of reconstruction coordinate and retains the dynamic characteristics of the original system. In the numerical simulations, results of the Lorenz system show that it could improve the performance of chaotic time series prediction.
{"title":"High-dimensional time delays selection for phase space reconstruction with information theory","authors":"Chuntao Zhang, Jialiang Xu, Xiaofeng Chen, Jiao Guo","doi":"10.1109/URKE.2012.6319545","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319545","url":null,"abstract":"A method of information entropy optimized time delays is proposed for the chaotic time series reconstruction. First, it establishes an information entropy optimum model in phase space for high-dimensional time delays by using conditional entropy. Then solved these parameters using genetic algorithm(GA). This method constructs an optimum phase space, which maintains independence of reconstruction coordinate and retains the dynamic characteristics of the original system. In the numerical simulations, results of the Lorenz system show that it could improve the performance of chaotic time series prediction.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133835200","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319537
Yuge Zheng, Hongjuan Tian
The research of Boolean index sets of graphs is one of the important graph theory in the graph theory . Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to Z2. It's theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The edge-balance index set is an important issue in Boolean index set. In this paper, we defined edge-friendly labeling of the graph, edge-balance index set of the graph and the graph Cnm × Pmn (n=4,m≥2). We completely determine the edge-balance index sets of the graph Cnm × Pmn(m ≡ 0(mod 3)) and solve formula proof and graphic tectonic methods.
{"title":"On the edge-balance index sets of a classes of nested network graph","authors":"Yuge Zheng, Hongjuan Tian","doi":"10.1109/URKE.2012.6319537","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319537","url":null,"abstract":"The research of Boolean index sets of graphs is one of the important graph theory in the graph theory . Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to Z2. It's theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The edge-balance index set is an important issue in Boolean index set. In this paper, we defined edge-friendly labeling of the graph, edge-balance index set of the graph and the graph Cnm × Pmn (n=4,m≥2). We completely determine the edge-balance index sets of the graph Cnm × Pmn(m ≡ 0(mod 3)) and solve formula proof and graphic tectonic methods.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125923307","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319524
W. Muliady, H. Widiputra
Slang is one of the problems encountered in developing Lexical Database. There is no complete source officially for slangs in any language. This research attempts to create a list of Indonesian slangs using the proposed framework and methodology. The contents for slangs are generated by Twitter; therefore it can encounter the newest slangs available in the society.
{"title":"Generating Indonesian slang lexicons from twitter","authors":"W. Muliady, H. Widiputra","doi":"10.1109/URKE.2012.6319524","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319524","url":null,"abstract":"Slang is one of the problems encountered in developing Lexical Database. There is no complete source officially for slangs in any language. This research attempts to create a list of Indonesian slangs using the proposed framework and methodology. The contents for slangs are generated by Twitter; therefore it can encounter the newest slangs available in the society.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415082","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319543
Dan Tang, Jian Huang
Most of secret image sharing schemes are follow the idea of classic Shamir scheme, namely the (k,n) threshold scheme based on one-variable polynomial. Which schemes succeed much advantages of the Shamir scheme, such as implentment easily, both have features of Perfect and Ideal and so on. But those schemes regard images as data stream, and not adequately consider the matrix characteristics of the digital image. In view of this situation, this paper proposed a new secret image sharing scheme based on bivariate polynomial, besides has most advantages of Shamir scheme, access structure in the new scheme has been greatly enriched. And the most important, the new scheme is much more suitable for image processing.
{"title":"Secret image sharing scheme based on bivariate polynomial","authors":"Dan Tang, Jian Huang","doi":"10.1109/URKE.2012.6319543","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319543","url":null,"abstract":"Most of secret image sharing schemes are follow the idea of classic Shamir scheme, namely the (k,n) threshold scheme based on one-variable polynomial. Which schemes succeed much advantages of the Shamir scheme, such as implentment easily, both have features of Perfect and Ideal and so on. But those schemes regard images as data stream, and not adequately consider the matrix characteristics of the digital image. In view of this situation, this paper proposed a new secret image sharing scheme based on bivariate polynomial, besides has most advantages of Shamir scheme, access structure in the new scheme has been greatly enriched. And the most important, the new scheme is much more suitable for image processing.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115136900","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319589
A. C. Leuveano, Fairul Azni Bin Jafar, Mohd Razali Bin Muhamad
One of the well-known inventory control techniques utilized in the supply chain is integrated inventory model. Recently, previous research [Z.X Chen and B.R Sarker, Multi-vendor integrated procurement-production system under shared transportation and just-in-time delivery system, Journal of the Operational Society 61 (2010) 1654-1666] have developed an integrated model to synchronize the production flow from multi-vendor to manufacturer through shared transportation. However, the model is complex to find the optimal solution. Because of these complexities, simplifications of the model are often based on limiting assumptions. Since the model is a non-linear integer programming type, this paper addresses genetic algorithm to overcome the limitations to find batch production lot size of vendors and manufacturer, delivery quantities and number of deliveries from different vendors to the manufacturer in order to minimize total cost of all parties involved in the supply chain. Furthermore, a numerical example is presented to illustrate the results.
{"title":"Development of genetic algorithm on multi-vendor integrated procurement-production system under shared transportation and just-in-time delivery system","authors":"A. C. Leuveano, Fairul Azni Bin Jafar, Mohd Razali Bin Muhamad","doi":"10.1109/URKE.2012.6319589","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319589","url":null,"abstract":"One of the well-known inventory control techniques utilized in the supply chain is integrated inventory model. Recently, previous research [Z.X Chen and B.R Sarker, Multi-vendor integrated procurement-production system under shared transportation and just-in-time delivery system, Journal of the Operational Society 61 (2010) 1654-1666] have developed an integrated model to synchronize the production flow from multi-vendor to manufacturer through shared transportation. However, the model is complex to find the optimal solution. Because of these complexities, simplifications of the model are often based on limiting assumptions. Since the model is a non-linear integer programming type, this paper addresses genetic algorithm to overcome the limitations to find batch production lot size of vendors and manufacturer, delivery quantities and number of deliveries from different vendors to the manufacturer in order to minimize total cost of all parties involved in the supply chain. Furthermore, a numerical example is presented to illustrate the results.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114397019","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319555
Shan Gao, Hongmei Li
There are some problems still exist in traditional individual Breast Cancer Diagnosis. To solve the problems, an individual credit assessment model based on support vector classification method is proposed. Using SPSS Clementine data mining tool, the personal credit data is clustering analysis by Support Vector Machine. It is analyzed in detail with the different kernel functions and parameters of Support vector machine. Support vector machine could be used to improve the work of medical practitioners in the diagnosis of breast cancer.
{"title":"Breast cancer diagnosis based on support vector machine","authors":"Shan Gao, Hongmei Li","doi":"10.1109/URKE.2012.6319555","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319555","url":null,"abstract":"There are some problems still exist in traditional individual Breast Cancer Diagnosis. To solve the problems, an individual credit assessment model based on support vector classification method is proposed. Using SPSS Clementine data mining tool, the personal credit data is clustering analysis by Support Vector Machine. It is analyzed in detail with the different kernel functions and parameters of Support vector machine. Support vector machine could be used to improve the work of medical practitioners in the diagnosis of breast cancer.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527295","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319592
Wang Shou-qiang
This paper presented an improved (1+ε)-randomized approximation algorithm proposed by Ostrovsky. The running time of the improved algorithm is O(2(O(kα2/ε))nd), where d,n denote the dimension and the number of the input points respectively, and α(<;1) represents the separated coefficient. The successful probability is (1/2(1-e(1/2ε)))k(1-O(√α)). Compared to the original algorithm, the improved algorithm runs more efficiency.
{"title":"An improved PTAS approximation algorithm for k-means clustering problem","authors":"Wang Shou-qiang","doi":"10.1109/URKE.2012.6319592","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319592","url":null,"abstract":"This paper presented an improved (1+ε)-randomized approximation algorithm proposed by Ostrovsky. The running time of the improved algorithm is O(2(O(kα<sup>2</sup>/ε))nd), where d,n denote the dimension and the number of the input points respectively, and α(<;1) represents the separated coefficient. The successful probability is (1/2(1-e<sup>(1/2ε)</sup>))k(1-O(√α)). Compared to the original algorithm, the improved algorithm runs more efficiency.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"39 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133686063","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 : 2012-10-04DOI: 10.1109/URKE.2012.6319575
Li Yuan
One of the main challenges in face recognition is represented by pose and illumination variations that drastically affect the recognition performance. This paper presents a new approach for face recognition based on Regularized-Labeled Linear Discriminant Analysis (RL-LDA) learning from 3D models. In the training stage, 3D face information is exploited to generate a large number of 2D virtual images with varying pose and illumination, and these images are grouped into different labeled subsets in a supervised manner. Labeled Linear Discriminant Analysis (L-LDA) is operated on each subsets subsequently. On this basis, eigenspectrum analysis is implemented to regularize the extracted L-LDA features. Recognition is accomplished by calculating RL-LDA features, and achieved a recognition rate of 98.4% on WHU-3D-2D database.
{"title":"2D face recognition based on RL-LDA learning from 3D model","authors":"Li Yuan","doi":"10.1109/URKE.2012.6319575","DOIUrl":"https://doi.org/10.1109/URKE.2012.6319575","url":null,"abstract":"One of the main challenges in face recognition is represented by pose and illumination variations that drastically affect the recognition performance. This paper presents a new approach for face recognition based on Regularized-Labeled Linear Discriminant Analysis (RL-LDA) learning from 3D models. In the training stage, 3D face information is exploited to generate a large number of 2D virtual images with varying pose and illumination, and these images are grouped into different labeled subsets in a supervised manner. Labeled Linear Discriminant Analysis (L-LDA) is operated on each subsets subsequently. On this basis, eigenspectrum analysis is implemented to regularize the extracted L-LDA features. Recognition is accomplished by calculating RL-LDA features, and achieved a recognition rate of 98.4% on WHU-3D-2D database.","PeriodicalId":277189,"journal":{"name":"2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132682566","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
扫码关注我们
求助内容：
应助结果提醒方式：