Efficient computation of Tate pairing is a crucial factor for practical applications of pairing-based cryptosystems. Recently, there have been many improvements for the computation of Tate pairing, which focuses on the arithmetical operations above the finite field. In this paper, we analyze the structure of Miller’s algorithm firstly, which is used to implement Tate pairing. Then, according to the characteristics that Miller’s algorithm will be improved tremendous if the order of the subgroup of elliptic curve group is low hamming prime, we present an effective generation method of elliptic curve using the Fermat number, which enable it feasible that there is certain some subgroup of low hamming prime order in the elliptic curve group generated. Finally, we give an example to generate elliptic curve, which includes the subgroup with low hamming prime order. It is clear that the computation of Tate pairing above elliptic curve group generating by our method can be improved tremendously.
{"title":"An Efficient Generation Method of Elliptic Curve for Pairing-Based Cryptosystems","authors":"Maocai Wang, Guangming Dai, Hanping Hu","doi":"10.1109/MVHI.2010.211","DOIUrl":"https://doi.org/10.1109/MVHI.2010.211","url":null,"abstract":"Efficient computation of Tate pairing is a crucial factor for practical applications of pairing-based cryptosystems. Recently, there have been many improvements for the computation of Tate pairing, which focuses on the arithmetical operations above the finite field. In this paper, we analyze the structure of Miller’s algorithm firstly, which is used to implement Tate pairing. Then, according to the characteristics that Miller’s algorithm will be improved tremendous if the order of the subgroup of elliptic curve group is low hamming prime, we present an effective generation method of elliptic curve using the Fermat number, which enable it feasible that there is certain some subgroup of low hamming prime order in the elliptic curve group generated. Finally, we give an example to generate elliptic curve, which includes the subgroup with low hamming prime order. It is clear that the computation of Tate pairing above elliptic curve group generating by our method can be improved tremendously.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83967306","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}
Yang Yang, Zhiliang Wang, Mengmeng Zhang, Yi Yang, Nannan Cheng
The automatic detection and tracking of multiple skin-colored objects in videos plays important roles in human-computer interaction, such as human activity recognition and hand posture recognition. In this paper, we propose a tracking method hybrid with color model and GVF. Hybrid RGB-YCrCb model is applied to detect human skin region. Different skin regions are label by connected component analysis and process the GVF step by step to track the shape of skin regions. We demonstrate the effectiveness and efficiency of this approach by experimenting on several video sequences with hand motion patterns.
{"title":"Skin Region Tracking Using Hybrid Color Model and Gradient Vector Flow","authors":"Yang Yang, Zhiliang Wang, Mengmeng Zhang, Yi Yang, Nannan Cheng","doi":"10.1109/MVHI.2010.143","DOIUrl":"https://doi.org/10.1109/MVHI.2010.143","url":null,"abstract":"The automatic detection and tracking of multiple skin-colored objects in videos plays important roles in human-computer interaction, such as human activity recognition and hand posture recognition. In this paper, we propose a tracking method hybrid with color model and GVF. Hybrid RGB-YCrCb model is applied to detect human skin region. Different skin regions are label by connected component analysis and process the GVF step by step to track the shape of skin regions. We demonstrate the effectiveness and efficiency of this approach by experimenting on several video sequences with hand motion patterns.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82364806","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}
Grid is the trend of the Internet next generation, which is a new network computing platform after the World Wide Web; It is the integration of the calculation of resources and environment its core is to eliminate Information isolation island, to realize including computing resources, storage resources, correspondence resources, information resources and knowledge resources, all resources in the sharing. Teaching is also a resources sharing process, the current accompanied by Internet network teaching resources sharing provide a lot of room for Educational Model to change. However, this sharing model is perplexed by current Internet technology’s defect, such as meeting the network bottleneck and the information isolated island, the resources frequently lacked questions and so on.
{"title":"Teaching Resource Sharing Research Based on Grid Technology","authors":"Yao Chen, Xue Xing, Yan Li, Zhibang Liu","doi":"10.1109/MVHI.2010.44","DOIUrl":"https://doi.org/10.1109/MVHI.2010.44","url":null,"abstract":"Grid is the trend of the Internet next generation, which is a new network computing platform after the World Wide Web; It is the integration of the calculation of resources and environment its core is to eliminate Information isolation island, to realize including computing resources, storage resources, correspondence resources, information resources and knowledge resources, all resources in the sharing. Teaching is also a resources sharing process, the current accompanied by Internet network teaching resources sharing provide a lot of room for Educational Model to change. However, this sharing model is perplexed by current Internet technology’s defect, such as meeting the network bottleneck and the information isolated island, the resources frequently lacked questions and so on.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80466341","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 DC power supply and its novel protection circuit are presented. The proposed new DC power supply is consisted of the output voltage control circuit, driving circuit and the overcurrent protection circuit. The structure and principle of every part about the power supply have been detailed. From a large number of experiments and measurements, it is testified that the lowest electronic noise, high stability, self-protecting, programmable and user-configurable are all merits of the proposed DC power supply.
{"title":"Research of a Programmable DC Power Supply and its Novel Protection Circuit","authors":"Shi Ji, Zhiwen Tian","doi":"10.1109/MVHI.2010.64","DOIUrl":"https://doi.org/10.1109/MVHI.2010.64","url":null,"abstract":"In this paper, a DC power supply and its novel protection circuit are presented. The proposed new DC power supply is consisted of the output voltage control circuit, driving circuit and the overcurrent protection circuit. The structure and principle of every part about the power supply have been detailed. From a large number of experiments and measurements, it is testified that the lowest electronic noise, high stability, self-protecting, programmable and user-configurable are all merits of the proposed DC power supply.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89787796","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}
Classic Dijdstra algorithm and heuristic strategy were discussed. A dynamic direction restricted searching algorithm is presented, based on the Dijkstra algorithm for computing shortest path from one node to another node in road net. In comparison with classic Dijdstra algorithm, the searching algorithm, combined with human searching thought and flexible handle, could change restricted area dynamically and save computation time. The efficiency of computing shortest path was improved by this algorithm only and better effects were given when this algorithm was combined with other algorithms. The results of comparative experiments show that the dynamic direction restricted searching algorithm led to almost a saving ratio of 50 %, in terms of both number of nodes selected and computation times.
{"title":"A Novel Shortest Path Method Based on Heuristic Algorithm","authors":"Yangeng Wen, Weihua Zang, Chen Li","doi":"10.1109/MVHI.2010.157","DOIUrl":"https://doi.org/10.1109/MVHI.2010.157","url":null,"abstract":"Classic Dijdstra algorithm and heuristic strategy were discussed. A dynamic direction restricted searching algorithm is presented, based on the Dijkstra algorithm for computing shortest path from one node to another node in road net. In comparison with classic Dijdstra algorithm, the searching algorithm, combined with human searching thought and flexible handle, could change restricted area dynamically and save computation time. The efficiency of computing shortest path was improved by this algorithm only and better effects were given when this algorithm was combined with other algorithms. The results of comparative experiments show that the dynamic direction restricted searching algorithm led to almost a saving ratio of 50 %, in terms of both number of nodes selected and computation times.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84767583","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}
At present, the large-scale workpiece need to be measured on the coordinate measuring machine(CMM) in the manufacturing process resulting in low efficiency and hard quality controlling. In this paper, an image mosaic method for on-machine vision measurement of large-scale workpiece was presented. The camera was mounted on the numerical controlled milling machine to acquire multi-images by controlling the moving of working table. Rule of image taking, definition of overlapped image pairs, feature point detection and projective matrix computation were discussed. Image mosaic of large-scale workpiece with high precision was realized. Size measurement result proved the effectiveness and high efficiency of this method.
{"title":"Image Mosaic for On-machine Measurement of Large-Scale Workpiece","authors":"Zhongren Wang, Shuxian Wang, Y. Quan","doi":"10.1109/MVHI.2010.85","DOIUrl":"https://doi.org/10.1109/MVHI.2010.85","url":null,"abstract":"At present, the large-scale workpiece need to be measured on the coordinate measuring machine(CMM) in the manufacturing process resulting in low efficiency and hard quality controlling. In this paper, an image mosaic method for on-machine vision measurement of large-scale workpiece was presented. The camera was mounted on the numerical controlled milling machine to acquire multi-images by controlling the moving of working table. Rule of image taking, definition of overlapped image pairs, feature point detection and projective matrix computation were discussed. Image mosaic of large-scale workpiece with high precision was realized. Size measurement result proved the effectiveness and high efficiency of this method.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84777649","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}
Cluster ensemble has recently become a hotspot in machine learning communities. The key problem in cluster ensemble is how to combine multiple clusterings to yield a final superior result. In this paper, an Improved Non-negative Matrix Factorization (INMF) algorithm is proposed. Firstly, K-Means algorithm is performed to partition the hypergraph’s adjacent matrix and get the indicator matrix, which is then provided to NMF as initial factor matrix. Secondly, NMF is performed to get the basis matrix and coefficient matrix. Finally, clustering result is obtained via the elements in coefficient matrix. Experiments on several real-world datasets show that: (a) INMF outperforms the NMF-based cluster ensemble algorithm; (b) INMF obtains better clustering results than other common cluster ensemble algorithms.
{"title":"An Improved Non-negative Matrix Factorization Algorithm for Combining Multiple Clusterings","authors":"Wei Wang","doi":"10.1109/MVHI.2010.72","DOIUrl":"https://doi.org/10.1109/MVHI.2010.72","url":null,"abstract":"Cluster ensemble has recently become a hotspot in machine learning communities. The key problem in cluster ensemble is how to combine multiple clusterings to yield a final superior result. In this paper, an Improved Non-negative Matrix Factorization (INMF) algorithm is proposed. Firstly, K-Means algorithm is performed to partition the hypergraph’s adjacent matrix and get the indicator matrix, which is then provided to NMF as initial factor matrix. Secondly, NMF is performed to get the basis matrix and coefficient matrix. Finally, clustering result is obtained via the elements in coefficient matrix. Experiments on several real-world datasets show that: (a) INMF outperforms the NMF-based cluster ensemble algorithm; (b) INMF obtains better clustering results than other common cluster ensemble algorithms.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90061195","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}
Optimization of Constrained Functions have been a research focus in multi-objective optimization problems (MOP). Based on the technologies from NSGA-II such as non-dominated sorting, elitist strategy and niche technique, this paper proposes an improved NSGA-II algorithm for Optimization of Constrained Functions. In the improved algorithm, a partial order relation and the crossover operate by Cauchy Distribution is set up. Then according to the partial order relation, the individuals are sorted for generating the non-dominated individuals. Moreover, to enhance the evolution’s ability, some individuals are evolved in the same generation and the crossover operate by Cauchy Distribution is adopted. In addition, non-dominated individuals generated in each generation are archived to Pareto set filter to reserve all individuals with good characteristic generated in the evolving process. Finally, some Benchmark functions are used to test the algorithm performance. Test result shows the availability and the efficiency of the algorithm.
{"title":"Improved NSGA-II Algorithm for Optimization of Constrained Functions","authors":"Maocai Wang, Guangming Dai, Hanping Hu","doi":"10.1109/MVHI.2010.209","DOIUrl":"https://doi.org/10.1109/MVHI.2010.209","url":null,"abstract":"Optimization of Constrained Functions have been a research focus in multi-objective optimization problems (MOP). Based on the technologies from NSGA-II such as non-dominated sorting, elitist strategy and niche technique, this paper proposes an improved NSGA-II algorithm for Optimization of Constrained Functions. In the improved algorithm, a partial order relation and the crossover operate by Cauchy Distribution is set up. Then according to the partial order relation, the individuals are sorted for generating the non-dominated individuals. Moreover, to enhance the evolution’s ability, some individuals are evolved in the same generation and the crossover operate by Cauchy Distribution is adopted. In addition, non-dominated individuals generated in each generation are archived to Pareto set filter to reserve all individuals with good characteristic generated in the evolving process. Finally, some Benchmark functions are used to test the algorithm performance. Test result shows the availability and the efficiency of the algorithm.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91338626","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}
To reveal the change regularity of drivers' memory on traffic sign information over time, fading model of drivers' short-term memory was established. Based on fading factors and the shape of fading curve, power function was employed in describing fading trend of drivers’ short-term memory. A typical route was chose in urban road network, and a car was employed to do the experiment. Based on theory of psychology and memory, the impact of traffic sign information on drivers’ short-term memory was studied, and the fading model of drivers’ memory for traffic signs information was established. The paper verified Ebbinghaus’ forgetting curve and proposed new parameters for drivers of different age/driving age and gender. Finally, the fading model was applied into the designing and layout of traffic sign in an intersection.
{"title":"Fading Model of Drivers' Short-Term Memory of Traffic Signs","authors":"Haipeng Shao","doi":"10.1109/MVHI.2010.57","DOIUrl":"https://doi.org/10.1109/MVHI.2010.57","url":null,"abstract":"To reveal the change regularity of drivers' memory on traffic sign information over time, fading model of drivers' short-term memory was established. Based on fading factors and the shape of fading curve, power function was employed in describing fading trend of drivers’ short-term memory. A typical route was chose in urban road network, and a car was employed to do the experiment. Based on theory of psychology and memory, the impact of traffic sign information on drivers’ short-term memory was studied, and the fading model of drivers’ memory for traffic signs information was established. The paper verified Ebbinghaus’ forgetting curve and proposed new parameters for drivers of different age/driving age and gender. Finally, the fading model was applied into the designing and layout of traffic sign in an intersection.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72926550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents an improved differential evolution (DE) algorithm to enhance the performance of DE. The proposed approach is called MPTDE which employs a novel mutation operator. The main idea of MPTDE is to conduct a mutation on each individual and select a fitter one between the current one and the mutated one as the new current individual. In order to verify the performance of MPTDE, we test it on ten well-known benchmark functions. The experimental results show that MPTDE outperforms DE on majority of test functions.
{"title":"Improved Differential Evolution for Function Optimization","authors":"Zhigang Zhou","doi":"10.1109/MVHI.2010.146","DOIUrl":"https://doi.org/10.1109/MVHI.2010.146","url":null,"abstract":"This paper presents an improved differential evolution (DE) algorithm to enhance the performance of DE. The proposed approach is called MPTDE which employs a novel mutation operator. The main idea of MPTDE is to conduct a mutation on each individual and select a fitter one between the current one and the mutated one as the new current individual. In order to verify the performance of MPTDE, we test it on ten well-known benchmark functions. The experimental results show that MPTDE outperforms DE on majority of test functions.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78538692","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
扫码关注我们
求助内容：
应助结果提醒方式：