CINXE.COM
EAI Endorsed Transactions on Scalable Information Systems - EUDL
<html><head><title>EAI Endorsed Transactions on Scalable Information Systems - EUDL</title><link rel="icon" href="/images/favicon.ico"><link rel="stylesheet" type="text/css" href="/css/screen.css"><link rel="stylesheet" href="/css/zenburn.css"><meta http-equiv="Content-Type" content="charset=utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="Description" content="Visit the new journal website to submit and consult our contents: https://publications.eai.eu/index.php/sis/index"><script type="text/javascript" src="https://services.eai.eu//load-signup-form/EAI"></script><script type="text/javascript" src="https://services.eai.eu//ujs/forms/signup/sso-client.js"></script><script type="text/javascript">if (!window.EUDL){ window.EUDL={} };EUDL.cas_url="https://account.eai.eu/cas";EUDL.profile_url="https://account.eai.eu";if(window.SSO){SSO.set_mode('eai')};</script><script type="text/javascript" src="/js/jquery.js"></script><script type="text/javascript" src="/js/jquery.cookie.js"></script><script type="text/javascript" src="/js/sso.js"></script><script type="text/javascript" src="/js/jscal2.js"></script><script type="text/javascript" src="/js/lang/en.js"></script><script type="text/javascript" src="/js/jquery.colorbox-min.js"></script><script type="text/javascript" src="/js/eudl.js"></script><script type="text/javascript" src="/js/journal.js"></script><script type="text/javascript" src="/js/tabs-journal.js"></script><link rel="stylesheet" type="text/css" href="/css/jscal/jscal2.css"><link rel="stylesheet" type="text/css" href="/css/jscal/eudl/eudl.css"><link rel="stylesheet" type="text/css" href="/css/colorbox.css"></head><body><div id="eudl-page-head"><div id="eudl-page-header"><section id="user-area"><div><nav id="right-nav"><a href="/about">About</a> | <a href="/contact">Contact Us</a> | <a class="register" href="https://account.eai.eu/register?service=http%3A%2F%2Feudl.eu%2Fjournal%2Fsis">Register</a> | <a class="login" href="https://account.eai.eu/cas/login?service=http%3A%2F%2Feudl.eu%2Fjournal%2Fsis">Login</a></nav></div></section></div></div><div id="eudl-page"><header><section id="topbar-ads"><div><a href="https://eudl.eu/"><img class="eudl-logo-top" src="https://eudl.eu/images/eudl-logo.png"></a><img class="eudl-ads-top" src="https://eudl.eu/images/eai-eudl.jpg"></div></section><section id="menu"><nav><a href="/proceedings" class=""><span>Proceedings</span><span class="icon"></span></a><a href="/series" class=""><span>Series</span><span class="icon"></span></a><a href="/journals" class="current"><span>Journals</span><span class="icon"></span></a><a href="/content" class=""><span>Search</span><span class="icon"></span></a><a href="http://eai.eu/">EAI</a></nav></section></header><div id="eaientran"></div><section id="content"><section id="journal"><form class="search-form" id="article_search" method="get"><section class="cover-and-filters"><section class="cover"><img src="/attachment/63349"></section><section class="issn"><strong>ISSN: </strong>2032-9407</section><section class="subscribe link"><a href="/journal/sis/subscribe">Subscribe</a></section><section class="escripts link"><a href="https://escripts.eai.eu/paper/submit">Submit Article</a></section><section class="instructions link"><a href="/instructions">Submission Instructions</a></section><section class="openaccess link"><a href="/openaccess">Open Access Information</a></section><section class="ethics link"><a href="/ethics">Ethics and Malpractice Statement</a></section><section class="most-recent link"><a href="/issue/sis/11/6">Most Recent Issue</a></section><section class="browse-filters"><div class="browse-by"><a class="browse-link">2024<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/11/6" class="filter">Issue 6</a><a href="/issue/sis/11/5" class="filter">Issue 5</a><a href="/issue/sis/11/4" class="filter">Issue 4</a><a href="/issue/sis/11/3" class="filter">Issue 3</a><a href="/issue/sis/11/2" class="filter">Issue 2</a><a href="/issue/sis/11/1" class="filter">Issue 1</a></div><a class="browse-link">2023<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/10/6" class="filter">Issue 6</a><a href="/issue/sis/10/5" class="filter">Issue 5</a><a href="/issue/sis/10/4" class="filter">Issue 4</a><a href="/issue/sis/10/3" class="filter">Issue 3</a><a href="/issue/sis/10/2" class="filter">Issue 2</a><a href="/issue/sis/10/1" class="filter">Issue 1</a></div><a class="browse-link">2022<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/9/6" class="filter">Issue 6</a><a href="/issue/sis/9/5" class="filter">Issue 5</a><a href="/issue/sis/9/4" class="filter">Issue 4</a><a href="/issue/sis/9/36" class="filter">Issue 36</a><a href="/issue/sis/9/35" class="filter">Issue 35</a><a href="/issue/sis/9/34" class="filter">Issue 34</a></div><a class="browse-link">2021<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/8/33" class="filter">Issue 33</a><a href="/issue/sis/8/32" class="filter">Issue 32</a><a href="/issue/sis/8/31" class="filter">Issue 31</a><a href="/issue/sis/8/30" class="filter">Issue 30</a><a href="/issue/sis/8/29" class="filter">Issue 29</a></div><a class="browse-link">2020<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/7/28" class="filter">Issue 28</a><a href="/issue/sis/7/27" class="filter">Issue 27</a><a href="/issue/sis/7/26" class="filter">Issue 26</a><a href="/issue/sis/7/25" class="filter">Issue 25</a><a href="/issue/sis/7/24" class="filter">Issue 24</a></div><a class="browse-link">2019<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/6/23" class="filter">Issue 23</a><a href="/issue/sis/6/22" class="filter">Issue 22</a><a href="/issue/sis/6/21" class="filter">Issue 21</a><a href="/issue/sis/6/20" class="filter">Issue 20</a></div><a class="browse-link">2018<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/5/19" class="filter">Issue 19</a><a href="/issue/sis/5/18" class="filter">Issue 18</a><a href="/issue/sis/5/17" class="filter">Issue 17</a><a href="/issue/sis/5/16" class="filter">Issue 16</a></div><a class="browse-link">2017<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/4/15" class="filter">Issue 15</a><a href="/issue/sis/4/14" class="filter">Issue 14</a><a href="/issue/sis/4/13" class="filter">Issue 13</a><a href="/issue/sis/4/12" class="filter">Issue 12</a></div><a class="browse-link">2016<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/3/11" class="filter">Issue 11</a><a href="/issue/sis/3/10" class="filter">Issue 10</a><a href="/issue/sis/3/9" class="filter">Issue 9</a><a href="/issue/sis/3/8" class="filter">Issue 8</a></div><a class="browse-link">2015<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/2/7" class="filter">Issue 7</a><a href="/issue/sis/2/6" class="filter">Issue 6</a><a href="/issue/sis/2/5" class="filter">Issue 5</a><a href="/issue/sis/2/4" class="filter">Issue 4</a></div><a class="browse-link">2014<span class="pointer"></span></a><div class="filters"><a href="/issue/sis/1/3" class="filter">Issue 3</a><a href="/issue/sis/1/2" class="filter">Issue 2</a><a href="/issue/sis/1/1" class="filter">Issue 1</a></div></div></section><section class="cover"><a href="https://eai.eu/eai-sponsorship/?mtm_campaign=call%20for%20bids&mtm_kwd=bids&mtm_source=organize%20conference%20page&mtm_medium=eudl"><img src="https://eudl.eu/images/banner-outside.png"></a></section></section><section class="info-and-search"><div class="manage-menu"><h2 class="blurb">Visit the new journal website to submit and consult our contents: https://publications.eai.eu/index.php/sis/index</h2><section class="editors"><strong>Editor(s)-in-Chief: </strong><span class="editor">Hua Wang</span> and <span class="editor">Xiaohua Jia</span></section><section class="meta-tabs"><div class="tabs"><ul><li><a name="aims-and-scope">Aims & Scope</a></li><li><a name="Indexing">Indexing</a></li><li><a name="EditorialBoard">Editorial Board</a></li><li><a name="SpecialIssues">Special Issues</a></li></ul></div><div class="content"><div name="aims-and-scope"><div class="abstract"><p>EAI Endorsed Transactions on Scalable Information Systems is open access, a peer-reviewed scholarly journal focused on scalable distributed information systems, scalable, data mining, grid information systems, and more. The journal publishes research articles, review articles, commentaries, editorials, technical articles, and short communications. From 2024, the journal started to publish twelve issues per year. Authors are not charged for article submission and processing.</p> <p>INDEXING: ESCI-WoS (IF: 1.3), Compendex, DOAJ, ProQuest, EBSCO</p> <p>The scope of the journal includes:</p> <ul> <li>Scalable distributed information systems</li> <li>Scalable grid information systems</li> <li>Parallel information processing and systems</li> <li>Web information searching and retrieval</li> <li>Data mining</li> <li>Content delivery networks (CDN)</li> <li>VLDB</li> <li>P2P systems</li> <li>Scalable mobile and wireless database systems</li> <li>Large scale sensor network systems</li> <li>Index compression methods</li> <li>Architectures for scalability</li> <li>Scalable information system applications</li> <li>Evaluation metrics for scalability</li> <li>Information security</li> </ul></div></div><div name="Indexing"><div class="abstract"><ul> <li><a href="https://mjl.clarivate.com/home">Web of Science Core Collection</a></li> <li><a href="https://www.engineeringvillage.com/home.url">Ei Compendex</a></li> <li><a href="https://doaj.org/toc/2032-9407">DOAJ</a></li> <li><a href="https://search.crossref.org/?q=2032-9407">CrossRef</a></li> <li><a href="https://www.ebsco.com/products/ebsco-discovery-service">EBSCO Discovery Service</a></li> <li><a href="https://www.worldcat.org/title/eai-endorsed-transactions-on-scalable-information-systems/oclc/913714002&referer=brief_results">OCLC Discovery Services</a></li> <li><a href="https://europub.co.uk/journals/8124">EuroPub</a></li> <li><a href="http://miar.ub.edu/issn/2032-9407">MIAR</a></li> <li><a href="https://rzblx1.uni-regensburg.de/ezeit/detail.phtml?bibid=AAAAA&colors=7&lang=de&jour_id=237211">Elektronische Zeitschriftenbibliothek</a></li> <li><a href="https://publons.com/journal/37157/icst-transactions-on-scalable-information-systems">Publons</a></li> <li><a href="http://ulrichsweb.serialssolutions.com/login">UlrichsWEB</a></li> <li><a href="https://www.heal-link.gr/en/home-2/">Hellenic Academic Libraries Link</a></li> <li><a href="https://www.ingentaconnect.com/content/doaj/20329407">Ingenta Connect</a></li> <li><a href="https://www.proquest.com/products-services/Publicly-Available-Content-Database.html#overviewlinkSection">Publicly Available Content Database (ProQuest)</a></li> <li><a href="https://www.proquest.com/products-services/adv_tech_aero.html">Advanced Technologies & Aerospace Database (ProQuest)</a></li> <li><a href="https://www.proquest.com/products-services/databases/pq_scitech.html">SciTech Premium Collection (ProQuest)</a></li> <li><a href="https://scholar.google.sk/scholar?start=0&q=source:eai+source:endorsed+source:transactions+source:on+source:scalable+source:information+source:systems&hl=es&as_sdt=0,5&as_ylo=2018">Google Scholar</a></li> </ul></div></div><div name="SpecialIssues"><div class="abstract"><p><em>Call for Papers:</em> <a href="https://escripts.eai.eu/publication/366">Special issue on: Real-time image information processing with deep neural networks and data mining technologies</a> (Manuscript submission deadline: 2022-02-28; Notification of acceptance: 2022-04-15; Submission of final revised paper: 2022-05-15; Publication of special issue (tentative): 2022-06-15)</p> <p><em>Guest Editor:</em> Dr. Prof. Hang Li (Northeastern University, China) <em>Guest Editor:</em> Dr. Prof. Jochen Schiewe (HafenCity Universität Hamburg, Germany)</p></div></div><div name="EditorialBoard"><div class="abstract"><ul> <li>Editors-in-Chief</li> <li>Hua Wang, Victoria University, Australia</li> <li>Xiaohua Jia, City University of Hong Kong</li> <li>Editorial board</li> <li>Manik Sharma, DAV University, India</li> <li>Ajay Kattepur (Tata Consultancy Services)</li> <li>Aniello Castiglione (University of Salerno)</li> <li>Chang Choi (Chosun University)</li> <li>Cho-Li Wang (University of Hong Kong)</li> <li>Daniel S. Katz (University of Chicago)</li> <li>Fabrizio Silvestri (ISTI – CNR, Italy)</li> <li>Hamed Taherdoost (Hamta Business Solution Snd)</li> <li>Heng Tao Shen (University of Queensland)</li> <li>Houbing Song (Embry-Riddle Aeronautical University)</li> <li>José Manuel Machado (University of Minho, Portugal)</li> <li>Jose Merseguer (Universidad de Zaragoza)</li> <li>Jie Li (University of Tsukuba)</li> <li>Lin Yun (Harbin Engineering University)</li> <li>Phan Cong Vinh (Nguyen Tat Thanh University)</li> <li>Raj Gururajan (University of Southern Queensland)</li> <li>Sherman Chow (Chinese University of Hong Kong)</li> <li>Silva Fábio (University of Minho, Portugal)</li> <li>Steve Beitzel (Telcordia)</li> <li>Tzung-Pei Hong (National University of Kaohsiung, Kaohsing City, Taiwan)</li> <li>Wang-Chien Lee (The Pennsylvania State University)</li> <li>Weili Wu (The University of Texas at Dallas)</li> <li>Xueyan Tang (Nanyang Technological University)</li> <li>Vijayakumar Ponnusamy (SRM University, India)</li> <li>J Amudhavel (KL University, India)</li> <li>Yingshu Li (Georgia State University)</li> <li>Jerry Chun-Wei Lin (Western Norway University of Applied Sciences, Norway)</li> <li>Karolj Skala (Ruđer Bošković Institute, Croatia)</li> <li>Xiao-Zhi Gao (University of Eastern Finland, Finland)</li> <li>Thaier Hayajneh (Fordham University, USA)</li> <li>Chin-Ling Chen (Chaoyang University of Technology, Taiwan)</li> <li>Nuno M. Garcia (Faculty of Sciences, University of Lisbon, Portugal)</li> <li>Arianna D'Ulizia (Consiglio Nazionale delle Ricerche (CNR), Italy)</li> <li>Robertas Damaševičius (Kaunas University of Technology (KTU), Lithuania)</li> <li>Hiep Xuan Huynh (Can Tho University, VietNam)</li> <li>Ji Zhang (University of Southern Queensland, Australia)</li> <li>Xiaohui Tao (University of Southern Queensland, Australia)</li> <li>Ye Wang (National University of Defense Technology, China)</li> <li>Nageswara Rao Moparthi (KL University, India)</li> <li>Shuai Liu (Hunan Normal University, China)</li> <li>Prof Xiaoming Fu (Georg-August-University of Goettingen, Germany)</li> <li>Prof Zhisheng Huang (Vrije University of Amsterdam)</li> <li>Prof Rose Quan (Northumbria University, UK)</li> <li>Prof Shi Dong (Zhoukou Normal University, China)</li> <li>Dr Limei Peng (Kyungpook National University, South Korea)</li> <li>Prof Hui Ma( Victoria University of Wellington, New Zealand)</li> <li>Dr. Venkatesan Subramanian (Indian Institute of Information Technology – Allahabad, India)</li> <li>Dr Pon Harshavardhanan (VIT Bhopal University, India)</li> <li>Dr. Manish Kumar (The Indian Institute of Information Technology, Allahabad, India)</li> <li>Muzammil Hussain, University of Management and Technology, Lahore, Pakistan</li> <li>Michael Bewong, Charles Sturt University, Australia</li> <li>Shabir Ahmad, Gachon University, Korea</li> <li>Vu Nguyen, University of Science, Vietnam</li> <li>Xiaodi Huang, Charles Sturt University, Australia</li> <li>Jianming Yong, University of Southern Queensland, Australia</li> <li>Yogeshwar Vijayakumar Navandar; National Institute of Technology, Indian.</li> <li>Zhengyi Chai, Tiangong University in China, China</li> <li>Chuanlong Wang, Taiyuan Normal University, China</li> <li>Chin-Feng Lee, Chaoyang University of Technology, Taiwan</li> <li>Hsing-Chung Chen (Jack Chen), Asia University, Taiwan</li> <li>Wen-Yang Lin, National University of Kaohsiung, Taiwan</li> <li>Chun-Hao Chen, National Kaohsiung University of Science and Technology, Taiwan</li> <li>Mudasir Mohd, University of Kashmir, India.</li> <li>BalaAnand Muthu, INTI International University, Malaysia.</li> <li>Md Rafiqul Islam, Australian Institute of Higher Education, Australia.</li> <li>Jin Wang, Institute of Applied Physics and Computational Mathematics, China.</li> <li>Chandu Thota, University of Nicosia, Cyprus.</li> <li>Haris M. Khalid, University of Dubai, UAE.</li> <li>Dr. G. Reza Nasiri, Alzahra University, Tehran, Iran.</li> <li>Siuly Siuly, Victoria University, Australia</li> <li>Bishnu Prasad Gautam, Kanazawa Gakuin University, Japan</li> <li>Sivaparthipan C B, Bharathiar University, India</li> <li>Ting-Chia Hsu, National Taiwan Normal University, Taiwan</li> <li>Punitha Palanisamy, Tagore IET, India</li> <li>Lakshmana Kumar R, Tagore IET, India</li> <li>Weiwei Jiang, Beijing University of Posts and Telecommunications, Taiwan</li> </ul></div></div></div></section><br><section class="article-tabs"><div class="tabs"><ul><li><a name="recent" onclick="handleRecentClick()">Recently Published</a></li><li><a name="popular" onclick="handlePopularClick()">Most Popular</a></li></ul></div><div class="contents"><div class="expandable-list"><ul class="results-list"><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.4217">Design and Application of Evaluation Method for Civics Classroom Based on CRITIC Fuzzy Algorithm</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(1): </dd><br><dt class="title">Authors: </dt><dd class="value">Zhanyu Chang</dd><br><dt class="title">Published: </dt><dd class="value">24th Oct 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">INTRODUCTION: Through in-depth study of Civics classroom evaluation, it can provide teachers with scientific evaluation indexes and methods, improve teaching quality and effect, promote the overall development of students, and also promote the professional growth of teachers. OBJECTIVES: Based on critical and fuzzy comprehensive evaluation methods, this study aims to study the effectiveness and accuracy of the evaluation methods in Civics and Politics classrooms. Based on the CRITIC method, the fuzzy comprehensive evaluation method was introduced to solve the problem of subjectivity and uncertainty in the evaluation process. METHODS: Various research methods were used, including observation, interviews, and questionnaires. By comprehensively analyzing the students' performance, feedback, and assessment, and the teachers' pre-course preparation, the advantages and improvement directions of Civics classroom teaching can be accurately evaluated using the CRITIC and fuzzy comprehensive evaluation methods. RESULTS: The study results show that the CRITIC and fuzzy comprehensive evaluation methods can provide a more comprehensive, accurate, and objective evaluation of the Civics classroom. The undefined complete evaluation method plays an essential role in dealing with ambiguity and uncertainty in the evaluation process, making the evaluation results more objective and reliable. CONCLUSION: The Civics classroom evaluation method based on the CRITIC and fuzzy comprehensive evaluation methods is adequate and accurate. These findings strongly support improving the quality of Civics classroom teaching and enhancing students' learning outcomes. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.6086">A New Hybrid COA-OOA Based Task Scheduling and Fuzzy Logic Approach to Increase Fault Tolerance in Cloud Computing</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(6): </dd><br><dt class="title">Authors: </dt><dd class="value">Abhishek Swaroop, Vineet Goel, Manoj Kumar Malik</dd><br><dt class="title">Published: </dt><dd class="value">27th Jun 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">INTRODUCTION: Technology is made available to customers worldwide through a distributed computing architecture called cloud computing. In the cloud paradigm, there is a risk of single-point failures, in order to prevent errors and gain confidence from consumers in their cloud services, one problem facing cloud providers is efficiently scheduling tasks. OBJECTIVES: High availability and fault tolerance must be offered to clients by these services. Fuzzy logic and hybrid COA-OOA are used in this study proposed fault-tolerant work scheduling algorithm. Jobs given by users and virtual machines are considered as input for this proposed approach. METHODS: The given tasks are initially scheduled utilizing the FIFO order. Then, it is rescheduled utilizing the Hybrid Coati Optimization Algorithm (COA) - Osprey Optimization Algorithm (OOA) for scheduling the task based on priority. RESULTS: This scheduled job is assigned to the VM for further execution. If the jobs are not executed successfully, then fault tolerant mechanism is carried out. Faults are recognized by employing fuzzy logic in this proposed approach. CONCLUSION: This proposed approach attains 62 sec response time, 61 sec of makespan and 98% success rate. Thus, this proposed approach is the best choice for efficient task scheduling with fault tolerant mechanism. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.5667">A hybrid intrusion detection system with K-means and CNN+LSTM</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(6): </dd><br><dt class="title">Authors: </dt><dd class="value">Haifeng Lv, Yong Ding</dd><br><dt class="title">Published: </dt><dd class="value">27th Jun 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">Intrusion detection system (IDS) plays an important role as it provides an efficient mechanism to prevent or mitigate cyberattacks. With the recent advancement of artificial intelligence (AI), there have been many deep learning methods for intrusion anomaly detection to improve network security. In this research, we present a novel hybrid framework called KCLSTM, combining the K-means clustering algorithm with convolutional neural network (CNN) and long short-term memory (LSTM) architecture for the binary classification of intrusion detection systems. Extensive experiments are conducted to evaluate the performance of the proposed model on the well-known NSL-KDD dataset in terms of accuracy, precision, recall, F1-score, detection rate (DR), and false alarm rate (FAR). The results are compared with traditional machine learning approaches and deep learning methods. The proposed model demonstrates superior performance in terms of accuracy, DR, and F1-score, showcasing its effectiveness in identifying network intrusions accurately while minimizing false positives. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.6111">Comprehensive Review of Advanced Machine Learning Techniques for Detecting and Mitigating Zero-Day Exploits</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(6): </dd><br><dt class="title">Authors: </dt><dd class="value">Mitra Madanchian, Hamed Taherdoost, Nachaat Mohamed</dd><br><dt class="title">Published: </dt><dd class="value">26th Jun 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">This paper provides an in-depth examination of the latest machine learning (ML) methodologies applied to the detection and mitigation of zero-day exploits, which represent a critical vulnerability in cybersecurity. We discuss the evolution of machine learning techniques from basic statistical models to sophisticated deep learning frameworks and evaluate their effectiveness in identifying and addressing zero-day threats. The integration of ML with other cybersecurity mechanisms to develop adaptive, robust defense systems is also explored, alongside challenges such as data scarcity, false positives, and the constant arms race against cyber attackers. Special attention is given to innovative strategies that enhance real-time response and prediction capabilities. This review aims to synthesize current trends and anticipate future developments in machine learning technologies to better equip researchers, cybersecurity professionals, and policymakers in their ongoing battle against zero-day exploits. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.5737">Sentinel Shield: Leveraging ConvLSTM and Elephant Herd Optimization for Advanced Network Intrusion Detection</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(6): </dd><br><dt class="title">Authors: </dt><dd class="value">Dinesh Kumar, Aparna Tiwari</dd><br><dt class="title">Published: </dt><dd class="value">26th Jun 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">Given the escalating intricacy of network environments and the rising level of sophistication in cyber threats, there is an urgent requirement for resilient and effective network intrusion detection systems (NIDS). This document presents an innovative NIDS approach that utilizes Convolutional Long Short-Term Memory (ConvLSTM) networks and Elephant Herd Optimization (EHO) to achieve precise and timely intrusion detection. Our proposed model combines the strengths of ConvLSTM, which can effectively capture spatiotemporal dependencies in network traffic data, and EHO, which allow the model to focus on relevant information while filtering out noise. To achieve this, we first preprocess network traffic data into sequential form and use ConvLSTM layers to learn both spatial and temporal features. Subsequently, we introduce Elephant Herd Optimization that dynamically assigns different weights to different parts of the input data, emphasizing the regions most likely to contain malicious activity. To evaluate the effectiveness of our approach, we conducted extensive experiments on publicly available network intrusion CICIDS2017 Dataset. The experimental results demonstrate the efficacy of the proposed approach (Accuracy = 99.98%), underscoring its potential to revolutionize modern network intrusion detection and proactively safeguard digital assets. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.5765">Analysis of Employment Competitiveness of College Students Based on Binary Association Rule Extraction Algorithm</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(5): </dd><br><dt class="title">Authors: </dt><dd class="value">Lixia Guo</dd><br><dt class="title">Published: </dt><dd class="value"> 3rd May 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract"> Today, assessing competition among college students in the job search is extremely important. However, various methods available are often inaccurate or inefficient when it comes to determining the level of their readiness for work. Conventional techniques usually depend on simplistic measures or miss out on crucial factors responsible for employability. The challenging characteristics of such competitive employment of college students are the lower levels of perceived stress, financing my education, and crucial professional skills. Hence, in this research, the Internet of Things Based on Binary Association Rule Extraction Algorithm (IoT-BAREA) technologies have improved college students' employment competitiveness. IoT-BAREA addresses this situation using a binary association rule extraction algorithm that helps detect significant patterns and relationships in large amounts of data involving student attributes and employment outcomes. IoT-BAREA positions itself as capable of providing insights into features that highly mediate the employability levels among students. This paper closes this gap and recommends a new IoT-BAREA method to help increase accuracy and efficiency in evaluating student employment competitiveness. Specifically, this study uses rigorous evaluation methods such as precision, recall and interaction ratio to determine how well IoT-BAREA predicts students' employability. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.5713">Realization of Urban Perception Art: Painting Expressions of Internet of Things Technologies in Urban Environments</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(5): </dd><br><dt class="title">Authors: </dt><dd class="value">Hong Zhu, Lu Yao</dd><br><dt class="title">Published: </dt><dd class="value"> 3rd May 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">INTRODUCTION: With the continuous progress of urbanization, people's perceptions and experiences of the urban environment are increasingly concerned. Traditional forms of artistic expression can no longer fully meet people's needs for urban perception. Therefore, it is especially important to explore new possibilities of urban perception art with the help of modern technology, especially intelligent technology. OBJECTIVES: The main purpose of this study is to explore the feasibility and effectiveness of utilizing advanced technology for urban perception art expression. Through an in-depth understanding of the urban environment and the perceptual needs of urban residents, as well as existing technological means, artistic expressions that can present urban perceptions more intuitively and vividly are developed. METHODS: This study adopts a combination of field research and art practice. Through urban observation and questionnaire surveys, the subjective experience and needs of urban residents for urban perception were collected. Then, using digital painting and video technology, combined with the principles of perception psychology, urban perception works with artistic and technological senses were designed. RESULTS: A series of urban perception artworks were designed in this study, covering all aspects of urban life, including architectural landscapes, transportation scenes, and humanistic customs. These works enable viewers to perceive the urban environment in a more intuitive and immersive way through digital painting and video technology, as well as real-time data and perceptual feedback. CONCLUSION: By exploring new ways of artistic expression of urban perception, this study provides urban residents with a richer and deeper experience of urban perception. The application of digital painting and video technology, as well as the interaction and feedback with urban residents, opens up new possibilities for the development of urban perceptual art. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.5862">Design of Intelligent Political Test Paper Generation Method Based on Improved Intelligent Optimization Algorithm</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(5): </dd><br><dt class="title">Authors: </dt><dd class="value">Qing Wan</dd><br><dt class="title">Published: </dt><dd class="value"> 3rd May 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">With the development of artificial intelligence, computer intelligent grouping, as a research hotspot of political ideology examination paper proposition, can greatly shorten the time of generating examination papers, reduce the human cost, reduce the human factor, and improve the quality of political ideology teaching evaluation. Aiming at the problem that the current political ideology examination paper-grouping strategy method easily falls into the local optimum, a kind of intelligent paper-grouping method for political ideology examination based on the improved stock market trading optimisation algorithm is proposed. Firstly, by analyzing the traditional steps of political thought grouping, according to the index genus of the grouping problem and the condition constraints, we construct the grouping model of political thought test questions; then, combining the segmented real number coding method and the fitness function, we use the securities market trading optimization algorithm based on the Circle chaotic mapping initialization strategy and adaptive t-distribution variability strategy to solve the grouping problem of the political thought test. The experimental results show that the method can effectively find the optimal strategy of political thought exam grouping, and the test questions have higher knowledge point coverage, moderate difficulty, and more stable performance. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.5771">Enhanced Design of a Tai Chi Teaching Assistance System Integrating DTW Algorithm and SVM</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(5): </dd><br><dt class="title">Authors: </dt><dd class="value">Yujie Guo</dd><br><dt class="title">Published: </dt><dd class="value"> 3rd May 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">Physical education using technology has enabled traditional practices like Tai Chi, a martial art known for its multiple health benefits and meditative aspects, to set coordinated goals. This research presents an intelligent Tai Chi Teaching Assistance System supported by the integration of the Dynamic Time Warping algorithm and Support Vector Machine, in which can practitioners providing real-time feedback to improve Tai Chi learning and quality. In the system, the DTWA Dynamic Time Warping Algorithm was used to accurately compare a practitioner’s complex body movements with the Tai Chi standard movements dataset, taking into account execution speed deviations and others. Meanwhile, the SVM was employed to classify the movement as to quality and correctness, thereby being able to provide precise, individual feedback. This hybrid approach ensures a high-motion recognition accuracy rate while also adhering to nuanced Tai Chi requirements. The system was evaluated through detailed testing with various levels of Tai Chi experience. Evaluation showed that the students’ performance and understanding of most Taijiquan movements and related physical exercises improved significantly. It indicates the system has a practical application value for also beginners and intermediate and last expert, respectively. It also shows the effectiveness of combining DTW and SVM to support learners ‘body movement trajectory in a physical learning environment, opening them up to additional technology-assisted physical training applications. This provides implications for a more promising generation of future physical education involving the incorporation of complex AI technology. </dd><hr></dl></li><li class="result-item article-light recent"><h3><a href="../doi/10.4108/eetsis.5785">Research on Fault Diagnosis Method of CNC Machine Tools Based on Integrated MPA Optimised Random Forests</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 24(5): </dd><br><dt class="title">Authors: </dt><dd class="value">Xiaoyan Wang</dd><br><dt class="title">Published: </dt><dd class="value"> 3rd May 2024</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">INTRODUCTION: Intelligent diagnosis of CNC machine tool faults can not only early detection and troubleshooting to improve the reliability of machine tool operation and work efficiency, but also in advance of the station short maintenance to extend the life of the machine tool to ensure that the production line of normal production. OBJECTIVES: For the current research on CNC machine tool fault diagnosis, there are problems such as poorly considered feature selection and insufficiently precise methods. METHODS: This paper proposes a CNC machine tool fault diagnosis method based on improving random forest by intelligent optimisation algorithm with integrated learning as the framework. Firstly, the CNC machine tool fault diagnosis process is analysed to extract the CNC machine tool fault features and construct the time domain, frequency domain and time-frequency domain feature system; then, the random forest is improved by the marine predator optimization algorithm with integrated learning as the framework to construct the CNC machine tool fault diagnosis model; finally, the validity and superiority of the proposed method is verified by simulation experiment analysis. RESULTS: The results show that the proposed method meets the real-time requirements while improving the diagnosis accuracy. CONCLUSION: Solve the problem of poor accuracy of fault diagnosis of CNC machine tools and unsound feature system. </dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.13-7-2018.159623">Topic Modeling: A Comprehensive Review</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 19(24): e2</dd><br><dt class="title">Authors: </dt><dd class="value">Poonam Bansal, Pooja Kherwa</dd><br><dt class="title">Downloads: </dt><dd class="value">14245</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">Topic modelling is the new revolution in text mining. It is a statistical technique for revealing the underlying semantic structure in large collection of documents. After analysing approximately 300 research articles on topic modeling, a comprehensive survey on topic modelling has been presented in this paper. It includes classification hierarchy, Topic modelling methods, Posterior Inference techniques, different evolution models of latent Dirichlet allocation (LDA) and its applications in different areas of technology including Scientific Literature, Bioinformatics, Software Engineering and analysing social network is presented. Quantitative evaluation of topic modeling techniques is also presented in detail for better understanding the concept of topic modeling. At the end paper is concluded with detailed discussion on challenges of topic modelling, which will definitely give researchers an insight for good research.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.28-6-2017.152748">The impact of using social media and internet on academic performance case study Bahrain Universities</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 17(13): e2</dd><br><dt class="title">Authors: </dt><dd class="value">Abdulla Jaafar Desmal</dd><br><dt class="title">Downloads: </dt><dd class="value">10826</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">The internet and social media provide students with a range of academic benefits and opportunities to enhance their learning process. The main goal of this research is to examine the impact of using the social media on the academic performance. The new social networks, such as Instagram, Facebook, Twitter, etc., can affect the behavior and academic performance of the universities' students; therefore the selected universities were Ahlia University, Applied Science University and University of Bahrain. The sample was (150) students distributed equally among the three universities. The research questions will answer (1) what is the evolution of ICTs and the Internet in the World; (2) what is the impact caused by ICT in education; (3) what are the effects of social media on the academic performance of students at Bahrain Universities; (4) what are the social networking sites that are more popular among students at Bahrain Universities. The results show that the social media has a positive impact on academic performance and 57% of students prefer the mobile application WhatsApp as a social media for their academic purpose.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.19-6-2018.155865">Preventing DDoS using Bloom Filter: A Survey</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 18(19): e3</dd><br><dt class="title">Authors: </dt><dd class="value">Sabuzima Nayak, Ripon Patgiri, Samir Kumar Borgohain</dd><br><dt class="title">Downloads: </dt><dd class="value">6831</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">Distributed Denial-of-Service (DDoS) is a menace for service provider and prominent issue in network security. Defeating or defending the DDoS is a prime challenge. DDoS make a service unavailable for a certain time. This phenomenon harms the service providers, and hence, causes loss of business revenue. Therefore, DDoS is a grand challenge to defeat. There are numerous mechanism to defend DDoS, however, this paper surveys the deployment of Bloom Filter in defending the DDoS attack. The Bloom Filter is a probabilistic data structure for membership query that returns either true or false. Bloom Filter uses tiny memory to store information of large data. Therefore, packet information is stored in Bloom Filter to defend and defeat DDoS. This paper presents a survey on DDoS defending technique using Bloom Filter.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.19-8-2015.2260044">A Parking Management System based on Background Difference Detecting Algorithm</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 15(7): e3</dd><br><dt class="title">Authors: </dt><dd class="value">Yanwen Wang, Hainan Chen, Lei Shu, Kangkang Liang, Xiaoling Wu</dd><br><dt class="title">Downloads: </dt><dd class="value">6437</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">The number of vehicles in cities has increased dramatically due to rapid economic development. However, the infrastructure for accommodating these vehicles has grown relatively slow. Alleviating the pressure on the urban transport system and solving the ‘parking difficulty’ problem have thus become hot topics recently. In this paper, an intelligent parking system based on geomagnetic field variations is presented to solve this problem. An algorithm which detects the presence of vehicles in parking spaces in a parking lot is designed and field test results are presented. Our results show that this system has an acceptably high accuracy with low cost, high feasibility, high efficiency and hence is recommended for wide use.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.29-5-2018.154806">A Narrative Literature Review and E-Commerce Website Research</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 18(17): e1</dd><br><dt class="title">Authors: </dt><dd class="value">K.M. Rahman</dd><br><dt class="title">Downloads: </dt><dd class="value">6084</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">In this study, a narrative literature review regarding culture and e-commerce website design has been introduced. Cultural aspect and e-commerce website design will play a significant role for successful global e-commerce sites in the future. Future success of businesses will rely on e-commerce. To compete in the global e-commerce marketplace, local businesses need to focus on designing culturally friendly e-commerce websites. To the best of my knowledge, there has been insignificant research conducted on correlations between culture and e-commerce website design. The research shows that there are correlations between e-commerce, culture, and website design. The result of the study indicates that cultural aspects influence e-commerce website design. This study aims to deliver a reference source for information systems and information technology researchers interested in culture and e-commerce website design, and will show less-focused research areas in addition to future directions. </dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.19-12-2018.156086">A Hybrid Approach for Breast Cancer Classification and Diagnosis</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 19(20): e2</dd><br><dt class="title">Authors: </dt><dd class="value">Bibhuprasad Sahu, Saroj Kumar Rout, Sachi Nandan Mohanty</dd><br><dt class="title">Downloads: </dt><dd class="value">6017</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">Feature selection in breast cancer disease important and risky task for further analysis. Breast cancer is the second leading reason for death among the women. Cancer starts from breast and spread to other part of the body. People are unable to identify their disease before it become dangerous. It can be cured if the disease identified at early stage. Accurate classification of benign tumours can avoid patients undergoing unnecessary treatments. Data Analytics and machine learning methods provides framework for prognostic studies by errorless classification of data instances into relevant based on the cancer severity. In this study we have purposed a prediction model by combining artificial intelligent based learning technique with multivariate statistical method. For automation of the diagnosis process data mining plays an significant role. The data sets available in different repositories are noisy in nature. This study suggests a hybrid feature selection method to be used with PCA (Principal Component Analysis) and Artificial Neural Network (ANN). Preprocessing of data and extracting the most relevant features done by PCA. The proposed algorithm is tested by applying it on Wisconsin Breast Cancer Dataset from UCI Repository of Machine Learning Databases. In classification phase 10 fold cross validation was used. The suggested algorithm was measured against different classifier algorithms on the same database. The evaluation results of the algorithm proposed have achieved better accuracy with sensitivity and F measure comparison with others and by enhancing this concept we can provide a future scope to produce sophisticated learning models for diagnosis.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.13-7-2018.159407">Comparative Analysis of Wind Speed Forecasting Using LSTM and SVM</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 19(25): e1</dd><br><dt class="title">Authors: </dt><dd class="value">Ajay Kumar, Vikram Bali, Satyam Gangwar</dd><br><dt class="title">Downloads: </dt><dd class="value">5562</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">The objective of this work is to present a comprehensive exploration of deep learning based wind forecasting model. The forecasting of speed of wind is called as the wind speed forecasting/prediction. It is basically done to achieve the better sustainability for power generation and production. The availability of wind energy in ample amount makes it quite comfortable to be utilized for various functionalities. In this research work the main aim is to forecast speed using LSTM including certain parameters and then comparative analysis is done using SVM. Both are machine learning approaches but have different functionalities in comparison to each other. This comparison is done to obtain the better technique which can be further applied on larger datasets to design a better, accurate, efficient forecasting model for speed of wind. The survey and implementation of both the techniques gave a clear idea about the utilisation of long short term memory for the better and enhanced wind speed forecasting. The forecasting is based on various atmospheric variables, and the data set is taken from the kaggle datsets which have numerous attributes but we have considered few of them only for the prediction purpose.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.19-12-2018.156085">Stock Price Prediction using Artificial Neural Model: An Application of Big Data</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 19(20): e1</dd><br><dt class="title">Authors: </dt><dd class="value">Sudipta Roy, Malav Shastri, Mamta Mittal</dd><br><dt class="title">Downloads: </dt><dd class="value">5427</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">In recent time, stock price prediction is an area of profound interest in the realm of fiscal market. To predict the stock prices, authors have proposed a technique by first calculating the sentiment scores through Naïve Bayes classifier and after that neural network is applied on both sentiment scores and historical stock dataset. They have also addressed the issue of data cleaning using a Hive ecosystem. This ecosystem is being used for pre-processing part and a neural network model with inputs from sentiment analysis and historic data is used to predict the prices. It has been observed from the experiments that the accuracy level reaches above 90% in maximum cases, as well as it also provides the solid base that model will be more accurate if it trained with recent data. The intended combination of sentiment analysis and Neural networks is used to establish a statistical relationship between historic numerical data records of a particular stock and other sentimental factors which can affects the stock prices.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.19-6-2018.154828">An Advanced Conceptual Diagnostic Healthcare Framework for Diabetes and Cardiovascular Disorders</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 18(18): e5</dd><br><dt class="title">Authors: </dt><dd class="value">R. Singh, G. Singh, M. Sharma</dd><br><dt class="title">Downloads: </dt><dd class="value">5388</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">The data mining along with emerging computing techniques have astonishingly influenced the healthcare industry. Researchers have used different Data Mining and Internet of Things (IoT) for enrooting a programmed solution for diabetes and heart patients. However, still, more advanced and united solution is needed that can offer a therapeutic opinion to individual diabetic and cardio patients. Therefore, here, a smart data mining and IoT (SMDIoT) based advanced healthcare system for proficient diabetes and cardiovascular diseases have been proposed. The hybridization of data mining and IoT with other emerging computing techniques is supposed to give an effective and economical solution to diabetes and cardio patients. SMDIoT hybridized the ideas of data mining, Internet of Things, chatbots, contextual entity search (CES), bio-sensors, semantic analysis and granular computing (GC). The bio-sensors of the proposed system assist in getting the current and precise status of the concerned patients so that in case of an emergency, the needful medical assistance can be provided. The novelty lies in the hybrid framework and the adequate support of chatbots, granular computing, context entity search and semantic analysis. The practical implementation of this system is very challenging and costly. However, it appears to be more operative and economical solution for diabetes and cardio patients.</dd><hr></dl></li><li class="result-item article-light popular"><h3><a href="../doi/10.4108/eai.28-12-2017.153522">Machine Learning and Predictive Analysis of Fossil Fuels Consumption in Mid-Term</a></h3><dl class="metadata"><dt class="title">Appears in: </dt><dd class="value">sis 18(15): e4</dd><br><dt class="title">Authors: </dt><dd class="value">Mohsen Amerion, Mohammadmehdi Hosseini, Abdorreza Alavi Gharahbagh, Mahmood Amerion</dd><br><dt class="title">Downloads: </dt><dd class="value">4930</dd><br><dt class="title">Abstract: </dt><dd class="value abstract">In economies that are dependent on fossil fuel revenues, Realization of long-term plans, mid-term and annual budgeting requires a fairly accurate estimation of the amount of consumption and its price fluctuations. Accordingly, the present study is using machine learning techniques to predict the usage of fossil fuels (Diesel, Black oil, Heating oil, and Petrol) in mid-term. Exponential Smoothing, a model of time series and the Neural Network model have been applied on the actual usage data obtained from Shahroud area from 2010 to 2015. For estimation of predictive value by Neural Network method, the training and testing samples, the highest and lowest errors with a range of 41% -0.89% and 88% -3% for the Mean Absolute Percent Deviation are the most appropriate predictions for Petrol consumption. And in the Single Exponential Smoothing, the forecast rate for each product is estimated on a quarterly as well as monthly basis.</dd><hr></dl></li></ul></div></div></section><section class="publication-info"><dl class="metadata"><dt class="title">Publisher</dt> <dd class="value">EAI</dd> <dt class="title">ISSN</dt> <dd class="value">2032-9407</dd> <dt class="title">Number of Volumes</dt> <dd class="value">11</dd></dl><dl class="metadata"><dt class="title">Last Published</dt> <dd class="value">2024-10-05</dd></dl></section></div></section></form></section></section><div class="clear"></div><footer><div class="links"><a href="https://www.ebsco.com/" target="_blank"><img class="logo ebsco-logo" src="/images/ebsco.png" alt="EBSCO"></a><a href="https://www.proquest.com/" target="_blank"><img class="logo proquest-logo" src="/images/proquest.png" alt="ProQuest"></a><a href="https://dblp.uni-trier.de/db/journals/publ/icst.html" target="_blank"><img class="logo dblp-logo" src="/images/dblp.png" alt="DBLP"></a><a href="https://doaj.org/search?source=%7B%22query%22%3A%7B%22filtered%22%3A%7B%22filter%22%3A%7B%22bool%22%3A%7B%22must%22%3A%5B%7B%22term%22%3A%7B%22index.publisher.exact%22%3A%22European%20Alliance%20for%20Innovation%20(EAI)%22%7D%7D%5D%7D%7D%2C%22query%22%3A%7B%22query_string%22%3A%7B%22query%22%3A%22european%20alliance%20for%20innovation%22%2C%22default_operator%22%3A%22AND%22%2C%22default_field%22%3A%22index.publisher%22%7D%7D%7D%7D%7Dj" target="_blank"><img class="logo doaj-logo" src="/images/doaj.jpg" alt="DOAJ"></a><a href="https://www.portico.org/publishers/eai/" target="_blank"><img class="logo portico-logo" src="/images/portico.png" alt="Portico"></a><a href="http://eai.eu/" target="_blank"><img class="logo eai-logo" src="/images/eai.png"></a></div></footer></div><div class="footer-container"><div class="footer-width"><div class="footer-column logo-column"><a href="https://eai.eu/"><img src="https://eudl.eu/images/logo_new-1-1.png" alt="EAI Logo"></a></div><div class="footer-column"><h4>About EAI</h4><ul><li><a href="https://eai.eu/who-we-are/">Who We Are</a></li><li><a href="https://eai.eu/leadership/">Leadership</a></li><li><a href="https://eai.eu/research-areas/">Research Areas</a></li><li><a href="https://eai.eu/partners/">Partners</a></li><li><a href="https://eai.eu/media-center/">Media Center</a></li></ul></div><div class="footer-column"><h4>Community</h4><ul><li><a href="https://eai.eu/eai-community/">Membership</a></li><li><a href="https://eai.eu/conferences/">Conference</a></li><li><a href="https://eai.eu/recognition/">Recognition</a></li><li><a href="https://eai.eu/corporate-sponsorship">Sponsor Us</a></li></ul></div><div class="footer-column"><h4>Publish with EAI</h4><ul><li><a href="https://eai.eu/publishing">Publishing</a></li><li><a href="https://eai.eu/journals/">Journals</a></li><li><a href="https://eai.eu/proceedings/">Proceedings</a></li><li><a href="https://eai.eu/books/">Books</a></li><li><a href="https://eudl.eu/">EUDL</a></li></ul></div></div></div><script type="text/javascript" src="https://eudl.eu/js/gacode.js"></script><script src="/js/highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script><script type="application/ld+json">{"@context":"http://schema.org","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"item":{"@id":"http://eudl.eu","name":"Home","image":null}},{"@type":"ListItem","position":2,"item":{"@id":"http://eudl.eu/journals","name":"Journals","image":null}},{"@type":"ListItem","position":3,"item":{"@id":"http://eudl.eu/journal/sis","name":"sis","image":null}}]}</script></body></html>