发布求助
文献互助 智能选刊 最新文献

2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)最新文献

筛选
英文 中文
Optimization of the Retardance in Citrate Coated Ferrofluids Using Integrated Genetic-Sequential Quadratic Programming Technique 基于遗传序列二次规划的柠檬酸盐包覆铁磁流体缓速优化研究
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654799
Jing-Fung Lin
{"title":"Optimization of the Retardance in Citrate Coated Ferrofluids Using Integrated Genetic-Sequential Quadratic Programming Technique","authors":"Jing-Fung Lin","doi":"10.1109/ISCMI53840.2021.9654799","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654799","url":null,"abstract":"The citrate (citric acid, CA) coated ferrofluids with great magneto-optical retardance could meet the highly magnetic responsive demand, especially in their potential biomedical applications such as hyperthermia and magnetic resonance imaging. In this study, the measured retardances are based on Taguchi method with nine tests for four parameters, including pH of suspension, molar ratio of CA to Fe3O4, CA volume, and coating temperature. Three optimization algorithms including sequential quadratic programming (SQP), genetic algorithm (GA) and integrated GA-SQP are executed to obtain high retardance. Five initial points chosen from the orthogonal test are input into the SQP, the GA is applied to the regression equation, and while executing the integrated GA-SQP algorithm, the parametric combination obtained by GA is adopted as the initial point in the SQP simulation. The global optimum retardance and the corresponding parameter values are effectively assured by the global search ability of a GA and the ability of local searching by using SQP.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125093944","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
Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems 基于增强蚁群优化的混合量子近似优化求解大规模组合优化问题
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654824
Bishad Ghimire, A. Mahmood, K. Elleithy
{"title":"Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems","authors":"Bishad Ghimire, A. Mahmood, K. Elleithy","doi":"10.1109/ISCMI53840.2021.9654824","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654824","url":null,"abstract":"Quantum computing is a promising technology that may provide breakthrough solutions to today’s difficult problems such as breaking encryption and solving large-scale combinatorial optimization problems. A class of algorithms referred to as Quantum Approximate Optimization Algorithm (QAOA) have been recently proposed. QAOA attempts to approximately solve hard problems using a protocol know as bang-bang. The technique is based on the unitary evolution using a Hamiltonian encoding of the objective function of the combinatorial optimization problem. QAOA has been explored in the context of several optimization problems such as Max-Cut problem, variational Eigenvalue problem etc. Recently, attempts have been made to create QAOA for the Traveling Salesman Problem (TSP). Due to small node size and limited solution capability of the currently available Quantum computers and/or simulators, we develop a hybrid approach where subgraphs of a TSP tour are executed on a Quantum computer and the results from the quantum optimization are combined in further optimization of the whole tour. Since the local optimization of a subgraph is prone to getting stuck in a local minima, we overcome this problem by using a parallel Ant Colony Optimization Algorithm with periodic pheromone exchange between colonies. Our results are encouraging and yield optimum results for benchmarks with less than 50 nodes, and usually within 1% of the optimal solution for benchmarks with around 200 nodes.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126746331","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
powerGhosts & defensiveGhosts – Enhanced Ghost Team Controller based on Ant Colony Optimization for Ms. Pac-Man powerhosts & defenveghosts -基于蚁群优化的增强型吃豆人鬼队控制器
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654859
Timothy Applewhite, R. Kaufmann, Rolf Dornberger, T. Hanne
{"title":"powerGhosts & defensiveGhosts – Enhanced Ghost Team Controller based on Ant Colony Optimization for Ms. Pac-Man","authors":"Timothy Applewhite, R. Kaufmann, Rolf Dornberger, T. Hanne","doi":"10.1109/ISCMI53840.2021.9654859","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654859","url":null,"abstract":"This paper presents an improved controller based on Ant Colony Optimization for the ghost team of Ms. Pac-Man. The controller is an enhanced version of fairGhosts which is based on the ghostAnt framework. Various improvements were implemented in terms of parameters and concepts. Especially for the explorer ants, fairGhosts uses a simplified version, as the exact reasoning for the proposed concepts could not be determined in the ghostAnt framework. In this paper, two new types of ghost teams are proposed after the modifications were conducted: powerGhosts and defensiveGhosts. powerGhosts take into account the power pill aspect for stopping criteria and solution quality of the explorer ants, and defensiveGhosts additionally involve a threshold of Ms. Pac-Man’s distance to the nearest power pill for the hunter ants, so as not to be caught easily. Test results show that the powerGhosts version shows on average 15% better results than the initial fairGhosts setup, while defensiveGhosts performs equal or slightly worse than the initial implementation. It can be concluded that including the power pill aspect in the explorer ants concept shows an improved performance of the ghost team. On the other hand, the concept of distancing ghosts from Ms. Pac-Man when she is near a power pill did not result in any significant improvement.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129248561","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
Air Quality Index Analysis of Indian Cities During COVID-19 Using Machine Learning Models: A Comparative Study 使用机器学习模型分析COVID-19期间印度城市空气质量指数:一项比较研究
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654925
Lopamudra Hota, P. Dash, Kshira Sagar Sahoo, A. Gandomi
{"title":"Air Quality Index Analysis of Indian Cities During COVID-19 Using Machine Learning Models: A Comparative Study","authors":"Lopamudra Hota, P. Dash, Kshira Sagar Sahoo, A. Gandomi","doi":"10.1109/ISCMI53840.2021.9654925","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654925","url":null,"abstract":"Rapid urbanisation has led to degradation in air quality index in past decades caused by pollutants generated by factories, industries and transportation. Designing an automated system for air quality tracking and monitoring is essential for generating awareness. Restrictions imposed by COVID 19 lockdown has resulted in the degradation of pollutants in air and having a great impact on air pollution management. An analysis of air pollution index based on vehicular pollutants and industrial pollutants is done, depicting the most polluted cities in India. Various machine learning models are compared so, as to figure out a better model for classification and analysis. Results delineate that Delhi was one of the most polluted cities before lockdown but shown a tremendous decrease in air pollution index after lockdown. Further boosting models proved to outperform other models in the prediction and forecasting of air quality index.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"386 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132374298","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}
引用次数: 2
Examination of Fairness in Scheduling Tasks with Heterogeneous Resources 异构资源调度任务公平性研究
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654963
Szilvia Erdős, B. Kővári
{"title":"Examination of Fairness in Scheduling Tasks with Heterogeneous Resources","authors":"Szilvia Erdős, B. Kővári","doi":"10.1109/ISCMI53840.2021.9654963","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654963","url":null,"abstract":"The question of fairness has been raised in many different areas, e.g. in decision support systems, legal issues or economics. In scheduling tasks, it is not easy to know when scheduling can be called fair.We have examined previous rostering approaches to this issue, and experience shows no general formulation of fairness. Different task-specific solutions are used, or equity is defined for more straightforward, homogeneous resource scheduling. In practice, however, more complex assignments of heterogeneous groups are more common.There is also a need for a more general formulation of fairness in scheduling issues. In order to answer this, we give a basic concept for heterogeneous resources, taking into account disjoint and non-disjoint skill-sets.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130821881","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
Cuckoo Search Algorithm and K-Means for IFS Reconstruction of Fractal Colored Images 分形彩色图像IFS重构的布谷鸟搜索算法与K-Means
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654830
A. Gálvez, S. Deb, Iztok Fister, Andrés Iglesias
{"title":"Cuckoo Search Algorithm and K-Means for IFS Reconstruction of Fractal Colored Images","authors":"A. Gálvez, S. Deb, Iztok Fister, Andrés Iglesias","doi":"10.1109/ISCMI53840.2021.9654830","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654830","url":null,"abstract":"Fractal image reconstruction through iterated function systems (IFS) is a very hot topic of research. Yet, existing methods have focused exclusively on binary or gray level images, and the case of colored images has been largely ignored so far. This paper aims to tackle this issue for colored fractal images by coupling a swarm intelligence method called cuckoo search algorithm and k-means clustering. To show the performance of the method, an illustrative example is discussed in detail. The numerical and graphical results show that the method is effective and very promising, as it is able to recover both the geometry and color of the input fractal image, but it still yields sub-optimal solutions to this problem and should be further improved.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133658138","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
Lane-Level Matching Algorithm Based on GNSS, IMU and Map Data 基于GNSS、IMU和地图数据的车道级匹配算法
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654917
Julian Kreibich, Frederic Brenner, M. Lienkamp
{"title":"Lane-Level Matching Algorithm Based on GNSS, IMU and Map Data","authors":"Julian Kreibich, Frederic Brenner, M. Lienkamp","doi":"10.1109/ISCMI53840.2021.9654917","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654917","url":null,"abstract":"High-precision map services are an indispensable basis of many innovative in-vehicle applications. Safety and comfort can be improved even further by inputting contextual information, such as road surface. Correct allocation requires lane-accurate vehicle localization. This paper presents a novel algorithm for lane-level map-matching that integrates a global navigation satellite system, an inertial measurement unit, and map data. The implemented algorithm consists of five consecutive modules: map generation, sensor-data pre-processing, road assignment, maneuver recognition, and information fusion. The approach was tested over a total distance of 245 km, involving 237 lane changes, within the metropolitan area of Munich. A total accuracy of 82% correctly classified lanes was achieved in test drives recorded with smartphones. Both the implementation and part of the data set of this paper are publicly available (https://github.com/TUMFTM/Lane_Level_Matching).","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117227747","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
Relegation-Based League Championship Algorithm 基于降级的联赛冠军算法
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654822
Sandarbh Yadav, P. Singh
{"title":"Relegation-Based League Championship Algorithm","authors":"Sandarbh Yadav, P. Singh","doi":"10.1109/ISCMI53840.2021.9654822","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654822","url":null,"abstract":"Classical optimization techniques often prove insufficient in case of large scale combinatorial problems and non-linear problems. Consequently, heuristic based optimization techniques have been introduced. Recently, a novel metaheuristic named league championship algorithm (LCA) has been proposed for global optimization in continuous search space. LCA is a population based algorithm which mimics a sports league with a fixed number of teams. These teams, denoting solutions, compete against each other according to a predetermined schedule and the winner is determined on the basis of playing strength of the teams. The formations of the teams keep on improving throughout the season and at the end an optimal solution is obtained. Since, its inception, LCA has been employed for solving many optimization problems. However, there are few limitations of LCA in form of premature convergence and slow convergence rate. This paper attempts to overcome the shortcomings of LCA by proposing relegation based LCA which incorporates the concept of relegation into the original LCA. Comparative experiments have been performed on 10 different test functions and promising results are obtained. Additionally, a study is also done to investigate the impact of control parameters on the performance of relegation based LCA.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116256542","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
Further Stability and L2-Gain Conditions for Sampled-Data Systems 采样数据系统的进一步稳定性和l2增益条件
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654906
Ramasamy Saravanakumar
{"title":"Further Stability and L2-Gain Conditions for Sampled-Data Systems","authors":"Ramasamy Saravanakumar","doi":"10.1109/ISCMI53840.2021.9654906","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654906","url":null,"abstract":"This paper studies stability and ${mathcal{L}_2}$-gain analysis of sampled-data systems. Finsler’s lemma and free-matrix-based integral inequality (FMBII) are employed to solve the integral term in the derivative of looped functional. Based on new looped-functional, an improved stability conditions in the form of linear matrix inequalities (LMIs) are derived using the FMBII. The benefit of this technique is mainly used in reducing the conservatism and is verified based on numerical examples. Five numerical examples are given to demonstrate the validity and superiority of the proposed methods.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132857468","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
Dynamic Co-attention Network for Visual Question Answering 视觉问答的动态共注意网络
2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI) Pub Date : 2021-11-26 DOI: 10.1109/ISCMI53840.2021.9654812
Doaa B. Ebaid, Magda M. Madbouly, A. El-Zoghabi
{"title":"Dynamic Co-attention Network for Visual Question Answering","authors":"Doaa B. Ebaid, Magda M. Madbouly, A. El-Zoghabi","doi":"10.1109/ISCMI53840.2021.9654812","DOIUrl":"https://doi.org/10.1109/ISCMI53840.2021.9654812","url":null,"abstract":"Visual Question Answering (VQA) embraces driving answers to questions about a particular image. It requires a fine-grained understanding of both the image content and the question content. Recently, VQA models use attention mechanism to find appropriate visual features based on the given question, this requires multi-step inference. The majority of the present work focus on the visual attention only and ignores the role of the textual attention in VQA. In this paper, we propose a dynamic capsule co-attention (CapsCoAtt) where the visual and textual features are treated as capsules and the attention weights are obtained through an iterative process inspired by the capsule network (CapsNet). In addition to that, to achieve a deep understanding for the questions, we propose a hierarchal question representation through three levels. We evaluate the proposed model on the benchmark dataset VQA 2.0. The results show a significant improvement in the VQA performance with the lowest number of parameters compared with the baseline models.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"457 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124327255","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
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书