Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296436
Mahmoud Bersali, A. Rachedi, Hafida Bouarfa
The advent of the Internet of Things has contributed to the development of traditional vehicular ad-hoc networks (VANETs) into a new approach called the Internet of Vehicles (IoV), which has recently been the subject of many researchers. For this purpose, many control mechanisms have been suggested for these networks to tackle their problems. Like dynamic topology changes due to high vehicles motion and the scalability issue due to the high number of vehicles connected. As a key mechanism used in the VANET, clustering has greatly enhanced performance in various applications. In this sight, the current study proposes a new collaborative clustering algorithm for the Internet of vehicles named: CCA-IoV, which takes advantage of the important computing and storage capabilities of modern vehicles to operate the clustering process. This latter is based on Node Score (SC) introduced by our approach and through cooperation between vehicles rather than access to remote servers. CCA-IoV reinforces the cluster stability structure by choosing a Vice Cluster Head as a supplement to the Cluster Head. We use the NS-2 network simulator and SUMO integrated environment to test the performance of the proposed scheme.
{"title":"A New Collaborative Clustering Approach for the Internet of Vehicles (CCA-IoV)","authors":"Mahmoud Bersali, A. Rachedi, Hafida Bouarfa","doi":"10.1109/EDiS49545.2020.9296436","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296436","url":null,"abstract":"The advent of the Internet of Things has contributed to the development of traditional vehicular ad-hoc networks (VANETs) into a new approach called the Internet of Vehicles (IoV), which has recently been the subject of many researchers. For this purpose, many control mechanisms have been suggested for these networks to tackle their problems. Like dynamic topology changes due to high vehicles motion and the scalability issue due to the high number of vehicles connected. As a key mechanism used in the VANET, clustering has greatly enhanced performance in various applications. In this sight, the current study proposes a new collaborative clustering algorithm for the Internet of vehicles named: CCA-IoV, which takes advantage of the important computing and storage capabilities of modern vehicles to operate the clustering process. This latter is based on Node Score (SC) introduced by our approach and through cooperation between vehicles rather than access to remote servers. CCA-IoV reinforces the cluster stability structure by choosing a Vice Cluster Head as a supplement to the Cluster Head. We use the NS-2 network simulator and SUMO integrated environment to test the performance of the proposed scheme.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122164864","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296437
Fairouz Bendjamaa, Taleb Nora
A dialogue-system is a medium of communication and interaction between humans and computers by exchanging questions and answers in natural languages. The performance of the latter depends on the ability to analyze the question, the good management of keywords to question the knowledge base, and finally the use of an efficient knowledge base. However, several problems related to developing dialogue systems are due to using traditional databases. In this project, we propose a dialogue-system based on a Quranic ontology. This system allows easy access to Qur’anic information by SPARQL queries from pre-existing domain ontology. The used ontology covers Quranic chapters and verses, each word of the Qur’an and its root and lemma.
{"title":"A Dialogue-System Using a Qur’anic Ontology","authors":"Fairouz Bendjamaa, Taleb Nora","doi":"10.1109/EDiS49545.2020.9296437","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296437","url":null,"abstract":"A dialogue-system is a medium of communication and interaction between humans and computers by exchanging questions and answers in natural languages. The performance of the latter depends on the ability to analyze the question, the good management of keywords to question the knowledge base, and finally the use of an efficient knowledge base. However, several problems related to developing dialogue systems are due to using traditional databases. In this project, we propose a dialogue-system based on a Quranic ontology. This system allows easy access to Qur’anic information by SPARQL queries from pre-existing domain ontology. The used ontology covers Quranic chapters and verses, each word of the Qur’an and its root and lemma.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"63 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114103180","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}
Pub Date : 2020-11-03DOI: 10.1109/edis49545.2020.9296455
A. Gómez
This talk will review the basic concepts of how IoT provide advanced solutions for data management based on open platform for data integration and interoperability. Solution for different scenarios like smart building, smart agriculture and smart cities will be described. This talk will review also the basic concepts of securing communications proposal for Internet of Things (IoT) and impact of new 5G networks.
{"title":"Advanced IoTbased Platforms for Smart Infrastructure: Projects DEMETER and WATERMED","authors":"A. Gómez","doi":"10.1109/edis49545.2020.9296455","DOIUrl":"https://doi.org/10.1109/edis49545.2020.9296455","url":null,"abstract":"This talk will review the basic concepts of how IoT provide advanced solutions for data management based on open platform for data integration and interoperability. Solution for different scenarios like smart building, smart agriculture and smart cities will be described. This talk will review also the basic concepts of securing communications proposal for Internet of Things (IoT) and impact of new 5G networks.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340543","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296478
Fayssal Bendaoud
The network selection is one of the most important problems in nowadays networking issues; it means that the users want to be best served at each instant of its multimedia experience (VoIP and video conferencing services). In this paper, we address a real-world problem which is the frequent mobility of the users in heterogeneous networks. The paper proposes a framework that allows the users to select the best networks for the whole call session especially form a mobility perspective. The idea consists of starting by the path prediction which is done using the Markov model order 2. After that, we make the network selection on the zones of each predicted path to select one of them to be used by the user. The results show that our proposal performs very well compared to other proposed approaches while maintaining a good Quality of Service (QoS).
{"title":"Markov model and a modified-SAW for network selection in a heterogeneous wireless environment","authors":"Fayssal Bendaoud","doi":"10.1109/EDiS49545.2020.9296478","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296478","url":null,"abstract":"The network selection is one of the most important problems in nowadays networking issues; it means that the users want to be best served at each instant of its multimedia experience (VoIP and video conferencing services). In this paper, we address a real-world problem which is the frequent mobility of the users in heterogeneous networks. The paper proposes a framework that allows the users to select the best networks for the whole call session especially form a mobility perspective. The idea consists of starting by the path prediction which is done using the Markov model order 2. After that, we make the network selection on the zones of each predicted path to select one of them to be used by the user. The results show that our proposal performs very well compared to other proposed approaches while maintaining a good Quality of Service (QoS).","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117116406","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296463
Meriem Zeboudj, K. Belkadi
Searching for information on the Web engages the user in a process of questioning for the choice of search engines. However, many Internet users suffer for the information choice which these search engines receive. On the other hand, if the queries do not express their needs or else their objectives, this implies that some information is not formulated, requiring the reformulation of these queries. In this paper, an approach of bio-inspired optimization based on the FireFly Algorithm is used to formulate the query by providing a new suggestion. This algorithm has been applied on the frequent itemsets generated by FP-Growth (frequent-pattern Growth). Moreover, every user interaction with the search engine has been treated as a Firefly path. The algorithmic solution allows the user to select the best path (which contains key words) among all possible solutions for the initial query. Experimentally, we study the performance of the proposed method in comparison to different techniques (particle swarms optimization and genetic algorithms).
{"title":"Web Query Reformulation Using FireFly Algorithm","authors":"Meriem Zeboudj, K. Belkadi","doi":"10.1109/EDiS49545.2020.9296463","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296463","url":null,"abstract":"Searching for information on the Web engages the user in a process of questioning for the choice of search engines. However, many Internet users suffer for the information choice which these search engines receive. On the other hand, if the queries do not express their needs or else their objectives, this implies that some information is not formulated, requiring the reformulation of these queries. In this paper, an approach of bio-inspired optimization based on the FireFly Algorithm is used to formulate the query by providing a new suggestion. This algorithm has been applied on the frequent itemsets generated by FP-Growth (frequent-pattern Growth). Moreover, every user interaction with the search engine has been treated as a Firefly path. The algorithmic solution allows the user to select the best path (which contains key words) among all possible solutions for the initial query. Experimentally, we study the performance of the proposed method in comparison to different techniques (particle swarms optimization and genetic algorithms).","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127780978","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296452
F. Alaa, M. Zoulikha, Bendoukha Hayat
Cloud computing is a distributed computing model; which refers to manipulating, configuring, and accessing the applications online. It offers online data storage, infrastructure and application. Task scheduling is one of the most important issues in cloud environment, such as the tasks must be affected to the appropriate virtual machines considering different factors at the same time, which leads to considering the task scheduling problem an NP-complete problem. This article presents an improved ROUND ROBIN (RR) CPU scheduling algorithm with varying time quantum. The appropriate algorithm proven better than traditional RR and IRRVQ algorithms. The results show that the waiting time and turnaround time have been reduced in the proposed approach compared to traditional RR and IRRVQ
{"title":"Improved Round Robin Scheduling Algorithm With Varying Time Quantum","authors":"F. Alaa, M. Zoulikha, Bendoukha Hayat","doi":"10.1109/EDiS49545.2020.9296452","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296452","url":null,"abstract":"Cloud computing is a distributed computing model; which refers to manipulating, configuring, and accessing the applications online. It offers online data storage, infrastructure and application. Task scheduling is one of the most important issues in cloud environment, such as the tasks must be affected to the appropriate virtual machines considering different factors at the same time, which leads to considering the task scheduling problem an NP-complete problem. This article presents an improved ROUND ROBIN (RR) CPU scheduling algorithm with varying time quantum. The appropriate algorithm proven better than traditional RR and IRRVQ algorithms. The results show that the waiting time and turnaround time have been reduced in the proposed approach compared to traditional RR and IRRVQ","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134439920","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296439
K. Gaffour, M. K. Benhaoua, Somdip Dey, A. Singh, Abou El hassen Benyamina
Networks-on-Chips have been suggested as a powerful solution to communication problems in multi/many-core architectures. The communications mapping consists of one of the crucial steps in architectural exploration in NoC-based multi/many-core architectures. Most works that are reported in the literature use virtual static clustering (the platform is devised in a different region with the same size). Parallelized mapping of communications tasks of the same application onto different regions causes degradation of system performance, especially when the number of tasks is greater than the number of processors of the chosen cluster. In this paper, a new dynamic clustering mapping strategy is proposed to place all the tasks of the same application in the same region. We have applied our proposed approach under different heuristics of applications tasks mapping. Comparative study of our proposed strategy provides significant performance improvements over the static clustering methodology.
{"title":"Dynamic clustering approach for run-time applications mapping on NoC-based multi/many-core systems","authors":"K. Gaffour, M. K. Benhaoua, Somdip Dey, A. Singh, Abou El hassen Benyamina","doi":"10.1109/EDiS49545.2020.9296439","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296439","url":null,"abstract":"Networks-on-Chips have been suggested as a powerful solution to communication problems in multi/many-core architectures. The communications mapping consists of one of the crucial steps in architectural exploration in NoC-based multi/many-core architectures. Most works that are reported in the literature use virtual static clustering (the platform is devised in a different region with the same size). Parallelized mapping of communications tasks of the same application onto different regions causes degradation of system performance, especially when the number of tasks is greater than the number of processors of the chosen cluster. In this paper, a new dynamic clustering mapping strategy is proposed to place all the tasks of the same application in the same region. We have applied our proposed approach under different heuristics of applications tasks mapping. Comparative study of our proposed strategy provides significant performance improvements over the static clustering methodology.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113990466","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296444
M. Benmahdi, M. Lehsaini
Energy efficiency is a very challenging issue in wire-less sensor networks (WSNs) since these networks are generally composed of a large number of energy-constrained sensors which are expected to run autonomously for long times and it may be cost-prohibitive to replace exhausted batteries of these sensors or even impossible in harsh environments. In this paper, we propose a novel routing protocol using genetic algorithm approach and K-means method to prolong network lifetime in WSNs. We involve k-means method to create clusters wherein cluster-heads are elected based on distance, residual energy and the occurrence of nodes state as cluster-head (CH). Moreover, we use genetic algorithm approach to establish CH-to-CH paths from a source node to the base station. The clustering process is performed if all members of a cluster are dead and the path constructing process will be triggered if a node changes status i.e. a member node becomes a CH. Simulation results demonstrate that our proposal provides better performance in terms of network lifetime and energy consumption compared to other routing protocols.
{"title":"A GA-based Multihop Routing Scheme using K-Means Clustering approach for Wireless Sensor Networks","authors":"M. Benmahdi, M. Lehsaini","doi":"10.1109/EDiS49545.2020.9296444","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296444","url":null,"abstract":"Energy efficiency is a very challenging issue in wire-less sensor networks (WSNs) since these networks are generally composed of a large number of energy-constrained sensors which are expected to run autonomously for long times and it may be cost-prohibitive to replace exhausted batteries of these sensors or even impossible in harsh environments. In this paper, we propose a novel routing protocol using genetic algorithm approach and K-means method to prolong network lifetime in WSNs. We involve k-means method to create clusters wherein cluster-heads are elected based on distance, residual energy and the occurrence of nodes state as cluster-head (CH). Moreover, we use genetic algorithm approach to establish CH-to-CH paths from a source node to the base station. The clustering process is performed if all members of a cluster are dead and the path constructing process will be triggered if a node changes status i.e. a member node becomes a CH. Simulation results demonstrate that our proposal provides better performance in terms of network lifetime and energy consumption compared to other routing protocols.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114615526","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296469
Benamar Bouougada, D. Bouchiha
The ontology authoring is a fundamental task in the Semantic Web. This process enables the domain expert to develop ontologies with the help of dedicated tools. This article presents an approach for building OWL ontologies from relational databases based on Model Driven Engineering (MDE). The proposed approach consists of two phases: (1) Preprocessing phase and (2) Transformation phase. The first one consists of creating an input model from the database which must conform to its meta-model. The second phase takes this model as input and transforms it into an OWL file by executing a set of mapping rules written in Atlas Transformation Language (ATL). The transformation process is done at a higher level of abstraction; it does a matching between the source meta-model elements (Database) and the target meta-model elements (OWL). We have concretized our approach as the DB2OWLOntology tool, and we have evaluated it with a set of databases. The obtained results are encouraging and show the efficiency of the proposed approach.
本体创作是语义Web的一项基本任务。这个过程使领域专家能够在专用工具的帮助下开发本体。本文提出了一种基于模型驱动工程(Model Driven Engineering, MDE)从关系数据库构建OWL本体的方法。该方法包括两个阶段:(1)预处理阶段和(2)转换阶段。第一个包括从数据库创建输入模型，该模型必须符合其元模型。第二阶段将此模型作为输入，并通过执行用Atlas Transformation Language (ATL)编写的一组映射规则将其转换为OWL文件。转换过程是在更高的抽象层次上完成的;它在源元模型元素(Database)和目标元模型元素(OWL)之间进行匹配。我们将这种方法具体化为DB2OWLOntology工具，并使用一组数据库对其进行了评估。所得结果令人鼓舞，表明了所提方法的有效性。
{"title":"Ontology Authoring from Relational Database: A Model Based Approach","authors":"Benamar Bouougada, D. Bouchiha","doi":"10.1109/EDiS49545.2020.9296469","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296469","url":null,"abstract":"The ontology authoring is a fundamental task in the Semantic Web. This process enables the domain expert to develop ontologies with the help of dedicated tools. This article presents an approach for building OWL ontologies from relational databases based on Model Driven Engineering (MDE). The proposed approach consists of two phases: (1) Preprocessing phase and (2) Transformation phase. The first one consists of creating an input model from the database which must conform to its meta-model. The second phase takes this model as input and transforms it into an OWL file by executing a set of mapping rules written in Atlas Transformation Language (ATL). The transformation process is done at a higher level of abstraction; it does a matching between the source meta-model elements (Database) and the target meta-model elements (OWL). We have concretized our approach as the DB2OWLOntology tool, and we have evaluated it with a set of databases. The obtained results are encouraging and show the efficiency of the proposed approach.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"286 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131539969","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}
Pub Date : 2020-11-03DOI: 10.1109/EDiS49545.2020.9296433
Hayi Mohamed Yassine, C. Zahira
The problem of finding the shortest path is a combinatorial well-studied optimization problem, this last decade and is a challenging task over large graphs. This article presents an improved optimization Genetic algorithm (IOGA) to solve the k shortest paths problem. Our algorithm based on the combination of the exact algorithm (Dijkstra) and metaheuristic algorithm (Genetic algorithm-GA) is proposed to return the k shortest optimal paths on graph in large-scale routing problems. Our empirical results show that the proposed algorithm surpasses and runs faster than Dijkstra’s algorithm and gives one or more paths,, while Dijkstra gives only one path.
{"title":"An Improved optimization Algorithm to Find Multiple Shortest Paths over Large Graph","authors":"Hayi Mohamed Yassine, C. Zahira","doi":"10.1109/EDiS49545.2020.9296433","DOIUrl":"https://doi.org/10.1109/EDiS49545.2020.9296433","url":null,"abstract":"The problem of finding the shortest path is a combinatorial well-studied optimization problem, this last decade and is a challenging task over large graphs. This article presents an improved optimization Genetic algorithm (IOGA) to solve the k shortest paths problem. Our algorithm based on the combination of the exact algorithm (Dijkstra) and metaheuristic algorithm (Genetic algorithm-GA) is proposed to return the k shortest optimal paths on graph in large-scale routing problems. Our empirical results show that the proposed algorithm surpasses and runs faster than Dijkstra’s algorithm and gives one or more paths,, while Dijkstra gives only one path.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123808029","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：