It is in general more difficult to test a concurrent program than a sequential program, as different programming language provide different implementations of concurrency mechanism. For instance, Java language implements concurrency by using multi-thread. Therefore, we should have corresponding way to test multithreaded Java programs. In this article, an approach of reachability testing based on extended synchronization sequence is proposed to test Java multithread programs: a kind of Java multi-thread flow diagram is constructed at first, all extended synchronization sequences are computed based on some prefixes secondly, and the deterministic testing is performed based on extended synchronization sequence finally. The validity of the approach is showed by some cases analysis.
{"title":"On Testing Multi-threaded Java Programs","authors":"Xufang Gong, Yancheng Wang, Ying Zhou, Bixin Li","doi":"10.1109/SNPD.2007.165","DOIUrl":"https://doi.org/10.1109/SNPD.2007.165","url":null,"abstract":"It is in general more difficult to test a concurrent program than a sequential program, as different programming language provide different implementations of concurrency mechanism. For instance, Java language implements concurrency by using multi-thread. Therefore, we should have corresponding way to test multithreaded Java programs. In this article, an approach of reachability testing based on extended synchronization sequence is proposed to test Java multithread programs: a kind of Java multi-thread flow diagram is constructed at first, all extended synchronization sequences are computed based on some prefixes secondly, and the deterministic testing is performed based on extended synchronization sequence finally. The validity of the approach is showed by some cases analysis.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"1 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":"130285312","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}
F. Shao, Gang Chen, Lihua Yu, Yijun Bei, Jinxiang Dong
With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching.
{"title":"Bitmap Filtering: An Efficient Speedup Method for XML Structural Matching","authors":"F. Shao, Gang Chen, Lihua Yu, Yijun Bei, Jinxiang Dong","doi":"10.1109/SNPD.2007.376","DOIUrl":"https://doi.org/10.1109/SNPD.2007.376","url":null,"abstract":"With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching.","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":"134093091","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 traditional intrusion detection system has the disadvantages of alert flooding and high false positive due to weak collaboration-awareness. The collaborative intrusion detection mechanism is advocated to overcome shortcomings of traditional IDS and alert verification and correlation are two important techniques to perform collaborative mechanisms. The goal of alert verification is to distinguish the false positives from true positives or confirm the confidence of the alert by integrating context information of protected network with alerts. In this paper, we present an alert verification scheme based on attack classification to achieve the objectives of low cost and high efficiency of verification process.
{"title":"Alert Verification Based on Attack Classification in Collaborative Intrusion Detection","authors":"Min Xiao, Debao Xiao","doi":"10.1109/SNPD.2007.216","DOIUrl":"https://doi.org/10.1109/SNPD.2007.216","url":null,"abstract":"The traditional intrusion detection system has the disadvantages of alert flooding and high false positive due to weak collaboration-awareness. The collaborative intrusion detection mechanism is advocated to overcome shortcomings of traditional IDS and alert verification and correlation are two important techniques to perform collaborative mechanisms. The goal of alert verification is to distinguish the false positives from true positives or confirm the confidence of the alert by integrating context information of protected network with alerts. In this paper, we present an alert verification scheme based on attack classification to achieve the objectives of low cost and high efficiency of verification process.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"29 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":"133677285","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 combination of cellular networks with wireless ad-hoc networks composed of cognitive radio (CR) enabled terminals can not only address the inherent capacity and coverage limitations, but also increase the spectrum utilization as a result of opportunistic spectrum usage characterized by cognitive radio. In this paper, the network environment is referred to as CR-MANET, including location management, network handoff, spectrum handoff where the traditional concept of mobility management is largely extended. After several anticipatory challenges facing the CR-MANET being brought forward in this paper, an appropriate model for cooperative and cross-layer design is proposed. Finally, the main open research issues for efficient spectrum handoff and network mobility management are analyzed detail, which include spectrum handoff and performance optimization, location areas management, location update and paging, network handoff and QoS guarantee.
{"title":"Extended Mobility Management Challenges over Cellular Networks combined with Cognitive Radio by using Multi-hop Network","authors":"Xiuhua Fu, Wen’an Zhou, Junli Xu, Junde Song","doi":"10.1109/SNPD.2007.172","DOIUrl":"https://doi.org/10.1109/SNPD.2007.172","url":null,"abstract":"The combination of cellular networks with wireless ad-hoc networks composed of cognitive radio (CR) enabled terminals can not only address the inherent capacity and coverage limitations, but also increase the spectrum utilization as a result of opportunistic spectrum usage characterized by cognitive radio. In this paper, the network environment is referred to as CR-MANET, including location management, network handoff, spectrum handoff where the traditional concept of mobility management is largely extended. After several anticipatory challenges facing the CR-MANET being brought forward in this paper, an appropriate model for cooperative and cross-layer design is proposed. Finally, the main open research issues for efficient spectrum handoff and network mobility management are analyzed detail, which include spectrum handoff and performance optimization, location areas management, location update and paging, network handoff and QoS guarantee.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"1 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":"133248027","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}
Presently, most target detection post-processing algorithms are short of self-adapting, which make them have many limitations in automatic target detection from the digital images. Therefore this paper provides a new type of automatic target detection post-processing algorithm (CASI) which adopts clustering algorithm based on swarm intelligence to post-process the detected target pixels. Because of the characteristics of self-organization, robustness, expandability and simplicity, CASI can self-adaptively restore the target pixels, divide them into different targets and delete the false alarm targets. Experimental results conform that the target detection post-processing effect of this new type of algorithm is much better than the ones of morphological transformation in common use.
{"title":"An Automatic Target Detection Post-Processing Algorithm Based on Swarm Intelligence","authors":"Chen Zhuo, Liu Xiangshuang, Zhu Xiaodong","doi":"10.1109/SNPD.2007.142","DOIUrl":"https://doi.org/10.1109/SNPD.2007.142","url":null,"abstract":"Presently, most target detection post-processing algorithms are short of self-adapting, which make them have many limitations in automatic target detection from the digital images. Therefore this paper provides a new type of automatic target detection post-processing algorithm (CASI) which adopts clustering algorithm based on swarm intelligence to post-process the detected target pixels. Because of the characteristics of self-organization, robustness, expandability and simplicity, CASI can self-adaptively restore the target pixels, divide them into different targets and delete the false alarm targets. Experimental results conform that the target detection post-processing effect of this new type of algorithm is much better than the ones of morphological transformation in common use.","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":"128864198","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 novel method based on support vector machine for coal thickness prediction through seismic attribute technology is proposed in this paper. Based on SVM which embodies the structural risk minimization principle, the proposed method is more generalized in performance and accurate than artificial neural network which embodies the embodies risk minimization principle. In order to improve prediction accuracy, grid search and cross-validation are integrated in this paper to select SIM parameter. Error analysis of predicting coal thickness is carried out to prove that SIM could achieve greater accuracy than the BP neural network.
{"title":"Coal Thickness Prediction Based on Support Vector Machine Regression","authors":"ZhengWei Li, Shixiong Xia, Niuqiang, Zhanguo Xia","doi":"10.1109/SNPD.2007.226","DOIUrl":"https://doi.org/10.1109/SNPD.2007.226","url":null,"abstract":"A novel method based on support vector machine for coal thickness prediction through seismic attribute technology is proposed in this paper. Based on SVM which embodies the structural risk minimization principle, the proposed method is more generalized in performance and accurate than artificial neural network which embodies the embodies risk minimization principle. In order to improve prediction accuracy, grid search and cross-validation are integrated in this paper to select SIM parameter. Error analysis of predicting coal thickness is carried out to prove that SIM could achieve greater accuracy than the BP neural network.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"76 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":"115378865","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}
Sensor networks have recently gained a lot of attention from the research community. To ensure scalability sensor networks are often partitioned into clusters, each managed by a cluster head. Since sensors self organize in the form of clusters within a hierarchal wireless sensor network, it is necessary for a sensor node to perform target tracking cooperating with a set of sensors that belong to another cluster. The increased flexibility allows for efficient and optimized use of sensor nodes. While most of the previous research focused on the optimal communication of sensors in one cluster, very little attention has been paid to the efficiency of cooperation among the clusters. This paper proposes a heuristic algorithm of designing optimal structure across clusters to allow the inter-cluster flow of communication and resource sharing under reliability constraints. Such a guarantee simultaneously provides fault tolerance against node failures and high capacity through multi-path routing.
{"title":"Optimal Cluster-Cluster Design for Sensor Network with Guaranteed Capacity and Fault Tolerance","authors":"B. Zeng, Jun Wei, Tao Hu","doi":"10.1109/SNPD.2007.225","DOIUrl":"https://doi.org/10.1109/SNPD.2007.225","url":null,"abstract":"Sensor networks have recently gained a lot of attention from the research community. To ensure scalability sensor networks are often partitioned into clusters, each managed by a cluster head. Since sensors self organize in the form of clusters within a hierarchal wireless sensor network, it is necessary for a sensor node to perform target tracking cooperating with a set of sensors that belong to another cluster. The increased flexibility allows for efficient and optimized use of sensor nodes. While most of the previous research focused on the optimal communication of sensors in one cluster, very little attention has been paid to the efficiency of cooperation among the clusters. This paper proposes a heuristic algorithm of designing optimal structure across clusters to allow the inter-cluster flow of communication and resource sharing under reliability constraints. Such a guarantee simultaneously provides fault tolerance against node failures and high capacity through multi-path routing.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"34 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":"115427975","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}
Reputation systems are designed for reducing the risk entailed in interactions among total strangers in electronic marketplaces. Such systems can be used to collect and aggregate feedback on the past behavior of participants in electronic transactions, so as to derive reputation scores assumed to predict likely future behavior. Privacy and incentive are mainly concerns in secure reputation systems for feedback providers to providing rating. In this paper, a reputation system is proposed, in which, feedback providers ' privacy can be achieved through anonymous technique by using smart card, incentive for feedback provider to provide rating can be achieved through discount token technique by using hash chain.
{"title":"A Reputation System with Privacy and Incentive","authors":"Yang Bo, Zhou Min, Li Guohuan","doi":"10.1109/SNPD.2007.91","DOIUrl":"https://doi.org/10.1109/SNPD.2007.91","url":null,"abstract":"Reputation systems are designed for reducing the risk entailed in interactions among total strangers in electronic marketplaces. Such systems can be used to collect and aggregate feedback on the past behavior of participants in electronic transactions, so as to derive reputation scores assumed to predict likely future behavior. Privacy and incentive are mainly concerns in secure reputation systems for feedback providers to providing rating. In this paper, a reputation system is proposed, in which, feedback providers ' privacy can be achieved through anonymous technique by using smart card, incentive for feedback provider to provide rating can be achieved through discount token technique by using hash chain.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"29 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":"123912938","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 formulates a pattern search method for nonlinear programming. A distributed parallel algorithm is given based on the pattern search method by distributing the direction to every processor. Promising experimental results of the distributed parallel pattern method are obtained on a sixteen-machines cluster system by running the environment MPI.
{"title":"Distributed Parallel Algorithm For Nonlinear OptimizationWithout Derivatives","authors":"Congying Han, G. He, Huanqing Cui, Xuping Zhang","doi":"10.1109/SNPD.2007.105","DOIUrl":"https://doi.org/10.1109/SNPD.2007.105","url":null,"abstract":"This paper formulates a pattern search method for nonlinear programming. A distributed parallel algorithm is given based on the pattern search method by distributing the direction to every processor. Promising experimental results of the distributed parallel pattern method are obtained on a sixteen-machines cluster system by running the environment MPI.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"108 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":"124238001","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 concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks.
{"title":"Perfect Concurrent Signature Protocol","authors":"Zhenjie Huang, Rufen Huang, Xuanzhi Lin","doi":"10.1109/SNPD.2007.366","DOIUrl":"https://doi.org/10.1109/SNPD.2007.366","url":null,"abstract":"The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"116 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":"124266259","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
扫码关注我们
求助内容：
应助结果提醒方式：