For electric power business decision, the open Web is an important resource of knowledge. Unfortunately, traditional methods of knowledge acquiring, representing and organizing can not satisfy the requirements of semantic to support intelligent decision. Arming to these, a semantic platform oriented business intelligence named SP4BI is proposed by this paper, then two key technologies, model of Web knowledge representation and automatic algorithm of ontology acquiring, are illustrated. Knowledge on the Web are time-related and context-related, these properties are all be considered in representation model of Web knowledge. Meanwhile, the experiments of automatic acquiring electric power ontology show the validity of extracting properties and relations of concepts. Compared with existing methods, SP4BI platform provides a semantic supporting, and is a fundamental of machine reading and automatic reasoning.
{"title":"Research on Semantic Business Platform for Electric Power System","authors":"Sheng Jia-gen, Liu Sifeng","doi":"10.1109/CCCM.2008.357","DOIUrl":"https://doi.org/10.1109/CCCM.2008.357","url":null,"abstract":"For electric power business decision, the open Web is an important resource of knowledge. Unfortunately, traditional methods of knowledge acquiring, representing and organizing can not satisfy the requirements of semantic to support intelligent decision. Arming to these, a semantic platform oriented business intelligence named SP4BI is proposed by this paper, then two key technologies, model of Web knowledge representation and automatic algorithm of ontology acquiring, are illustrated. Knowledge on the Web are time-related and context-related, these properties are all be considered in representation model of Web knowledge. Meanwhile, the experiments of automatic acquiring electric power ontology show the validity of extracting properties and relations of concepts. Compared with existing methods, SP4BI platform provides a semantic supporting, and is a fundamental of machine reading and automatic reasoning.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115319415","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}
An important issue in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called double-loop hypercube (DLH), is proposed. The DLH network combines the positive features of hypercube topology, such as small diameter, high connectivity, symmetry and simple routing, and the scalability and constant node degree of a new double-loop topology. The DLH network can maintain a constant node degree regardless of the increase in the network size. The nodes of the DLH network adopt the hybrid coding combining Johnson code and Gray code. The hybrid coding scheme can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms are designed for the DLH network, and it is based on the hybrid coding scheme. A detailed analysis shows that the DLH network is a better interconnection network in the properties of topology and the performance of communication.
{"title":"Double-Loop Hypercube: A New Scalable Interconnection Network for Massively Parallel Computing","authors":"Youyao Liu, Jungang Han","doi":"10.1109/CCCM.2008.45","DOIUrl":"https://doi.org/10.1109/CCCM.2008.45","url":null,"abstract":"An important issue in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called double-loop hypercube (DLH), is proposed. The DLH network combines the positive features of hypercube topology, such as small diameter, high connectivity, symmetry and simple routing, and the scalability and constant node degree of a new double-loop topology. The DLH network can maintain a constant node degree regardless of the increase in the network size. The nodes of the DLH network adopt the hybrid coding combining Johnson code and Gray code. The hybrid coding scheme can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms are designed for the DLH network, and it is based on the hybrid coding scheme. A detailed analysis shows that the DLH network is a better interconnection network in the properties of topology and the performance of communication.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115487933","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}
Data warehouse and online analytical processing (OLAP) are two significant information technology (IT) strategies. To commercial enterprises, merchandise sales play important and special role. With the market competition getting fierce, managers see information as a critical resource and require methods that let them exploit it for competitive advantage. The development of data warehouse and OLAP make it possible to use these technologies to help managers' analysis and decision making. In this study, we take the case of a drugs retail enterprise, propose a drugs sales data cube and attempt to apply it to drugs sales data OLAP analysis. We give an OLAP structure based on Web. This paper provides the method to realize OLAP data analysis from Web pages through bedding office Web components, and realizes the OLAP multidimensional data analyses.
{"title":"Effectiveness of OLAP-Based Sales Analysis in Retail Enterprises","authors":"Chun-hua Ju, Minghua Han","doi":"10.1109/CCCM.2008.131","DOIUrl":"https://doi.org/10.1109/CCCM.2008.131","url":null,"abstract":"Data warehouse and online analytical processing (OLAP) are two significant information technology (IT) strategies. To commercial enterprises, merchandise sales play important and special role. With the market competition getting fierce, managers see information as a critical resource and require methods that let them exploit it for competitive advantage. The development of data warehouse and OLAP make it possible to use these technologies to help managers' analysis and decision making. In this study, we take the case of a drugs retail enterprise, propose a drugs sales data cube and attempt to apply it to drugs sales data OLAP analysis. We give an OLAP structure based on Web. This paper provides the method to realize OLAP data analysis from Web pages through bedding office Web components, and realizes the OLAP multidimensional data analyses.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114630906","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 positioning algorithm based on a Kalman smoother is proposed, and the performance of the INS/GPS integrated navigation system is improved. In this paper, the error sources of inertial navigation system (INS) and Global Positioning System (GPS) are analyzed respectively, and then the error state models are set up. Furthermore, the INS/GPS integrated navigation system based on the information of GPS and INS is modeled and simulated, and the algorithm using the KF and the Rauch-Tung-smoother (RTS) filtering is compared. The numerical emulation demonstrates that the RTS filtering can greatly enhance the robustness and reliability of integrated navigation system. The system has obvious advantages of high accuracy.
{"title":"Research and Application of a Kalman Smoother Based on INS/GPS Integrated Navigation","authors":"Jian Rong, Haitao Zhang, Xiaochun Zhong, Ke Chen","doi":"10.1109/CCCM.2008.314","DOIUrl":"https://doi.org/10.1109/CCCM.2008.314","url":null,"abstract":"A positioning algorithm based on a Kalman smoother is proposed, and the performance of the INS/GPS integrated navigation system is improved. In this paper, the error sources of inertial navigation system (INS) and Global Positioning System (GPS) are analyzed respectively, and then the error state models are set up. Furthermore, the INS/GPS integrated navigation system based on the information of GPS and INS is modeled and simulated, and the algorithm using the KF and the Rauch-Tung-smoother (RTS) filtering is compared. The numerical emulation demonstrates that the RTS filtering can greatly enhance the robustness and reliability of integrated navigation system. The system has obvious advantages of high accuracy.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121828486","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}
Xiaohong Wang, Jinming Yang, Xian-yong Zhang, Jie Wu
The brushless doubly-fed machine (BDFM) has prospect application in the wind energy conversion system (WECS) for its abilities of speed regulation and variable-speed constant-frequency. The decoupled control of the active and reactive power is crucial to the applications of the BDFM in WECS. The robust control strategy based on sliding mode theory is applied for the independent control of active and reactive power of the BDFM. The controller is designed through the Lyapunov stable theory to ensure the stability of controller and achieve the required control result. The effect of the proposed method is tested with the matlab/simulink software. Simulation results illustrate the good performance of the controller and proves the power control strategy's feasibility.
{"title":"Sliding Mode Control of Active and Reactive Power for Brushless Doubly-Fed Machine","authors":"Xiaohong Wang, Jinming Yang, Xian-yong Zhang, Jie Wu","doi":"10.1109/CCCM.2008.167","DOIUrl":"https://doi.org/10.1109/CCCM.2008.167","url":null,"abstract":"The brushless doubly-fed machine (BDFM) has prospect application in the wind energy conversion system (WECS) for its abilities of speed regulation and variable-speed constant-frequency. The decoupled control of the active and reactive power is crucial to the applications of the BDFM in WECS. The robust control strategy based on sliding mode theory is applied for the independent control of active and reactive power of the BDFM. The controller is designed through the Lyapunov stable theory to ensure the stability of controller and achieve the required control result. The effect of the proposed method is tested with the matlab/simulink software. Simulation results illustrate the good performance of the controller and proves the power control strategy's feasibility.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"32 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850749","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}
New equivalent reformulations of generalized semi-infinite min-max programming (GSMMP) is derived by addressing the perturbed problem of the lower-level programming. Based on these, we obtain an exact penalty representations for the lower-level programming, which allows us to convert (GSSMP) into the standard semi-infinite programming problems (SMMP) via a class of exact penalty functions, including not only the function used in [9] but also some smooth exact penalty functions as special cases.This fact makes it possible to solve (GSMMP) by using any available standard semi-infinite optimization algorithms.
{"title":"Equivalent Reformulations of Generalized Semi-infinite Min-Max Programming","authors":"Jinchuan Zhou, Mei-xia Li, Wenling Zhao, Xiuhua Xu","doi":"10.1109/CCCM.2008.196","DOIUrl":"https://doi.org/10.1109/CCCM.2008.196","url":null,"abstract":"New equivalent reformulations of generalized semi-infinite min-max programming (GSMMP) is derived by addressing the perturbed problem of the lower-level programming. Based on these, we obtain an exact penalty representations for the lower-level programming, which allows us to convert (GSSMP) into the standard semi-infinite programming problems (SMMP) via a class of exact penalty functions, including not only the function used in [9] but also some smooth exact penalty functions as special cases.This fact makes it possible to solve (GSMMP) by using any available standard semi-infinite optimization algorithms.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123890988","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}
Secure key issuing in identity-based public key cryptosystems is a challenging task due to the inherent drawback of key escrow and the requirement for secure channel between the private key generator (PKG) and users. In this paper, we propose a practical key issuing scheme. User registers at a local registration authority in off-line manner, local registration authority signs and delivers authenticated userpsilas information to multiple PKGs in batch manner. The master key is generated by PKGs based on secure distributed key generation protocol, which solves the key escrow problem. The secure channel between the user and the PKGs are not needed by using blinding technique. The proposed scheme is more efficient than those of existing key issuing schemes and the security is proved under random oracle model.
{"title":"A Practical Key Issuing Scheme in Identity-Based Cryptosystem","authors":"Chang-ji Wang, Jing Liu","doi":"10.1109/CCCM.2008.302","DOIUrl":"https://doi.org/10.1109/CCCM.2008.302","url":null,"abstract":"Secure key issuing in identity-based public key cryptosystems is a challenging task due to the inherent drawback of key escrow and the requirement for secure channel between the private key generator (PKG) and users. In this paper, we propose a practical key issuing scheme. User registers at a local registration authority in off-line manner, local registration authority signs and delivers authenticated userpsilas information to multiple PKGs in batch manner. The master key is generated by PKGs based on secure distributed key generation protocol, which solves the key escrow problem. The secure channel between the user and the PKGs are not needed by using blinding technique. The proposed scheme is more efficient than those of existing key issuing schemes and the security is proved under random oracle model.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127904645","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}
We proposed a method to auto-extract contour sketch from color image. Firstly, we get binary image through OTSU method, and then trace the contour of the binary image. Secondly, map the contour to the specified sketch plane. We use Hough Transform to detect all possible line segments in the contour, use Randomized Circle Detection algorithm to get all possible circular arcs, and then determine the break points of the contour according to the constraints between the fitted line segments and circular arcs. Finally, we refit the curve set by the global constraint formula based on the estimated curve type and constraints. Examples show that the method can recognize the curve type and corresponding constraints accurately, and can extract contour sketch from the color image as expected.
{"title":"Constrained 2D Sketch Generation Based on Image Contour Detect","authors":"Shen Ying, Chen Zhiyang, Cai Zhiyong","doi":"10.1109/CCCM.2008.306","DOIUrl":"https://doi.org/10.1109/CCCM.2008.306","url":null,"abstract":"We proposed a method to auto-extract contour sketch from color image. Firstly, we get binary image through OTSU method, and then trace the contour of the binary image. Secondly, map the contour to the specified sketch plane. We use Hough Transform to detect all possible line segments in the contour, use Randomized Circle Detection algorithm to get all possible circular arcs, and then determine the break points of the contour according to the constraints between the fitted line segments and circular arcs. Finally, we refit the curve set by the global constraint formula based on the estimated curve type and constraints. Examples show that the method can recognize the curve type and corresponding constraints accurately, and can extract contour sketch from the color image as expected.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128472920","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 new integration scheme of robust and fragile for secured digital watermarking is developed and implemented. The proposed method uses symmetric encryption algorithm, error correcting code and random permutation to process the original watermark information, and then embeds it into the blue component of image in robust process. In fragile process, a session key and the red component of image are hashed, and then the hashed value is encrypted by using the receiverpsilas public key, finally the encrypted message is embedded into the least significant bit (LSB) of the image. Our results have shown that the proposed scheme can resist white noise, cropping, median filter and JPEG compressing distortions, and can be used for image verification and identity authentication.
{"title":"A New Integration Scheme of Robust and Fragile for Secured Digital Watermarking","authors":"Lin Zhang, F. Qian, Yi Gao, Yuesheng Zhu","doi":"10.1109/CCCM.2008.358","DOIUrl":"https://doi.org/10.1109/CCCM.2008.358","url":null,"abstract":"In this paper, a new integration scheme of robust and fragile for secured digital watermarking is developed and implemented. The proposed method uses symmetric encryption algorithm, error correcting code and random permutation to process the original watermark information, and then embeds it into the blue component of image in robust process. In fragile process, a session key and the red component of image are hashed, and then the hashed value is encrypted by using the receiverpsilas public key, finally the encrypted message is embedded into the least significant bit (LSB) of the image. Our results have shown that the proposed scheme can resist white noise, cropping, median filter and JPEG compressing distortions, and can be used for image verification and identity authentication.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233376","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}
Since the anonymity and openness of P2P,in P2P networks,services may be misused by providing tampered files, viruses and Trojan Horses. But existing researches on reputation system for P2P networks are still limited to the resistance of some attacks. This paper provides a new measure by adding a server into the reputation system to record all userspsila actions, such as uploading, downloading, judging and getting judgments, defending the attack etc. It is proved to be feasible and efficient. Finally, Conclusion and some prospects are proposed.
{"title":"Research and Design on P2P Based Reliable Reputation Management System","authors":"Shouqiang Liu, Deyu Qi, Baogang Chen","doi":"10.1109/CCCM.2008.383","DOIUrl":"https://doi.org/10.1109/CCCM.2008.383","url":null,"abstract":"Since the anonymity and openness of P2P,in P2P networks,services may be misused by providing tampered files, viruses and Trojan Horses. But existing researches on reputation system for P2P networks are still limited to the resistance of some attacks. This paper provides a new measure by adding a server into the reputation system to record all userspsila actions, such as uploading, downloading, judging and getting judgments, defending the attack etc. It is proved to be feasible and efficient. Finally, Conclusion and some prospects are proposed.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130948426","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
扫码关注我们
求助内容：
应助结果提醒方式：