9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)最新文献

{"title":"Threat Modelling for the Virtual Machine Image in Cloud Computing","authors":"R. K. Hussein, V. Sassone","doi":"10.5121/CSIT.2019.90911","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90911","url":null,"abstract":"Cloud computing is one of the most smart technology in the era of computing as its capability todecrease the cost of data processing while increasing flexibility and scalability for computer processes. Security is one of the core concerns related to the cloud computing as it hinders the organizations to adopt this technology. Infrastructure as a service (IaaS) is one of the main services of cloud computing which uses virtualization to supply virtualized computing resources to its users through the internet. Virtual Machine Image is the key component in the cloud as it is used to run an instance. There are security issues related to the virtual machine image that need to be analysed as being an essential component related to the cloud computing. Some studies were conducted to provide countermeasure for the identify security threats. However, there is no study has attempted to synthesize security threats and corresponding vulnerabilities. In addition, these studies did not model and classified security threats to find their effect on the Virtual Machine Image. Therefore, this paper provides a threat modelling approach to identify threats that affect the virtual machine image. Furthermore, threat classification is carried out to each individual threat to find out their effects on the cloud computing. Potential attack was drawn to show how an adversary might exploit the weakness in the system to attack the Virtual Machine Image.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158591","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}

{"title":"Effective Service Composition Approach based on Pruning Performance Bottlenecks","authors":"Navinderjit Kaur Kahlon, K. Chahal","doi":"10.5121/CSIT.2019.90924","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90924","url":null,"abstract":"In recent years, several online services have proliferated to provide similar services with same functionality by different service providers with varying Quality of Service (QoS) properties. So, service composition should provide effective adaptation especially in a dynamically changing composition environment. Meanwhile, a large number of component services pose scalability issues. As a result, monitoring and resolving performance problems in web services based systems is challenging task as these systems depend on component web services that are distributed in nature. In this paper, a distributed approach is used to identify performance related problems in component web services. The service composition adaptation provides timely replacement of the performance bottleneck source that can prohibit performance degradation for the forthcoming requests. Experimentation results demonstrate the efficiency of the proposed approach, and also the quality of solution of a service composition is maintained.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133656972","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}

{"title":"Maximizing the Total Number of on TIME Jobs on Identical Machines","authors":"Hairong Zhao","doi":"10.5121/CSIT.2019.90909","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90909","url":null,"abstract":"This paper studies the job-scheduling problem on m ≥ 2 parallel/identical machines.There are n jobs, denoted by Ji,1 ≤ i ≤ n. Each job Ji, has a due date di. A job has one or more tasks, each with a specific processing time. The tasks can’t be preempted, i.e., once scheduled, a task cannot be interrupted and resumed later. Different tasks of the same job can be scheduled concurrently on different machines. A job is on time if all of its tasks finish before its due date; otherwise, it is tardy. A schedule of the jobs specifies which task is scheduled on which machine at what time. The problem is to find a schedule of these jobs so that the number of on time jobs is maximized; or equivalently, the number of tardy jobs is minimized. We consider two cases: the case when each job has only a single task and the case where a job can have one or more tasks. For the first case, if all jobs have common due date we design a simple algorithm and show that the algorithm can generate a schedule whose number of on time jobs is at most (m-1) less than that of the optimal schedule. We also show that the modified algorithm works for the second case with common due date and has same performance. Finally, we design an algorithm when jobs have different due dates for the second case. We conduct computation experiment and show that the algorithm has very good performance.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127019055","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}

{"title":"Three-Dimensional Reconstruction Using the Depth Map","authors":"A. Abderrahmani, R. Lasri, K. Satori","doi":"10.5121/CSIT.2019.90922","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90922","url":null,"abstract":"This paper presents an approach to reconstructing 3D objects based on the generation of dense depth map. From a two 2D images (a pair of images) of the same 3D object, taken from different points of view, a new grayscale image is estimated. It is an intermediate image between a purely 2D image and a 3D image where each pixel of this image represents a z-height according to its gray level value. Our objective therefore is to play on the precision of this map in order to prove the interest and effectiveness of this map on the quality of the reconstruction.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133924132","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}

{"title":"Context-Aware Trust-Based Access Control for Ubiquitous Systems","authors":"M. Yaici, Faiza Ainennas, Nassima Zidi","doi":"10.5121/CSIT.2019.90902","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90902","url":null,"abstract":"The ubiquitous computing and context-aware applications experience at the present time a very important development. This has led organizations to open more of their information systems, making them available anywhere, at any time and integrating the dimension of mobile users. This cannot be done without taking into account thoughtfully the access security: a pervasive information system must henceforth be able to take into account the contextual features to ensure a robust access control. In this paper, access control and a few existing mechanisms have been exposed. It is intended to show the importance of taking into account context during a request for access. In this regard, our proposal incorporates the concept of trust to establish a trust relationship according to three contextual constraints (location, social situation and time) in order to decide to grant or deny the access request of a user to a service.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114181233","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}

{"title":"Attribute Reduction and Decision Tree Pruning to Simplify Liver Fibrosis Prediction Algorithms A Cohort Study","authors":"M. Mabrouk, Abubakr Awad, H. Shousha, Wafaa Alake, A. Salama, T. Awad","doi":"10.5121/CSIT.2019.90927","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90927","url":null,"abstract":"Background: Assessment of liver fibrosis is a vital need for enabling therapeutic decisions and prognostic evaluations of chronic hepatitis. Liver biopsy is considered the definitive investigation for assessing the stage of liver fibrosis but it carries several limitations. FIB-4 and APRI also have a limited accuracy. The National Committee for Control of Viral Hepatitis (NCCVH) in Egypt has supplied a valuable pool of electronic patients’ data that data mining techniques can analyze to disclose hidden patterns, trends leading to the evolution of predictive algorithms. Aim: to collaborate with physicians to develop a novel reliable, easy to comprehend noninvasive model to predict the stage of liver fibrosis utilizing routine workup, without imposing extra costs for additional examinations especially in areas with limited resources like Egypt. Methods: This multi-centered retrospective study included baseline demographic, laboratory, and histopathological data of 69106 patients with chronic hepatitis C. We started by data collection preprocessing, cleansing and formatting for knowledge discovery of useful information from Electronic Health Records EHRs. Data mining has been used to build a decision tree (Reduced Error Pruning tree (REP tree)) with 10-fold internal cross-validation. Histopathology results were used to assess accuracy for fibrosis stages. Machine learning feature selection and reduction (CfsSubseteval / best first) reduced the initial number of input features (N=15) to the most relevant ones (N=6) for developing the prediction model. Results: In this study, 32419 patients had F(0-1), 25073 had F(2) and 11615 had F(3-4). FIB-4 and APRI revalidation in our study showed low accuracy and high discordance with biopsy results, with overall AUC 0.68 and 0.58 respectively. Out of 15 attributes machine learning selected Age, AFP, AST, glucose, albumin, and platelet as the most relevant attributes. Results for REP tree indicated an overall classification accuracy up to 70% and ROC Area 0.74 which was not nearly affected by attribute reduction, and pruning . However attribute reduction, and tree pruning were associated with simpler model easy to understand by physician with less time for execution. Conclusion: This study we had the chance to study a large cohort of 69106 chronic hepatitis patients with available liver biopsy results to revise and validate the accuracy of FIB-4 and APRI. This study represents the collaboration between computer scientist and hepatologists to provide clinicians with an accurate novel and reliable, noninvasive model to predict the stage of liver fibrosis.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114438190","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}

{"title":"Optimizing DSCP Marking to Ensure VoIP’s QoS over HFC Network","authors":"Shaher Daoud, Yanzhen Qu","doi":"10.5121/CSIT.2019.90928","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90928","url":null,"abstract":"Three major factors that can affect Voice over Internet Protocol (VoIP) phone services’ quality, these include packet delay, packet loss, and jitter. The focus of this study is specific to the VoIP phone services offered to customers by cable companies that utilize broadband hybrid fiber coaxial (HFC) networks. HFC networks typically carry three types of traffic that include voice, data, and video. Unlike data and video, some delays or packet loss can result in a noticeable degraded impact on a VoIP’s phone conversation. We will examine various differentiated services code point (DSCP) marking, then analyze and assess their impact on VoIP’s quality of service (QoS). This study mimics the production environment. It examines the relationship between specific DSCP marking’s configuration. This research avoids automated test calls and rather focuses on human made call testing. This study relies on users’ experience and the captured data to support this research’s findings.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127026976","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}

{"title":"Trust Modelling for Security of IoT Devices","authors":"Naresh Sehgal, S. Shankar, J. Acken","doi":"10.5121/CSIT.2019.90913","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90913","url":null,"abstract":"IoT (Internet of Things), represents many kinds of devices in the field, connected to data-centers via various networks, submitting data, and allow themselves to be controlled. Connected cameras, TV, media players, access control systems, and wireless sensors are becoming pervasive. Their applications include Retail Solutions, Home, Transportation and Automotive, Industrial and Energy etc. This growth also represents security threat, as several hacker attacks been launched using these devices as agents. We explore the current environment and propose a quantitative and qualitative trust model, using a multi-dimensional exploration space, based on the hardware and software stack. This can be extended to any combination of IoT devices, and dynamically updated as the type of applications, deployment environment or any ingredients change.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123527889","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}

{"title":"A MapReduce based Algorithm for Data Migration in a Private Cloud Environment","authors":"A. Pandey, R. Thulasiram, A. Thavaneswaran","doi":"10.5121/CSIT.2019.90916","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90916","url":null,"abstract":"When a resource in a data center reaches its end-of-life, instead of investing in upgrading, it is possibly the time to decommission such a resource and migrate workloads to other resources in the data center. Data migration between different cloud servers is risky due to the possibility of data loss. The current studies in the literature do not optimize the data before migration, which could avoid data loss. MapReduce is a software framework for distributed processing of large data sets with reduced overhead of migrating data. For this study, we design a MapReduce based algorithm and introduce a few metrics to test and evaluate our proposed framework. We deploy an architecture for creating an Apache Hadoop environment for our experiments. We show that our algorithm for data migration works efficiently for text, image, audio and video files with minimum data loss and scale well for large files as well.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126041033","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}

{"title":"Motion Compensated Restoration of Colonoscopy Images","authors":"Nidhal Azawi, J. Gauch","doi":"10.5121/CSIT.2019.90920","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90920","url":null,"abstract":"Colonoscopy examinations are widely used for detecting colon cancer and many other colon abnormalities. Unfortunately, the resulting colon videos often have artifacts caused by camera motion and specular highlights caused by light reflections from the wet colon surface. To address these problems, we have developed a method for motion compensated colonoscopy image restoration. Our approach utilizes RANSAC-based image registration to align sequences of N consecutive images in the colonoscopy video and restores each frame of the video using information from these aligned images. We compare image alignment quality when N adjacent images are registered to each other versus registering images with larger step sizes between them. Three types of image pre processing were evaluated in our work. We found that the removal of non-informative images prior to image registration produced better alignment results and reduced processing time. We also evaluated the effects of image smoothing and resizing as a pre processing step for image registration.","PeriodicalId":248929,"journal":{"name":"9th International Conference on Computer Science, Engineering and Applications (CCSEA 2019)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128601556","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}