Pub Date : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142084
Bashaer Khalil Ibrahim, M. A. Mahdi, M. A. Salman
Localization in WSNs provides critical data for decisions when collecting data from wide area spread sensors. Using embedded GPS unit on sensor board is not a cost-effective solution Therefore; researchers have paid more attention to locate sensors in WSNs without using many GPSs units. Several algorithms have been suggested for this purpose. However, they are different in terms of cost and accuracy. This paper is going to suggest a new range-based algorithm called Triple Mobile Anchors for Localization (TMAL). This algorithm is based on three mobile sensors that form a mobile triangle to locate unknown sensors. As other approaches, it uses Receive Signal Strength indicator (RSSI). Besides, the algorithm assumes that the mobile anchors are chargeable to avoid the energy issue. Based on a method known as the Relative Side Coordinates (RSC) the simulation results emphasis of the proposed algorithm compare by RELMA-method1 and RELMA-method 2, the TMAL has good accuracy and low cost. It shows how to control the accuracy based on the area of the mobile triangle.
当从广域传感器收集数据时，无线传感器网络中的定位为决策提供了关键数据。因此，在传感器板上使用嵌入式GPS单元不是一种经济有效的解决方案;如何在无线传感器网络中实现不使用大量gps单元的传感器定位已成为研究热点。为此提出了几种算法。然而，它们在成本和准确性方面有所不同。本文提出了一种新的基于距离的定位算法——三移动定位锚(TMAL)。该算法基于三个移动传感器组成一个移动三角形来定位未知传感器。与其他方法一样，它使用接收信号强度指示器(RSSI)。此外，该算法假设移动锚是可充电的，以避免能量问题。基于相对侧坐标(Relative Side Coordinates, RSC)方法，将本文算法的仿真结果与RELMA-method1和RELMA-method 2的仿真结果进行了对比，结果表明该算法具有较好的精度和较低的成本。演示了如何根据移动三角形的面积来控制精度。
{"title":"Triple Mobile Anchors Approach for Localization in WSN","authors":"Bashaer Khalil Ibrahim, M. A. Mahdi, M. A. Salman","doi":"10.1109/CSASE48920.2020.9142084","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142084","url":null,"abstract":"Localization in WSNs provides critical data for decisions when collecting data from wide area spread sensors. Using embedded GPS unit on sensor board is not a cost-effective solution Therefore; researchers have paid more attention to locate sensors in WSNs without using many GPSs units. Several algorithms have been suggested for this purpose. However, they are different in terms of cost and accuracy. This paper is going to suggest a new range-based algorithm called Triple Mobile Anchors for Localization (TMAL). This algorithm is based on three mobile sensors that form a mobile triangle to locate unknown sensors. As other approaches, it uses Receive Signal Strength indicator (RSSI). Besides, the algorithm assumes that the mobile anchors are chargeable to avoid the energy issue. Based on a method known as the Relative Side Coordinates (RSC) the simulation results emphasis of the proposed algorithm compare by RELMA-method1 and RELMA-method 2, the TMAL has good accuracy and low cost. It shows how to control the accuracy based on the area of the mobile triangle.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121610165","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142061
Hayder Jaber Samawi, A. Al-Sultan, Enas Hamood Al-Saadi
Among the many diseases that affect the retina, there are two serious diseases: Diabetic Retinopathy and Glaucoma. Diabetic Retinopathy (DR) is a sight-threatening risk inflicting disorder diabetic patient. It occurs due to damage in the retina as a result of diabetes. Glaucoma is a disease of the retinal system that damages the optic nerve of the eye and gets worse over time. A buildup of pressure inside the eye is often associated with it, so it can damage the optic nerve that transmits images to the brain. If damage to the optic nerve caused by high eye pressure continues, glaucoma causes permanent vision loss. Early diagnosis and treatment have been shown to prevent blindness and visual loss. Compared with the manual diagnostic methods, automated retinal analysis systems help save patients’ time, cost and vision. In this context, a fundamental process for diagnosing these diseases is the precise and effective localization of the Optic Disc (OD) in retinal images. This paper offers a robust and efficient method for automatic diagnosis of OD. The method starts with removing the undesirable portions of the image, such as noise, reflections and blur. Next, the OD has been detected by means of morphological operations considering the intensity threshold feature. The proposed method is fast and robustness to detect OD even if interrupted by the visible blood vessels. This method was applied on seven data sets which are the Origa, Rim-One 3, Drishti, Messidor, Drions, Diaretdb0 and DIARETDBI, and the resulted accuracy for these data set are 98.46, 97.48, 97.03, 98.75, 97.27, 95.38, 95.45 respectively.
{"title":"Optic Disc Segmentation in Retinal Fundus Images Using Morphological Techniques and Intensity Thresholding","authors":"Hayder Jaber Samawi, A. Al-Sultan, Enas Hamood Al-Saadi","doi":"10.1109/CSASE48920.2020.9142061","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142061","url":null,"abstract":"Among the many diseases that affect the retina, there are two serious diseases: Diabetic Retinopathy and Glaucoma. Diabetic Retinopathy (DR) is a sight-threatening risk inflicting disorder diabetic patient. It occurs due to damage in the retina as a result of diabetes. Glaucoma is a disease of the retinal system that damages the optic nerve of the eye and gets worse over time. A buildup of pressure inside the eye is often associated with it, so it can damage the optic nerve that transmits images to the brain. If damage to the optic nerve caused by high eye pressure continues, glaucoma causes permanent vision loss. Early diagnosis and treatment have been shown to prevent blindness and visual loss. Compared with the manual diagnostic methods, automated retinal analysis systems help save patients’ time, cost and vision. In this context, a fundamental process for diagnosing these diseases is the precise and effective localization of the Optic Disc (OD) in retinal images. This paper offers a robust and efficient method for automatic diagnosis of OD. The method starts with removing the undesirable portions of the image, such as noise, reflections and blur. Next, the OD has been detected by means of morphological operations considering the intensity threshold feature. The proposed method is fast and robustness to detect OD even if interrupted by the visible blood vessels. This method was applied on seven data sets which are the Origa, Rim-One 3, Drishti, Messidor, Drions, Diaretdb0 and DIARETDBI, and the resulted accuracy for these data set are 98.46, 97.48, 97.03, 98.75, 97.27, 95.38, 95.45 respectively.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130707099","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142096
Areej M. Abduldaim, Jumana Waleed, A. N. Mazher
Nowadays, the widespread availability of digital images manipulating software leads to the easy potential for editing images with no need for professional knowledge. Generally, the digital images tampering is very subtle in order that it is not distinguishable by the system of human vision. Most of the attackers work on exploiting and misusing this property. Therefore, for preventing illegal manipulation and unlawful access for any digital image, digital images watermarking schemes are developed to hide an imperceptible watermark into a cover image. Based on the utilized application, the significant requirements for these watermarking schemes are security, capacity, robustness, and imperceptibility. In order to satisfy most of these requirements, in this paper, an efficient digital image watermarking scheme has been proposed that relies on Hessenberg Matrix Decomposition (HMD) applied to each block produced from transforming the cover image by discrete wavelet transform (DWT). In the experiments, the obtained results show that the proposed scheme has a high performance in providing the significant requirements of watermarking; security, capacity, robustness, and imperceptibility.
{"title":"An Efficient Scheme of Digital Image Watermarking Based on Hessenberg Factorization and DWT","authors":"Areej M. Abduldaim, Jumana Waleed, A. N. Mazher","doi":"10.1109/CSASE48920.2020.9142096","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142096","url":null,"abstract":"Nowadays, the widespread availability of digital images manipulating software leads to the easy potential for editing images with no need for professional knowledge. Generally, the digital images tampering is very subtle in order that it is not distinguishable by the system of human vision. Most of the attackers work on exploiting and misusing this property. Therefore, for preventing illegal manipulation and unlawful access for any digital image, digital images watermarking schemes are developed to hide an imperceptible watermark into a cover image. Based on the utilized application, the significant requirements for these watermarking schemes are security, capacity, robustness, and imperceptibility. In order to satisfy most of these requirements, in this paper, an efficient digital image watermarking scheme has been proposed that relies on Hessenberg Matrix Decomposition (HMD) applied to each block produced from transforming the cover image by discrete wavelet transform (DWT). In the experiments, the obtained results show that the proposed scheme has a high performance in providing the significant requirements of watermarking; security, capacity, robustness, and imperceptibility.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131674696","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142054
Sagvan Saleh, Shelan Kamal Ahmed, F. Nashat
In this paper, an optimization problem belonging to project management family is determined, where the objective is to maximize the benefit of a certain projects. The selection of projects to be performed with a limited budget is a decision process which is characterized by its difficulty in case of high scale problems. In this paper, an approach based on genetic algorithm is presented for solving high scale of the tackled problem with the goal of maximization the benefits. First, a mathematical programming model is presented to represent the problem. Then, a heuristic method was proposed based on genetic algorithm and random neighborhood search techniques. The study realized here simulate a practical situation as an optimization problem and highlighted the effectiveness of genetic algorithm and random search techniques for solving it. The presented method is competitive since it is able to present high quality solutions in acceptable solution time. As shown in the computation results section the proposed genetic algorithm: Decision-Making in Project Management average solution needs 13.7 s, random neighborhood search needs 14.1 s, and greedy procedure needs so small time. In spite of genetic algorithm: Decision-Making in Project Management required more solution time than others algorithms greedy algorithm and random neighborhood algorithm, but the solution quality is better. In addition, the presented work highlights the effectiveness of optimization solution procedures in decision-making to justify the investment budget and so maximizing benefits of organizations, personnel, and others.
{"title":"A Genetic Algorithm for Solving an Optimization Problem: Decision Making in Project Management","authors":"Sagvan Saleh, Shelan Kamal Ahmed, F. Nashat","doi":"10.1109/CSASE48920.2020.9142054","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142054","url":null,"abstract":"In this paper, an optimization problem belonging to project management family is determined, where the objective is to maximize the benefit of a certain projects. The selection of projects to be performed with a limited budget is a decision process which is characterized by its difficulty in case of high scale problems. In this paper, an approach based on genetic algorithm is presented for solving high scale of the tackled problem with the goal of maximization the benefits. First, a mathematical programming model is presented to represent the problem. Then, a heuristic method was proposed based on genetic algorithm and random neighborhood search techniques. The study realized here simulate a practical situation as an optimization problem and highlighted the effectiveness of genetic algorithm and random search techniques for solving it. The presented method is competitive since it is able to present high quality solutions in acceptable solution time. As shown in the computation results section the proposed genetic algorithm: Decision-Making in Project Management average solution needs 13.7 s, random neighborhood search needs 14.1 s, and greedy procedure needs so small time. In spite of genetic algorithm: Decision-Making in Project Management required more solution time than others algorithms greedy algorithm and random neighborhood algorithm, but the solution quality is better. In addition, the presented work highlights the effectiveness of optimization solution procedures in decision-making to justify the investment budget and so maximizing benefits of organizations, personnel, and others.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127396011","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142053
F. Ali, M. Ahmed
This In this paper, we studied one of the multi objective function problem on a single machine which is represented by the sum of total completion times, range of lateness and maximum tardiness on a single machine. As an exact solving method, we proposed the branch and bound (BAB) method to find the optimal solution for our problem, by using two techniques which are including new Upper bounds and Lower bounds. In addition, we introduce the idea of Dominance Rules to be used in BAB method to reduce the time by reducing the number of branching nodes in the search tree. Lastly, we suggested two heuristic methods to find near optimal solutions for our problem. The practical results proved the efficiency of BAB method in obtaining optimal solutions and the good performance of the proposed heuristic methods.
{"title":"Optimal and Near Optimal Solutions for Multi Objective Function on a Single Machine","authors":"F. Ali, M. Ahmed","doi":"10.1109/CSASE48920.2020.9142053","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142053","url":null,"abstract":"This In this paper, we studied one of the multi objective function problem on a single machine which is represented by the sum of total completion times, range of lateness and maximum tardiness on a single machine. As an exact solving method, we proposed the branch and bound (BAB) method to find the optimal solution for our problem, by using two techniques which are including new Upper bounds and Lower bounds. In addition, we introduce the idea of Dominance Rules to be used in BAB method to reduce the time by reducing the number of branching nodes in the search tree. Lastly, we suggested two heuristic methods to find near optimal solutions for our problem. The practical results proved the efficiency of BAB method in obtaining optimal solutions and the good performance of the proposed heuristic methods.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127026008","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142118
A. A. Albabawat, Shimal S.Taher, A. Al-Khalil
The internet plays significant roles in different aspects of daily life especially in education and learning fields. Nowadays, many interactive applications have been emerged to satisfy the requirements of both teachers and students. These applications can contribute to the ease of the data delivery processes which are essentially depending on the internet access. In this paper, new backup technique have been proposed to surpassing the issue of internet outage. The teacher quality assurance system at University of Duhok have been taken as a case study to evaluate the designed technique. The designed technique mainly focuses on overcoming the issue of internet outage while the academic staff get their students’ feedbacks. The proposed technique has been successfully designed to fulfill two main goals: first, the internet outage can recovered by adding a local backup server that can achieve parallel tasks, and this local server replace the main server when the internet connection is unavailable. Second, the backed up information in the local server will be automatically uploaded to the main server once the internet is available. The approached used in this paper minimizes three key aspects in internet-based IMSs, which are traffic, time, and IT requirements.
{"title":"TQAIOD: A Backup Technique to Surpassing the Internet Outage","authors":"A. A. Albabawat, Shimal S.Taher, A. Al-Khalil","doi":"10.1109/CSASE48920.2020.9142118","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142118","url":null,"abstract":"The internet plays significant roles in different aspects of daily life especially in education and learning fields. Nowadays, many interactive applications have been emerged to satisfy the requirements of both teachers and students. These applications can contribute to the ease of the data delivery processes which are essentially depending on the internet access. In this paper, new backup technique have been proposed to surpassing the issue of internet outage. The teacher quality assurance system at University of Duhok have been taken as a case study to evaluate the designed technique. The designed technique mainly focuses on overcoming the issue of internet outage while the academic staff get their students’ feedbacks. The proposed technique has been successfully designed to fulfill two main goals: first, the internet outage can recovered by adding a local backup server that can achieve parallel tasks, and this local server replace the main server when the internet connection is unavailable. Second, the backed up information in the local server will be automatically uploaded to the main server once the internet is available. The approached used in this paper minimizes three key aspects in internet-based IMSs, which are traffic, time, and IT requirements.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122859613","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142098
Y. A. Hamza, W. M. Abduallah
In this paper, a new method of secured reversible data hiding that depends on modified pixel expansion has been proposed. The coloured image is divided into three layers (red, green, and blue); then, the blue-layer will be selected as a cover-media for embedding. Next, the difference between two adjacent pixels of the cover-image is calculated, and the result is assigned to the second pixel. After that, a secret logo of size (256x512) will be embedded into each 1st MSB of the second pixel of the cover-image to obtain a stego-image (blue layer only). Finally, the other layers of stego-image; red and green will be encrypted using the Henon chaotic system, and they will be merged to generate the final encrypted image. The receiver has to use the extraction and recovery process to decrypt the ciphered image to obtain the original layers of the image (red, green, and blue). Also, the secret logo will be extracted from 1st MSB of the stego-image then the original cover-image will be ideally recovered via using the recovery process. The red, green, and recovered blue layer has to be combined to obtain the final original image. According to the results, the proposed approach has achieved the best embedding capacity equal to (0.5 bpp) and optimal image quality for the recovered image. The confidentiality of the stego-image and secret logo has been improved via applying Henon chaotic system. Besides, the proposed method is straightforward for implementation, and it requires a little execution time.
{"title":"A Secured Method of Reversible Data Hiding","authors":"Y. A. Hamza, W. M. Abduallah","doi":"10.1109/CSASE48920.2020.9142098","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142098","url":null,"abstract":"In this paper, a new method of secured reversible data hiding that depends on modified pixel expansion has been proposed. The coloured image is divided into three layers (red, green, and blue); then, the blue-layer will be selected as a cover-media for embedding. Next, the difference between two adjacent pixels of the cover-image is calculated, and the result is assigned to the second pixel. After that, a secret logo of size (256x512) will be embedded into each 1st MSB of the second pixel of the cover-image to obtain a stego-image (blue layer only). Finally, the other layers of stego-image; red and green will be encrypted using the Henon chaotic system, and they will be merged to generate the final encrypted image. The receiver has to use the extraction and recovery process to decrypt the ciphered image to obtain the original layers of the image (red, green, and blue). Also, the secret logo will be extracted from 1st MSB of the stego-image then the original cover-image will be ideally recovered via using the recovery process. The red, green, and recovered blue layer has to be combined to obtain the final original image. According to the results, the proposed approach has achieved the best embedding capacity equal to (0.5 bpp) and optimal image quality for the recovered image. The confidentiality of the stego-image and secret logo has been improved via applying Henon chaotic system. Besides, the proposed method is straightforward for implementation, and it requires a little execution time.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124462169","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 : 2020-04-01DOI: 10.1109/csase48920.2020.9142049
{"title":"CSASE 2020 Keynote Speakers-2","authors":"","doi":"10.1109/csase48920.2020.9142049","DOIUrl":"https://doi.org/10.1109/csase48920.2020.9142049","url":null,"abstract":"","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132439639","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142101
Huda M. Salih, M. S. Mohammed
Malicious is a malevolent software used to disturb installed applications, collect information. From the outset, malicious software has been developed alongside authentic computer software, creating programs to spy on the user and invade the user’s privacy. The purpose of such applications is often business related, enabling information to be sold for large sums of money. This creates major problems for protection companies and software developers needing to detect spyware, because this is often hidden within the system or within fake applications. In this paper we are going to analyze the behaviour of venous Android spyware. Also, a complete Spyware system has been developed, concealed in a fake application on an Android phone, for the purpose of obtaining information about the victim, such as contacts, messages, calls, accounts, geographical location by Wi-Fi or subscriber identity module (SIM) card, 3G, 4G, Long-Term Evolution (LTE) and other personal information. The spyware can be used to send fake alerts to the victim for purposes of deception.
{"title":"Spyware Injection in Android using Fake Application","authors":"Huda M. Salih, M. S. Mohammed","doi":"10.1109/CSASE48920.2020.9142101","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142101","url":null,"abstract":"Malicious is a malevolent software used to disturb installed applications, collect information. From the outset, malicious software has been developed alongside authentic computer software, creating programs to spy on the user and invade the user’s privacy. The purpose of such applications is often business related, enabling information to be sold for large sums of money. This creates major problems for protection companies and software developers needing to detect spyware, because this is often hidden within the system or within fake applications. In this paper we are going to analyze the behaviour of venous Android spyware. Also, a complete Spyware system has been developed, concealed in a fake application on an Android phone, for the purpose of obtaining information about the victim, such as contacts, messages, calls, accounts, geographical location by Wi-Fi or subscriber identity module (SIM) card, 3G, 4G, Long-Term Evolution (LTE) and other personal information. The spyware can be used to send fake alerts to the victim for purposes of deception.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129332754","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 : 2020-04-01DOI: 10.1109/CSASE48920.2020.9142095
Wisam H. Ali, Thamir R. Saeed, Mahmuod H. Al-Muifraje
Visual identification is an exciting field because it reflects the primary form of understanding of objects used by humans. At the beginning of artificial intelligent technology, multiple experiments were suggested by the researcher to develop a computer image recogniser similar to human recognition. One such application is in the speech recognition system in a noisy environment, where the visual cue representing the movement of the lips contains some essential information added to the audio signal, as well as how the person merges audio-visual stimuli to identify output words. A little, but unresolved, part of this problem is the classification of utterance using only the visual signals without the speaker’s acoustic signal being available. Taking into account a collection of frames from a recorded video for a person speaking a word; a robust image processing technique is adopted to isolate the region of the lips; then extracting correct geometric characteristics that reflect the variation of the mouth shape during the speech. The observed features are utilised by the identification stage to identify the spoken word. This paper aims to solve this problem by introducing a new segmentation technique to isolate the area of the lips together with a collection of visual shape features centred on the boundary of the extracted lips that can read the lips with significant results. Weightless neural network classifier is proposed to enhance the utterance identification with hardware implementation based on FPGA. Furthermore, A specialised laboratory is designed to collect the utterance of twenty-six English letters from thirty speakers who are adopted in this paper.
{"title":"FPGA Implementation of Visual Speech Recognition System based on NVGRAM-WNN","authors":"Wisam H. Ali, Thamir R. Saeed, Mahmuod H. Al-Muifraje","doi":"10.1109/CSASE48920.2020.9142095","DOIUrl":"https://doi.org/10.1109/CSASE48920.2020.9142095","url":null,"abstract":"Visual identification is an exciting field because it reflects the primary form of understanding of objects used by humans. At the beginning of artificial intelligent technology, multiple experiments were suggested by the researcher to develop a computer image recogniser similar to human recognition. One such application is in the speech recognition system in a noisy environment, where the visual cue representing the movement of the lips contains some essential information added to the audio signal, as well as how the person merges audio-visual stimuli to identify output words. A little, but unresolved, part of this problem is the classification of utterance using only the visual signals without the speaker’s acoustic signal being available. Taking into account a collection of frames from a recorded video for a person speaking a word; a robust image processing technique is adopted to isolate the region of the lips; then extracting correct geometric characteristics that reflect the variation of the mouth shape during the speech. The observed features are utilised by the identification stage to identify the spoken word. This paper aims to solve this problem by introducing a new segmentation technique to isolate the area of the lips together with a collection of visual shape features centred on the boundary of the extracted lips that can read the lips with significant results. Weightless neural network classifier is proposed to enhance the utterance identification with hardware implementation based on FPGA. Furthermore, A specialised laboratory is designed to collect the utterance of twenty-six English letters from thirty speakers who are adopted in this paper.","PeriodicalId":254581,"journal":{"name":"2020 International Conference on Computer Science and Software Engineering (CSASE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128030221","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
扫码关注我们
求助内容：
应助结果提醒方式：