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}
As the foundation of service discovery, match, and composition, the solution to semantic description of Web services is the primary issue in semantic Web services. Aiming at adding semantic description to Web services, and solving problems of similarity calculations in Web services semantic annotation, an improved annotation method was developed: using similarities between WSDL and ontology to annotate services. The method improves similarity algorithms from two aspects: on one hand, the most-related concepts are filtered out according to name similarities between concepts so as to reduce the computational work; on the other, setting different weights to different sub-concepts to raise the accuracy of the structural similarity algorithm. Tests annotating dozens of WSDL in weather has an accuracy of 82.5%.
{"title":"An Improved Semantic Annotation Method of Web Services Based on Ontology","authors":"Lei Zhang, Yang Xiaoying, Y. Yanni, Sun Bo","doi":"10.1109/CCCM.2008.73","DOIUrl":"https://doi.org/10.1109/CCCM.2008.73","url":null,"abstract":"As the foundation of service discovery, match, and composition, the solution to semantic description of Web services is the primary issue in semantic Web services. Aiming at adding semantic description to Web services, and solving problems of similarity calculations in Web services semantic annotation, an improved annotation method was developed: using similarities between WSDL and ontology to annotate services. The method improves similarity algorithms from two aspects: on one hand, the most-related concepts are filtered out according to name similarities between concepts so as to reduce the computational work; on the other, setting different weights to different sub-concepts to raise the accuracy of the structural similarity algorithm. Tests annotating dozens of WSDL in weather has an accuracy of 82.5%.","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":"114956268","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}
In order to prolong the lifetime of wireless sensor networks, this paper presents a multihop routing protocol with unequal clustering (MRPUC). On the one hand, cluster heads deliver the data to the base station with relay to reduce energy consumption. On the other hand, MRPUC uses many measures to balance the energy of nodes. First, it selects the nodes with more residual energy as cluster heads, and clusters closer to the base station have smaller sizes to preserve some energy during intra-cluster communication for inter-cluster packets forwarding. Second, when regular nodes join clusters, they consider not only the distance to cluster heads but also the residual energy of cluster heads. Third, cluster heads choose those nodes as relay nodes, which have minimum energy consumption for forwarding and maximum residual energy to avoid dying earlier. Simulation results show that MRPUC performs much better than similar protocols.
{"title":"Multihop Routing Protocol with Unequal Clustering for Wireless Sensor Networks","authors":"Bencan Gong, La-yuan Li, Shaorong Wang, Xuejun Zhou","doi":"10.1109/CCCM.2008.99","DOIUrl":"https://doi.org/10.1109/CCCM.2008.99","url":null,"abstract":"In order to prolong the lifetime of wireless sensor networks, this paper presents a multihop routing protocol with unequal clustering (MRPUC). On the one hand, cluster heads deliver the data to the base station with relay to reduce energy consumption. On the other hand, MRPUC uses many measures to balance the energy of nodes. First, it selects the nodes with more residual energy as cluster heads, and clusters closer to the base station have smaller sizes to preserve some energy during intra-cluster communication for inter-cluster packets forwarding. Second, when regular nodes join clusters, they consider not only the distance to cluster heads but also the residual energy of cluster heads. Third, cluster heads choose those nodes as relay nodes, which have minimum energy consumption for forwarding and maximum residual energy to avoid dying earlier. Simulation results show that MRPUC performs much better than similar protocols.","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":"126545261","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 studies the period doubling bifurcation in buck converters using harmonic balance. A dynamic model of a buck converter under voltage mode control is derived. An exact harmonic balance analysis is used to obtain a necessary condition for a period doubling bifurcation to occur and provide information on its exact location. Using the condition for bifurcation, a feedforward control scheme is designed to eliminate a period doubling bifurcation. The simulation results indicate that a wider operating range for the source voltage is achieved, along with output voltage regulation.
{"title":"Research of Period Doubling Bifurcation in PWM Buck DC-DC Converter Using Harmonic Balance","authors":"L. Wei, Zhang Jinbo","doi":"10.1109/CCCM.2008.142","DOIUrl":"https://doi.org/10.1109/CCCM.2008.142","url":null,"abstract":"This paper studies the period doubling bifurcation in buck converters using harmonic balance. A dynamic model of a buck converter under voltage mode control is derived. An exact harmonic balance analysis is used to obtain a necessary condition for a period doubling bifurcation to occur and provide information on its exact location. Using the condition for bifurcation, a feedforward control scheme is designed to eliminate a period doubling bifurcation. The simulation results indicate that a wider operating range for the source voltage is achieved, along with output voltage regulation.","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":"129875119","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 transformable model of EWDG (edge-weighted directed graph) and VWDG (vertex-weighted directed graph) is proposed to resolve the problem of weighted traversal patterns mining. Based on the model, an effective algorithm called GTCWFP miner (graph traversals-based closed weighted frequent patterns miner) is presented. The algorithm exploits a divide-and-conquer paradigm with a pattern growth method to mine closed frequent patterns with weight constraint from the traversals on directed graph. It incorporates the closure property with weight constrains to reduce effectively search space and extracts succinct and lossless patterns from graph traversal TDB. Experimental results of synthetic data show that the algorithm is an efficient and scalable algorithm for mining closed weighted frequent patterns based on graph traversals.
{"title":"Efficiently Mining Closed Frequent Patterns with Weight Constraint from Directed Graph Traversals Using Weighted FP-Tree Approach","authors":"Runian Geng, Xiangjun Dong, Xingye Zhang, Wenbo Xu","doi":"10.1109/CCCM.2008.393","DOIUrl":"https://doi.org/10.1109/CCCM.2008.393","url":null,"abstract":"In this paper, a transformable model of EWDG (edge-weighted directed graph) and VWDG (vertex-weighted directed graph) is proposed to resolve the problem of weighted traversal patterns mining. Based on the model, an effective algorithm called GTCWFP miner (graph traversals-based closed weighted frequent patterns miner) is presented. The algorithm exploits a divide-and-conquer paradigm with a pattern growth method to mine closed frequent patterns with weight constraint from the traversals on directed graph. It incorporates the closure property with weight constrains to reduce effectively search space and extracts succinct and lossless patterns from graph traversal TDB. Experimental results of synthetic data show that the algorithm is an efficient and scalable algorithm for mining closed weighted frequent patterns based on graph traversals.","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":"130108853","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}
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}
A major objective of supply chain management is to improve the performance of the whole supply chain. In a two-echelon supply chain of seasonal products controlled by a pure wholesale price contract, double marginalization can not be avoided. A wholesale price discount contract is introduced to improve the performance of the supply chain. By adjusting the contract parameters, the supplier can coordinate the supply chain and arbitrarily divide the total expected profit between the two supply chain members. All our findings are illustrated by a numerical example.
{"title":"A Two-Echelon Inventory Model for Seasonal Products under Demand Uncertainty","authors":"Jian-hu Cai, Gengui Zhou","doi":"10.1109/CCCM.2008.31","DOIUrl":"https://doi.org/10.1109/CCCM.2008.31","url":null,"abstract":"A major objective of supply chain management is to improve the performance of the whole supply chain. In a two-echelon supply chain of seasonal products controlled by a pure wholesale price contract, double marginalization can not be avoided. A wholesale price discount contract is introduced to improve the performance of the supply chain. By adjusting the contract parameters, the supplier can coordinate the supply chain and arbitrarily divide the total expected profit between the two supply chain members. All our findings are illustrated by a numerical example.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"146 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":"121891098","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
扫码关注我们
求助内容：
应助结果提醒方式：