2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)最新文献
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022735
W. Lai, Mei-Tso Lin
In vehicular ad hoc networks (VANETs), due to highly mobile and frequently changing topology, available resources and transmission opportunities are restricted. Transmitting frames efficiently within transmission opportunities is very important for system performance. Generally, there are many transmissions between many senders and receivers in a congested environment, which leads to network congestion and reduces transmission efficiency. To address this, we propose a burst transmission and frame aggregation (FAB) scheme to enhance transmission opportunity (TXOP) efficiency of IEEE 802.11p. The proposed scheme considers aggregation and TXOP techniques. Such techniques are useful for improving transmission performance. FAB aggregates frames in the relay node and utilizes the TXOP to transmit these frames to the next hop with a burst transmission. FAB also select multiple relay nodes to improve the efficiency of data forwarding if data is large and can not be forwarded by the node with the largest weight value. This FAB scheme increases transmission efficiency within one TXOP while decreasing transmission overheads. FAB can also support traffics with multiple classes. The proposed strategy is evaluated using various metrics such as end-to-end delays, collision rates, and transmission overheads. Simulation results show that the proposed FAB scheme can significantly improve the performance of inter-vehicle communications.
{"title":"Burst transmission and frame aggregation for inter-vehicle communications","authors":"W. Lai, Mei-Tso Lin","doi":"10.1109/SNPD.2017.8022735","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022735","url":null,"abstract":"In vehicular ad hoc networks (VANETs), due to highly mobile and frequently changing topology, available resources and transmission opportunities are restricted. Transmitting frames efficiently within transmission opportunities is very important for system performance. Generally, there are many transmissions between many senders and receivers in a congested environment, which leads to network congestion and reduces transmission efficiency. To address this, we propose a burst transmission and frame aggregation (FAB) scheme to enhance transmission opportunity (TXOP) efficiency of IEEE 802.11p. The proposed scheme considers aggregation and TXOP techniques. Such techniques are useful for improving transmission performance. FAB aggregates frames in the relay node and utilizes the TXOP to transmit these frames to the next hop with a burst transmission. FAB also select multiple relay nodes to improve the efficiency of data forwarding if data is large and can not be forwarded by the node with the largest weight value. This FAB scheme increases transmission efficiency within one TXOP while decreasing transmission overheads. FAB can also support traffics with multiple classes. The proposed strategy is evaluated using various metrics such as end-to-end delays, collision rates, and transmission overheads. Simulation results show that the proposed FAB scheme can significantly improve the performance of inter-vehicle communications.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957398","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022794
M. Fukumoto, Kota Nomura
Interactive evolutionary computation (IEC) is known as a method to optimize media contents suited to user's subjective feeling and preference. Previous IECs employed various evolutionary algorithms, and some of them applied Tabu Search (TS) algorithm: This method was named Interactive Tabu Search (ITS). In the ITS, users have to select the best individual from current population. ITS was often used for the area of computer graphics, and some previous studies applied ITS for creating fragrance. In these studies, blended fragrances composed of several aroma sources are corresponded to individuals in ITS. Adjusting intensity of each aroma source was target of optimization. Purpose of this study is to propose ITS that combines paired comparison in user's evaluation task and differential vector between the best individuals of different generations. The best individuals here mean that the best individuals in the current generation and in the previous generation. By combining these factors, we expect both of easy user's selection of the best individual and efficient search in searching fragrance. To investigate a fundamental efficiency of the proposed ITS, a smelling experiment was conducted. Target fragrance was a fragrance suited to a deodorant which has originally no fragrance.
{"title":"A proposal of interactive Tabu Search with paired comparison and differential vector for creating fragrance","authors":"M. Fukumoto, Kota Nomura","doi":"10.1109/SNPD.2017.8022794","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022794","url":null,"abstract":"Interactive evolutionary computation (IEC) is known as a method to optimize media contents suited to user's subjective feeling and preference. Previous IECs employed various evolutionary algorithms, and some of them applied Tabu Search (TS) algorithm: This method was named Interactive Tabu Search (ITS). In the ITS, users have to select the best individual from current population. ITS was often used for the area of computer graphics, and some previous studies applied ITS for creating fragrance. In these studies, blended fragrances composed of several aroma sources are corresponded to individuals in ITS. Adjusting intensity of each aroma source was target of optimization. Purpose of this study is to propose ITS that combines paired comparison in user's evaluation task and differential vector between the best individuals of different generations. The best individuals here mean that the best individuals in the current generation and in the previous generation. By combining these factors, we expect both of easy user's selection of the best individual and efficient search in searching fragrance. To investigate a fundamental efficiency of the proposed ITS, a smelling experiment was conducted. Target fragrance was a fragrance suited to a deodorant which has originally no fragrance.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124052174","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022747
K. Chanchio, Phithak Thaenkaew
Pre-copy live migration is a popular virtual machine (VM) live migration mechanism that has been used in most hypervisors. In this mechanism, a key parameter, namely the maximum tolerable downtime, is required for each migration. However, defining an appropriate value for this parameter is nontrivial, especially for the migration of a virtual machine running CPU-intensive and memory-intensive applications. If an inappropriate value is used, the migration may suffer poor performance. Time-bound Live Migration (TLM) is another live migration mechanism that was proposed to solve this problem. The TLM can operate automatically without the need for the maximum tolerable downtime. Thus, the operational burden and performance penalty due to the configuration of the maximum tolerable downtime are eliminated. The contributions of this study are two folds. First, a novel compression framework for TLM, namely TLMZ, is proposed. Second, the live migration performances of TLM and TLMZ are evaluated against those of the pre-copy mechanism. In our comparisons, the pre-copy mechanism was configured to operate using a range of maximum tolerable downtime values and a number of compression options. An extensive number of experiments have been conducted. In our experiments, the TLM, TLMZ, and pre-copy mechanisms are used to migrate VMs running four OpenMP NAS parallel benchmarks. Experimental results show that TLM and TLMZ are practical solutions for the migrations of VMs running CPU-intensive and memory-intensive applications.
预拷贝动态迁移是一种流行的虚拟机动态迁移机制，已在大多数管理程序中使用。在这种机制中，每次迁移都需要一个关键参数，即最大可容忍停机时间。然而，为这个参数定义一个适当的值是非常重要的，特别是对于运行cpu密集型和内存密集型应用程序的虚拟机的迁移。如果设置的值不合适，可能会影响迁移的性能。TLM (Time-bound Live Migration)是为解决这一问题而提出的另一种实时迁移机制。TLM可以自动运行，而不需要最大可容忍的停机时间。因此，消除了由于配置最大可容忍停机时间而造成的操作负担和性能损失。本研究的贡献有两个方面。首先，提出了一种新的TLM压缩框架，即TLMZ。其次，将TLM和TLMZ的实时迁移性能与预拷贝机制进行比较。在我们的比较中，预拷贝机制被配置为使用一系列最大可容忍停机时间值和许多压缩选项进行操作。已经进行了大量的实验。在我们的实验中，使用TLM、TLMZ和预复制机制来迁移运行四个OpenMP NAS并行基准的vm。实验结果表明，TLM和TLMZ是运行cpu密集型和内存密集型应用程序的虚拟机迁移的实用解决方案。
{"title":"Performance comparisons and data compression of time-bound live migration and pre-copy live migration of virtual machines","authors":"K. Chanchio, Phithak Thaenkaew","doi":"10.1109/SNPD.2017.8022747","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022747","url":null,"abstract":"Pre-copy live migration is a popular virtual machine (VM) live migration mechanism that has been used in most hypervisors. In this mechanism, a key parameter, namely the maximum tolerable downtime, is required for each migration. However, defining an appropriate value for this parameter is nontrivial, especially for the migration of a virtual machine running CPU-intensive and memory-intensive applications. If an inappropriate value is used, the migration may suffer poor performance. Time-bound Live Migration (TLM) is another live migration mechanism that was proposed to solve this problem. The TLM can operate automatically without the need for the maximum tolerable downtime. Thus, the operational burden and performance penalty due to the configuration of the maximum tolerable downtime are eliminated. The contributions of this study are two folds. First, a novel compression framework for TLM, namely TLMZ, is proposed. Second, the live migration performances of TLM and TLMZ are evaluated against those of the pre-copy mechanism. In our comparisons, the pre-copy mechanism was configured to operate using a range of maximum tolerable downtime values and a number of compression options. An extensive number of experiments have been conducted. In our experiments, the TLM, TLMZ, and pre-copy mechanisms are used to migrate VMs running four OpenMP NAS parallel benchmarks. Experimental results show that TLM and TLMZ are practical solutions for the migrations of VMs running CPU-intensive and memory-intensive applications.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125848380","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022750
P. Lavery, Takuo Watanabe
In this paper, we introduce a runtime monitoring method for Actor-based programs and present a Scala module that realizes the proposed method. The primary characteristic of our method is that it supports asynchronous message-passing based on the Actor model. Besides, the module does not require specialized languages for describing application properties to be monitored. Once a developer incorporates the module in his/her application, it continuously checks whether the application satisfies certain properties described as Scala code and invokes mitigation code when it finds the violation of the properties. This paper also provides two non-trivial use cases to illustrate how the module can be seamlessly integrated into actual modern Scala applications. We also demonstrate the efficiency of the module using a set of benchmarks that resulted in only 8% of the experiments causing more than 5% runtime overhead.
{"title":"An actor-based runtime monitoring system for web and desktop applications","authors":"P. Lavery, Takuo Watanabe","doi":"10.1109/SNPD.2017.8022750","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022750","url":null,"abstract":"In this paper, we introduce a runtime monitoring method for Actor-based programs and present a Scala module that realizes the proposed method. The primary characteristic of our method is that it supports asynchronous message-passing based on the Actor model. Besides, the module does not require specialized languages for describing application properties to be monitored. Once a developer incorporates the module in his/her application, it continuously checks whether the application satisfies certain properties described as Scala code and invokes mitigation code when it finds the violation of the properties. This paper also provides two non-trivial use cases to illustrate how the module can be seamlessly integrated into actual modern Scala applications. We also demonstrate the efficiency of the module using a set of benchmarks that resulted in only 8% of the experiments causing more than 5% runtime overhead.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128388035","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022650
L. Bacon
Society is facing a significant educational challenge in future, if predictions such as those around job automation are fully realised. However, whilst technology is transforming society at an ever increasing pace, little has changed at the heart of how we educate people, which will become increasingly important for reskilling and upskilling the population as they progress through multiple careers in their lifetime. This talk will look at the impact of technology on society and the consequent educational needs going forward. It will draw together lessons learned from recent research in mass education with research in the development of sophisticated intelligent training tools designed to provide realistic and engaging educational experiences, and discuss how these can be combined to provide engaging, immersive and just-in-time, online mass education.
{"title":"Intelligent and immersive systems for mass education: Keynote address","authors":"L. Bacon","doi":"10.1109/SNPD.2017.8022650","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022650","url":null,"abstract":"Society is facing a significant educational challenge in future, if predictions such as those around job automation are fully realised. However, whilst technology is transforming society at an ever increasing pace, little has changed at the heart of how we educate people, which will become increasingly important for reskilling and upskilling the population as they progress through multiple careers in their lifetime. This talk will look at the impact of technology on society and the consequent educational needs going forward. It will draw together lessons learned from recent research in mass education with research in the development of sophisticated intelligent training tools designed to provide realistic and engaging educational experiences, and discuss how these can be combined to provide engaging, immersive and just-in-time, online mass education.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129122041","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022777
M. Maeda, Hiroki Nomiya, Shota Sakaue, T. Hochin, Yukiko Nishizaki
Lifelog videos, which are the records of a person's daily life as video data, draw attention since various recording devices such as smartphone become widely used. Due to privacy reasons, lifelog videos are usually managed by the owners of the videos although the amount of video data is quite large. This makes it quite difficult to find interesting and impressive scenes from lifelog videos. In order to facilitate the retrieval of such scenes, we develop a video scene retrieval system for lifelog videos. We focus on emotional scenes as interesting scenes taking into consideration the strength of emotion derived from the intensity of facial expression. Our retrieval system thus displays emotional scenes of various intensity to users in a comprehensible way. We clarify the usability of the retrieval system through an evaluation experiment.
{"title":"Emotional video scene retrieval system for lifelog videos based on facial expression intensity","authors":"M. Maeda, Hiroki Nomiya, Shota Sakaue, T. Hochin, Yukiko Nishizaki","doi":"10.1109/SNPD.2017.8022777","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022777","url":null,"abstract":"Lifelog videos, which are the records of a person's daily life as video data, draw attention since various recording devices such as smartphone become widely used. Due to privacy reasons, lifelog videos are usually managed by the owners of the videos although the amount of video data is quite large. This makes it quite difficult to find interesting and impressive scenes from lifelog videos. In order to facilitate the retrieval of such scenes, we develop a video scene retrieval system for lifelog videos. We focus on emotional scenes as interesting scenes taking into consideration the strength of emotion derived from the intensity of facial expression. Our retrieval system thus displays emotional scenes of various intensity to users in a comprehensible way. We clarify the usability of the retrieval system through an evaluation experiment.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130833481","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022791
Kota Nomura, M. Fukumoto
In the area of product design, it is important that adding user's feelings on the products for emphasizing its value. Interactive Evolutionary Computation (IEC) is known as a method that searches optimal or better media contents suited for each user's feelings. In terms of expanding the ability of IEC, some recent studies applied IEC into problem of multiple users. This study aims to create music melody suited for multiple users' feelings by employing parallel Distributed Interactive Genetic Algorithm (DIGA). In this method, each of the users proceeds general Interactive Genetic Algorithm (IGA) process by evaluating solution candidates subjectively. In some generations, solution candidates are exchanged between the users. With the exchange, each of the users is affected by other users' feelings. As a result of these processes, obtaining good solution suited for all users. We conducted listening experiments for investigating efficiency of the DIGA for creation of music melody. Ten persons participated in the experiment as subjects, and pair of the subjects participated in the IGA task simultaneously. Experimental results show that higher fitness was obtained in the final generation, and similar melody was obtained through exchange of solutions. To clarify the efficiency of the exchange of the asynchronous method, further study with comparing experiment including conditions synchronous is needed.
{"title":"Asynchronous distributed interactive genetic algorithm for creating music melody reflecting multiple users' feelings","authors":"Kota Nomura, M. Fukumoto","doi":"10.1109/SNPD.2017.8022791","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022791","url":null,"abstract":"In the area of product design, it is important that adding user's feelings on the products for emphasizing its value. Interactive Evolutionary Computation (IEC) is known as a method that searches optimal or better media contents suited for each user's feelings. In terms of expanding the ability of IEC, some recent studies applied IEC into problem of multiple users. This study aims to create music melody suited for multiple users' feelings by employing parallel Distributed Interactive Genetic Algorithm (DIGA). In this method, each of the users proceeds general Interactive Genetic Algorithm (IGA) process by evaluating solution candidates subjectively. In some generations, solution candidates are exchanged between the users. With the exchange, each of the users is affected by other users' feelings. As a result of these processes, obtaining good solution suited for all users. We conducted listening experiments for investigating efficiency of the DIGA for creation of music melody. Ten persons participated in the experiment as subjects, and pair of the subjects participated in the IGA task simultaneously. Experimental results show that higher fitness was obtained in the final generation, and similar melody was obtained through exchange of solutions. To clarify the efficiency of the exchange of the asynchronous method, further study with comparing experiment including conditions synchronous is needed.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126812473","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022707
Bassey Isong, Tebogo Kgogo, Francis Lugayizi, Bennett Kankuzi
Software Defined Networks (SDNs) is a new network paradigm and is gaining significant attention in recent years. However, security remains a great challenge, though several improvements have been proposed. A key security challenge is the lack of trust between the SDN controller and the applications running atop the control plane. SDN controller can easily be attacked if these applications are malicious or compromised by an attacker to control the entire network or even result in network failure since it represents a single point of failure in the SDN. Though trust mechanisms to verify network devices exist, mechanisms to verify management applications are still not well developed. Therefore, this paper proposes a unique direct trust establishment framework between an OpenFlow-based SDN controller and the applications. The objective is to ensure that SDN controller is protected and multitude of applications that regularly consume network resources are always trusted throughout their lifetime. Additionally, the paper introduced the concept of trust access matrix and application identity to ensure efficient control of network resources. Based on its operation, if this proposed trust model is adopted in the OpenFlow architecture, it could go a long way to improve the security of the SDN and protect the controller.
{"title":"Trust establishment framework between SDN controller and applications","authors":"Bassey Isong, Tebogo Kgogo, Francis Lugayizi, Bennett Kankuzi","doi":"10.1109/SNPD.2017.8022707","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022707","url":null,"abstract":"Software Defined Networks (SDNs) is a new network paradigm and is gaining significant attention in recent years. However, security remains a great challenge, though several improvements have been proposed. A key security challenge is the lack of trust between the SDN controller and the applications running atop the control plane. SDN controller can easily be attacked if these applications are malicious or compromised by an attacker to control the entire network or even result in network failure since it represents a single point of failure in the SDN. Though trust mechanisms to verify network devices exist, mechanisms to verify management applications are still not well developed. Therefore, this paper proposes a unique direct trust establishment framework between an OpenFlow-based SDN controller and the applications. The objective is to ensure that SDN controller is protected and multitude of applications that regularly consume network resources are always trusted throughout their lifetime. Additionally, the paper introduced the concept of trust access matrix and application identity to ensure efficient control of network resources. Based on its operation, if this proposed trust model is adopted in the OpenFlow architecture, it could go a long way to improve the security of the SDN and protect the controller.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131285559","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022694
Mingchang Chih
This study proposes a novel particle swarm optimization (PSO) to solve the multidimensional knapsack problem (MKP). This novel PSO is composed of a new three-ratio self-adaptive check and repair operator (SACRO) idea and a hill-climbing local search scheme. The SACRO idea was first proposed in 2015 and originally utilized only two dynamic ratios (namely, profit/weight utility and profit density) in repairing infeasible solutions. The third unique pseudo-utility ratio (that is, the surrogate relaxation ratio) was further introduced into SACRO, and three ratios (namely, surrogate relaxation ratio, profit/weight utility, and profit density) were used instead of two ratios. A local search idea (that is, the hill-climbing scheme) was also employed to avoid being trapped in the local optimal solutions. The proposed algorithm was tested using the benchmark problems from the OR-library to validate and demonstrate the efficiency of the proposed idea. Results were compared with those of two-ratio SACRO-based algorithms. The simulation and evaluation results showed that the three-ratio SACRO-based PSO with local search scheme is more competitive and robust than the two-ratio SACRO-based algorithm. Moreover, the SACRO idea could be combined with other population-based optimization algorithms to solve MKPs.
{"title":"A three-ratio SACRO-based particle swarm optimization with local search scheme for the multidimensional knapsack problem","authors":"Mingchang Chih","doi":"10.1109/SNPD.2017.8022694","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022694","url":null,"abstract":"This study proposes a novel particle swarm optimization (PSO) to solve the multidimensional knapsack problem (MKP). This novel PSO is composed of a new three-ratio self-adaptive check and repair operator (SACRO) idea and a hill-climbing local search scheme. The SACRO idea was first proposed in 2015 and originally utilized only two dynamic ratios (namely, profit/weight utility and profit density) in repairing infeasible solutions. The third unique pseudo-utility ratio (that is, the surrogate relaxation ratio) was further introduced into SACRO, and three ratios (namely, surrogate relaxation ratio, profit/weight utility, and profit density) were used instead of two ratios. A local search idea (that is, the hill-climbing scheme) was also employed to avoid being trapped in the local optimal solutions. The proposed algorithm was tested using the benchmark problems from the OR-library to validate and demonstrate the efficiency of the proposed idea. Results were compared with those of two-ratio SACRO-based algorithms. The simulation and evaluation results showed that the three-ratio SACRO-based PSO with local search scheme is more competitive and robust than the two-ratio SACRO-based algorithm. Moreover, the SACRO idea could be combined with other population-based optimization algorithms to solve MKPs.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121856046","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}
Pub Date : 2017-06-01DOI: 10.1109/SNPD.2017.8022702
Kui Chen, H. Kanoh
In this paper, we propose a novel non-hybrid discrete firefly algorithm (DFA) for solving planar graph coloring problems. The original FA handles continuous optimization problems only. To apply it to discrete problems, we should redefined the original FA over discrete space. In this work, we introduce a new algorithm based on Similarity and discretize FA directly without any other hybrid algorithm. The experiments show that the proposed method outperforms the success rate of HDPSO and HDABC when solving planar graph coloring problems.
{"title":"A discrete firefly algorithm based on similarity for graph coloring problems","authors":"Kui Chen, H. Kanoh","doi":"10.1109/SNPD.2017.8022702","DOIUrl":"https://doi.org/10.1109/SNPD.2017.8022702","url":null,"abstract":"In this paper, we propose a novel non-hybrid discrete firefly algorithm (DFA) for solving planar graph coloring problems. The original FA handles continuous optimization problems only. To apply it to discrete problems, we should redefined the original FA over discrete space. In this work, we introduce a new algorithm based on Similarity and discretize FA directly without any other hybrid algorithm. The experiments show that the proposed method outperforms the success rate of HDPSO and HDABC when solving planar graph coloring problems.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128131791","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
扫码关注我们
求助内容：
应助结果提醒方式：