Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00132
Jose Alfredo Alvarez Aldana, S. Maag, Fatiha Zaïdi
Wireless networks have gained wide attention in recent years including studies on Mobile Ad-hoc Networks (MANET). Among the rich literature produced by the researchers, the problematic of MANET interoperability is becoming of high interest. Interoperability in a MANET refers to the communication between two separate domains or networks. This is an important research area aiming at enhancing the overall communication between MANETs. There are multiple proposals in the literature that study MANET interoperability. Their variability shows an energetic work and interesting proposals, in theory and in practice. The objective of this paper is to survey the main MANET works in the literature through different identified key aspects. We presented a comprehensive analysis of multiple proposals, techniques, features, opportunities, limitations and omissions. Based on that, we aim at guiding the researchers, practitioners and industrials who work on MANETs that interoperate.
{"title":"MANETs Interoperability: Current Trends and Open Research","authors":"Jose Alfredo Alvarez Aldana, S. Maag, Fatiha Zaïdi","doi":"10.1109/WAINA.2018.00132","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00132","url":null,"abstract":"Wireless networks have gained wide attention in recent years including studies on Mobile Ad-hoc Networks (MANET). Among the rich literature produced by the researchers, the problematic of MANET interoperability is becoming of high interest. Interoperability in a MANET refers to the communication between two separate domains or networks. This is an important research area aiming at enhancing the overall communication between MANETs. There are multiple proposals in the literature that study MANET interoperability. Their variability shows an energetic work and interesting proposals, in theory and in practice. The objective of this paper is to survey the main MANET works in the literature through different identified key aspects. We presented a comprehensive analysis of multiple proposals, techniques, features, opportunities, limitations and omissions. Based on that, we aim at guiding the researchers, practitioners and industrials who work on MANETs that interoperate.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130657817","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00061
Masaki Kohana, Hiroki Sakaji, Akio Kobayashi, S. Okamoto
This paper proposes a scheme for parallel calculation on a Web browser for contents categorization. When we provide a contents categorization with distributed calculation, the file transfer time becomes a major problem. However, if a browser can perform a part of the calculation, we can reduce the transfer time. In this paper, we use Web Workers that allows us to parallel computing. In our system, a Web browser uses the Web Workers and performs a part of the calculation.
{"title":"A Parallel Calculation Method on Web Browser for Contents Categorization","authors":"Masaki Kohana, Hiroki Sakaji, Akio Kobayashi, S. Okamoto","doi":"10.1109/WAINA.2018.00061","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00061","url":null,"abstract":"This paper proposes a scheme for parallel calculation on a Web browser for contents categorization. When we provide a contents categorization with distributed calculation, the file transfer time becomes a major problem. However, if a browser can perform a part of the calculation, we can reduce the transfer time. In this paper, we use Web Workers that allows us to parallel computing. In our system, a Web browser uses the Web Workers and performs a part of the calculation.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134493652","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00077
Meriem Meddah, R. Haddad, T. Ezzedine
In designing the Wireless Sensor Network, the energy consumption represents one of the most and important factor that recent researches aim to reduce efficiently. Because of the limited energy that sensor nodes are equipped with, and in order to prolong the network lifetime, we introduce a new clustering algorithm for WSN, which consists on choosing a subset of sensor nodes to be elected as Cluster Heads. This choice is based on three parameters; the residual energy, the density and the distances separating the node with its neighbors. Each node enters into a competition and makes its proper decision. Then, the network is divided into clusters and each member is affected to the nearest CH that has the job to gather the data of the members of its cluster. The efficiency of our proposed algorithm is proved comparing with some other clustering approaches. Simulation results show that the energy dissipation of the sensor nodes can be considerably reduced, and the network lifetime efficiently extended.
{"title":"Residual Energy and Density Control Aware Cluster Head Election in Wireless Sensor Network","authors":"Meriem Meddah, R. Haddad, T. Ezzedine","doi":"10.1109/WAINA.2018.00077","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00077","url":null,"abstract":"In designing the Wireless Sensor Network, the energy consumption represents one of the most and important factor that recent researches aim to reduce efficiently. Because of the limited energy that sensor nodes are equipped with, and in order to prolong the network lifetime, we introduce a new clustering algorithm for WSN, which consists on choosing a subset of sensor nodes to be elected as Cluster Heads. This choice is based on three parameters; the residual energy, the density and the distances separating the node with its neighbors. Each node enters into a competition and makes its proper decision. Then, the network is divided into clusters and each member is affected to the nearest CH that has the job to gather the data of the members of its cluster. The efficiency of our proposed algorithm is proved comparing with some other clustering approaches. Simulation results show that the energy dissipation of the sensor nodes can be considerably reduced, and the network lifetime efficiently extended.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114915878","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00085
D. Arora, P. Agathoklis, A. Loffler
The number of devices connected over the Internet are expected to grow tremendously over the next few years. Maintaining secure communications between these network-enabled devices would be a major challenge. By carefully examining the events generated by these devices it is expected to gain some insights into their behavior and identifying if a device has been compromised. One of the major challenges in classifying the events generated by these devices is the inconsistencies in the data formats of these events and the separators between them. The approach presented in this paper is based on identifying and grouping similar events generated by these devices using an Agglomerative Hierarchical Clustering technique. To deal with the inconsistencies of formats and delimiters, some data preprocessing was used. The methodology proposed in this study was successful in identifying events stored in fifteen data files tested for analysis. The results indicate that the combination of text processing techniques in conjunction with machine learning based unsupervised learning offers promising alternatives in separating events generated by the network-enabled devices and, thus, facilitating a better understanding of their behavior and identifying potential security breaches.
{"title":"Network Event Classification for Security of IT Infrastructure","authors":"D. Arora, P. Agathoklis, A. Loffler","doi":"10.1109/WAINA.2018.00085","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00085","url":null,"abstract":"The number of devices connected over the Internet are expected to grow tremendously over the next few years. Maintaining secure communications between these network-enabled devices would be a major challenge. By carefully examining the events generated by these devices it is expected to gain some insights into their behavior and identifying if a device has been compromised. One of the major challenges in classifying the events generated by these devices is the inconsistencies in the data formats of these events and the separators between them. The approach presented in this paper is based on identifying and grouping similar events generated by these devices using an Agglomerative Hierarchical Clustering technique. To deal with the inconsistencies of formats and delimiters, some data preprocessing was used. The methodology proposed in this study was successful in identifying events stored in fifteen data files tested for analysis. The results indicate that the combination of text processing techniques in conjunction with machine learning based unsupervised learning offers promising alternatives in separating events generated by the network-enabled devices and, thus, facilitating a better understanding of their behavior and identifying potential security breaches.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116311101","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00166
W. Balzano, Vinicio Barbieri, Giovanni Riccardi
This paper provide an algorithm for detecting a place to park inside a multi-level garage. The study is based on setting a different priority for each user, so the results of algorithm will vary depending on the user's priority (disabled people, police, etc.). The conditions of use are related to very crowded parking, so individual users will receive custom maps where the places will appear according to the priorities assigned to them. To achieve this objective, we shall use On Board Units (OBUs) and Road Side Units (RSUs) to build the distance matrix among all the sensors, but inside the VANET (Vehicular Ad Hoc Networks) the information is not exchanged indifferently for all users, but is suitably filtered and sorted by priority. In this way everyone will see only the places where they can park while others will be obscured. In the solution of the algorithm for calculating positions on the map we shall solve a Distance Geometry Problem, however, to locate the parking positions we use the DGP (Distance Geometry Problem) algorithm with the simplifications from continuous to discrete, reducing it to a DDGP3 (Discretizable Distance Geometry Problem in R3), and then solving it with a branch and pruning algorithm. We adopt a linear approximation techniques to resolve an intersection problem among three spheres.
{"title":"Smart Priority Park Framework Based on DDGP3","authors":"W. Balzano, Vinicio Barbieri, Giovanni Riccardi","doi":"10.1109/WAINA.2018.00166","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00166","url":null,"abstract":"This paper provide an algorithm for detecting a place to park inside a multi-level garage. The study is based on setting a different priority for each user, so the results of algorithm will vary depending on the user's priority (disabled people, police, etc.). The conditions of use are related to very crowded parking, so individual users will receive custom maps where the places will appear according to the priorities assigned to them. To achieve this objective, we shall use On Board Units (OBUs) and Road Side Units (RSUs) to build the distance matrix among all the sensors, but inside the VANET (Vehicular Ad Hoc Networks) the information is not exchanged indifferently for all users, but is suitably filtered and sorted by priority. In this way everyone will see only the places where they can park while others will be obscured. In the solution of the algorithm for calculating positions on the map we shall solve a Distance Geometry Problem, however, to locate the parking positions we use the DGP (Distance Geometry Problem) algorithm with the simplifications from continuous to discrete, reducing it to a DDGP3 (Discretizable Distance Geometry Problem in R3), and then solving it with a branch and pruning algorithm. We adopt a linear approximation techniques to resolve an intersection problem among three spheres.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"343 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132853146","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00100
O. Aldhaibani, F. Bouhafs, M. Mackay, A. Raschellà
This paper addresses the issue of the Handover (HO) decision in Wi-Fi environments. Existing HO methods do not meet the requirements of modern applications for mobile nodes due to the lack of intelligence, awareness Quality of Service (QoS) and the Quality of Experience (QoE) requirements of mobile users. We, therefore, introduce a novel architecture that implements a horizontal HO algorithm for Wi-Fi networks, based on Fuzzy Logic Control (FLC). This architecture is based on the Software Defined Networking (SDN) concept, where the Wi-Fi network is controlled centrally and the wireless Access Points (APs) are programmable. In this architecture, the proposed HO algorithm will assist wireless users to find the AP that can best support the application in terms of its QoS and QoE requirements. The use of FLC, which can include QoS and QoE in the HO algorithm, together with the use of SDN, provide promising performance results with respect to the 802.11 standard and another approach proposed in the literature.
{"title":"An SDN-Based Architecture for Smart Handover to Improve QoE in IEEE 802.11 WLANs","authors":"O. Aldhaibani, F. Bouhafs, M. Mackay, A. Raschellà","doi":"10.1109/WAINA.2018.00100","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00100","url":null,"abstract":"This paper addresses the issue of the Handover (HO) decision in Wi-Fi environments. Existing HO methods do not meet the requirements of modern applications for mobile nodes due to the lack of intelligence, awareness Quality of Service (QoS) and the Quality of Experience (QoE) requirements of mobile users. We, therefore, introduce a novel architecture that implements a horizontal HO algorithm for Wi-Fi networks, based on Fuzzy Logic Control (FLC). This architecture is based on the Software Defined Networking (SDN) concept, where the Wi-Fi network is controlled centrally and the wireless Access Points (APs) are programmable. In this architecture, the proposed HO algorithm will assist wireless users to find the AP that can best support the application in terms of its QoS and QoE requirements. The use of FLC, which can include QoS and QoE in the HO algorithm, together with the use of SDN, provide promising performance results with respect to the 802.11 standard and another approach proposed in the literature.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123494636","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00158
Chuan-Yu Chang, Fu Ren Chen
Obstruction of the nose and mouth by vomit or quilts is the main cause of sudden infant death. Different baby sleeping postures will increase the difficulty of face detection. Therefore, a deep learning neural network is adopted to detect baby faces and a novel algorithm is proposed to detect vomiting of infants in this paper. The SSD + mobilenet network in Teansorflow is adopted. Experimental results show reasonable detection results of the proposed method.
{"title":"Application of Deep Learning for Infant Vomiting and Crying Detection","authors":"Chuan-Yu Chang, Fu Ren Chen","doi":"10.1109/WAINA.2018.00158","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00158","url":null,"abstract":"Obstruction of the nose and mouth by vomit or quilts is the main cause of sudden infant death. Different baby sleeping postures will increase the difficulty of face detection. Therefore, a deep learning neural network is adopted to detect baby faces and a novel algorithm is proposed to detect vomiting of infants in this paper. The SSD + mobilenet network in Teansorflow is adopted. Experimental results show reasonable detection results of the proposed method.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130402423","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00056
M. Calzarossa, D. Tessera
Web content changes have a strong impact on search engines and more generally on technologies dealing with content retrieval and management. These technologies have to take account of the temporal patterns of these changes and adjust their crawling policies accordingly. This paper presents a methodological framework — based on time series analysis -- for modeling and predicting the dynamics of the content changes. To test this framework, we analyze the content of three major news websites whose change patterns are characterized by large fluctuations and significant differences across days and hours. The classical decomposition of the observed time series into trend, seasonal and irregular components is applied to identify the weekly and daily patterns as well as the remaining fluctuations. The corresponding models are used for predicting the future dynamics of the sites based on their current and historical behavior.
{"title":"Analysis and Forecasting of Web Content Dynamics","authors":"M. Calzarossa, D. Tessera","doi":"10.1109/WAINA.2018.00056","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00056","url":null,"abstract":"Web content changes have a strong impact on search engines and more generally on technologies dealing with content retrieval and management. These technologies have to take account of the temporal patterns of these changes and adjust their crawling policies accordingly. This paper presents a methodological framework — based on time series analysis -- for modeling and predicting the dynamics of the content changes. To test this framework, we analyze the content of three major news websites whose change patterns are characterized by large fluctuations and significant differences across days and hours. The classical decomposition of the observed time series into trend, seasonal and irregular components is applied to identify the weekly and daily patterns as well as the remaining fluctuations. The corresponding models are used for predicting the future dynamics of the sites based on their current and historical behavior.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"79 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121002938","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00147
L. Coppolino, S. D'Antonio, Giovanni Mazzeo, L. Romano, Luigi Sgaglione
The advent of the Internet has been opening new opportunities for Local Public Administrations (LPAs) to improve their efficiency while providing better services to citizens via an ever larger set of specialized network applications, including e-government, e-health, and more. Indeed, as a potential channel of accessing personal information, these specialized applications also expose the public sector to new risks. The cybersecurity landscape is changing, and Local Public Administrations are rapidly becoming an attractive target for cybercriminals, who might access some sets of personal data or gain control over smartly operated city resources through LPAs infrastructures. The consequences of cyber-threats have the potential to be considerable causing business interruptions, data losses, and thefts of intellectual property, significantly impacting both individuals and organizations. This paper provides an overview of the EU H2020 COMPACT (Competitive Methods to protect local Public Administration from Cyber security Threats) project, that aims to increase LPAs awareness, skills, and protection against cyber threats through risk assessment, game-based education, monitoring and knowledge sharing services that are highly usable, interoperable with major Commercial Off-The-Shelf (COTS) solutions, cloud-enabled and cloud-ready.
{"title":"How to Protect Public Administration from Cybersecurity Threats: The COMPACT Project","authors":"L. Coppolino, S. D'Antonio, Giovanni Mazzeo, L. Romano, Luigi Sgaglione","doi":"10.1109/WAINA.2018.00147","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00147","url":null,"abstract":"The advent of the Internet has been opening new opportunities for Local Public Administrations (LPAs) to improve their efficiency while providing better services to citizens via an ever larger set of specialized network applications, including e-government, e-health, and more. Indeed, as a potential channel of accessing personal information, these specialized applications also expose the public sector to new risks. The cybersecurity landscape is changing, and Local Public Administrations are rapidly becoming an attractive target for cybercriminals, who might access some sets of personal data or gain control over smartly operated city resources through LPAs infrastructures. The consequences of cyber-threats have the potential to be considerable causing business interruptions, data losses, and thefts of intellectual property, significantly impacting both individuals and organizations. This paper provides an overview of the EU H2020 COMPACT (Competitive Methods to protect local Public Administration from Cyber security Threats) project, that aims to increase LPAs awareness, skills, and protection against cyber threats through risk assessment, game-based education, monitoring and knowledge sharing services that are highly usable, interoperable with major Commercial Off-The-Shelf (COTS) solutions, cloud-enabled and cloud-ready.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125688877","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00066
D. P. Mahato, Ravi Shankar Singh
Reliability modeling and analysis of deadline-constrained grid computing system is a complex task. Additionally, a task must be completed within its given deadline. Therefore, deadline-miss failure is another type of failure which must be explained. This paper presents hierarchical model and analysis for the deadline-constrained grid service reliability.
{"title":"Reliability Modeling and Analysis for Deadline-Constrained Grid Service","authors":"D. P. Mahato, Ravi Shankar Singh","doi":"10.1109/WAINA.2018.00066","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00066","url":null,"abstract":"Reliability modeling and analysis of deadline-constrained grid computing system is a complex task. Additionally, a task must be completed within its given deadline. Therefore, deadline-miss failure is another type of failure which must be explained. This paper presents hierarchical model and analysis for the deadline-constrained grid service reliability.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128853815","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
扫码关注我们
求助内容：
应助结果提醒方式：