Firstly, the paper made a contrast between the current domestic and international research condition, and introduced the basic concept of fault injection and distributed system. secondly, it discussed the classification and requirements of fault injection. There are mainly three types of distributed fault, namely the memory fault, CPU fault and correspondence fault. Besides, it discussed the method of distributed software fault injection about DOCTOR and illustrated the comprehensive structure and its respective parts of DOCTOR in detail. Thirdly, it reached a conclusion about the fault model of distributed system of fault injection and its realization method.
{"title":"Research about Software Fault Injection Technology Based on Distributed System","authors":"Hui Zhang","doi":"10.1109/MVHI.2010.46","DOIUrl":"https://doi.org/10.1109/MVHI.2010.46","url":null,"abstract":"Firstly, the paper made a contrast between the current domestic and international research condition, and introduced the basic concept of fault injection and distributed system. secondly, it discussed the classification and requirements of fault injection. There are mainly three types of distributed fault, namely the memory fault, CPU fault and correspondence fault. Besides, it discussed the method of distributed software fault injection about DOCTOR and illustrated the comprehensive structure and its respective parts of DOCTOR in detail. Thirdly, it reached a conclusion about the fault model of distributed system of fault injection and its realization method.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"18 1","pages":"518-521"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74429276","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 order to prevent more effectively the occurrence of the distortion of target weights’ distribution and further reduce system errors, a comprehensive improvement has been conducted on the algorithm’s weight updating and weight normalization to avoid the defects of the traditional AdaBoost image detection algorithm. It is proved that the improved algorithm is more effective.
{"title":"Research of Image Detection Based on Improved AdaBoost Algorithm","authors":"Peng Wu, Shenming Qu","doi":"10.1109/MVHI.2010.104","DOIUrl":"https://doi.org/10.1109/MVHI.2010.104","url":null,"abstract":"In order to prevent more effectively the occurrence of the distortion of target weights’ distribution and further reduce system errors, a comprehensive improvement has been conducted on the algorithm’s weight updating and weight normalization to avoid the defects of the traditional AdaBoost image detection algorithm. It is proved that the improved algorithm is more effective.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"24 4 1","pages":"113-115"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77445713","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 using orthogonal test method, this paper studies several influential factors, such as the optic magnification of the system, the intensity of backlight and so on, which influence the measurement accuracy of the spinneret automatic inspection system based on machine vision. Through range and variance analysis, the paper determines the best inspecting condition of the inspection system and finds out the factors that have significant effect to measurement accuracy of machine vision system. At the same time, the paper looks out some ways to improve the measurement accuracy of the spinneret automatic inspection system.
{"title":"Analysis of Factors Influencing Measurement Accuracy of Spinneret Automatic Inspection System","authors":"Chongchang Yang, Chunlei Li, Bin Cui","doi":"10.1109/MVHI.2010.63","DOIUrl":"https://doi.org/10.1109/MVHI.2010.63","url":null,"abstract":"By using orthogonal test method, this paper studies several influential factors, such as the optic magnification of the system, the intensity of backlight and so on, which influence the measurement accuracy of the spinneret automatic inspection system based on machine vision. Through range and variance analysis, the paper determines the best inspecting condition of the inspection system and finds out the factors that have significant effect to measurement accuracy of machine vision system. At the same time, the paper looks out some ways to improve the measurement accuracy of the spinneret automatic inspection system.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"484 1","pages":"722-724"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76375100","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":"17 1","pages":"17-20"},"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}
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":"7 1","pages":"243-246"},"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}
For the current database security issues of office automation system, A database encryption scheme is proposed in this paper, which according to authority, roles, and the different encryption granularity of the database, not only ensure data security, but also improve the efficiency of system management. In order to enhance the security of the database, using ECC (elliptic curve encryption algorithm) flexibly, fully ensure the store of sensitive data’s security. Through experiments and performance analysis, the method can ensure the security of the database effectively.
{"title":"Research on Database Encryption of OA System","authors":"Jianfei He, X. Guan","doi":"10.1109/MVHI.2010.79","DOIUrl":"https://doi.org/10.1109/MVHI.2010.79","url":null,"abstract":"For the current database security issues of office automation system, A database encryption scheme is proposed in this paper, which according to authority, roles, and the different encryption granularity of the database, not only ensure data security, but also improve the efficiency of system management. In order to enhance the security of the database, using ECC (elliptic curve encryption algorithm) flexibly, fully ensure the store of sensitive data’s security. Through experiments and performance analysis, the method can ensure the security of the database effectively.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"66 1","pages":"29-32"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81708071","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":"1 1","pages":"688-691"},"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":"30 1","pages":"545-548"},"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}
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":"66 1","pages":"676-678"},"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}
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":"108 1","pages":"254-257"},"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
扫码关注我们
求助内容：
应助结果提醒方式：