2019 14th International Conference on Computer Engineering and Systems (ICCES)最新文献_第5页

Session BM: Biomedical Engineering 会议BM:生物医学工程

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/icces.2015.7393082

引用次数: 0

Social Networking Sites (SNS) and Digital Communication Across Nations 社交网站(SNS)和跨国家的数字通信

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068167

Heba Sayed, Georgios A. Dafoulas, N. Saleeb

引用次数: 0

Detecting Deviations in Business Processes Using Process Mining 使用流程挖掘检测业务流程中的偏差

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068146

M. A. Ellatif, Essam M. Shaaban, Mohamed Amin

{"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}

引用次数: 1

Session SE: Software Engineering 会话SE:软件工程

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/icces48960.2019.9068120

引用次数: 0

An Energy-Aware Clustering/Routing A*Algorithm for Wireless Sensor Networks 基于能量感知的无线传感器网络聚类/路由A*算法

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068135

Nilly Elsaka, Nada El-shennawy, M. Fahmy

引用次数: 1

A new challenge on video recommendation by content 基于内容的视频推荐的新挑战

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068169

Aly Mohamed, Amr Sherif, Foad Osama, Youssef Roshdy, Mennat Allah Hassan, Walaa H. El Ashmawi

{"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}

引用次数: 2

SCMA: A Sparse Cooperative Multi-Agent Framework for Adaptive Traffic Signal Control 自适应交通信号控制的稀疏协作多智能体框架

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068144

Mahmoud Nawar, Ahmed M. Fares, A. Al-sammak

{"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}

引用次数: 0

Emotion Recognition In Videos For Low-Memory Systems Using Deep-Learning 使用深度学习的低记忆系统视频中的情绪识别

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068168

Ahmed F. Hagar, Hazem M. Abbas, M. Khalil

引用次数: 3

A GRASP-Simulated Annealing approach applied to solve Multi-Processor Task Scheduling problems 应用模拟退火方法求解多处理机任务调度问题

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068118

Abla F. A. Saad, A. Kafafy, Osama Abd El Raouf, N. El-Hefnawy

{"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}

引用次数: 2

Enhancing Recursive Brute Force Algorithm with Static Memory Allocation: Solving Motif Finding Problem as a Case Study 基于静态内存分配的改进递归蛮力算法:以解决Motif查找问题为例研究

2019 14th International Conference on Computer Engineering and Systems (ICCES) Pub Date : 2019-12-01 DOI: 10.1109/ICCES48960.2019.9068158

H. Khaled

{"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}

引用次数: 1