The growing number of Web services has greatly placed pressure on discovering Web services. It is a very desiderate to solve the problem how we can discover Web services accurately. The paper proposes a method based on service composition by describing Web services with OWLS. We firstly analyzed the process model of the service. Then, we make matchmaking and return the result to the requester. Compared with the algorithms based on service profile, it has made use of the process model and taken the composition and repeating execution of Web services into consideration, which can discover the services accurately .The effectiveness of the algorithm is proved by us with experiment.
{"title":"A Web service discovery algorithm based on dynamic composition","authors":"Fu-cun Zhang, Yan Wang, L. Wang","doi":"10.1109/SNPD.2007.400","DOIUrl":"https://doi.org/10.1109/SNPD.2007.400","url":null,"abstract":"The growing number of Web services has greatly placed pressure on discovering Web services. It is a very desiderate to solve the problem how we can discover Web services accurately. The paper proposes a method based on service composition by describing Web services with OWLS. We firstly analyzed the process model of the service. Then, we make matchmaking and return the result to the requester. Compared with the algorithms based on service profile, it has made use of the process model and taken the composition and repeating execution of Web services into consideration, which can discover the services accurately .The effectiveness of the algorithm is proved by us with experiment.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127170915","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}
Fault-tolerance is an important property of conference key distribution protocol. Recently, Yang et al. proposed an identity-based fault-tolerant conference key distribution scheme which is much different to the traditional ones. But their scheme can not withstand passive attack and modification attack, moreover, it also can not provide forward security. An improved identity-based fault-tolerant conference key distribution scheme is proposed in this paper. Compared with the Yang et al. 's scheme, Tzeng's (2002) scheme and Xun's scheme, the new scheme has illustrated the highest security and its communication cost is intervenient Yang et al. 's scheme and Tzeng's (2002) scheme. As security is the first-line property in conference key establishment protocol, our scheme is the most practical one in the mass.
{"title":"An Improved Identity-based Fault-tolerant Conference Key Distribution Scheme","authors":"Yongquan Cai, Xiuying Li","doi":"10.1109/SNPD.2007.262","DOIUrl":"https://doi.org/10.1109/SNPD.2007.262","url":null,"abstract":"Fault-tolerance is an important property of conference key distribution protocol. Recently, Yang et al. proposed an identity-based fault-tolerant conference key distribution scheme which is much different to the traditional ones. But their scheme can not withstand passive attack and modification attack, moreover, it also can not provide forward security. An improved identity-based fault-tolerant conference key distribution scheme is proposed in this paper. Compared with the Yang et al. 's scheme, Tzeng's (2002) scheme and Xun's scheme, the new scheme has illustrated the highest security and its communication cost is intervenient Yang et al. 's scheme and Tzeng's (2002) scheme. As security is the first-line property in conference key establishment protocol, our scheme is the most practical one in the mass.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127509225","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 the embedded real-time image processing system, moving mini point target was detected and tracked. The self-adaptive threshold division and corresponding matching method were employed to detect the moving target and restrain the background noise. And with the memory extrapolate image processing method, the sheltered target was tracked. According to the requirement of image data and algorithm complexity, the simulation was realized on TMS320DM642 board based on TI Company. The results show CPU utilization rate is 83.3%, which could satisfy the real-time requirement, and the image output is smooth with high reliability.
{"title":"Infrared Point Target Detection and Tracking Based on DSP","authors":"Zhao Hong-wei, Zhang Xiao-lin, Qi Yi-ming","doi":"10.1109/SNPD.2007.319","DOIUrl":"https://doi.org/10.1109/SNPD.2007.319","url":null,"abstract":"In the embedded real-time image processing system, moving mini point target was detected and tracked. The self-adaptive threshold division and corresponding matching method were employed to detect the moving target and restrain the background noise. And with the memory extrapolate image processing method, the sheltered target was tracked. According to the requirement of image data and algorithm complexity, the simulation was realized on TMS320DM642 board based on TI Company. The results show CPU utilization rate is 83.3%, which could satisfy the real-time requirement, and the image output is smooth with high reliability.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125684337","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 is devoted to study existence of multiple periodic positive solutions for a class of nonautonomous functional differential equations with impulse actions at fixed moments. The main results here is established by employing the theory of fixed point index in cones.
{"title":"The existence of periodic solutions for a class impulsive differential equations","authors":"Yanping Guo, Wei Xiang, Xiujun Liu","doi":"10.1109/SNPD.2007.157","DOIUrl":"https://doi.org/10.1109/SNPD.2007.157","url":null,"abstract":"This paper is devoted to study existence of multiple periodic positive solutions for a class of nonautonomous functional differential equations with impulse actions at fixed moments. The main results here is established by employing the theory of fixed point index in cones.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130564480","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 improve personal data security in the electronic commerce, and to avoid information exposing of personal privacy, personal data was used as the encrypted principle, applying homomorphism and random perturbation to strengthen personal data security. This paper analyze the usage of personal data in electronic commerce firstly, then discuss the P3P to realize security of personal data. This mechanism cannot guarantee that Web sites do act according to their policies once they have obtained user's personal data. In light of this, a new algorithm was used to acquire improved security. The proposed algorithm uses homomorphism as principle to preserve privacy. This method can make the important data to be appeared with secret content in the web service, and prevent personal data from being misused. The simulation results proved that the modified method can protect personal privacy effectively, and can carry on data mining to provide the characteristic service for the customer, and modified method has shorter response time.
{"title":"A Modified Model for Private Data Security Facing E-commerce","authors":"Chunyong Yin, Jianshi Li, Ruxia Sun","doi":"10.1109/SNPD.2007.10","DOIUrl":"https://doi.org/10.1109/SNPD.2007.10","url":null,"abstract":"In order to improve personal data security in the electronic commerce, and to avoid information exposing of personal privacy, personal data was used as the encrypted principle, applying homomorphism and random perturbation to strengthen personal data security. This paper analyze the usage of personal data in electronic commerce firstly, then discuss the P3P to realize security of personal data. This mechanism cannot guarantee that Web sites do act according to their policies once they have obtained user's personal data. In light of this, a new algorithm was used to acquire improved security. The proposed algorithm uses homomorphism as principle to preserve privacy. This method can make the important data to be appeared with secret content in the web service, and prevent personal data from being misused. The simulation results proved that the modified method can protect personal privacy effectively, and can carry on data mining to provide the characteristic service for the customer, and modified method has shorter response time.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131658923","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}
How to eliminate redundant communications is a key issue in developing parallelizing compilers for distributed memory machines. An important way to improve the performance of the code generated by parallelizing compiler in distributed memory systems is to eliminate as much communications as possible. This paper investigates algorithms for generating communications code from previously published work and modifies them to eliminate redundant communications. Based on the mathematical model of symbolic coefficient linear inequalities the revisited formal specification of communications sets are presented and the corresponding improved algorithms are given. Experimental results indicate that the new algorithms can reduce communication messages and improve the performance of parallelized code significantly.
{"title":"Eliminating Redundant Communication of Code Generation for Distributed Memory Machines","authors":"Yanan Shen, Rongcai Zhao, Lei Wang","doi":"10.1109/SNPD.2007.482","DOIUrl":"https://doi.org/10.1109/SNPD.2007.482","url":null,"abstract":"How to eliminate redundant communications is a key issue in developing parallelizing compilers for distributed memory machines. An important way to improve the performance of the code generated by parallelizing compiler in distributed memory systems is to eliminate as much communications as possible. This paper investigates algorithms for generating communications code from previously published work and modifies them to eliminate redundant communications. Based on the mathematical model of symbolic coefficient linear inequalities the revisited formal specification of communications sets are presented and the corresponding improved algorithms are given. Experimental results indicate that the new algorithms can reduce communication messages and improve the performance of parallelized code significantly.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121339274","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}
The close-opening or open-closing filter based on the morphological filters with the same size structuring element cannot remove all the positive or negative impulse noise effectively. To improve the performance of these two kinds of filter, the generalized close- opening and open-closing filter based on the morphological filter with the different size structuring element are put forward. Based on the generalized morphological filter, this paper suggests a kind of designing project of the filter that applies a new structuring element to the generalized morphological filter. The theoretical analysis and the simulation experiments of the image processing indicate that this kind of filter can not only remove noise effectively but also keep the details of the image sufficiently.
{"title":"Filter Design Based on the Theory of the Generalized Morphological Filter with Omnidirectional Structuring Element","authors":"Zhang Xiang-guang, Liu Yun, Wang Chuan-xu","doi":"10.1109/SNPD.2007.443","DOIUrl":"https://doi.org/10.1109/SNPD.2007.443","url":null,"abstract":"The close-opening or open-closing filter based on the morphological filters with the same size structuring element cannot remove all the positive or negative impulse noise effectively. To improve the performance of these two kinds of filter, the generalized close- opening and open-closing filter based on the morphological filter with the different size structuring element are put forward. Based on the generalized morphological filter, this paper suggests a kind of designing project of the filter that applies a new structuring element to the generalized morphological filter. The theoretical analysis and the simulation experiments of the image processing indicate that this kind of filter can not only remove noise effectively but also keep the details of the image sufficiently.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121535873","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 improved heuristic attribute reduction algorithm based on the attribute frequency is presented. After analyzing many other attribute reduction algorithms, we utilize the discernibility matrix and the appeared attribute frequencies to determine each attribute's significance, based on the principle of maximum attribute frequency, we achieved the reduction of the information system. An illustrative example demonstrate the algorithm's effectiveness and validity.
{"title":"An Improved Attribute Reduction Algorithm Based on Rough Set","authors":"X. Yang, Jiancheng Wan, Ling Zhang","doi":"10.1109/SNPD.2007.181","DOIUrl":"https://doi.org/10.1109/SNPD.2007.181","url":null,"abstract":"An improved heuristic attribute reduction algorithm based on the attribute frequency is presented. After analyzing many other attribute reduction algorithms, we utilize the discernibility matrix and the appeared attribute frequencies to determine each attribute's significance, based on the principle of maximum attribute frequency, we achieved the reduction of the information system. An illustrative example demonstrate the algorithm's effectiveness and validity.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122241670","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}
Ad hoc networks are characterized with frequent link failures and network topology change. These features result in a great challenge to transmit video over ad hoc networks. We propose a novel scheme for robust video transmission over ad hoc networks. Video stream is coded by using multiple description coding strategy and then a clustering-based multiple paths algorithm is applied for routing over ad hoc networks. The paper describes the general issues of multiple description coding and the principle of clustering-based multiple paths algorithm. Simulation results clearly demonstrate the effectiveness of this scheme for supporting error resilient video transmission over ad hoc networks.
Ad hoc网络的特点是链路故障频繁，网络拓扑结构多变。这些特点给在自组织网络上传输视频带来了巨大的挑战。我们提出了一种在自组织网络上实现鲁棒视频传输的新方案。首先采用多描述编码策略对视频流进行编码，然后采用基于聚类的多路径算法在ad hoc网络上进行路由。本文介绍了多描述编码的一般问题和基于聚类的多路径算法的原理。仿真结果清楚地证明了该方案在支持自组织网络上的容错视频传输方面的有效性。
{"title":"Video Transmission over Ad Hoc Networks Using Multiple Description Coding and Clustering-based Multiple Paths","authors":"Yuan Chen, Sheng-sheng Yu, Jing-li Zhou, Jun Fan","doi":"10.1109/SNPD.2007.580","DOIUrl":"https://doi.org/10.1109/SNPD.2007.580","url":null,"abstract":"Ad hoc networks are characterized with frequent link failures and network topology change. These features result in a great challenge to transmit video over ad hoc networks. We propose a novel scheme for robust video transmission over ad hoc networks. Video stream is coded by using multiple description coding strategy and then a clustering-based multiple paths algorithm is applied for routing over ad hoc networks. The paper describes the general issues of multiple description coding and the principle of clustering-based multiple paths algorithm. Simulation results clearly demonstrate the effectiveness of this scheme for supporting error resilient video transmission over ad hoc networks.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126037502","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}
Li Wang, Zhitang Li, Jie Ma, Yang-ming Ma, Aifang Zhang
The amount of security application products connected to the Internet increased so dramatically that they usually generate huge volumes of security audit data. Therefore, it is important to develop an advanced alert correlation system that can reduce data redundancy and provide effective direction. This paper describes the framework, SATA, for Security Alerts and Threats analysis. Using SATA, raw audit data is firstpreprocessed into hi-alerts, which are refined and verified as true threat. We further analyze the correlation-ship of real-time hi-alerts to achieve the goal of online attack plan recognition. A key contribution of the paper is thus in automatic "multistage attack plan recognition". It also solves the problem of detecting novel multi-stage attacks. Experiment shows our approach can effectively correlate multi-stage attack behaviors and identify true attack threats.
{"title":"Automatic attack plan recognition from intrusion alerts","authors":"Li Wang, Zhitang Li, Jie Ma, Yang-ming Ma, Aifang Zhang","doi":"10.1109/SNPD.2007.396","DOIUrl":"https://doi.org/10.1109/SNPD.2007.396","url":null,"abstract":"The amount of security application products connected to the Internet increased so dramatically that they usually generate huge volumes of security audit data. Therefore, it is important to develop an advanced alert correlation system that can reduce data redundancy and provide effective direction. This paper describes the framework, SATA, for Security Alerts and Threats analysis. Using SATA, raw audit data is firstpreprocessed into hi-alerts, which are refined and verified as true threat. We further analyze the correlation-ship of real-time hi-alerts to achieve the goal of online attack plan recognition. A key contribution of the paper is thus in automatic \"multistage attack plan recognition\". It also solves the problem of detecting novel multi-stage attacks. Experiment shows our approach can effectively correlate multi-stage attack behaviors and identify true attack threats.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"26 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126050598","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
扫码关注我们
求助内容：
应助结果提醒方式：