Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593702
Lixiong Lin, Xiafu Peng
This paper investigates the Application of PID neural network(PIDNN) control law for a permanent magnet synchronous motor(PMSM) servo system. First, the math model of a PMSM is introduced for the PMSM servo system, on which PIDNN controller with on-line learning, tracking and regulating ability is applied. This PIDNN controller is campared with the conventional PID controller, and single neural PID controller. The simulation results show that the control law of PIDNN yields excellent performance for both track following and real-time control in the PMSM servo system.
{"title":"A PID neural network control for permanent magnet synchronous motor servo system","authors":"Lixiong Lin, Xiafu Peng","doi":"10.1109/ICCSE.2010.5593702","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593702","url":null,"abstract":"This paper investigates the Application of PID neural network(PIDNN) control law for a permanent magnet synchronous motor(PMSM) servo system. First, the math model of a PMSM is introduced for the PMSM servo system, on which PIDNN controller with on-line learning, tracking and regulating ability is applied. This PIDNN controller is campared with the conventional PID controller, and single neural PID controller. The simulation results show that the control law of PIDNN yields excellent performance for both track following and real-time control in the PMSM servo system.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123082283","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593835
Cui Xuehong
For inpainting of the flow-like textures with line-like structures images, we present an model based on tensor diffusion. The proposed model is to reconstruct a damaged original image by acting along the texture's direction and the vertical texture's direction which is determined by the texture's trend of the local image structure (This local image structure is measured by the so-called structure tensor). In order to guarantee better results, the intensity of the diffusion along the texture's direction should be much greater than that of the diffusion along the vertical texture's direction. The nonnegativity discretization method and optimized rotation invariance method is used to calculate the proposed model. It was shown in experiments that this model can get good results for inpainting the flow-like textures with line-like structures images that contain nicks or small broken areas.
{"title":"Flow-like textures with line-like structures images inpainting by improved tensor diffusion model","authors":"Cui Xuehong","doi":"10.1109/ICCSE.2010.5593835","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593835","url":null,"abstract":"For inpainting of the flow-like textures with line-like structures images, we present an model based on tensor diffusion. The proposed model is to reconstruct a damaged original image by acting along the texture's direction and the vertical texture's direction which is determined by the texture's trend of the local image structure (This local image structure is measured by the so-called structure tensor). In order to guarantee better results, the intensity of the diffusion along the texture's direction should be much greater than that of the diffusion along the vertical texture's direction. The nonnegativity discretization method and optimized rotation invariance method is used to calculate the proposed model. It was shown in experiments that this model can get good results for inpainting the flow-like textures with line-like structures images that contain nicks or small broken areas.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116677882","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593667
Qingming Tang, Yingjie Wu, Xiaodong Wang
K-Anonymity is a famous and widely used privacy principle for protecting private information. It requires that each tuple of a public released data table must be indistinguishable from at least other k − 1 tuples. Given a table, finding an optimal k-anonymous version is NP-hard in most previous recoding ”model”. Thus, designing an efficient algorithm to find high-quality k-anonymous version is still challenge, though k-anonymity is well-researched. In recent years, hierarchical partition is proposed and widely accepted. Viewing the given table as a multidimensional space, each hierarchical partition of the space is a multidimensional recoding under some special constraints. Previous works need huge computation to find optimal hierarchical partition, and efficient algorithms just find a reasonable hierarchical partition. In this paper, we show that optimal hierarchical partition for k-anonymity can be obtained within polynomial time when a fixed quasi-identifier is given. We then design a bottom-up algorithm using dynamic approach. Through theoretical analysis and experiments, we show that our algorithm finds better results than related works, and our algorithm runs significantly fast comparing with other optimal algorithms for hierarchical partition.
k -匿名(K-Anonymity)是一种著名且被广泛应用的隐私保护原则，用于保护个人信息。它要求公开发布的数据表的每个元组必须与至少其他k−1个元组不可区分。给定一个表，在大多数以前的编码“模型”中，找到一个最优的k-匿名版本是np困难的。因此，设计一个有效的算法来寻找高质量的k-匿名版本仍然是一个挑战，尽管k-匿名已经得到了很好的研究。近年来，分层划分被提出并被广泛接受。将给定的表视为一个多维空间，该空间的每个分层分区都是在某些特殊约束下的多维重新编码。以往的工作需要大量的计算才能找到最优的层次划分，而高效的算法只是找到一个合理的层次划分。本文证明了当给定一个固定的拟标识符时，k-匿名的最优层次划分可以在多项式时间内得到。然后，我们采用动态方法设计了一个自下而上的算法。通过理论分析和实验，我们的算法得到了比相关工作更好的结果，并且与其他分层划分的最优算法相比，我们的算法运行速度明显快。
{"title":"Optimal hierarchical partition for k-Anonymity","authors":"Qingming Tang, Yingjie Wu, Xiaodong Wang","doi":"10.1109/ICCSE.2010.5593667","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593667","url":null,"abstract":"K-Anonymity is a famous and widely used privacy principle for protecting private information. It requires that each tuple of a public released data table must be indistinguishable from at least other k − 1 tuples. Given a table, finding an optimal k-anonymous version is NP-hard in most previous recoding ”model”. Thus, designing an efficient algorithm to find high-quality k-anonymous version is still challenge, though k-anonymity is well-researched. In recent years, hierarchical partition is proposed and widely accepted. Viewing the given table as a multidimensional space, each hierarchical partition of the space is a multidimensional recoding under some special constraints. Previous works need huge computation to find optimal hierarchical partition, and efficient algorithms just find a reasonable hierarchical partition. In this paper, we show that optimal hierarchical partition for k-anonymity can be obtained within polynomial time when a fixed quasi-identifier is given. We then design a bottom-up algorithm using dynamic approach. Through theoretical analysis and experiments, we show that our algorithm finds better results than related works, and our algorithm runs significantly fast comparing with other optimal algorithms for hierarchical partition.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"36 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120885524","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593828
Zhao Yan, Li Yufei
Electronic Power Steering (EPS) has become the direction of the development of modern steering system for its excellent functions. The manufacturers and the researchers need pay attention not only to the improvement and innovation of the technology of the products but also to the control and management on course of designing, producing, dynamic capability research etc. So it's necessary to develop one kind of 3-dimensional Computer Aided Design (CAD) management system for electronic power steering. Using the mind of Concurrent Engineering and Modularization facing to the users, different functions of the system are contacted by the database of management information under this platform. Which make the exchange of different information turn to reality, fasting the speed of products developing. Visual FoxPro, which used Object-Oriented technology and the 3D CAD software, and Solid Works were used to design this system. A good interface and database were set up at the same time.
{"title":"Development of 3-dimensional CAD management system software for EPS","authors":"Zhao Yan, Li Yufei","doi":"10.1109/ICCSE.2010.5593828","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593828","url":null,"abstract":"Electronic Power Steering (EPS) has become the direction of the development of modern steering system for its excellent functions. The manufacturers and the researchers need pay attention not only to the improvement and innovation of the technology of the products but also to the control and management on course of designing, producing, dynamic capability research etc. So it's necessary to develop one kind of 3-dimensional Computer Aided Design (CAD) management system for electronic power steering. Using the mind of Concurrent Engineering and Modularization facing to the users, different functions of the system are contacted by the database of management information under this platform. Which make the exchange of different information turn to reality, fasting the speed of products developing. Visual FoxPro, which used Object-Oriented technology and the 3D CAD software, and Solid Works were used to design this system. A good interface and database were set up at the same time.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121117769","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593447
Wenzhou Liu, Changqing Cai, Zhuo Zhang
Applying IC-card technology, fingerprint recognition technology and the single chip microcomputer control technology, we verify the fingerprint recognition and design a kind of ID card based on IC card and its recognition system. This system includes: M04 fingerprint module, IC-card reader, microcomputer system, warning circuit, voltage stabilizing circuit and some other components. The fingerprint is stored into IC cart of the ID card via microcomputer system, and matched with the information of the holder when necessary. The identification result can be shown on the PC screen to protect the basic information of the holder. This system has the feature of reliable performance, easy to use, higher security, and greater practicability and so on.
{"title":"Fingerprint ID cards and the recognition system","authors":"Wenzhou Liu, Changqing Cai, Zhuo Zhang","doi":"10.1109/ICCSE.2010.5593447","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593447","url":null,"abstract":"Applying IC-card technology, fingerprint recognition technology and the single chip microcomputer control technology, we verify the fingerprint recognition and design a kind of ID card based on IC card and its recognition system. This system includes: M04 fingerprint module, IC-card reader, microcomputer system, warning circuit, voltage stabilizing circuit and some other components. The fingerprint is stored into IC cart of the ID card via microcomputer system, and matched with the information of the holder when necessary. The identification result can be shown on the PC screen to protect the basic information of the holder. This system has the feature of reliable performance, easy to use, higher security, and greater practicability and so on.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127160453","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593755
B. Ramasubbareddy, Dr. A Govardhan, Dr. A. Ramamohanreddy
Association rule mining is one of the most popular data mining techniques to find associations among items in a set by mining necessary patterns in a large database. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. They are also very useful for constructing associative classifiers. In this paper, we propose an algorithm that mines positive and negative association rules without adding any additional measure and extra database scans.
{"title":"Mining positive and negative association rules","authors":"B. Ramasubbareddy, Dr. A Govardhan, Dr. A. Ramamohanreddy","doi":"10.1109/ICCSE.2010.5593755","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593755","url":null,"abstract":"Association rule mining is one of the most popular data mining techniques to find associations among items in a set by mining necessary patterns in a large database. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. They are also very useful for constructing associative classifiers. In this paper, we propose an algorithm that mines positive and negative association rules without adding any additional measure and extra database scans.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125833835","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593801
Chen Hua-hui, Liao Kang-Li
Maintaining a synopsis structure dynamically from data stream is vital for a variety of streaming data applications, such as approximate query or data mining. In many cases, the significance of data item in streams decays with age: this item perhaps conveys critical information first, but, as time goes by, it gets less and less important until it eventually becomes useless. This characteristic is termed amnesic. Random Sampling is often used in construction of synopsis for streaming data. This paper proposed a Weighted Random Sampling based Hierarchical Amnesic Synopses which includes the amnesic characteristic of data stream in the generation of synopsis. The construction methods for weighted random sampling with and without replacement are discussed. We experimentally evaluate the proposed synopsis structure.
{"title":"Weighted Random sampling based hierarchical amnesic synopses for data streams","authors":"Chen Hua-hui, Liao Kang-Li","doi":"10.1109/ICCSE.2010.5593801","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593801","url":null,"abstract":"Maintaining a synopsis structure dynamically from data stream is vital for a variety of streaming data applications, such as approximate query or data mining. In many cases, the significance of data item in streams decays with age: this item perhaps conveys critical information first, but, as time goes by, it gets less and less important until it eventually becomes useless. This characteristic is termed amnesic. Random Sampling is often used in construction of synopsis for streaming data. This paper proposed a Weighted Random Sampling based Hierarchical Amnesic Synopses which includes the amnesic characteristic of data stream in the generation of synopsis. The construction methods for weighted random sampling with and without replacement are discussed. We experimentally evaluate the proposed synopsis structure.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123505715","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593400
Wang Chunzhi, Jiang Wei, Chen Hong, Wei Luo, H. Fang
With the increasingly development of P2P in recent years, the operational mechanism of P2P application has varied, it's very difficult to distinguish P2P traffic from normal traffic by using single traffic characteristics. The paper put forward a method of P2P traffic identification based on multi-dimension characteristics. Extracting multi-dimension characteristics of P2P application such as ratio of UDP/TCP protocol packet, packet changing ratio, average data transmitting size and ratio of up/down traffic, to indentify P2P traffic under off line status by using decision tree. Test result indicated that P2P traffic in network could be effectively identified by using this method, with an accuracy over 97 percent.
{"title":"Research on a method of P2P traffic identification based on multi-dimension characteristics","authors":"Wang Chunzhi, Jiang Wei, Chen Hong, Wei Luo, H. Fang","doi":"10.1109/ICCSE.2010.5593400","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593400","url":null,"abstract":"With the increasingly development of P2P in recent years, the operational mechanism of P2P application has varied, it's very difficult to distinguish P2P traffic from normal traffic by using single traffic characteristics. The paper put forward a method of P2P traffic identification based on multi-dimension characteristics. Extracting multi-dimension characteristics of P2P application such as ratio of UDP/TCP protocol packet, packet changing ratio, average data transmitting size and ratio of up/down traffic, to indentify P2P traffic under off line status by using decision tree. Test result indicated that P2P traffic in network could be effectively identified by using this method, with an accuracy over 97 percent.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"2 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123758617","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593808
Hong Yan, L. Yibing
In order to evaluate the graduation designs more objective and fair, take the scores of students majored in the same field as samples, the index system is analyzed by the method of Cronbach reliability coefficient. According to the results, countermeasures are brought forward to optimize the system and increase the reliability and validity.
{"title":"The research on index system optimization of graduation design based on Cronbach coefficient","authors":"Hong Yan, L. Yibing","doi":"10.1109/ICCSE.2010.5593808","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593808","url":null,"abstract":"In order to evaluate the graduation designs more objective and fair, take the scores of students majored in the same field as samples, the index system is analyzed by the method of Cronbach reliability coefficient. According to the results, countermeasures are brought forward to optimize the system and increase the reliability and validity.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125340491","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}
Pub Date : 2010-09-30DOI: 10.1109/ICCSE.2010.5593459
Zhou-jun Li, Tan Fang-yong, Gao Xiao-hui
As a comparatively new IPC, Netlink socket has its own predominance in the communication between user process and kernel space. This paper has analyzed the application of Netlink socket in the IPSec support mechanism, summarized the Netlink socket message supported by kernel IPSec module, implemented the IPSec configuration with Netlink sockets.
{"title":"Research on application of Netlink socket communication in linux IPSec support mechanism","authors":"Zhou-jun Li, Tan Fang-yong, Gao Xiao-hui","doi":"10.1109/ICCSE.2010.5593459","DOIUrl":"https://doi.org/10.1109/ICCSE.2010.5593459","url":null,"abstract":"As a comparatively new IPC, Netlink socket has its own predominance in the communication between user process and kernel space. This paper has analyzed the application of Netlink socket in the IPSec support mechanism, summarized the Netlink socket message supported by kernel IPSec module, implemented the IPSec configuration with Netlink sockets.","PeriodicalId":377991,"journal":{"name":"2010 5th International Conference on Computer Science & Education","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125380917","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
扫码关注我们
求助内容：
应助结果提醒方式：