The conjugacy search problem in a group G is the problem of recovering an x $in$ G from given g $in$ G and h =x-11gx. The alleged computational hardness of this problem in some groups was used in several recently suggested public key exchange protocols and the digital signature scheme, including the one due to Anshel, Anshel, and Goldfeld, and the one due to Ko, Lee et al. In this paper, using Miller group G as the platform, we propose a generalization of the digital signature algorithms DSA whose security is based on the hardness of the conjugacy search problem. An important difference between DSA and our signature scheme is that our scheme may not change k for each signature.
{"title":"A Generalization of DSA Based on the Conjugacy Search Problem","authors":"Guangguo Han, Chuan-gui Ma, Qingfeng Cheng","doi":"10.1109/ETCS.2010.48","DOIUrl":"https://doi.org/10.1109/ETCS.2010.48","url":null,"abstract":"The conjugacy search problem in a group G is the problem of recovering an x $in$ G from given g $in$ G and h =x-11gx. The alleged computational hardness of this problem in some groups was used in several recently suggested public key exchange protocols and the digital signature scheme, including the one due to Anshel, Anshel, and Goldfeld, and the one due to Ko, Lee et al. In this paper, using Miller group G as the platform, we propose a generalization of the digital signature algorithms DSA whose security is based on the hardness of the conjugacy search problem. An important difference between DSA and our signature scheme is that our scheme may not change k for each signature.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128078516","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}
Face recognition under variable illumination conditions is an unsolved problem. In this paper, we propose a novel face recognition method based on steerable filters and local binary pattern. First, the normalized face image is convoluted by a multiple orientation steerable filters to extract their corresponding steerable magnitude maps (SMM). Then, the features of face image is extracted by linked all the LBP features which are computed on each item in the SMM separately. Finally, SVM (Support Vector Machine) is used for classification. Experiments show that our method is some invariant face position, pose, illumination and expression variations. Recognition results on ORL and YALE face database show the effectiveness of the proposed approach.
{"title":"Face Recognition Based on SFLBP","authors":"Zhisheng Gao, Hongzhao Yuan","doi":"10.1109/ETCS.2010.420","DOIUrl":"https://doi.org/10.1109/ETCS.2010.420","url":null,"abstract":"Face recognition under variable illumination conditions is an unsolved problem. In this paper, we propose a novel face recognition method based on steerable filters and local binary pattern. First, the normalized face image is convoluted by a multiple orientation steerable filters to extract their corresponding steerable magnitude maps (SMM). Then, the features of face image is extracted by linked all the LBP features which are computed on each item in the SMM separately. Finally, SVM (Support Vector Machine) is used for classification. Experiments show that our method is some invariant face position, pose, illumination and expression variations. Recognition results on ORL and YALE face database show the effectiveness of the proposed approach.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125482513","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 the process of software development, the frequent modification makes the software testing much more difficult, the source code management and control is an important complement to the white-box testing process. We propose modificatory identification algorithm for source code oriented which applies the combination of LCS algorithm and Divide and Conquer thinking. The experiment's result shows that the result of its implementation is not only accurate but also efficient, efficiency of the algorithm is more significant especially when the amount of code is larger.
{"title":"Modificatory Indentification Algorithm Research for Source Code Oriented","authors":"Yu Jiang, Yongmin Mu, Zhihua Zhang","doi":"10.1109/ETCS.2010.359","DOIUrl":"https://doi.org/10.1109/ETCS.2010.359","url":null,"abstract":"In the process of software development, the frequent modification makes the software testing much more difficult, the source code management and control is an important complement to the white-box testing process. We propose modificatory identification algorithm for source code oriented which applies the combination of LCS algorithm and Divide and Conquer thinking. The experiment's result shows that the result of its implementation is not only accurate but also efficient, efficiency of the algorithm is more significant especially when the amount of code is larger.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125641576","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 gene analysis, finding approximate tandem repeats in DNA sequence is an important issue. MSATR is one of the latest methods for finding those repetitions, which suffers deficiencies of runtime cost and poor result quality. This paper proposes an optimized algorithm mMSATR for detecting approximate tandem repeats in genomic sequences more efficiently. By introducing the definition of CASM to reduce the searching scope and optimizing the original mechanism adopted by MSATR, mMSATR makes the detecting process more efficient and improves the result quality. The theoretical analysis and experiment results indicates that mMSATR is able to get more results within less runtime. Algorithm mMSATR is superior to other methods in finding results, and it greatly reduces the runtime cost, which is of benefit when the gene data becomes larger.
{"title":"An Optimized Algorithm for Finding Approximate Tandem Repeats in DNA Sequences","authors":"Sheng Li, Q. Jiang, Dan Wei","doi":"10.1109/ETCS.2010.602","DOIUrl":"https://doi.org/10.1109/ETCS.2010.602","url":null,"abstract":"In gene analysis, finding approximate tandem repeats in DNA sequence is an important issue. MSATR is one of the latest methods for finding those repetitions, which suffers deficiencies of runtime cost and poor result quality. This paper proposes an optimized algorithm mMSATR for detecting approximate tandem repeats in genomic sequences more efficiently. By introducing the definition of CASM to reduce the searching scope and optimizing the original mechanism adopted by MSATR, mMSATR makes the detecting process more efficient and improves the result quality. The theoretical analysis and experiment results indicates that mMSATR is able to get more results within less runtime. Algorithm mMSATR is superior to other methods in finding results, and it greatly reduces the runtime cost, which is of benefit when the gene data becomes larger.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115955085","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}
Cloud computing has attracted more and more attentions due to its ability to deliver computing utilities as Internet services. Many industrial companies have successfully applied their Clouds with different technologies and architectures. But the existing Clouds are all computer-based and designed for Web browser. In this paper we propose a Cloud architecture which is based on digital appliances in smart home to provide IT Services that can be accessed and used by appliances users. As the vinculum that links Cloud and smart home, home gateway, which helps smart home merge into Cloud to provide more information services and access services provided by Cloud, plays a significant role in this architecture. Thus this Cloud architecture extends Cloud computing applications to a new domain so that more users could benefit from Clouds. The architecture that we propose in this paper is a conceptual model and more work need to be done to implement it.
{"title":"A Cloud Architecture Based on Smart Home","authors":"Yongquan Yang, Zhiqiang Wei, Dongning Jia, Yanping Cong, Ruobing Shan","doi":"10.1109/ETCS.2010.293","DOIUrl":"https://doi.org/10.1109/ETCS.2010.293","url":null,"abstract":"Cloud computing has attracted more and more attentions due to its ability to deliver computing utilities as Internet services. Many industrial companies have successfully applied their Clouds with different technologies and architectures. But the existing Clouds are all computer-based and designed for Web browser. In this paper we propose a Cloud architecture which is based on digital appliances in smart home to provide IT Services that can be accessed and used by appliances users. As the vinculum that links Cloud and smart home, home gateway, which helps smart home merge into Cloud to provide more information services and access services provided by Cloud, plays a significant role in this architecture. Thus this Cloud architecture extends Cloud computing applications to a new domain so that more users could benefit from Clouds. The architecture that we propose in this paper is a conceptual model and more work need to be done to implement it.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130241000","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 novel adaptive Turbo equalization algorithm based on the serious inter-symbol interference (ISI) in wireless channel is proposed. The channel characteristics are estimated through combining iterative recursive least square (RLS) with least mean square(LMS) and channel's changes are traced; and the soft interference cancellation (SIC) algorithm for Turbo equalization and the iterative calculations between equalizer and decoder are employed. Simulation results show that adaptive Turbo equalization achieves nearly 1.5 dB gain at 10-4 of BER compared with the conventional RLS, and reduces the complexity of calculation.
{"title":"Notice of RetractionAdaptive Turbo Equalization Algorithm Based on the Estimation of Channel Characteristics","authors":"Shuxia Guo, Guodong Huang, Bing Liu","doi":"10.1109/ETCS.2010.585","DOIUrl":"https://doi.org/10.1109/ETCS.2010.585","url":null,"abstract":"A novel adaptive Turbo equalization algorithm based on the serious inter-symbol interference (ISI) in wireless channel is proposed. The channel characteristics are estimated through combining iterative recursive least square (RLS) with least mean square(LMS) and channel's changes are traced; and the soft interference cancellation (SIC) algorithm for Turbo equalization and the iterative calculations between equalizer and decoder are employed. Simulation results show that adaptive Turbo equalization achieves nearly 1.5 dB gain at 10-4 of BER compared with the conventional RLS, and reduces the complexity of calculation.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134137432","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}
Liqin Zhang, Jiangfeng Li, Liping Qu, Jianghong Zhu, C. Kong, Zhongda Chen, Yida Luo
Construction land location advantages and agricultural land suitability evaluation are the most important basis for land use decision in urban region. This article focuses studying on Hangzhou case, an urban region with very rapid construction expansion. In this study, GIS is using for spatial analysis and mapping, while K-Means Clustering (KMC) and BPNN for attribute data process. Factors including economic agglomeration, prosperous degree, transportation accessibility, and ecological dominance, have been considered for construction land location advantages evaluation with KMC. Factors including topography features, soil quality, agricultural infrastructure, and geological environment, have been evaluated with BPNN. The evaluation result shows that lowest opportunity cost of agricultural and ecological resources is the principal rule for land decision in urban region. The suitable urban expansion space distributes across with high-quality agricultural land, which is beneficial to regional ecological balance. The comparison between construction land location advantages and agricultural land suitability is valuable for land use decision in urban region. Integration of KMC, BPNN, and MapGIS has valuable advantages for land decision system.
{"title":"GIS Based Land Use Decision in Urban Region Case from Hangzhou, China","authors":"Liqin Zhang, Jiangfeng Li, Liping Qu, Jianghong Zhu, C. Kong, Zhongda Chen, Yida Luo","doi":"10.1109/ETCS.2010.539","DOIUrl":"https://doi.org/10.1109/ETCS.2010.539","url":null,"abstract":"Construction land location advantages and agricultural land suitability evaluation are the most important basis for land use decision in urban region. This article focuses studying on Hangzhou case, an urban region with very rapid construction expansion. In this study, GIS is using for spatial analysis and mapping, while K-Means Clustering (KMC) and BPNN for attribute data process. Factors including economic agglomeration, prosperous degree, transportation accessibility, and ecological dominance, have been considered for construction land location advantages evaluation with KMC. Factors including topography features, soil quality, agricultural infrastructure, and geological environment, have been evaluated with BPNN. The evaluation result shows that lowest opportunity cost of agricultural and ecological resources is the principal rule for land decision in urban region. The suitable urban expansion space distributes across with high-quality agricultural land, which is beneficial to regional ecological balance. The comparison between construction land location advantages and agricultural land suitability is valuable for land use decision in urban region. Integration of KMC, BPNN, and MapGIS has valuable advantages for land decision system.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133943856","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}
Computer network course is a fundamental course for the computer major college student which explains the architecture of network based on TCP/IP. But because the course is abstract in some degree, it’s hard for students to understand. We propose a learning method that utilizes the auxiliary software to simulate the network topology and configure the network protocols for the students to understand and analyze the learned network knowledge in time. After practicing for several years, we find this method is very helpful for student to study computer network course.
{"title":"Learning Computer Network with Auxiliary Software","authors":"Chunmiao Yuan","doi":"10.1109/ETCS.2010.368","DOIUrl":"https://doi.org/10.1109/ETCS.2010.368","url":null,"abstract":"Computer network course is a fundamental course for the computer major college student which explains the architecture of network based on TCP/IP. But because the course is abstract in some degree, it’s hard for students to understand. We propose a learning method that utilizes the auxiliary software to simulate the network topology and configure the network protocols for the students to understand and analyze the learned network knowledge in time. After practicing for several years, we find this method is very helpful for student to study computer network course.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486524","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 of great significance both in theory and practice to build a scientific evaluation system to effectively evaluate the educational technique ability training performance of university teachers. This paper builds a performance evaluation indicator system for educational technique ability training of university teachers from three dimensions of training preparation, training process and training outcomes. Based on the theory of fuzzy mathematics, a multi-level fuzzy comprehensive evaluation model for assessing the educational technique ability training performance of university teachers is built, and a case study is done for verification. The result shows that the built evaluation system is effective, applicable and operable.
{"title":"Notice of RetractionMulti-level Fuzzy Comprehensive Evaluation of Educational Technique Ability Training Performance of University Teachers","authors":"Xin’gang Weng","doi":"10.1109/ETCS.2010.297","DOIUrl":"https://doi.org/10.1109/ETCS.2010.297","url":null,"abstract":"It is of great significance both in theory and practice to build a scientific evaluation system to effectively evaluate the educational technique ability training performance of university teachers. This paper builds a performance evaluation indicator system for educational technique ability training of university teachers from three dimensions of training preparation, training process and training outcomes. Based on the theory of fuzzy mathematics, a multi-level fuzzy comprehensive evaluation model for assessing the educational technique ability training performance of university teachers is built, and a case study is done for verification. The result shows that the built evaluation system is effective, applicable and operable.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131502645","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}
Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today’s Internet traffic. But as the P2P systems has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay, which often leads to traffic management challenges for Internet Service Providers (ISPs) and poor QoS for users. To overcome these problems, we design a scheme, which clusters the P2P peers based on the topology information of the physical network they belong to, and employ caching mechanism then guides the users’ behaviors globally, so the resources can be downloaded rapidly without taking wrong paths. Our event-based simulations show that with our algorithm, the time of downloading files in Bit Torrent (BT) is reduced compared to traditional BT. So that our algorithm can be used to the P2P file sharing systems which pay no attention to underlying network information to improve performance.
{"title":"A Scheme to Solve P2P ALTO Problem","authors":"Suqi Ye, Xinli Huang, Rong Xiao","doi":"10.1109/ETCS.2010.319","DOIUrl":"https://doi.org/10.1109/ETCS.2010.319","url":null,"abstract":"Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today’s Internet traffic. But as the P2P systems has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay, which often leads to traffic management challenges for Internet Service Providers (ISPs) and poor QoS for users. To overcome these problems, we design a scheme, which clusters the P2P peers based on the topology information of the physical network they belong to, and employ caching mechanism then guides the users’ behaviors globally, so the resources can be downloaded rapidly without taking wrong paths. Our event-based simulations show that with our algorithm, the time of downloading files in Bit Torrent (BT) is reduced compared to traditional BT. So that our algorithm can be used to the P2P file sharing systems which pay no attention to underlying network information to improve performance.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131848468","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
扫码关注我们
求助内容：
应助结果提醒方式：