In this paper, we propose an improved password-based authentication key exchange protocol for group, which called nPAKE. In the protocol, each client shares a password with the server and the adjacent clients share a temporary encryption key with the help of server, so it can reduce the communication costs between the clients and server. nPAKE protocol is based on the chosen-based computation Diffie-Hellman assumption. By security analysis, we show that our protocol can resist the dictionary attacks, Tang-Chen attack and man-in-the-middle attack.
{"title":"nPAKE: An Improved Group PAKE Protocol","authors":"Xiumei Liu, Junjiang Liu, G. Chang","doi":"10.1109/WISA.2012.42","DOIUrl":"https://doi.org/10.1109/WISA.2012.42","url":null,"abstract":"In this paper, we propose an improved password-based authentication key exchange protocol for group, which called nPAKE. In the protocol, each client shares a password with the server and the adjacent clients share a temporary encryption key with the help of server, so it can reduce the communication costs between the clients and server. nPAKE protocol is based on the chosen-based computation Diffie-Hellman assumption. By security analysis, we show that our protocol can resist the dictionary attacks, Tang-Chen attack and man-in-the-middle attack.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125272395","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}
Hua Ming, Yong Zhang, Chunxiao Xing, Haiyan Yin, Minglei Wang
We propose a dual hash tables algorithm which can realize the durable top-k search. Two hash tables are constructed to keep the core information, such as score and time in the inverted lists. We use the key-value relationships between the two hash tables to calculate the scores which measure the correlations between a keyword and documents, and search the versioned objects that are consistent in the top-k results throughout a given query interval. Finally, we use data from Wikipedia to demonstrate the efficiency and performance of our algorithm.
{"title":"A Dual Hashtables Algorithm for Durable Top-k Search","authors":"Hua Ming, Yong Zhang, Chunxiao Xing, Haiyan Yin, Minglei Wang","doi":"10.1109/WISA.2012.23","DOIUrl":"https://doi.org/10.1109/WISA.2012.23","url":null,"abstract":"We propose a dual hash tables algorithm which can realize the durable top-k search. Two hash tables are constructed to keep the core information, such as score and time in the inverted lists. We use the key-value relationships between the two hash tables to calculate the scores which measure the correlations between a keyword and documents, and search the versioned objects that are consistent in the top-k results throughout a given query interval. Finally, we use data from Wikipedia to demonstrate the efficiency and performance of our algorithm.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130077290","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}
For most of the face recognition techniques will suffer serious performance drop when there is only one training sample per person, a face recognition method based on principle component analysis and two dimension principle component analysis is proposed. We compared our methods with PCA and 2DPCA. In the experiments, the nearest neighbor classifier is used to recognize different faces from the ORL and Yale face database. Experimental results show that the proposed method improved the recognition performance effectively in comparison with other method.
{"title":"Face Recognition Based on PCA and 2DPCA with Single Image Sample","authors":"Luo Min, Liu Song","doi":"10.1109/WISA.2012.20","DOIUrl":"https://doi.org/10.1109/WISA.2012.20","url":null,"abstract":"For most of the face recognition techniques will suffer serious performance drop when there is only one training sample per person, a face recognition method based on principle component analysis and two dimension principle component analysis is proposed. We compared our methods with PCA and 2DPCA. In the experiments, the nearest neighbor classifier is used to recognize different faces from the ORL and Yale face database. Experimental results show that the proposed method improved the recognition performance effectively in comparison with other method.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131620931","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 model for seamless steel tube order-grouping problem was built and a series of heuristic algorithms have been designed to solve problems in optimization of fixed order-grouping in steel tube production. There are two main parts in this model. First of all, the hot rolling cutting length by the order should be determined. Secondly, the simulation of different orders can be used to search for order-grouping optimization of the sizing problem in the cold rolling to minimize the waste.
{"title":"An Optimized Heuristic Algorithm for Fixed Order-Grouping in Seamless Steel Tube Production","authors":"Zhenliao Lv, Zhiguang Ao, Duan Xu","doi":"10.1109/WISA.2012.54","DOIUrl":"https://doi.org/10.1109/WISA.2012.54","url":null,"abstract":"A model for seamless steel tube order-grouping problem was built and a series of heuristic algorithms have been designed to solve problems in optimization of fixed order-grouping in steel tube production. There are two main parts in this model. First of all, the hot rolling cutting length by the order should be determined. Secondly, the simulation of different orders can be used to search for order-grouping optimization of the sizing problem in the cold rolling to minimize the waste.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133599842","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}
By means of complex network methods, we construct the Operation SoS network based on simulated data generated by games in large-scale joint operations and analyze the basic statistical characteristics and evolution. Through analyzing, there are three findings: the first one is that the Operation SoS network have the basic characteristics of complex networks, the second one is Operation SoS network's structure determines its real effects, the third one is that it helps to find the problems and recognize the trend of flattening existing in command system, and to predict the future of warfare by means of complex network methods.
{"title":"Evolutionary Analysis of Operation System-of-Systems (SoS) Network Based on Simulated Data","authors":"Yang Liu, Xiao-Feng Hu, Lin Wu","doi":"10.1109/WISA.2012.50","DOIUrl":"https://doi.org/10.1109/WISA.2012.50","url":null,"abstract":"By means of complex network methods, we construct the Operation SoS network based on simulated data generated by games in large-scale joint operations and analyze the basic statistical characteristics and evolution. Through analyzing, there are three findings: the first one is that the Operation SoS network have the basic characteristics of complex networks, the second one is Operation SoS network's structure determines its real effects, the third one is that it helps to find the problems and recognize the trend of flattening existing in command system, and to predict the future of warfare by means of complex network methods.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114678511","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}
With the development of keyword search over relational databases, how to improve the result quality is a popular problem. To solve it, existing work mainly are CN-based and graph-based. The CN-based approaches occupy little memory space and have high level of abstract. However, the defect of these approaches is not considering meaningful information in metadata of databases. In this paper, we propose a novel architecture. First, it provides richer semantics for keywords to generate more meaningful candidate networks. Second, it provides query templates to facilitate the query transforms of candidate networks, which contribute to generating more meaningful query results. Third, some properties of ranking are simply summarized. Finally, the experimental results demonstrate that the result quality is improved.
{"title":"Richly Semantical Keyword Searching over Relational Databases","authors":"Jianzhao Zhai, Derong Shen, Yue Kou, Tiezheng Nie","doi":"10.1109/WISA.2012.10","DOIUrl":"https://doi.org/10.1109/WISA.2012.10","url":null,"abstract":"With the development of keyword search over relational databases, how to improve the result quality is a popular problem. To solve it, existing work mainly are CN-based and graph-based. The CN-based approaches occupy little memory space and have high level of abstract. However, the defect of these approaches is not considering meaningful information in metadata of databases. In this paper, we propose a novel architecture. First, it provides richer semantics for keywords to generate more meaningful candidate networks. Second, it provides query templates to facilitate the query transforms of candidate networks, which contribute to generating more meaningful query results. Third, some properties of ranking are simply summarized. Finally, the experimental results demonstrate that the result quality is improved.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116447110","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}
It is very important to know how to save and utilize the content of ontology effectively and efficiently in the practical application of ontology. This article presents one type of agriculture product cultivating standard ontology relation database mode, on the applying background of agricultural product cultivating standardized management system and at the base of analyzing the present ontology storage mode, as well as to realize the coding for the ontology content in the transferring process. The experiment shows, this method provides the convenience for the management and application of agricultural product cultivating standard ontology, and speeds up the response speed of the system.
{"title":"Implementation and Design of Agricultural Product Cultivating Standard Ontology Database Mode","authors":"Daiyi Li, Li Kang","doi":"10.1109/WISA.2012.32","DOIUrl":"https://doi.org/10.1109/WISA.2012.32","url":null,"abstract":"It is very important to know how to save and utilize the content of ontology effectively and efficiently in the practical application of ontology. This article presents one type of agriculture product cultivating standard ontology relation database mode, on the applying background of agricultural product cultivating standardized management system and at the base of analyzing the present ontology storage mode, as well as to realize the coding for the ontology content in the transferring process. The experiment shows, this method provides the convenience for the management and application of agricultural product cultivating standard ontology, and speeds up the response speed of the system.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130662427","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}
Topic detection is an hot research in the area of information retrieval. However, the new environment of Internet, the content of which are usually user-generated, asks for new requirements and brings new challenges. Topic detection has to resolve the problem of its lower quality and large amount of noisy. This paper not only provides a solution for detecting hot topics, but also giving its semantic descriptions as result. Our method integrates two kinds of term features (local features and global features), and use single pass clustering to perform topic detection in a web forum. It's efficient to filter non-topic documents and get readable descriptions of topic in our system. By comparison with baseline and topic model LDA, our method gets better performance and readable result.
{"title":"Topic Detection over Online Forum","authors":"F. Chen, Juan Du, Weining Qian, Aoying Zhou","doi":"10.1109/WISA.2012.15","DOIUrl":"https://doi.org/10.1109/WISA.2012.15","url":null,"abstract":"Topic detection is an hot research in the area of information retrieval. However, the new environment of Internet, the content of which are usually user-generated, asks for new requirements and brings new challenges. Topic detection has to resolve the problem of its lower quality and large amount of noisy. This paper not only provides a solution for detecting hot topics, but also giving its semantic descriptions as result. Our method integrates two kinds of term features (local features and global features), and use single pass clustering to perform topic detection in a web forum. It's efficient to filter non-topic documents and get readable descriptions of topic in our system. By comparison with baseline and topic model LDA, our method gets better performance and readable result.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133793381","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}
With the flourish of the Web, online review is become a more and more useful and important information resource for people. As a result, automatic review mining has become a hot research topic recently. Traditional review mining based on feature extracts product feature and opinion word independently, and seldom considers their association information. In this paper, we only focus on Chinese product review. We propose a method based on Chinese dependency grammar to extract feature-opinion word pairs. Specifically, we use Chinese dependency grammar to set several rules, then we make use of these rules to extract candidate feature-opinion word pairs. Finally, we filter out mismatched feature-opinion words pairs by feature ranking and Named Entity Recognition (NER) system. Experiment shows that our method in Precision is rather high.
{"title":"OpinMiner: Extracting Feature-Opinion Pairs with Dependency Grammar from Chinese Product Reviews","authors":"Fuzeng Jiao, Guoqing Dong, Qiuyan Li, Jie Zhu","doi":"10.1109/WISA.2012.28","DOIUrl":"https://doi.org/10.1109/WISA.2012.28","url":null,"abstract":"With the flourish of the Web, online review is become a more and more useful and important information resource for people. As a result, automatic review mining has become a hot research topic recently. Traditional review mining based on feature extracts product feature and opinion word independently, and seldom considers their association information. In this paper, we only focus on Chinese product review. We propose a method based on Chinese dependency grammar to extract feature-opinion word pairs. Specifically, we use Chinese dependency grammar to set several rules, then we make use of these rules to extract candidate feature-opinion word pairs. Finally, we filter out mismatched feature-opinion words pairs by feature ranking and Named Entity Recognition (NER) system. Experiment shows that our method in Precision is rather high.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115123180","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}
Recommender systems have been widely deployed on E-commerce websites. The cold start problem of making effective recommendations to new users without any historical data on the website is still challenging. These new users often have some available information, such as search keywords, before visiting the website. It is natural to use the information to predict users' preference, such that an immediate recommendation is possible. In this paper, we propose a new product recommendation approach for new users based on the implicit relationships between search keywords and products. The relationships between keywords and products are represented in a graph and relevance of keywords to products is derived from attributes of the graph. The relevance information will be utilized to predict preferences of new users. A preliminary experiment is conducted and shows that our approach outperforms the traditional approach (Recommending Most Popular Products).
{"title":"Product Recommendation Based on Search Keywords","authors":"Jiawei Yao, Jiajun Yao, Rui Yang, Zhenyu Chen","doi":"10.1109/WISA.2012.33","DOIUrl":"https://doi.org/10.1109/WISA.2012.33","url":null,"abstract":"Recommender systems have been widely deployed on E-commerce websites. The cold start problem of making effective recommendations to new users without any historical data on the website is still challenging. These new users often have some available information, such as search keywords, before visiting the website. It is natural to use the information to predict users' preference, such that an immediate recommendation is possible. In this paper, we propose a new product recommendation approach for new users based on the implicit relationships between search keywords and products. The relationships between keywords and products are represented in a graph and relevance of keywords to products is derived from attributes of the graph. The relevance information will be utilized to predict preferences of new users. A preliminary experiment is conducted and shows that our approach outperforms the traditional approach (Recommending Most Popular Products).","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121503119","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
扫码关注我们
求助内容：
应助结果提醒方式：