首页 > 最新文献

2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)最新文献

英文 中文
Genetic Algorithm Based on Multiple Population in a Business Process Optimization Issue 基于多种群的遗传算法在业务流程优化中的应用
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380124
Nadir Mahammed, Mahmoud Fahsi, S. Bennabi
In a competitive environment, enterprises success depends on the effectiveness of their business processes, which leads to the search of a continuous improvement in the time. This kind of improvement is called business process optimization. Yet, two major challenges often prevent processes optimization. First, the skills of the analysts to choose the right process among a number of propositions. Second, the techniques applied to generate and evaluate solutions during optimization process are poor and do not include all relevant data. Our Evolutionary Business Process Optimization approach addresses these challenges through a well-defined mathematical representation and a novel evolutionary algorithm as optimization facilities. In this paper, we focus to use of a formalized process optimization approach for generating and improving business process designs.
在竞争激烈的环境中,企业的成功取决于其业务流程的有效性,这导致了对时间的持续改进的追求。这种改进称为业务流程优化。然而,两个主要的挑战经常阻碍流程优化。首先,分析人员在众多命题中选择正确过程的技能。其次,在优化过程中用于生成和评估解的技术很差,并且不包括所有相关数据。我们的渐进式业务流程优化方法通过定义良好的数学表示和新颖的进化算法作为优化工具来解决这些挑战。在本文中,我们着重于使用形式化的流程优化方法来生成和改进业务流程设计。
{"title":"Genetic Algorithm Based on Multiple Population in a Business Process Optimization Issue","authors":"Nadir Mahammed, Mahmoud Fahsi, S. Bennabi","doi":"10.1109/ICAASE51408.2020.9380124","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380124","url":null,"abstract":"In a competitive environment, enterprises success depends on the effectiveness of their business processes, which leads to the search of a continuous improvement in the time. This kind of improvement is called business process optimization. Yet, two major challenges often prevent processes optimization. First, the skills of the analysts to choose the right process among a number of propositions. Second, the techniques applied to generate and evaluate solutions during optimization process are poor and do not include all relevant data. Our Evolutionary Business Process Optimization approach addresses these challenges through a well-defined mathematical representation and a novel evolutionary algorithm as optimization facilities. In this paper, we focus to use of a formalized process optimization approach for generating and improving business process designs.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130871580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Cloud Data Classification Model Using Fuzzy Logic 基于模糊逻辑的云数据分类模型
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380119
Oussama Arki, Abdelhafid Zitouni, A. Hadjali
In the last years, cloud computing has emerged as a new information technology (IT) model. Which provides an easy way for data processing and storage remotely through a network. The common solution to secure data in the cloud is data encryption. However, treating all data with the same security policy does not appear to be a good practice, because they do not have the same sensitivity for their owners. In this paper, we propose a model that aims to solve the problem of data sensitivity in cloud storage using the classification. The proposal is based on the use of fuzzy logic that uses the CIA (Confidentiality, Integrity and Availability) triad of information security to classify data.
在过去的几年里,云计算已经成为一种新的信息技术(IT)模式。它为通过网络远程处理和存储数据提供了一种简便的方法。保护云中的数据的常用解决方案是数据加密。但是,用相同的安全策略处理所有数据似乎不是一个好的做法,因为它们对其所有者没有相同的敏感性。在本文中,我们提出了一个模型,旨在利用分类来解决云存储中的数据敏感性问题。该提案基于模糊逻辑的使用,该逻辑使用CIA(机密性、完整性和可用性)信息安全三元组对数据进行分类。
{"title":"A Cloud Data Classification Model Using Fuzzy Logic","authors":"Oussama Arki, Abdelhafid Zitouni, A. Hadjali","doi":"10.1109/ICAASE51408.2020.9380119","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380119","url":null,"abstract":"In the last years, cloud computing has emerged as a new information technology (IT) model. Which provides an easy way for data processing and storage remotely through a network. The common solution to secure data in the cloud is data encryption. However, treating all data with the same security policy does not appear to be a good practice, because they do not have the same sensitivity for their owners. In this paper, we propose a model that aims to solve the problem of data sensitivity in cloud storage using the classification. The proposal is based on the use of fuzzy logic that uses the CIA (Confidentiality, Integrity and Availability) triad of information security to classify data.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123067764","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
Formal Modeling IoT Systems on the Basis of BiAgents* and Maude 基于BiAgents*和Maude的物联网系统形式化建模
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380126
Souad Marir, F. Belala, N. Hameurlain
The Internet of Things is an emerging worldwide ecosystem in which smart devices interact to build smart homes, smart cities, etc. In such context, plethora of research efforts are oriented to networking and devices; analyzing and formalizing IoT systems are still in their earliest state. In this paper, we propose a BiAgents* (Bigraphical Agents) model to provide a formal description for IoT systems structure and behavior. In addition, we encode the BiAgents* specification into Maude language to enable an autonomic execution of the IoT systems’ behaviors. The proposed approach is illustrated and evaluated through an example (an intelligent case of collision avoidance system).
物联网是一个新兴的全球生态系统,智能设备通过交互来构建智能家居、智能城市等。在这种背景下,大量的研究工作都是面向网络和设备的;物联网系统的分析和形式化仍处于早期阶段。在本文中,我们提出了一个BiAgents* (bigrapical Agents)模型来提供物联网系统结构和行为的形式化描述。此外,我们将BiAgents*规范编码为Maude语言,以实现物联网系统行为的自主执行。最后通过一个智能避碰系统的实例对该方法进行了说明和评价。
{"title":"Formal Modeling IoT Systems on the Basis of BiAgents* and Maude","authors":"Souad Marir, F. Belala, N. Hameurlain","doi":"10.1109/ICAASE51408.2020.9380126","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380126","url":null,"abstract":"The Internet of Things is an emerging worldwide ecosystem in which smart devices interact to build smart homes, smart cities, etc. In such context, plethora of research efforts are oriented to networking and devices; analyzing and formalizing IoT systems are still in their earliest state. In this paper, we propose a BiAgents* (Bigraphical Agents) model to provide a formal description for IoT systems structure and behavior. In addition, we encode the BiAgents* specification into Maude language to enable an autonomic execution of the IoT systems’ behaviors. The proposed approach is illustrated and evaluated through an example (an intelligent case of collision avoidance system).","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127255745","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
Towards an UML-based SoS Analysis and Design Process 基于uml的SoS分析与设计过程
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380112
N. Benlahrache, Chafia Bouanaka, M. Bendjaballah, Abdoudjallil Djarri
Systems of Systems or SoSs are an emerging class of systems built from large-scale constituent systems, that are often heterogeneous, with independent management, goals and resources. The heterogeneity and managerial independence of the constituent systems is both a strength and a drawback of SoS engineering. Although, the individual systems of an SoS may operate autonomously, their interactions present and usually provide important emerging properties that are constantly evolving. Therefore, coordination and interaction within the SoS constituent systems gives rise to an emerging behavior which defines the SoS overall goal. However, this may lead to unpredictable behavior (arrival/departure, failure to fulfill commitments) of the SoS constituent systems. As a result, a well-defined process for SoS engineering; where missions, capabilities and mainly the expected interactions of the constituent systems are well-established, is missing. Our objective in the present work is to propose an UML-based SoS analysis and design process (USDP). The process is iterative and incremental and will be instrumented and documented with various diagrams to ensure clarity and understandability of the USDP artifacts. Besides, a meta-model for SoS modelling will be defined, it mainly defines the SoS structure in terms of constituent systems, theirs missions, capabilities, and interactions. With the aim of reducing the abstraction of interactions and in order to ensure a high interoperability, a precise and coherent definition of the interactions among the heterogenous constituent systems of an SoS is given to make the description of the SoS more truthful. From a practical point of view, we develop a graphical editor for modeling an SoS, based on the strengths of the MDE approach.
系统的系统(SoSs)是一种新兴的系统,由大型组成系统构建而成,这些系统通常是异构的,具有独立的管理、目标和资源。组成系统的异质性和管理独立性是SoS工程的优点和缺点。尽管单个系统可以自主运行,但它们之间的相互作用通常提供了不断发展的重要新特性。因此,SoS组成系统内部的协调和互动产生了一种新兴的行为,它定义了SoS的总体目标。然而,这可能会导致SoS组成系统的不可预测行为(到达/离开,未能履行承诺)。因此,一个定义良好的SoS工程过程;在任务、能力和主要是组成系统的预期相互作用已确立的情况下,则不存在。我们目前工作的目标是提出一个基于uml的SoS分析和设计过程(USDP)。该过程是迭代的和增量的,并且将使用各种图表进行仪器化和文档化,以确保USDP工件的清晰度和可理解性。此外,还将定义一个用于SoS建模的元模型,主要从组成系统、它们的任务、能力和交互等方面定义SoS的结构。为了减少交互的抽象性,保证系统的高互操作性,给出了系统异构组成系统间交互的精确、一致的定义,使系统的描述更加真实。从实用的角度来看,基于MDE方法的优势,我们开发了一个图形化编辑器,用于对SoS进行建模。
{"title":"Towards an UML-based SoS Analysis and Design Process","authors":"N. Benlahrache, Chafia Bouanaka, M. Bendjaballah, Abdoudjallil Djarri","doi":"10.1109/ICAASE51408.2020.9380112","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380112","url":null,"abstract":"Systems of Systems or SoSs are an emerging class of systems built from large-scale constituent systems, that are often heterogeneous, with independent management, goals and resources. The heterogeneity and managerial independence of the constituent systems is both a strength and a drawback of SoS engineering. Although, the individual systems of an SoS may operate autonomously, their interactions present and usually provide important emerging properties that are constantly evolving. Therefore, coordination and interaction within the SoS constituent systems gives rise to an emerging behavior which defines the SoS overall goal. However, this may lead to unpredictable behavior (arrival/departure, failure to fulfill commitments) of the SoS constituent systems. As a result, a well-defined process for SoS engineering; where missions, capabilities and mainly the expected interactions of the constituent systems are well-established, is missing. Our objective in the present work is to propose an UML-based SoS analysis and design process (USDP). The process is iterative and incremental and will be instrumented and documented with various diagrams to ensure clarity and understandability of the USDP artifacts. Besides, a meta-model for SoS modelling will be defined, it mainly defines the SoS structure in terms of constituent systems, theirs missions, capabilities, and interactions. With the aim of reducing the abstraction of interactions and in order to ensure a high interoperability, a precise and coherent definition of the interactions among the heterogenous constituent systems of an SoS is given to make the description of the SoS more truthful. From a practical point of view, we develop a graphical editor for modeling an SoS, based on the strengths of the MDE approach.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133061534","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
Using Holonic Multi-agent Architecture to deal with complexity in Multi-modal emotion recognition 利用全息多智能体架构处理多模态情感识别中的复杂性
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380118
Tarek Boutefara, L. Mahdaoui
The affective computing is an increasingly important area in computer science. It aims to give computer system the ability to recognize and express affect. A key issue in affective computing is emotional data. Data in multiple formats and from different sources can be used and every format can be subject of different approaches and techniques. Several approaches can be combined to obtain better results. Because of this, multi-modal emotion detection requires an architecture that can support complexity and heterogeneity. This paper proposes a Holonic multi-agent architecture to design multi-modal emotion recognition and affective computing systems. Also, it describes the design and implementation of a prototype that demonstrates the applicability, adequacy and adaptability of the proposed architecture.
情感计算是计算机科学中一个日益重要的领域。它旨在赋予计算机系统识别和表达情感的能力。情感计算的一个关键问题是情感数据。可以使用多种格式和来自不同来源的数据,每种格式都可以采用不同的方法和技术。几种方法可以结合使用以获得更好的结果。正因为如此,多模态情感检测需要一个能够支持复杂性和异质性的架构。本文提出了一种全息多智能体架构来设计多模态情感识别和情感计算系统。此外,它还描述了一个原型的设计和实现,该原型演示了所提议的体系结构的适用性、充分性和适应性。
{"title":"Using Holonic Multi-agent Architecture to deal with complexity in Multi-modal emotion recognition","authors":"Tarek Boutefara, L. Mahdaoui","doi":"10.1109/ICAASE51408.2020.9380118","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380118","url":null,"abstract":"The affective computing is an increasingly important area in computer science. It aims to give computer system the ability to recognize and express affect. A key issue in affective computing is emotional data. Data in multiple formats and from different sources can be used and every format can be subject of different approaches and techniques. Several approaches can be combined to obtain better results. Because of this, multi-modal emotion detection requires an architecture that can support complexity and heterogeneity. This paper proposes a Holonic multi-agent architecture to design multi-modal emotion recognition and affective computing systems. Also, it describes the design and implementation of a prototype that demonstrates the applicability, adequacy and adaptability of the proposed architecture.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124075857","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
Concept Dissimilarity Based Approach for Skyline Relaxation 基于概念差异的Skyline松弛方法
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380121
Mohamed Haddache, A. Hadjali, H. Azzoune
In the recent years, skyline queries become one of the predominant and most frequently used queries among preference queries in the database system. Based on the concept of Pareto dominance, skyline queries attempt to incorporate and provide a flexible query operator that returns objects (skylines) which are not being dominated (in sense of Pareto) by other objects in all dimensions (attributes) of the database. However, this process leads to two scenarios: either (i) a huge number of skyline objects are returned which are less informative for the end-users or (ii) a small number of skyline objects are retrieved which could be insufficient to serve the user needs. In this paper we tackle the second problem and we propose a new efficient approach to relax the skyline and increase its size. The basic idea is to build the fuzzy formal concept lattice for dominated objects, i.e., no skyline objects based on minimal distance between each concept and the ideal concept (i.e., the ideal object from the set of dominated objects w.r.t the user query). The relaxed skyline is given by the set Srelax, formed by the union of skyline objects and the objects of the concept who has the minimal distance to the ideal concept and the size of Srelax is equal to k. (k is the user defined parameter). Furthermore, we develop efficient algorithm to compute the relaxed skyline. A set of experiments is conducted to demonstrate the effectiveness and efficiency of the proposed approach.
近年来,skyline查询成为数据库系统首选项查询中最主要、最常用的查询之一。基于帕累托支配的概念,天际线查询试图合并并提供一个灵活的查询操作符,该操作符返回的对象(天际线)在数据库的所有维度(属性)中不被其他对象支配(在帕累托意义上)。然而,这个过程会导致两种情况:要么(i)返回大量的skyline对象,而这些对象对最终用户来说信息较少;要么(ii)检索到的skyline对象数量很少,可能不足以满足用户的需求。在本文中,我们解决了第二个问题,并提出了一种新的有效方法来放松天际线并增加其规模。其基本思想是基于每个概念与理想概念(即从用户查询的主导对象集合中的理想对象)之间的最小距离,为主导对象(即无天际线对象)构建模糊形式概念格。松弛的天际线由集合Srelax给出,该集合由天际线对象与概念中与理想概念距离最小的对象联合而成,且Srelax的大小等于k (k为用户自定义参数)。此外,我们还开发了有效的算法来计算松弛的天际线。一组实验证明了该方法的有效性和高效性。
{"title":"Concept Dissimilarity Based Approach for Skyline Relaxation","authors":"Mohamed Haddache, A. Hadjali, H. Azzoune","doi":"10.1109/ICAASE51408.2020.9380121","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380121","url":null,"abstract":"In the recent years, skyline queries become one of the predominant and most frequently used queries among preference queries in the database system. Based on the concept of Pareto dominance, skyline queries attempt to incorporate and provide a flexible query operator that returns objects (skylines) which are not being dominated (in sense of Pareto) by other objects in all dimensions (attributes) of the database. However, this process leads to two scenarios: either (i) a huge number of skyline objects are returned which are less informative for the end-users or (ii) a small number of skyline objects are retrieved which could be insufficient to serve the user needs. In this paper we tackle the second problem and we propose a new efficient approach to relax the skyline and increase its size. The basic idea is to build the fuzzy formal concept lattice for dominated objects, i.e., no skyline objects based on minimal distance between each concept and the ideal concept (i.e., the ideal object from the set of dominated objects w.r.t the user query). The relaxed skyline is given by the set Srelax, formed by the union of skyline objects and the objects of the concept who has the minimal distance to the ideal concept and the size of Srelax is equal to k. (k is the user defined parameter). Furthermore, we develop efficient algorithm to compute the relaxed skyline. A set of experiments is conducted to demonstrate the effectiveness and efficiency of the proposed approach.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122445404","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
EEPSCZ: An Energy-Efficient Protocol with Static Clustering Zones EEPSCZ:一种具有静态集群区域的节能协议
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380107
A. Abbas, M. Amad, Juba Bellal, A. Moussaoui
A wireless sensor network is a network system composed by a large number of communicating sensor nodes through wireless links. The main problem in wireless sensor networks is their constraints in terms of computational power, and thereafter for their energy consumption. In this work, we propose a new hierarchical routing protocol called Energy Efficient Protocol Static Clustering Zones (EEPSCZ) that aims to minimize energy consumption for wireless sensor network. EEPSCZ splits the network into layers; each layer is divided into a set of zones which forms the static clusters in order to eliminate the overhead caused by the dynamic clustering. EEPSCZ uses multi-hop between these different layers and utilizes temporary cluster heads to distribute the energy load of sensor nodes. We have conducted simulation to compare the performance of EEPSCZ with Energy Efficient Protocol with Static Clustering (EEPSC). Results show that EEPSCZ allows less amount energy consumption. It reduces the number of failed nodes, and therefore keeps more nodes alive after sending packets thus extends network lifetime.
无线传感器网络是由大量通过无线链路进行通信的传感器节点组成的网络系统。无线传感器网络的主要问题是它们在计算能力方面的限制,然后是它们的能量消耗。在这项工作中,我们提出了一种新的分层路由协议,称为能源效率协议静态聚类区域(EEPSCZ),旨在最大限度地减少无线传感器网络的能源消耗。EEPSCZ将网络分成几层;为了消除动态集群带来的开销,将每一层划分为一组区域,这些区域形成静态集群。EEPSCZ在这些不同的层之间使用多跳,并利用临时簇头来分配传感器节点的能量负载。通过仿真比较了EEPSCZ与静态聚类节能协议(Energy Efficient Protocol with Static Clustering, EEPSC)的性能。结果表明,EEPSCZ允许较少的能耗。它减少了故障节点的数量,从而在发送数据包后保持更多节点存活,从而延长了网络生命周期。
{"title":"EEPSCZ: An Energy-Efficient Protocol with Static Clustering Zones","authors":"A. Abbas, M. Amad, Juba Bellal, A. Moussaoui","doi":"10.1109/ICAASE51408.2020.9380107","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380107","url":null,"abstract":"A wireless sensor network is a network system composed by a large number of communicating sensor nodes through wireless links. The main problem in wireless sensor networks is their constraints in terms of computational power, and thereafter for their energy consumption. In this work, we propose a new hierarchical routing protocol called Energy Efficient Protocol Static Clustering Zones (EEPSCZ) that aims to minimize energy consumption for wireless sensor network. EEPSCZ splits the network into layers; each layer is divided into a set of zones which forms the static clusters in order to eliminate the overhead caused by the dynamic clustering. EEPSCZ uses multi-hop between these different layers and utilizes temporary cluster heads to distribute the energy load of sensor nodes. We have conducted simulation to compare the performance of EEPSCZ with Energy Efficient Protocol with Static Clustering (EEPSC). Results show that EEPSCZ allows less amount energy consumption. It reduces the number of failed nodes, and therefore keeps more nodes alive after sending packets thus extends network lifetime.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127487153","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
Classification of Android APIs Posts : An analysis of developer’s discussions on Stack Overflow Android api帖子分类:开发者关于Stack Overflow的讨论分析
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380113
Chahrazed Beddiar, Issam Eddine Khelili, N. Bounour, A. Seriai
Discussions concerning mobile applications development are growing significantly in the recent years in questions and answers websites such as Stack Overflow (SO). Developers commonly resort to Stack Overflow to solve their technical issues and seek professional help. In this paper, we aim to analyze developers’ discussions about Android APIs in order for us to understand how these questions evolve over the years and what answers could possibly contain (code, URL). Therefore, we suggest a novel classification technique to identify the Android APIs that are being most discussed. The proposed technique is based on the official online documentation of Android APIs and the Random Forest Classifier algorithm (RFC). Our findings show that the most discussed Android APIs by developers on SO is “google.android.collect”.
近年来,在Stack Overflow (SO)等问答网站上,关于移动应用开发的讨论正在显著增长。开发人员通常求助于Stack Overflow来解决他们的技术问题并寻求专业帮助。在本文中,我们的目标是分析开发者关于Android api的讨论,以便我们了解这些问题是如何演变的,以及答案可能包含什么(代码,URL)。因此,我们建议一种新的分类技术来识别被讨论最多的Android api。所提出的技术是基于Android api的官方在线文档和随机森林分类器算法(RFC)。我们的调查结果显示,开发者在SO上讨论最多的Android api是“google.android.collect”。
{"title":"Classification of Android APIs Posts : An analysis of developer’s discussions on Stack Overflow","authors":"Chahrazed Beddiar, Issam Eddine Khelili, N. Bounour, A. Seriai","doi":"10.1109/ICAASE51408.2020.9380113","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380113","url":null,"abstract":"Discussions concerning mobile applications development are growing significantly in the recent years in questions and answers websites such as Stack Overflow (SO). Developers commonly resort to Stack Overflow to solve their technical issues and seek professional help. In this paper, we aim to analyze developers’ discussions about Android APIs in order for us to understand how these questions evolve over the years and what answers could possibly contain (code, URL). Therefore, we suggest a novel classification technique to identify the Android APIs that are being most discussed. The proposed technique is based on the official online documentation of Android APIs and the Random Forest Classifier algorithm (RFC). Our findings show that the most discussed Android APIs by developers on SO is “google.android.collect”.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123497140","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
[ICAASE 2020 Front cover] [ICAASE 2020封面]
Pub Date : 2020-11-28 DOI: 10.1109/icaase51408.2020.9380102
{"title":"[ICAASE 2020 Front cover]","authors":"","doi":"10.1109/icaase51408.2020.9380102","DOIUrl":"https://doi.org/10.1109/icaase51408.2020.9380102","url":null,"abstract":"","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125965691","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
Personalized Menu: a New Contextual Collaborative Recommender System 个性化菜单:一种新的上下文协同推荐系统
Pub Date : 2020-11-28 DOI: 10.1109/ICAASE51408.2020.9380111
Hanane Zitouni, Khadidja Bouchelik, Ramla Saidi, Nassira Chekkai
The varied number of suggested meals put people who spend most of their time outside to a confusing situation. In addition, the proposed items (meals) are standard for all people, meaning that they receive the same menu, although they differ in many attributes such as age, weight, health status, eating habits and tastes. A recommendation based on nutritional value can help people to prevent or control certain diseases such as diabetes, hypertension and obesity. However, learning about people’s food preferences and making recommendations that simultaneously appeal to their health expectations, which can be very difficult, is really a very difficult task. Many existing recommendation systems do not take into account the context in which the user is placed and often suffer from the cold start system problem. Through this work, we propose a new collaborative and contextual recommendation system that allows the target user to be directed towards healthy menu of tasty meals. For this, the proposed approach was named Healthy and Tasty (H&T). H&T is a recommendation system based on a multilayer architecture, where the highest layer is based on the pre-filtering algorithm, which eliminates the cold start system problem, and is based mainly on the thresholds of the compatible nutritional elements with the user profile, thus ensuring the healthy factor in the recommendations. The middle layer based on collaborative filtering algorithm works in particular to ensure the taste factor, while the deepest layer is the pertinent layer based on the post-filtering algorithm, where the recommendation will be much more adapted to the environment of the user. The proposed approach has been realized via an Android application where the experimental results are promoters.
各种各样的食物建议让那些大部分时间都在外面的人感到困惑。此外,建议的项目(膳食)是所有人的标准,这意味着他们收到相同的菜单,尽管他们在年龄、体重、健康状况、饮食习惯和口味等许多属性上有所不同。基于营养价值的建议可以帮助人们预防或控制某些疾病,如糖尿病、高血压和肥胖。然而,了解人们的食物偏好并提出建议,同时满足他们对健康的期望,这是非常困难的,真的是一项非常困难的任务。许多现有的推荐系统没有考虑到用户所处的环境,经常遭受冷启动系统的问题。通过这项工作,我们提出了一个新的协作和上下文推荐系统,可以将目标用户引导到美味的健康菜单上。为此,提出的方法被命名为健康和美味(H&T)。H&T是一种基于多层架构的推荐系统,其中最高层基于预过滤算法,消除了冷启动系统的问题,主要基于与用户档案相匹配的营养元素阈值,从而保证了推荐中的健康因素。基于协同过滤算法的中间层主要保证口味因素,而最深层是基于后过滤算法的相关层,其推荐将更加适应用户的环境。所提出的方法已通过Android应用程序实现,其中实验结果为推广程序。
{"title":"Personalized Menu: a New Contextual Collaborative Recommender System","authors":"Hanane Zitouni, Khadidja Bouchelik, Ramla Saidi, Nassira Chekkai","doi":"10.1109/ICAASE51408.2020.9380111","DOIUrl":"https://doi.org/10.1109/ICAASE51408.2020.9380111","url":null,"abstract":"The varied number of suggested meals put people who spend most of their time outside to a confusing situation. In addition, the proposed items (meals) are standard for all people, meaning that they receive the same menu, although they differ in many attributes such as age, weight, health status, eating habits and tastes. A recommendation based on nutritional value can help people to prevent or control certain diseases such as diabetes, hypertension and obesity. However, learning about people’s food preferences and making recommendations that simultaneously appeal to their health expectations, which can be very difficult, is really a very difficult task. Many existing recommendation systems do not take into account the context in which the user is placed and often suffer from the cold start system problem. Through this work, we propose a new collaborative and contextual recommendation system that allows the target user to be directed towards healthy menu of tasty meals. For this, the proposed approach was named Healthy and Tasty (H&T). H&T is a recommendation system based on a multilayer architecture, where the highest layer is based on the pre-filtering algorithm, which eliminates the cold start system problem, and is based mainly on the thresholds of the compatible nutritional elements with the user profile, thus ensuring the healthy factor in the recommendations. The middle layer based on collaborative filtering algorithm works in particular to ensure the taste factor, while the deepest layer is the pertinent layer based on the post-filtering algorithm, where the recommendation will be much more adapted to the environment of the user. The proposed approach has been realized via an Android application where the experimental results are promoters.","PeriodicalId":405638,"journal":{"name":"2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129502599","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
期刊
2020 International Conference on Advanced Aspects of Software Engineering (ICAASE)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1