Pub Date : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585906
Nadia Ben Seghier, O. Kazar
Service discovery approaches, which reduce the cost of discovering services while also providing ease to users, are gaining popularity. Middleware for context-aware service discovery is necessary for more dynamic and useful service discovery. This study presents a new mobile agent-based paradigm for context-aware service discovery. We characterize the concept 'context' in two ways: one from the perspective of service requesters, such as devices, locations, preferences, and activities; and the other from the perspective of Web services, like protocols for service binding, networks, devices and platforms for service execution, and so on.
{"title":"A Context-Aware Service Discovery Framework Based on Mobile Agent","authors":"Nadia Ben Seghier, O. Kazar","doi":"10.1109/ICRAMI52622.2021.9585906","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585906","url":null,"abstract":"Service discovery approaches, which reduce the cost of discovering services while also providing ease to users, are gaining popularity. Middleware for context-aware service discovery is necessary for more dynamic and useful service discovery. This study presents a new mobile agent-based paradigm for context-aware service discovery. We characterize the concept 'context' in two ways: one from the perspective of service requesters, such as devices, locations, preferences, and activities; and the other from the perspective of Web services, like protocols for service binding, networks, devices and platforms for service execution, and so on.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125000505","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585910
Khaoula Merzoug, N. Boumaza, Billel Gheraibia
In this paper, we study the behavior of solution for viscoelastic wave equation with logarithmic nonlinearity term source. we established a general decay results of the energy, by using the logarithmic Sobolev Inequality.
{"title":"General Decay Result of Solutions for Viscoelastic Wave Equation with Logarithmic Nonlinearity","authors":"Khaoula Merzoug, N. Boumaza, Billel Gheraibia","doi":"10.1109/ICRAMI52622.2021.9585910","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585910","url":null,"abstract":"In this paper, we study the behavior of solution for viscoelastic wave equation with logarithmic nonlinearity term source. we established a general decay results of the energy, by using the logarithmic Sobolev Inequality.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122079506","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585947
Zouaidia Khouloud, Rais Med Saber
Nowadays the world is in desperate need for an alternative energy, due to the climate changes and the environmental damages caused by the abused use of traditional energy resources. In this paper we focused on the wind speed prediction for the wind energy generation purpose. A hybrid wind speed model was developed based on the Trailing Moving Average pre-processing method (TMA) and the Encoder-Decoder-Convolutional Neural Network-Long Short Term Memory (CNN-LSTM-ED) prediction model. The TMA technique was used for smoothing the wind speed data followed by the CNN-LSTM-ED hybrid deep learning network for the wind speed forecasting. The experimental results proved that the proposed hybrid model outperformed the benchmarks models being the LSTM, CNN, CNN-LSTM, LSTM-ED and CNN-LSTM-ED models respectively and provided the best performance and the more accurate wind speed forecast.
{"title":"Multi-Step Wind Speed Forecasting Based on Hybrid Deep Learning Model and Trailing Moving Average Denoising Technique","authors":"Zouaidia Khouloud, Rais Med Saber","doi":"10.1109/ICRAMI52622.2021.9585947","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585947","url":null,"abstract":"Nowadays the world is in desperate need for an alternative energy, due to the climate changes and the environmental damages caused by the abused use of traditional energy resources. In this paper we focused on the wind speed prediction for the wind energy generation purpose. A hybrid wind speed model was developed based on the Trailing Moving Average pre-processing method (TMA) and the Encoder-Decoder-Convolutional Neural Network-Long Short Term Memory (CNN-LSTM-ED) prediction model. The TMA technique was used for smoothing the wind speed data followed by the CNN-LSTM-ED hybrid deep learning network for the wind speed forecasting. The experimental results proved that the proposed hybrid model outperformed the benchmarks models being the LSTM, CNN, CNN-LSTM, LSTM-ED and CNN-LSTM-ED models respectively and provided the best performance and the more accurate wind speed forecast.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123124968","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585964
Moustafa Sadek Kahil, Abdelkrim Bouramoul, M. Derdour
Networks in the Big Data era are characterized by complex structures due to their heterogeneity, largeness and dynamics. As result, many issues regarding scalability have emerged. Among them, the community detection problem takes an important part. In the case of large-scale graphs, this problem presents a real issue because of its high complexity and therefore slowness. In this paper, we introduce a new approach based on Label Propagation Algorithm (LPA) to consider the community detection problem in a distributed and scalable way. It can be used for both single and multi-label networks. The experimentation is realized using the Spark GraphX framework. The results show its benefits.
{"title":"Multi Criteria-Based Community Detection and Visualization in Large-scale Networks Using Label Propagation Algorithm","authors":"Moustafa Sadek Kahil, Abdelkrim Bouramoul, M. Derdour","doi":"10.1109/ICRAMI52622.2021.9585964","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585964","url":null,"abstract":"Networks in the Big Data era are characterized by complex structures due to their heterogeneity, largeness and dynamics. As result, many issues regarding scalability have emerged. Among them, the community detection problem takes an important part. In the case of large-scale graphs, this problem presents a real issue because of its high complexity and therefore slowness. In this paper, we introduce a new approach based on Label Propagation Algorithm (LPA) to consider the community detection problem in a distributed and scalable way. It can be used for both single and multi-label networks. The experimentation is realized using the Spark GraphX framework. The results show its benefits.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128022641","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585979
Atef Bentahar, A. Meraoumia, H. Bendjenna, S. Chitroub, Abdelhakim Zeroual
Nowadays, biometric is a most technique to authenticate /identify human been, because its resistance against theft, loss or forgetfulness. However, biometric is subject to different transmission attacks. Today, the protection of the sensitive biometric information is a big challenge, especially in current wireless networks such as internet of things where the transmitted data is easy to sniffer. For that, this paper proposes an Eigens-Fingerprint-based biometric cryptosystem, where the biometric feature vectors are extracted by the Principal Component Analysis technique with an appropriate quantification. The key-binding principle incorporated with bit-wise and byte-wise correcting code is used for encrypting data and sharing key. Several recognition rates and computation time are used to evaluate the proposed system. The findings show that the proposed cryptosystem achieves a high security without decreasing the accuracy.
{"title":"Eigen-Fingerprints-Based Remote Authentication Cryptosystem","authors":"Atef Bentahar, A. Meraoumia, H. Bendjenna, S. Chitroub, Abdelhakim Zeroual","doi":"10.1109/ICRAMI52622.2021.9585979","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585979","url":null,"abstract":"Nowadays, biometric is a most technique to authenticate /identify human been, because its resistance against theft, loss or forgetfulness. However, biometric is subject to different transmission attacks. Today, the protection of the sensitive biometric information is a big challenge, especially in current wireless networks such as internet of things where the transmitted data is easy to sniffer. For that, this paper proposes an Eigens-Fingerprint-based biometric cryptosystem, where the biometric feature vectors are extracted by the Principal Component Analysis technique with an appropriate quantification. The key-binding principle incorporated with bit-wise and byte-wise correcting code is used for encrypting data and sharing key. Several recognition rates and computation time are used to evaluate the proposed system. The findings show that the proposed cryptosystem achieves a high security without decreasing the accuracy.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123766041","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585918
N. A. Saoucha
Cognitive radio is considered to be an intelligent device capable of ensuring an enhanced spectral efficiency, while satisfying the needs of the user in terms of quality of service, through making autonomous decisions adaptation to its dynamic environment in real time. In this paper, we propose firefly algorithm based on a real-coding, for the adaptation of the transmission parameters which has been formulated as a multi-objective optimization problem. The results obtained through a series of simulations demonstrate a clear superiority of our algorithms in terms of quality of solutions, speed of convergence and computation time compared to firefly algorithm based on a binary-coding.
{"title":"Cognitive Radio Engine Based on Real-Coded Firefly Algorithm","authors":"N. A. Saoucha","doi":"10.1109/ICRAMI52622.2021.9585918","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585918","url":null,"abstract":"Cognitive radio is considered to be an intelligent device capable of ensuring an enhanced spectral efficiency, while satisfying the needs of the user in terms of quality of service, through making autonomous decisions adaptation to its dynamic environment in real time. In this paper, we propose firefly algorithm based on a real-coding, for the adaptation of the transmission parameters which has been formulated as a multi-objective optimization problem. The results obtained through a series of simulations demonstrate a clear superiority of our algorithms in terms of quality of solutions, speed of convergence and computation time compared to firefly algorithm based on a binary-coding.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125175825","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}
Deep learning-based traffic sign recognition has been a very active area of research in autonomous driving since the appearance of Convolutional Neural Networks (CNN) as a substitute for classical machine learning algorithms. However, a good traffic sign recognition system (TSR) should inclusively fulfill accuracy, and response time compromise to be palatable in self-driving applications. Besides, the considerable computational load remains a burden to the adaptation and the design of CNN architectures for real-time applications. This paper aims to investigate the relationship between accuracy, efficiency, and computational complexity for the classification of traffic signs. MobileNetV2 and EfficientNet architectures were evaluated as they are specifically designed to be computationally efficient. When most of the contributed work in the literature focuses on accuracy, we rather focus on the choice of the most efficient model (best accuracy/model complexity ratio). The results support the intuitive idea that performance remains proportional to network size up to a given level beyond which it saturates.
{"title":"An Analytical Study of Efficient CNNs Tuning and Scaling for Traffic Signs Recognition","authors":"Imene Bouderbal, Abdenour Amamra, Mohamed Akrem Benatia","doi":"10.1109/ICRAMI52622.2021.9585952","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585952","url":null,"abstract":"Deep learning-based traffic sign recognition has been a very active area of research in autonomous driving since the appearance of Convolutional Neural Networks (CNN) as a substitute for classical machine learning algorithms. However, a good traffic sign recognition system (TSR) should inclusively fulfill accuracy, and response time compromise to be palatable in self-driving applications. Besides, the considerable computational load remains a burden to the adaptation and the design of CNN architectures for real-time applications. This paper aims to investigate the relationship between accuracy, efficiency, and computational complexity for the classification of traffic signs. MobileNetV2 and EfficientNet architectures were evaluated as they are specifically designed to be computationally efficient. When most of the contributed work in the literature focuses on accuracy, we rather focus on the choice of the most efficient model (best accuracy/model complexity ratio). The results support the intuitive idea that performance remains proportional to network size up to a given level beyond which it saturates.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121431838","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585917
Samia Moulai Hacene, S. Yessad, L. Bouallouche-Medjkoune
The special characteristics of Vehicular Ad hoc Networks such as dynamic topology, high mobility and frequent disconnection causes major problems during data dissemination. Since, the latter requires reliable communication in low delay, effective link quality estimation is a vital issue. Motivated by these facts, several link quality based dissemination approaches have been proposed. These approaches need to be surveyed to give a complete literature review and a comprehensive comparison. Therefore, we study and survey in this paper most of proposed link quality estimation based dissemination approaches. We, also, propose a classification of link quality estimation methods and according to this, we present a comparative study and analyze the presented works. Based on our study, we propose a new dissemination approach which aims to take advantages of the analyzed approaches.
{"title":"Link Quality Estimation for Reliable Data Dissemination in Vehicular Ad hoc Networks","authors":"Samia Moulai Hacene, S. Yessad, L. Bouallouche-Medjkoune","doi":"10.1109/ICRAMI52622.2021.9585917","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585917","url":null,"abstract":"The special characteristics of Vehicular Ad hoc Networks such as dynamic topology, high mobility and frequent disconnection causes major problems during data dissemination. Since, the latter requires reliable communication in low delay, effective link quality estimation is a vital issue. Motivated by these facts, several link quality based dissemination approaches have been proposed. These approaches need to be surveyed to give a complete literature review and a comprehensive comparison. Therefore, we study and survey in this paper most of proposed link quality estimation based dissemination approaches. We, also, propose a classification of link quality estimation methods and according to this, we present a comparative study and analyze the presented works. Based on our study, we propose a new dissemination approach which aims to take advantages of the analyzed approaches.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122426682","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585928
Amina-Aicha Khennaoui, A. Ouannas
A Leslie population model is an interesting mathematical discrete-time system because of its significant and wide applications in biology and ecology. In this paper, we extensively studied a fractional Leslie population model in the fractional μ-Caputo sense. For the different fractional order value and system parameters, the dynamics of the fractional population model are studied. It is verified that the new fractional population model undergoes doubling route to chaos and Neimark-Sacker bifurcation. Moreover, The dynamic of this model is experimentally investigated via bifurcation diagrams, phase portraits, largest Lyapunov exponent. Furthermore, the chaotic dynamic of the proposed population model is confirmed using a 0-1 test method. Simulation results reveal that chaos can be observed in such fractional model and its dynamic behavior depends on the fractional order value.
{"title":"Chaos and Bifurcation of Fractional Discrete-Time Population Model","authors":"Amina-Aicha Khennaoui, A. Ouannas","doi":"10.1109/ICRAMI52622.2021.9585928","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585928","url":null,"abstract":"A Leslie population model is an interesting mathematical discrete-time system because of its significant and wide applications in biology and ecology. In this paper, we extensively studied a fractional Leslie population model in the fractional μ-Caputo sense. For the different fractional order value and system parameters, the dynamics of the fractional population model are studied. It is verified that the new fractional population model undergoes doubling route to chaos and Neimark-Sacker bifurcation. Moreover, The dynamic of this model is experimentally investigated via bifurcation diagrams, phase portraits, largest Lyapunov exponent. Furthermore, the chaotic dynamic of the proposed population model is confirmed using a 0-1 test method. Simulation results reveal that chaos can be observed in such fractional model and its dynamic behavior depends on the fractional order value.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122231922","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 : 2021-09-21DOI: 10.1109/ICRAMI52622.2021.9585951
B. Lekdim, A. Khemmoudj
In this paper, the displacements in the transverse directions of the beam with memory term and bending couplings are considered. Under the lowest conditions on the kernel function the result of general decay is proven by multiplier method.
本文考虑了带记忆项和弯曲耦合的梁的横向位移。在核函数最低条件下，用乘数法证明了一般衰减的结果。
{"title":"General Stability of Two-dimensional Viscoelastic Nonlinear Beam with Bending Couplings","authors":"B. Lekdim, A. Khemmoudj","doi":"10.1109/ICRAMI52622.2021.9585951","DOIUrl":"https://doi.org/10.1109/ICRAMI52622.2021.9585951","url":null,"abstract":"In this paper, the displacements in the transverse directions of the beam with memory term and bending couplings are considered. Under the lowest conditions on the kernel function the result of general decay is proven by multiplier method.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123420407","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
扫码关注我们
求助内容：
应助结果提醒方式：