{"title":"A Braess’s Paradox Inspired Method for Enhancing the Robustness of Air Traffic Networks","authors":"Qing Cai, S. Alam, Haojie Ang, V. Duong","doi":"10.1109/SSCI47803.2020.9308452","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308452","url":null,"abstract":"Air traffic networks (ATNs) play an important role in air transport. It is of practical application values to improve the robustness of ATNs. Here we propose a counter-intuitive idea with the inspiration comes from the Braess’s Paradox phenomenon. To be specific, we propose to delete edges from an ATN to improve its corresponding robustness. To achieve this goal, we formulate a bi-objective optimization problem which aims to maximize the robustness of the focal ATN as well as to minimize the number of edges to be removed. In order to address the developed optimization model, we introduce the nondominated sorting genetic algorithm (NSGA-II) and modify its algorithm operators to make it fit for the established model. To check if the research idea proposed works or not, we conduct experiments on nine real-world ATNs. In the experiments, NSGAII has been compared against its successor–NSGA-III, and another state-of-the-art optimization algorithm named MODPSO. Experiments indicate that NSGA-II performs better than the rest two algorithms on the tested ATNs. For the tested ATNs, three networks have their robustness improved by 100% by removing less than six edges while the remaining six get an improvement of around 10%. This work provides aviation decision makers with a new perspective on ATNs design and management.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116175413","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}
T. Shivangi, M. Rahimi, G. Gargiulo, B. Kailath, T. J. Hamilton
{"title":"A Silicon Neuron-based Bio-Front-End for Ultra Low Power Bio-Monitoring at the Edge","authors":"T. Shivangi, M. Rahimi, G. Gargiulo, B. Kailath, T. J. Hamilton","doi":"10.1109/SSCI47803.2020.9308445","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308445","url":null,"abstract":"This paper presents the circuits for an edge-based bio-front-end implemented using an integrate-and-fire silicon neuron model in 22nm SOI CMOS Technology. The proposed implementation encodes both positive and negative input signals separately and, like its biological counterpart, provides asynchronous output. This asynchronous output allows for maximum sensitivity to high-information content input signals and low sensitivity for low-information content. In the proposed design, the firing rate can be controlled by an adaptation circuit to achieve maximum power savings. We demonstrate this design with a sinusoidal test signal and pre-recorded ECG signals. The proposed design achieves ultra-low-power consumption; by applying a sinusoidal input and ECG input the power consumption without adaptation (with adaptation) is 4. 069SnW(3.999nW) and 5. 1529nW (3.311SnW), respectively. In addition, the reconstruction of the ECG signal is demonstrated and the signal to error for the reconstructed ECG signal is 30.2 dB.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116499898","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}
{"title":"Wavelet-based denoising for EEG-based pattern recognition systems","authors":"Binh Nguyen, Wanli Ma, D. Tran, Younjin Chung","doi":"10.1109/SSCI47803.2020.9308421","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308421","url":null,"abstract":"Electroencephalogram (EEG) has been widely studied for EEG-based pattern recognition systems such as seizure, sleep stage, emotion, alcoholics and person recognitions. However, EEG signals are subject to noise and artifacts, which negatively affects to the pattern recognition systems. Hence, an effective EEG denoising technique is becoming necessary. In this paper, we propose an EEG denoising technique in which noisy signals are decomposed by a Wavelet transform operation, followed by Thresholding component using Energy Packing Efficiency, before being reconstructed to obtain the clean signals. The experiments are conducted on two EEG public datasets and the results show that our proposed technique achieves good performance on denoising EEG signals and improves EEG-based pattern recognition systems the most.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114830666","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}
{"title":"Designing Card Game Strategies with Genetic Programming and Monte-Carlo Tree Search: A Case Study of Hearthstone","authors":"Hao-Cheng Chia, Tsung-Su Yeh, T. Chiang","doi":"10.1109/SSCI47803.2020.9308459","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308459","url":null,"abstract":"This paper addresses an agent design problem of a digital collectible card game, Hearthstone, which is a two-player turn-based game. The agent has to play cards based on the game state, the hand cards, and the deck of cards to defeat the opponent. First, we design a rule-based agent by searching for the board evaluation criterion through genetic programming (GP). Then, we integrate the rule-based agent into the Monte-Carlo tree search (MCTS) framework to generate an advanced agent. Performance of the proposed agents are verified by playing against three participants in two recent Hearthstone competitions. Experimental results showed that the GP-agent can beat a simple MCTS agent and the mid-level agent in the competition. The MCTS-GP agent showed competitive performance against the best agents in the competition. We also examine the rule found by GP and observed that GP is able to identify key attributes of game states and to combine them into a useful rule automatically.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321846","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}
{"title":"A Ripple Spreading Algorithm for Free-Flight Route Optimization in Dynamical Airspace","authors":"Hang Zhou, Xiao-Bing Hu","doi":"10.1109/SSCI47803.2020.9308357","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308357","url":null,"abstract":"To resolve the problem of insufficient air routes in the near future, the concept of free flight gives a new solution that all aircraft are allowed to fly their optimal routes. This promising approach would improve the current economic, environmental and safety problems of civil aviation operations. In this paper, a ripple spreading algorithm is proposed for optimizing the aircraft free-flight route in a dynamical airspace. First, the problem description and a mathematical model are presented. Moving adverse weather areas, restricted zones, and time-variant airflow characteristics are taken into account in the airspace. Second, a ripple spreading algorithm adapted to a dynamically weighted network is introduced. The optimal flight route can be achieved by a single run of this efficient method. Finally, a numerical experiment is performed to show the effectiveness of the reported method in optimizing the free-flight route in a given complex dynamical airspace.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431068","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}
{"title":"Objective Comparison and Selection in Mono- and Multi-Objective Evolutionary Neurocontrollers","authors":"I. Showalter, H. Schwartz","doi":"10.1109/SSCI47803.2020.9308403","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308403","url":null,"abstract":"Often in multi-objective problems, several elemental objectives are combined into compound objectives by using auxiliary equations to reduce these problems to just one or two objectives. Reducing the number of objectives simplifies the problem into a more easily optimized mono-objective problem, or for multi-objective problems, reduces the Pareto front to a few dimensions for easy analysis. Here, multi-objective evolutionary neurocontrollers with both compound and elemental objectives are compared to a mono-objective evolutionary neurocontroller. The goal of this research is to compare the effectiveness of individual elemental and compound objective effectiveness, and not directly compare mono- and multi-objectivity. The effectiveness of each of the objectives is determined through a series of experiments using a previously demonstrated Lamarckian-inherited neuromodulated evolutionary neurocontroller. The evolved neurocontrollers operate a simulated vehicle pursuing a basic evader vehicle in the pursuit-evasion game. Both vehicles are subject to the effects of mass and drag. It is shown that under certain circumstances, binary objectives can be unsuitable choices as objectives, and that it can be more effective to use multi-objective solutions than to combine elemental objective problems into mono-objective problems by auxiliary functions. It is also shown that the obvious choice of objective may not be the most effective choice.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127712104","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}
Akihiro Yorita, S. Egerton, Carina Chan, N. Kubota
{"title":"Chatbot for Peer Support Realization based on Mutual Care","authors":"Akihiro Yorita, S. Egerton, Carina Chan, N. Kubota","doi":"10.1109/SSCI47803.2020.9308277","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308277","url":null,"abstract":"In this paper we build a chatbot as part of a stress management framework that aims to help professionals in the health care sector manage their occupational stress. Our framework employs chatbots and robots to conduct conversations with individuals in order to derive a measure of their stress using a Sense of Coherence (SOC) model and then provide support depending on the calculated SOC value. Our framework can deliver different types of support to individuals, in this paper we present the care-receiving support type which is based on helper theory. Experiments are carried out with a smartphone based chatbot which is developed using the LINE chatbot platform, allowing our chatbot to be accessed easily by either Android or Apple devices.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122264017","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}
{"title":"Survey on Copyright Laws about Music Generated by Artificial Intelligence","authors":"M. Makhmutov, Selina Varouqa, J. A. Brown","doi":"10.1109/SSCI47803.2020.9308449","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308449","url":null,"abstract":"This paper observes existing legislation in the USA and other countries in the field of copyrights for computergenerated music and fine arts in general. Also, this work provides results of the survey aimed at determining the opinions of various countries citizens about authorship and copyrights to music generated by artificial intelligence. Further examined is the correspondence between the current state of laws and expectations and opinions of people. As a result, this research forms recommendations for computer-generated music copyright laws of countries, as mentioned earlier.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130040260","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}
{"title":"Multi-label Classification Based on Adaptive Resonance Theory","authors":"Naoki Masuyama, Y. Nojima, C. Loo, H. Ishibuchi","doi":"10.1109/SSCI47803.2020.9308356","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308356","url":null,"abstract":"This paper proposes a multi-label classification algorithm based on an algorithm adaptation approach by applying the Adaptive Resonance Theory (ART) and the Bayesian approach for a label association process. In the proposed algorithm, the prior probability and likelihood are updated sequentially. Moreover, an ART-based clustering algorithm continually extracts useful information for multi-label classification, and holds the extracted information on prototype nodes generated by the clustering algorithm. Thanks to the above properties, the proposed algorithm can continually learn multi-label data. Our experimental results in this paper show that the proposed algorithm has better classification performance compared to typical multi-label classification algorithms.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134591283","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}
{"title":"(Energy) Policies Can Be Complicated: So Be Careful With Your Simulators!","authors":"Eric Austin, J. Denzinger","doi":"10.1109/SSCI47803.2020.9308546","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308546","url":null,"abstract":"We present an Evolutionary Algorithm for testing the quality of policy simulators that also can be used for using the simulator for decision support. Our focus is on a simulator for energy policies for the Canadian province of Alberta. Our results show that the simulator works rather well in regard to its predictions of the environmental consequences of policies but seems to have serious flaws regarding its economic predictions.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131551894","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}