2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)最新文献_第4页

Burst transmission and frame aggregation for inter-vehicle communications 车辆间通信的突发传输和帧聚合

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022735

W. Lai, Mei-Tso Lin

{"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}

引用次数: 0

A proposal of interactive Tabu Search with paired comparison and differential vector for creating fragrance 一种基于配对比较和差分向量的交互式禁忌搜索香味生成方法

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022794

M. Fukumoto, Kota Nomura

{"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}

引用次数: 0

Performance comparisons and data compression of time-bound live migration and pre-copy live migration of virtual machines 虚拟机定时热迁移和预拷贝热迁移的性能比较和数据压缩

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022747

K. Chanchio, Phithak Thaenkaew

{"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}

引用次数: 4

An actor-based runtime monitoring system for web and desktop applications 一个基于参与者的运行时监控系统，用于web和桌面应用程序

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022750

P. Lavery, Takuo Watanabe

引用次数: 5

Intelligent and immersive systems for mass education: Keynote address 面向大众教育的智能和沉浸式系统:主题演讲

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022650

L. Bacon

引用次数: 0

Emotional video scene retrieval system for lifelog videos based on facial expression intensity 基于面部表情强度的生活日志视频情感场景检索系统

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022777

M. Maeda, Hiroki Nomiya, Shota Sakaue, T. Hochin, Yukiko Nishizaki

引用次数: 4

Asynchronous distributed interactive genetic algorithm for creating music melody reflecting multiple users' feelings 异步分布式交互式遗传算法，用于创建反映多个用户感受的音乐旋律

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022791

Kota Nomura, M. Fukumoto

{"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}

引用次数: 3

Trust establishment framework between SDN controller and applications SDN控制器与应用程序之间建立信任框架

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022707

Bassey Isong, Tebogo Kgogo, Francis Lugayizi, Bennett Kankuzi

{"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}

引用次数: 12

A three-ratio SACRO-based particle swarm optimization with local search scheme for the multidimensional knapsack problem 基于三比saco的粒子群局部搜索算法求解多维背包问题

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022694

Mingchang Chih

{"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}

引用次数: 1

A discrete firefly algorithm based on similarity for graph coloring problems 基于相似度的离散萤火虫算法求解图着色问题

2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2017-06-01 DOI: 10.1109/SNPD.2017.8022702

Kui Chen, H. Kanoh

引用次数: 9