Pub Date : 2019-12-01DOI: 10.1109/icces.2015.7393082
Session BM: Biomedical Engineering
会议BM:生物医学工程
{"title":"Session BM: Biomedical Engineering","authors":"","doi":"10.1109/icces.2015.7393082","DOIUrl":"https://doi.org/10.1109/icces.2015.7393082","url":null,"abstract":"Session BM: Biomedical Engineering","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127340819","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068167
Heba Sayed, Georgios A. Dafoulas, N. Saleeb
In the information age, the Internet and its applications are creating a ‘network state’ due to the continuous interaction of Social Networking Sites (SNS) by people on their daily personal and professional lives; which made it a rich data bank for researchers to analyse and predict people's behavioural, cultural and societal change. This paper discusses the behavioural patterns of SNS users across nations. The methodology employed was interviews with 48 individuals from diverse nationalities. The analysis process utilized a qualitative content analysis technique. The findings indicated that SNS users can be divided into two main categories: social users and student users. Each group has its characteristic behaviours and its unique perception about the impact of SNS on their digital communication.
{"title":"Social Networking Sites (SNS) and Digital Communication Across Nations","authors":"Heba Sayed, Georgios A. Dafoulas, N. Saleeb","doi":"10.1109/ICCES48960.2019.9068167","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068167","url":null,"abstract":"In the information age, the Internet and its applications are creating a ‘network state’ due to the continuous interaction of Social Networking Sites (SNS) by people on their daily personal and professional lives; which made it a rich data bank for researchers to analyse and predict people's behavioural, cultural and societal change. This paper discusses the behavioural patterns of SNS users across nations. The methodology employed was interviews with 48 individuals from diverse nationalities. The analysis process utilized a qualitative content analysis technique. The findings indicated that SNS users can be divided into two main categories: social users and student users. Each group has its characteristic behaviours and its unique perception about the impact of SNS on their digital communication.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113957781","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068146
M. A. Ellatif, Essam M. Shaaban, Mohamed Amin
Monitoring business processes is one of process mining duties, this study aims to detect and diagnose deviations in business processes starting from process discovery to detection and diagnosis as well. The solution is applied to an anonymous Radiology lab in Egypt that focuses on the service process. The data set is about 184622 events that represent 21478 cases extracted from the database according to process mining required attributes. After detecting deviations by applying conformance checking; the results show the deviated cases because of the skipped, inserted, or switched activities. Besides; in some cases, there are overlapped processes that lead to a lot of diagnostics are applied to know deviations causes that influence the process which gives more insights for both all moves on the log and all moves on model for all activities. This finally gives recommendations to control these deviations and to enhance the service process by separating some activities into another process, some cases when doing more one service, or the interaction between instruments and the service process which finally enhanced the service process in the Radiology lab.
{"title":"Detecting Deviations in Business Processes Using Process Mining","authors":"M. A. Ellatif, Essam M. Shaaban, Mohamed Amin","doi":"10.1109/ICCES48960.2019.9068146","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068146","url":null,"abstract":"Monitoring business processes is one of process mining duties, this study aims to detect and diagnose deviations in business processes starting from process discovery to detection and diagnosis as well. The solution is applied to an anonymous Radiology lab in Egypt that focuses on the service process. The data set is about 184622 events that represent 21478 cases extracted from the database according to process mining required attributes. After detecting deviations by applying conformance checking; the results show the deviated cases because of the skipped, inserted, or switched activities. Besides; in some cases, there are overlapped processes that lead to a lot of diagnostics are applied to know deviations causes that influence the process which gives more insights for both all moves on the log and all moves on model for all activities. This finally gives recommendations to control these deviations and to enhance the service process by separating some activities into another process, some cases when doing more one service, or the interaction between instruments and the service process which finally enhanced the service process in the Radiology lab.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121832600","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 : 2019-12-01DOI: 10.1109/icces48960.2019.9068120
{"title":"Session SE: Software Engineering","authors":"","doi":"10.1109/icces48960.2019.9068120","DOIUrl":"https://doi.org/10.1109/icces48960.2019.9068120","url":null,"abstract":"","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129090046","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068135
Nilly Elsaka, Nada El-shennawy, M. Fahmy
Wireless sensor networks (WSNs) have gained researchers attraction over the recent years because it supports lot of applications as combat field management and disaster surveillance. Wireless sensors have the problem of dissipating more energy in the communication process, so we need to prolong the network lifetime by using an efficient method to minimize consuming sensors' energy in both routing and clustering process. In this paper, an energy-aware clustering/routing protocol based on A * mechanism is developed. The algorithm is evaluated using MATLAB. Its performance is compared with CBCCP and LEACH protocols in terms of number of sending packets, the number of dead nodes and sum of network nodes energy. The results show the proposed algorithm superiority over the two compared algorithms.
{"title":"An Energy-Aware Clustering/Routing A*Algorithm for Wireless Sensor Networks","authors":"Nilly Elsaka, Nada El-shennawy, M. Fahmy","doi":"10.1109/ICCES48960.2019.9068135","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068135","url":null,"abstract":"Wireless sensor networks (WSNs) have gained researchers attraction over the recent years because it supports lot of applications as combat field management and disaster surveillance. Wireless sensors have the problem of dissipating more energy in the communication process, so we need to prolong the network lifetime by using an efficient method to minimize consuming sensors' energy in both routing and clustering process. In this paper, an energy-aware clustering/routing protocol based on A * mechanism is developed. The algorithm is evaluated using MATLAB. Its performance is compared with CBCCP and LEACH protocols in terms of number of sending packets, the number of dead nodes and sum of network nodes energy. The results show the proposed algorithm superiority over the two compared algorithms.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127513405","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068169
Aly Mohamed, Amr Sherif, Foad Osama, Youssef Roshdy, Mennat Allah Hassan, Walaa H. El Ashmawi
When it comes to searching online, massive information is available, it is really hard to provide relevant information to users based on their interest. Although while searching for data based on user inputs, they need to search the entire database, which is also very frustrating and time-consuming. Video consumption becoming essential in most users' life. On the most video platforms, users get their recommended videos based on some algorithms, calculations, implicit feed-backs, watch, search behaviors and search history. New videos suffer from cold-start which happens to freshly uploaded videos in which no data or reviews are available. Therefore, it is not easy to recommend these videos to some users. Another real problem that users face every day is that finding the desired content depends on the video being labeled or has multiple views. The search engine will find the videos based on keywords or tags, not on the content inside the video. One of the solutions for this problem is recommending videos based on content. This paper presents a new challenge on proposing a video recommendation system based on content using objects and features with the ability to search or block specific scenes.
{"title":"A new challenge on video recommendation by content","authors":"Aly Mohamed, Amr Sherif, Foad Osama, Youssef Roshdy, Mennat Allah Hassan, Walaa H. El Ashmawi","doi":"10.1109/ICCES48960.2019.9068169","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068169","url":null,"abstract":"When it comes to searching online, massive information is available, it is really hard to provide relevant information to users based on their interest. Although while searching for data based on user inputs, they need to search the entire database, which is also very frustrating and time-consuming. Video consumption becoming essential in most users' life. On the most video platforms, users get their recommended videos based on some algorithms, calculations, implicit feed-backs, watch, search behaviors and search history. New videos suffer from cold-start which happens to freshly uploaded videos in which no data or reviews are available. Therefore, it is not easy to recommend these videos to some users. Another real problem that users face every day is that finding the desired content depends on the video being labeled or has multiple views. The search engine will find the videos based on keywords or tags, not on the content inside the video. One of the solutions for this problem is recommending videos based on content. This paper presents a new challenge on proposing a video recommendation system based on content using objects and features with the ability to search or block specific scenes.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130560274","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068144
Mahmoud Nawar, Ahmed M. Fares, A. Al-sammak
Building scalable, adaptive, and collaborative traffic signal control system still remains to be further explored across relevant research communities, including computer science and transportation groups. In this study, a scalable multi-agent framework is proposed based on the coordination graphs framework where the global objective is decomposed into a linear sum of local edge-based functions. The proposed edge-based decomposition scales linearly with edges in dense networks. A novel combination of max-plus joint action selection algorithm with two collaborative model-free methods, including sparse cooperative Q-learning (SparseQ) and relative sparse cooperative Q-learning (RSparseQ), is utilized to control multi-intersection networks. Extensive experiments are carried out, and their results demonstrate the effectiveness of our proposed framework. In comparison with independent Q-learning agents, our proposed framework achieves superior performance in terms of vehicle trip time, waiting time and jam length. In addition, the reported results show that the proposed RSparseQ outperforms SparseQ in avoiding vehicles teleports, which leads to better driver satisfaction.
{"title":"SCMA: A Sparse Cooperative Multi-Agent Framework for Adaptive Traffic Signal Control","authors":"Mahmoud Nawar, Ahmed M. Fares, A. Al-sammak","doi":"10.1109/ICCES48960.2019.9068144","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068144","url":null,"abstract":"Building scalable, adaptive, and collaborative traffic signal control system still remains to be further explored across relevant research communities, including computer science and transportation groups. In this study, a scalable multi-agent framework is proposed based on the coordination graphs framework where the global objective is decomposed into a linear sum of local edge-based functions. The proposed edge-based decomposition scales linearly with edges in dense networks. A novel combination of max-plus joint action selection algorithm with two collaborative model-free methods, including sparse cooperative Q-learning (SparseQ) and relative sparse cooperative Q-learning (RSparseQ), is utilized to control multi-intersection networks. Extensive experiments are carried out, and their results demonstrate the effectiveness of our proposed framework. In comparison with independent Q-learning agents, our proposed framework achieves superior performance in terms of vehicle trip time, waiting time and jam length. In addition, the reported results show that the proposed RSparseQ outperforms SparseQ in avoiding vehicles teleports, which leads to better driver satisfaction.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130940267","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068168
Ahmed F. Hagar, Hazem M. Abbas, M. Khalil
This paper explores a deep learning model for emotion recognition in videos, suitable for systems with limited memory like robots and embedded-systems. The proposed model is a Mini-xception+LSTM architecure with around 80k parameters. This model got a classification accuracy of 93% in dinstinction between Anger and Amusement emotions using the BioVidEmo dataset, compared to 70% accuracy that a recent work got for the same two emotions, and got 86 % and 90 % classification accuracy using the CK+dataset for seven and six emotions, respectively.
{"title":"Emotion Recognition In Videos For Low-Memory Systems Using Deep-Learning","authors":"Ahmed F. Hagar, Hazem M. Abbas, M. Khalil","doi":"10.1109/ICCES48960.2019.9068168","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068168","url":null,"abstract":"This paper explores a deep learning model for emotion recognition in videos, suitable for systems with limited memory like robots and embedded-systems. The proposed model is a Mini-xception+LSTM architecure with around 80k parameters. This model got a classification accuracy of 93% in dinstinction between Anger and Amusement emotions using the BioVidEmo dataset, compared to 70% accuracy that a recent work got for the same two emotions, and got 86 % and 90 % classification accuracy using the CK+dataset for seven and six emotions, respectively.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131398522","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068118
Abla F. A. Saad, A. Kafafy, Osama Abd El Raouf, N. El-Hefnawy
Task scheduling in Parallel processing systems is considered as one of the most difficult NP-hard optimization problems, it represents the most critical issue in managing multiprocessors. The greatest challenge in these problems is to find the best schedule for these tasks in a reasonable amount of time. This paper introduces a new hybrid metaheuristic algorithm called GRASP-Simulated annealing (GRASP-SA) to handle such problems. In this proposal, GRASP algorithm is modified by adopting Simulated Annealing procedure instead of classical local search procedure used in GRASP. This means, Improving the classical GRASP through adding more capabilities to escape local optima. To identify the influence of the proposed modifications, GRASP-SA is verified against the original GRASP, the original Simulated Annealing (SA), and the recently developed GRASP-GA. a set of benchmark problems are adopted in this experiment. The results indicate the proposed GRASP-SA has two-fold superiority over its competitors, it can achieve the schedule with the minimum make span through the minimum running time for most test problems.
{"title":"A GRASP-Simulated Annealing approach applied to solve Multi-Processor Task Scheduling problems","authors":"Abla F. A. Saad, A. Kafafy, Osama Abd El Raouf, N. El-Hefnawy","doi":"10.1109/ICCES48960.2019.9068118","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068118","url":null,"abstract":"Task scheduling in Parallel processing systems is considered as one of the most difficult NP-hard optimization problems, it represents the most critical issue in managing multiprocessors. The greatest challenge in these problems is to find the best schedule for these tasks in a reasonable amount of time. This paper introduces a new hybrid metaheuristic algorithm called GRASP-Simulated annealing (GRASP-SA) to handle such problems. In this proposal, GRASP algorithm is modified by adopting Simulated Annealing procedure instead of classical local search procedure used in GRASP. This means, Improving the classical GRASP through adding more capabilities to escape local optima. To identify the influence of the proposed modifications, GRASP-SA is verified against the original GRASP, the original Simulated Annealing (SA), and the recently developed GRASP-GA. a set of benchmark problems are adopted in this experiment. The results indicate the proposed GRASP-SA has two-fold superiority over its competitors, it can achieve the schedule with the minimum make span through the minimum running time for most test problems.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131567071","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068158
H. Khaled
Parallel Recursive Brute Force (PRBF) is one of the algorithms that need high memory. Memory allocation techniques play an important role and have a great effect on the performance of the PRBF. This paper proposes a modified implementation of the PRBF algorithm that uses the static memory allocation technique instead of dynamic memory allocation techniques. This is to avoid the memory management overhead and heap contention problems associated with dynamic memory allocation technique. This paper uses the Motif Finding Problem (MFP), one of the well-known computationally intensive problems in the field of bioinformatics, as a case study. The exponential memory requirements based on the problem size of the MFP make it very challenging to use static memory allocation. Experimental results show that the use of static memory allocation has achieved a significant speedup factor when using 16 MPI rank in comparison with the same implementation using dynamic memory allocation. The proposed R-BF modification scalability is also tested by using different number of MPI nodes and distributing the search space among them, and the results proved a significant reduction in the execution time by increasing the number of working MPI nodes.
并行递归蛮力算法(PRBF)是需要高内存的算法之一。内存分配技术对PRBF的性能有很大的影响。本文提出了一种改进的PRBF算法，该算法使用静态内存分配技术代替动态内存分配技术。这是为了避免与动态内存分配技术相关的内存管理开销和堆争用问题。本文以生物信息学领域中计算密集型问题之一的Motif Finding Problem (MFP)为例进行了研究。基于MFP问题大小的指数级内存需求使得使用静态内存分配非常具有挑战性。实验结果表明，与使用动态内存分配的相同实现相比，使用静态内存分配在使用16 MPI rank时获得了显着的加速因子。通过使用不同数量的MPI节点并在MPI节点之间分配搜索空间来测试所提出的R-BF改进的可扩展性，结果证明通过增加工作MPI节点的数量可以显著减少执行时间。
{"title":"Enhancing Recursive Brute Force Algorithm with Static Memory Allocation: Solving Motif Finding Problem as a Case Study","authors":"H. Khaled","doi":"10.1109/ICCES48960.2019.9068158","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068158","url":null,"abstract":"Parallel Recursive Brute Force (PRBF) is one of the algorithms that need high memory. Memory allocation techniques play an important role and have a great effect on the performance of the PRBF. This paper proposes a modified implementation of the PRBF algorithm that uses the static memory allocation technique instead of dynamic memory allocation techniques. This is to avoid the memory management overhead and heap contention problems associated with dynamic memory allocation technique. This paper uses the Motif Finding Problem (MFP), one of the well-known computationally intensive problems in the field of bioinformatics, as a case study. The exponential memory requirements based on the problem size of the MFP make it very challenging to use static memory allocation. Experimental results show that the use of static memory allocation has achieved a significant speedup factor when using 16 MPI rank in comparison with the same implementation using dynamic memory allocation. The proposed R-BF modification scalability is also tested by using different number of MPI nodes and distributing the search space among them, and the results proved a significant reduction in the execution time by increasing the number of working MPI nodes.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114977803","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
扫码关注我们
求助内容：
应助结果提醒方式：