Wireless Sensor Network (WSN) is a real-time monitor network [1]. It can sense and collect environmental information within the network or monitor objects. These data are processed to obtain detailed and accurate information. Research focusing on Wireless Sensor Network is routing, positioning technology, energy control and security guarantees. Routing technology is the basis for other research directions, and now a lot of routing algorithms have been proposed. This paper is based on the needs of the small transmission delay. The Minimum Hop Routing (MHR) algorithm is studied. MHR algorithm is mainly based on the node updating the routing table, so as to build each routing table, so as to build a path from source node to destination node. MHR has the advantage of network delay is small, but MHR also has shortcomings-with the data transmission, some path will soon run out of energy, the death of some nodes will depart the network into several parts, reduce network connecting. In order to solve the problem, this paper presents an improved minimum hop routing algorithm. First, sensor nodes are randomly distributed by region, Second, selecting the maximum energy node as the target node for transmission. Through analysis and experiment the approach has effectively reduced the transmission hops, and compared with the Flooding, the node energy consumption has increased.
{"title":"Improved Minimum Hop Routing Protocol in WSN","authors":"Yankun Li, M. Zhu, H. Qu, N. Wang, Y. Song","doi":"10.1109/SNPD.2012.130","DOIUrl":"https://doi.org/10.1109/SNPD.2012.130","url":null,"abstract":"Wireless Sensor Network (WSN) is a real-time monitor network [1]. It can sense and collect environmental information within the network or monitor objects. These data are processed to obtain detailed and accurate information. Research focusing on Wireless Sensor Network is routing, positioning technology, energy control and security guarantees. Routing technology is the basis for other research directions, and now a lot of routing algorithms have been proposed. This paper is based on the needs of the small transmission delay. The Minimum Hop Routing (MHR) algorithm is studied. MHR algorithm is mainly based on the node updating the routing table, so as to build each routing table, so as to build a path from source node to destination node. MHR has the advantage of network delay is small, but MHR also has shortcomings-with the data transmission, some path will soon run out of energy, the death of some nodes will depart the network into several parts, reduce network connecting. In order to solve the problem, this paper presents an improved minimum hop routing algorithm. First, sensor nodes are randomly distributed by region, Second, selecting the maximum energy node as the target node for transmission. Through analysis and experiment the approach has effectively reduced the transmission hops, and compared with the Flooding, the node energy consumption has increased.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133968693","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}
STP Spanning Tree Protocol as an important method to prevent broadcast storms since the 1985 proposed by Radia Perlem, has been widely used. This paper presents anew technology named DVSP-open flow. Compare STP and the STP improved version, this technology can be can be forward data packets dynamic by using Open Flow support switches. This method separates the forward rules and control rules and the network with this method will be able to collect real-time network information and create a virtual switch pool to manager Data forward path, achieve the ability to forward the packet to reach the network to dynamically control Open Flow switch. The technology can effectively suppress network storms, and be able to reduce the packet forwarding delay.
{"title":"Dynamic Virtual Switch Protocol Using Openflow","authors":"Miao Tang, Qiaochu Lv, Zheng Lu, Qi Zhao, Y. Song","doi":"10.1109/SNPD.2012.129","DOIUrl":"https://doi.org/10.1109/SNPD.2012.129","url":null,"abstract":"STP Spanning Tree Protocol as an important method to prevent broadcast storms since the 1985 proposed by Radia Perlem, has been widely used. This paper presents anew technology named DVSP-open flow. Compare STP and the STP improved version, this technology can be can be forward data packets dynamic by using Open Flow support switches. This method separates the forward rules and control rules and the network with this method will be able to collect real-time network information and create a virtual switch pool to manager Data forward path, achieve the ability to forward the packet to reach the network to dynamically control Open Flow switch. The technology can effectively suppress network storms, and be able to reduce the packet forwarding delay.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134544819","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}
Jianfei Zhang, Zhiyi Fang, Hyung Jae Chang, S. Zheng
In the previous papers, we presented a new mesh of trees based switch architecture, denoted as MOTS (N) switch, along with its variations IMOTS (N) and IMOTS-CT (N) switches. The analysis and simulation results were presented that all of them achieve 100% throughput and the mean cell delay of IMOTS-CT (N) is comparable to that of OQ switch with FIFO queues (FIFO-OQ). Especially, IMOTS-CT (N) was proposed for a way to reduce mean cell delay of IMOTS (N). In this paper, we propose advanced IMOTS (N), denoted as AIMOTS (N), with token based scheduling algorithm of it. It shows a way to reduce hardware complexity of IMOTS (N) and IMOTS-CT (N). Quantitative simulation results are presented to compare AMOTS (N) switch with others.
{"title":"Token Based Scheduling Algorithm for Advanced IMOTS(N) Switch Architecture","authors":"Jianfei Zhang, Zhiyi Fang, Hyung Jae Chang, S. Zheng","doi":"10.1109/SNPD.2012.133","DOIUrl":"https://doi.org/10.1109/SNPD.2012.133","url":null,"abstract":"In the previous papers, we presented a new mesh of trees based switch architecture, denoted as MOTS (N) switch, along with its variations IMOTS (N) and IMOTS-CT (N) switches. The analysis and simulation results were presented that all of them achieve 100% throughput and the mean cell delay of IMOTS-CT (N) is comparable to that of OQ switch with FIFO queues (FIFO-OQ). Especially, IMOTS-CT (N) was proposed for a way to reduce mean cell delay of IMOTS (N). In this paper, we propose advanced IMOTS (N), denoted as AIMOTS (N), with token based scheduling algorithm of it. It shows a way to reduce hardware complexity of IMOTS (N) and IMOTS-CT (N). Quantitative simulation results are presented to compare AMOTS (N) switch with others.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121408572","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}
Testing the GUI (Graphical User Interface) of a software application is typically accomplished by developing a GUI test script composed of sequences of events and assertions. A GUI test script is in a sense similar to the source code of a program, since events and assertions are like source-code statements, which are executed line by line. Therefore, like source code, a GUI test script may have bad smells, and refactoring is an effective technique that can eradicate bad smells, making the script better and easier to maintain. This paper studies the bad smells a GUI test script may have and the refactoring methods that can be applied to remove the bad smells. A total of 11 bad smells are identified and 16 refactoring methods are proposed. The refactoring methods have been implemented in a GUI testing tool, called GTT, to support the automatic refactoring of GUI test scripts.
{"title":"Bad Smells and Refactoring Methods for GUI Test Scripts","authors":"Woei-Kae Chen, Jung-Chi Wang","doi":"10.1109/SNPD.2012.10","DOIUrl":"https://doi.org/10.1109/SNPD.2012.10","url":null,"abstract":"Testing the GUI (Graphical User Interface) of a software application is typically accomplished by developing a GUI test script composed of sequences of events and assertions. A GUI test script is in a sense similar to the source code of a program, since events and assertions are like source-code statements, which are executed line by line. Therefore, like source code, a GUI test script may have bad smells, and refactoring is an effective technique that can eradicate bad smells, making the script better and easier to maintain. This paper studies the bad smells a GUI test script may have and the refactoring methods that can be applied to remove the bad smells. A total of 11 bad smells are identified and 16 refactoring methods are proposed. The refactoring methods have been implemented in a GUI testing tool, called GTT, to support the automatic refactoring of GUI test scripts.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116662017","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}
By analyzing the basic principle of Otsu method and its application in image segmentation, and according to the distribution characteristics of the target and background, an improved threshold image segmentation algorithm based on the Otsu method is developed. By narrowing the selection range of threshold and searching the minimum variance ratio, the improved algorithm selects the optimal threshold. Through the compared with the Otsu method and other methods, the results show that the new improved algorithm has these advantages such as high segmentation precision and fast computation speed.
{"title":"An Improved Image Segmentation Algorithm Based on the Otsu Method","authors":"Mengxing Huang, Wenjiao Yu, Donghai Zhu","doi":"10.1109/SNPD.2012.26","DOIUrl":"https://doi.org/10.1109/SNPD.2012.26","url":null,"abstract":"By analyzing the basic principle of Otsu method and its application in image segmentation, and according to the distribution characteristics of the target and background, an improved threshold image segmentation algorithm based on the Otsu method is developed. By narrowing the selection range of threshold and searching the minimum variance ratio, the improved algorithm selects the optimal threshold. Through the compared with the Otsu method and other methods, the results show that the new improved algorithm has these advantages such as high segmentation precision and fast computation speed.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117109353","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}
Recently, data stream has become popular in many contexts of data mining. Due to the high amount of incoming data, traditional clustering algorithms are not suitable for this family of problems. Many data stream clustering algorithms proposed in recent years considered the scalability of data, but most of them did not attend the following issues: (1) The quality of clustering can be dramatically low over the time. (2) Some of the algorithms cannot handle arbitrary shapes of data stream and consequently the results are limited to specific regions. (3) Most of the algorithms have not been evaluated in multi-density environments. Identifying appropriate clusters for data stream by handling the arbitrary shapes of clusters is the aim of this paper. The gist of the overall approach in this paper can be stated in two phases. In online phase, data manipulate with specific data structure called micro cluster. This phase is activated by incoming of data. The offline phase is manually activated by coming a request from user. The algorithm handles clusters by considering with micro clusters created by the online phase. The experimental evaluation showed that proposed algorithm has suitable quality and also returns appropriate results even in multi-density environments.
{"title":"DSCLU: A New Data Stream Clustring Algorithm for Multi Density Environments","authors":"A. Namadchian, Gholamreza Esfandani","doi":"10.1109/SNPD.2012.119","DOIUrl":"https://doi.org/10.1109/SNPD.2012.119","url":null,"abstract":"Recently, data stream has become popular in many contexts of data mining. Due to the high amount of incoming data, traditional clustering algorithms are not suitable for this family of problems. Many data stream clustering algorithms proposed in recent years considered the scalability of data, but most of them did not attend the following issues: (1) The quality of clustering can be dramatically low over the time. (2) Some of the algorithms cannot handle arbitrary shapes of data stream and consequently the results are limited to specific regions. (3) Most of the algorithms have not been evaluated in multi-density environments. Identifying appropriate clusters for data stream by handling the arbitrary shapes of clusters is the aim of this paper. The gist of the overall approach in this paper can be stated in two phases. In online phase, data manipulate with specific data structure called micro cluster. This phase is activated by incoming of data. The offline phase is manually activated by coming a request from user. The algorithm handles clusters by considering with micro clusters created by the online phase. The experimental evaluation showed that proposed algorithm has suitable quality and also returns appropriate results even in multi-density environments.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114334046","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}
Recently, it becomes common to handle large files in computers. However, we have a difficulty to realize file sharing over networks, especially for large files. The problem is that we have extended the system model designed decades ago based on a stand-alone computer model. Assuming that all files are located in data centers, and nobody accesses them at the sites, we can redesign the file sharing system model for higher access speed and efficient storage resource usage. We designed a global secure file sharing system called Content Espresso. In this paper, we describe the difficulty, the design goal for global secure file sharing system, and our approach for it. Finally, we explain the impact of Content Espresso on network.
{"title":"Content Espresso: A Global Secure Large File Sharing System for Media Industries","authors":"K. Kaneko, Daisuke Ando, F. Teraoka","doi":"10.1109/SNPD.2012.126","DOIUrl":"https://doi.org/10.1109/SNPD.2012.126","url":null,"abstract":"Recently, it becomes common to handle large files in computers. However, we have a difficulty to realize file sharing over networks, especially for large files. The problem is that we have extended the system model designed decades ago based on a stand-alone computer model. Assuming that all files are located in data centers, and nobody accesses them at the sites, we can redesign the file sharing system model for higher access speed and efficient storage resource usage. We designed a global secure file sharing system called Content Espresso. In this paper, we describe the difficulty, the design goal for global secure file sharing system, and our approach for it. Finally, we explain the impact of Content Espresso on network.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114367504","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 paper reports some new variants of gradient ascent type in learning SVMs. The theoretical development is presented in the third section of the paper. The performance analysis of the proposed variants, in terms of recognition accuracy and generalization capacity, is experimentally evaluated and the results are presented and commented in the final part of the paper.
{"title":"Heuristic Attempts to Improve the Generalization Capacities in Learning SVMs","authors":"L. State, C. Cocianu, Marinela Mircea","doi":"10.1109/SNPD.2012.37","DOIUrl":"https://doi.org/10.1109/SNPD.2012.37","url":null,"abstract":"The paper reports some new variants of gradient ascent type in learning SVMs. The theoretical development is presented in the third section of the paper. The performance analysis of the proposed variants, in terms of recognition accuracy and generalization capacity, is experimentally evaluated and the results are presented and commented in the final part of the paper.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126896871","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}
Weizhi Xu, Hao Zhang, Shuai Jiao, Da Wang, Fenglong Song, Zhiyong Liu
It is an important task to tune performance for sparse matrix vector multiplication (SpMV), but it is also a difficult task because of its irregularity. In this paper, we propose a cache blocking method to improve the performance of SpMV on the emerging GPU architecture. The sparse matrix is partitioned into many sub-blocks, which are stored in CSR format. With the blocking method, the corresponding part of vector x can be reused in the GPU cache, so the time spent on accessing the global memory for vector x is reduced heavily. Experimental results on GeForce GTX 480 show that SpMV kernel with the cache blocking method is 5x faster than the unblocked CSR kernel in the best case.
{"title":"Optimizing Sparse Matrix Vector Multiplication Using Cache Blocking Method on Fermi GPU","authors":"Weizhi Xu, Hao Zhang, Shuai Jiao, Da Wang, Fenglong Song, Zhiyong Liu","doi":"10.1109/SNPD.2012.20","DOIUrl":"https://doi.org/10.1109/SNPD.2012.20","url":null,"abstract":"It is an important task to tune performance for sparse matrix vector multiplication (SpMV), but it is also a difficult task because of its irregularity. In this paper, we propose a cache blocking method to improve the performance of SpMV on the emerging GPU architecture. The sparse matrix is partitioned into many sub-blocks, which are stored in CSR format. With the blocking method, the corresponding part of vector x can be reused in the GPU cache, so the time spent on accessing the global memory for vector x is reduced heavily. Experimental results on GeForce GTX 480 show that SpMV kernel with the cache blocking method is 5x faster than the unblocked CSR kernel in the best case.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127653343","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}
Multi-core processors are becoming widely deployed in computer systems. While improving the performance of applications with multi-core technology, multi-core CPUs consume more power than a single-core one. We propose a power saving technique for multi-core systems based on the observation of critical sections in multi-threaded applications. First, since only one thread on a core can enter into a critical section for a shared resource, other threads on other cores that would access the same resource would run into busy waiting state. Hence the frequency of those idle cores could be minimized to reduce energy wastages without degrading overall applications' performance. Secondly, the accurate engage/disengage timing of a critical section could be detected by matching particular byte code patterns before a thread actually enters into a critical section. Thus the frequency of busy waiting cores could be tuned in advance. Based on these findings, the power-saving technique of critical sections is proposed and implemented. With the experiments of five multi-threaded Java benchmarks, the proposed power-saving technique leads to good energy savings (11 to 15 percent) with lower values of Energy Delay Product as compared to the other power-saving techniques.
{"title":"Smart Energy Management of Multi-threaded Java Applications on Multi-core Processors","authors":"Fuh-Gwo Chen, Kuo-Yi Chen, Jr-Shian Chen, Chi-Chen Shui","doi":"10.1109/SNPD.2012.66","DOIUrl":"https://doi.org/10.1109/SNPD.2012.66","url":null,"abstract":"Multi-core processors are becoming widely deployed in computer systems. While improving the performance of applications with multi-core technology, multi-core CPUs consume more power than a single-core one. We propose a power saving technique for multi-core systems based on the observation of critical sections in multi-threaded applications. First, since only one thread on a core can enter into a critical section for a shared resource, other threads on other cores that would access the same resource would run into busy waiting state. Hence the frequency of those idle cores could be minimized to reduce energy wastages without degrading overall applications' performance. Secondly, the accurate engage/disengage timing of a critical section could be detected by matching particular byte code patterns before a thread actually enters into a critical section. Thus the frequency of busy waiting cores could be tuned in advance. Based on these findings, the power-saving technique of critical sections is proposed and implemented. With the experiments of five multi-threaded Java benchmarks, the proposed power-saving technique leads to good energy savings (11 to 15 percent) with lower values of Energy Delay Product as compared to the other power-saving techniques.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114395707","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
扫码关注我们
求助内容：
应助结果提醒方式：