The increasing development of mobile networks raises new security requirements and concerns. In addition to the basic need of authentication, confidentiality and key distribution services, a new problem involving privacy is the unauthorized tracking of users' migration. We present here a mobile commerce identity authentication protocol. Our scheme based on conic curves . This scheme is composed of three part which need to use threshold signature and proxy signature. Because the security of license is determined by private key, not the arithmetic itself, user can not construct new license by given license and the public key as long as the private key is not leaked. Since encoding and decoding over conic are easily implement on conic curves, it has enabled our scheme to greatly enhance efficiency. We also analysis its security. The entire process guarantees the security and reliability.
{"title":"Mobile Commerce Identity Authentication Protocol Based on Conic Curves","authors":"Zhigang Chen, Xinxia Song","doi":"10.1109/WISM.2010.141","DOIUrl":"https://doi.org/10.1109/WISM.2010.141","url":null,"abstract":"The increasing development of mobile networks raises new security requirements and concerns. In addition to the basic need of authentication, confidentiality and key distribution services, a new problem involving privacy is the unauthorized tracking of users' migration. We present here a mobile commerce identity authentication protocol. Our scheme based on conic curves . This scheme is composed of three part which need to use threshold signature and proxy signature. Because the security of license is determined by private key, not the arithmetic itself, user can not construct new license by given license and the public key as long as the private key is not leaked. Since encoding and decoding over conic are easily implement on conic curves, it has enabled our scheme to greatly enhance efficiency. We also analysis its security. The entire process guarantees the security and reliability.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131342521","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 web-based management system for urban road lighting is developed for the purpose of energy-saving. Following the trends of energy-saving and emission reduction, energy-saving lamps are widely used as measures taken by related organizations, including previous loop control systems and current single-lamp control systems. Our system consists of a platform of remote monitoring and management of street lamps, a database management module, a road controller (Smart Server), and a GPRS wireless communication module. Extensive tests show good performance of our system for energy-saving.
{"title":"A Web-Based Management System for Urban Road Lighting","authors":"Yun-gui Zhang, Lina Zhao, Li-na Wang, Sheng-yong Zhang","doi":"10.1109/WISM.2010.68","DOIUrl":"https://doi.org/10.1109/WISM.2010.68","url":null,"abstract":"A web-based management system for urban road lighting is developed for the purpose of energy-saving. Following the trends of energy-saving and emission reduction, energy-saving lamps are widely used as measures taken by related organizations, including previous loop control systems and current single-lamp control systems. Our system consists of a platform of remote monitoring and management of street lamps, a database management module, a road controller (Smart Server), and a GPRS wireless communication module. Extensive tests show good performance of our system for energy-saving.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131326282","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}
In this paper, a kind of second order diagonal recurrent neural network (SDRNN) identification method based on dynamic back propagation(DBP) algorithm with momentum term is proposed. This identification method overcomes the disadvantages such as slow convergent speed and trapping the local minimum. The SDRNN is similar as diagonal recurrent neural network(DRNN) in the structure, two tapped delays are used in the hidden neurons of DRNN, the simple structure of the DRNN is retained, the identification of a nonlinear system is realized with SDRNN. Serial-parallel identification architecture is applied in the modeling. Simulation results show that improved algorithm is effective with advantages the fast convergence, higher identification accuracy, higher adaptability and robustness in system identification. It is suitable for real-time identification of dynamic system.
{"title":"Application of Second Order Diagonal Recurrent Neural Network in Nonlinear System Identification","authors":"Yan Shen, Xianlong Ju, C. Liu","doi":"10.1109/WISM.2010.10","DOIUrl":"https://doi.org/10.1109/WISM.2010.10","url":null,"abstract":"In this paper, a kind of second order diagonal recurrent neural network (SDRNN) identification method based on dynamic back propagation(DBP) algorithm with momentum term is proposed. This identification method overcomes the disadvantages such as slow convergent speed and trapping the local minimum. The SDRNN is similar as diagonal recurrent neural network(DRNN) in the structure, two tapped delays are used in the hidden neurons of DRNN, the simple structure of the DRNN is retained, the identification of a nonlinear system is realized with SDRNN. Serial-parallel identification architecture is applied in the modeling. Simulation results show that improved algorithm is effective with advantages the fast convergence, higher identification accuracy, higher adaptability and robustness in system identification. It is suitable for real-time identification of dynamic system.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114713814","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}
Due to the existing failure and cancellation of business logic of Web services composition, service compensation is one of the most important issues in the research of Service-Oriented Computing (SOC). a paired-net based composition compensation mechanism is proposed to automatically implement partial or full compensation of the committed activities, where CSCP-Nets can be accurately constructed and agile compensation-triggered approach can be implemented. To ensure the weaker notion of atomicity through performing compensation, the execution semantics of this mechanism’s compensation pattern are analyzed based on paired net, where these details are given to execution semantics analysis of the four typical composition compensation patterns (sequence, parallel, selection and iteration) with the help of a relevant formal approach.
{"title":"A Flexible Failure Mechanisms for Reliable Web Services Transaction","authors":"X. Mei, Yiyan Fan","doi":"10.1109/WISM.2010.84","DOIUrl":"https://doi.org/10.1109/WISM.2010.84","url":null,"abstract":"Due to the existing failure and cancellation of business logic of Web services composition, service compensation is one of the most important issues in the research of Service-Oriented Computing (SOC). a paired-net based composition compensation mechanism is proposed to automatically implement partial or full compensation of the committed activities, where CSCP-Nets can be accurately constructed and agile compensation-triggered approach can be implemented. To ensure the weaker notion of atomicity through performing compensation, the execution semantics of this mechanism’s compensation pattern are analyzed based on paired net, where these details are given to execution semantics analysis of the four typical composition compensation patterns (sequence, parallel, selection and iteration) with the help of a relevant formal approach.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1056 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131961401","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}
As an effective method of machine learning, Support vector machine has been widely used in prediction. Proposition the supply of risk control and prevention, based on establishment evaluation index system and questionnaire to enterprise, this paper construct the supply risk prediction model and then discuss the fitting degree of model, expect to provide the basis for supply risk management.
{"title":"Research on the Prediction Model of Supply Risk Based on SVM","authors":"Da-peng Meng, Chun-sheng Shi","doi":"10.1109/WISM.2010.34","DOIUrl":"https://doi.org/10.1109/WISM.2010.34","url":null,"abstract":"As an effective method of machine learning, Support vector machine has been widely used in prediction. Proposition the supply of risk control and prevention, based on establishment evaluation index system and questionnaire to enterprise, this paper construct the supply risk prediction model and then discuss the fitting degree of model, expect to provide the basis for supply risk management.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133731511","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}
Today most news pages are generated from some underlying structured source, so we think that template-dependent wrappers should be more suitable for them than template-independent wrappers. In this paper, we propose a novel automatic template-dependent Web news content extraction approach based on similar pages. Firstly, We choose two similar pages as training samples and represent them as two HTML DOM trees. Secondly, we create the maximum matching tree between the DOM trees using our simple tree matching and backtracking algorithm. Then, by analyzing the characteristics of nodes in the maximum matching tree, we eliminate the noise nodes to generate an extraction template. Finally, we build a template-dependent wrapper for target news pages whose structures are similar to the samples. Experimental results indicate that our approach is effective and efficient for Web news content extraction, and the average harmonic mean of precision and recall reaches 98.3% .
{"title":"Automatic Web News Content Extraction Based on Similar Pages","authors":"Chunyuan Zhang, Z. Lin","doi":"10.1109/WISM.2010.154","DOIUrl":"https://doi.org/10.1109/WISM.2010.154","url":null,"abstract":"Today most news pages are generated from some underlying structured source, so we think that template-dependent wrappers should be more suitable for them than template-independent wrappers. In this paper, we propose a novel automatic template-dependent Web news content extraction approach based on similar pages. Firstly, We choose two similar pages as training samples and represent them as two HTML DOM trees. Secondly, we create the maximum matching tree between the DOM trees using our simple tree matching and backtracking algorithm. Then, by analyzing the characteristics of nodes in the maximum matching tree, we eliminate the noise nodes to generate an extraction template. Finally, we build a template-dependent wrapper for target news pages whose structures are similar to the samples. Experimental results indicate that our approach is effective and efficient for Web news content extraction, and the average harmonic mean of precision and recall reaches 98.3% .","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134110536","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}
WCF (Windows Communication Foundation) developed by Microsoft is a unified programming model for building SOA and it is highly extensible. The extensibility provides the ability to change the product more easily over time and the flexibility to custom WCF for fitting specific requirements of applications. The extensible characteristics are what make WCF a strong distributed application platform. In this paper, after the anatomy of WCF architecture, WCF extensibility is researched, then it is presented of the application of the extensibility in the web-MIS application which takes advantage of the extensibility to integrate DI (Dependency Injection) and AOP(Aspect-Oriented Programming) into WCF in the development for higher software quality. It represents the application of WCF extensibility.
微软开发的WCF (Windows Communication Foundation)是一种用于构建SOA的统一编程模型，具有很高的可扩展性。可扩展性提供了随着时间的推移更容易更改产品的能力，以及定制WCF以适应应用程序特定需求的灵活性。可扩展特性使WCF成为一个强大的分布式应用程序平台。本文在剖析WCF体系结构的基础上，对WCF的可扩展性进行了研究，并提出了可扩展性在web-MIS应用中的应用，利用可扩展性将依赖注入(Dependency Injection, DI)和面向方面编程(AOP, Aspect-Oriented Programming, AOP)集成到WCF中进行开发，以提高软件质量。它代表了WCF可扩展性的应用。
{"title":"Research and Application of WCF Extensibility","authors":"Wei Zhang, Jing Li","doi":"10.1109/WISM.2010.112","DOIUrl":"https://doi.org/10.1109/WISM.2010.112","url":null,"abstract":"WCF (Windows Communication Foundation) developed by Microsoft is a unified programming model for building SOA and it is highly extensible. The extensibility provides the ability to change the product more easily over time and the flexibility to custom WCF for fitting specific requirements of applications. The extensible characteristics are what make WCF a strong distributed application platform. In this paper, after the anatomy of WCF architecture, WCF extensibility is researched, then it is presented of the application of the extensibility in the web-MIS application which takes advantage of the extensibility to integrate DI (Dependency Injection) and AOP(Aspect-Oriented Programming) into WCF in the development for higher software quality. It represents the application of WCF extensibility.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132446143","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}
As a fundamental and critical component of music information retrieval (MIR) systems, automatically classifying music by genre is a challenging problem. The approaches depending on low-level audio features may not be able to obtain satisfactory results. In recent years, the social tags have emerged as an important way to provide information about resources on the Web. In this paper we are interested in another aspect, namely how perform automatic music genre classification solely depending on the available tag data. Two classification methods based on the social tags (including music-tag and artist-tag) which crawled from Last. fm are developed in our work. The first one, we use the generative probabilistic model Latent Dirichlet Allocation (LDA) to analyze the music-tag. Then, we can compute the probability of every tag belonging to each music genre. The starting point of the second method is that music’s artist is often associated with music genres more closely. Therefore, we can calculate the similarity between the artist-tags to infer which genre the music belongs to. At last, our experimental results demonstrate the benefit of using tags for accurate music genre classification.
{"title":"Solely Tag-Based Music Genre Classification","authors":"Chao Zhen, Jieping Xu","doi":"10.1109/WISM.2010.152","DOIUrl":"https://doi.org/10.1109/WISM.2010.152","url":null,"abstract":"As a fundamental and critical component of music information retrieval (MIR) systems, automatically classifying music by genre is a challenging problem. The approaches depending on low-level audio features may not be able to obtain satisfactory results. In recent years, the social tags have emerged as an important way to provide information about resources on the Web. In this paper we are interested in another aspect, namely how perform automatic music genre classification solely depending on the available tag data. Two classification methods based on the social tags (including music-tag and artist-tag) which crawled from Last. fm are developed in our work. The first one, we use the generative probabilistic model Latent Dirichlet Allocation (LDA) to analyze the music-tag. Then, we can compute the probability of every tag belonging to each music genre. The starting point of the second method is that music’s artist is often associated with music genres more closely. Therefore, we can calculate the similarity between the artist-tags to infer which genre the music belongs to. At last, our experimental results demonstrate the benefit of using tags for accurate music genre classification.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351062","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}
The article combines agents screening model with F-S unfairness aversion model to investigate the influence of fairness preference on agents’ competence screening contracts design in knowledge networks. We suggest that principal with fairness preference will cut down information rent to increase his utility. If efficient agents possess fairness preference, principal will increase the output of inefficient agents to raise information rent, but the information rent ultimately increases or decreases depending on the steep of principle′s utility function.
{"title":"The Agents Screening Model Based on Fairness Preference in Knowledge Networks","authors":"Jing Chen, Xin Gu, Shaobo Wu","doi":"10.1109/WISM.2010.132","DOIUrl":"https://doi.org/10.1109/WISM.2010.132","url":null,"abstract":"The article combines agents screening model with F-S unfairness aversion model to investigate the influence of fairness preference on agents’ competence screening contracts design in knowledge networks. We suggest that principal with fairness preference will cut down information rent to increase his utility. If efficient agents possess fairness preference, principal will increase the output of inefficient agents to raise information rent, but the information rent ultimately increases or decreases depending on the steep of principle′s utility function.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125010160","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 young researchers starting in a specific field of work, it is not always easy to make an opinion of a journal which potential for publication apart from the basis of peers’ advices and indicators such as impact factor. In this paper we use web technologies to create a scientometric picture, using bibliometric analysis methods, of the journal NeuroImage from its creation in 1992 until 2009. The aim of this work is show how to provide a good account of the journal’s bibliometrics which will help to quickly identify the journal’s main features. Results indicated that the Neuro Image literature consists of a total of 11604 contributions. The five top 5 major contributors were identified to be Kark J. Friston, Jon Ash burner, Keith J. Worsley, Bruce R. Fischl and Thomas E. Nichols. The top 5 most cited papers achieve very high number of citations (from 1026 to 1888). From authors affiliation, we also found strong international collaboration between US and Europe including UK, Germany, Switzerland, France and Italy, and with Asian countries such as Japan and China, shown using a strength color-coded connection-wheel diagram. This study will help future web sites to provide more bibliometric information about scientific journals, authors and research fields. As these are evolving very rapidly after each publication issue (e.g. citation counts, new contributing authors, etc.), web tools should be developed to provide the most recent bibliometric updates.
{"title":"Scientometric Study of the Journal NeuroImage 1992-2009","authors":"B. Hamadicharef","doi":"10.1109/WISM.2010.166","DOIUrl":"https://doi.org/10.1109/WISM.2010.166","url":null,"abstract":"For young researchers starting in a specific field of work, it is not always easy to make an opinion of a journal which potential for publication apart from the basis of peers’ advices and indicators such as impact factor. In this paper we use web technologies to create a scientometric picture, using bibliometric analysis methods, of the journal NeuroImage from its creation in 1992 until 2009. The aim of this work is show how to provide a good account of the journal’s bibliometrics which will help to quickly identify the journal’s main features. Results indicated that the Neuro Image literature consists of a total of 11604 contributions. The five top 5 major contributors were identified to be Kark J. Friston, Jon Ash burner, Keith J. Worsley, Bruce R. Fischl and Thomas E. Nichols. The top 5 most cited papers achieve very high number of citations (from 1026 to 1888). From authors affiliation, we also found strong international collaboration between US and Europe including UK, Germany, Switzerland, France and Italy, and with Asian countries such as Japan and China, shown using a strength color-coded connection-wheel diagram. This study will help future web sites to provide more bibliometric information about scientific journals, authors and research fields. As these are evolving very rapidly after each publication issue (e.g. citation counts, new contributing authors, etc.), web tools should be developed to provide the most recent bibliometric updates.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125588573","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
扫码关注我们
求助内容：
应助结果提醒方式：