{"title":"Study of Applications of Artificial Neural Networks","authors":"Kaleem Ullah Moon","doi":"10.54692/lgurjcsit.2020.0402130","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2020.0402130","url":null,"abstract":"This study is related to the different methods of identification of artificial neural networks. These techniques assess and detect lung cancer in the early stage of life, therefore, preventing lung disease. Growth in lung cancer is Pakistan's principal cause of death, so early identification of lung disease is crucial. The position and expectation of growth of lung cancer is guided by the pre-treatment plan in which sections, smoothing, and improvement measures were prepared which includes procedures based on pictures and steps. Lung malignancy was linked to the proper model of the false neural system and paces of the endurance of patients with lung disease were also determined. The role of artificial neural systems in the medical profession is significant Nowadays most ailment treatment strategies are prepared to upgrade the yield display with the aid of man-made brainpower. The artificial neural network model is useful in lung cancerous growth disorder because lung type of cancer can be detected. The main aim of this paper is to study the different methods of artificial neural network techniques used to detect, assess, and treat patients with lung cancer. ","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133453130","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":"Security and Countermeasures Wireless Communication Algorithm with Penetration Testing","authors":"Shahan Yamin Siddiqui","doi":"10.54692/lgurjcsit.2020.0402132","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2020.0402132","url":null,"abstract":"The communication algorithm security, in general, is a pending issue that has only recently become aware. In wireless communication algorithms, this need is more obvious, by its characteristics, and is part of the design of Wi-Fi communication algorithms. The biggest security problem of Wi-Fi communication algorithms is given by its spatial dispersion. It is not limited to an area, a cable or optical fiber, or has specific access points or connection, but it expands and is accessible from any point within its coverage. This makes it very vulnerable to wireless communication algorithms because of the physical security of this communication algorithm is difficult to secure.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131593587","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":"Cryptographic Compression Techniques along with some Penetrating Attacks and Possible Security Measures","authors":"Sobia Sattar","doi":"10.54692/lgurjcsit.2020.0402133","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2020.0402133","url":null,"abstract":"Information security relates to protecting advanced secrecy unit that presents unapproved access to PCs, individual databases, and sites. Cryptography watchesclients by giving utility to the mystery composing of information and affirmation of different clients. The need is to develop the techniques of lessening the number of bytes expected to speak to a provided arrangement of facts and figures. It licenses sparing a pile of learning. Organizations ensure information protection by using firewalls and mystery composing components. Cryptography is one of the best approaches to send and receive confidential information from one node to another. There are multiple data encryption systems available and AES is one of them. The data security framework contains privacy, quality, and respectability. In this article, we will embrace to imagine logical order of mystery composing, pressure and most absolutely varying sorts of assaults alongside fluctuated contrasting sorts of safety efforts that can be connected in venture with the prerequisite and style of the system.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122180859","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":"Performance Analysis of Search Algorithms on Workstation system","authors":"Mubashir Ali","doi":"10.54692/lgurjcsit.2020.0402136","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2020.0402136","url":null,"abstract":"Searching is a common issue in computer science. It is defined as a process in which elements are to be found from a given list. Search algorithms used in daily life for finding values in array or list, data retrieving, finding passwords and combinations, etc.In the past, many search algorithms have been introduced and existing ones have been improved keeping a view of performance in terms of time and space complexity.Search algorithms are defined based on their framework. Well-known types of search algorithms are binary, linear, jump, and interpolation search.Binary search (interval, logarithmic search) is defined as a search algorithm, which finds the position of an element or target value within a sorted array;linearsearch (sequential search) is a search over the list of items in a sequential way (step-by-step process). Jump search focuses on fewer elements by jumping (skipping) to the next elements in fixed steps while Interpolation search is an improvement over binary search may go to different locations according to the value of the key being searched.In this paper, we have performed a comparative analysis of these search algorithms on the workstation system. Lenovo S-20 workstation with windows as an operating system is used forexperimentation and analysis. Finding out which search algorithm is best in an associated scenario with a comparison of a single-core processor to a workstation of a six-core processor.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133309126","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":"Quantum Limits, Computational Complexity and Philosophy – A Review","authors":"Tahir Ilyas","doi":"10.54692/lgurjcsit.2018.020139","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2018.020139","url":null,"abstract":"Quantum computing physics uses quantum qubits (or bits), for computer’s memory or processor. They can perform certain calculations much faster than a normal computer. The quantum computers have some limitations due to which the problems belonging to NP- Complete are not solved efficiently. This paper covers effective quantum algorithm for solving NP-Complete problems through some features of complexity theory, that we can simplify some of the philosophical interest problems.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"38 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130735123","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":"Suicide Rate Predictions In Pakistan By using Neural Networks","authors":"Muhammad Nadeem Ali, Hira Akram, Afifa Akram","doi":"10.54692/lgurjcsit.2019.030385","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2019.030385","url":null,"abstract":"Suicide is the understudied subject in Pakistan that is a cause of death all over the world. Seventy-fivepercent of suicide occurs in LMIC.In Pakistan information about suicide is limited. The study is about tofind the number of suicide from major cities of Pakistan and then predict the number of suicides by usingNeural Networks Algorithm. About 24639 cases were found in our research from 2001-18 in majorcities of Pakistan. Hanging and poisoning were the most common methods of suicide. The peak age ofsuicide committers was 20-35 included males and females. The lowest number of suicide was inBahawalpur (130 from 2001 to 2018) and the Highest was in Lahore (5925 from 2001 to 2018).","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117023369","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":"Using codes in place of DNA Sample in Databases to reduce Storage","authors":"Shan e Zahra, Sabir Abbas, Tayyab Altaf","doi":"10.54692/lgurjcsit.2019.030386","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2019.030386","url":null,"abstract":"Biological data mainly comprises of Deoxyribonucleic acid (DNA) and protein sequences. These arethe biomolecules that are present in all cells of human beings. Due to the self-replicating property ofDNA, it is a key constituent of genetic material that exists in all breathing creatures. This biomolecule(DNA) comprehends the genetic material obligatory for the operational and expansion of all personifiedlives. To save DNA data of a single person we require 10CD-Rom's. In this paper, A lossless three-phasecompression algorithm is presented for DNA sequences. In the first phase the dataset is segmentedhaving tetra groups and then the resultant genetic sequences are compressed in the form of uniquenumbers (e.g Array Index) and in the second phase binary code is generated on the bases of array indexnumbers and in the last phase the modified version of Run Length Encoding (RLE) is applied on thedataset.The newly proposed technique has been implemented and its performance is also measured on samples.It has achieved the best average compression ratio. After Storing different DNA Samples.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131169846","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":"Formal Modeling of Security Concerns in Android","authors":"Khadija Javed","doi":"10.54692/lgurjcsit.2020.0401142","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2020.0401142","url":null,"abstract":"The need of providing a secure environment to the users of technology is necessary to keep it going. Android devices are used by most of the population worldwide, to keep it working and developing it should be secure for the users. Applications are installed on the device by the user for specific purposes. Different applications interact with each other to perform some specific functions e.g. an application that doesn't have its built-in Calendar functionality asks for the permission to access it externally from another application/s installed on the device and this inter-application communication can result in data theft vulnerabilities because of communication with a malicious application directly or indirectly. We present a defense mechanism model named PBAD (Permission Based Attack Defense) Model, which protects the applications from interacting with malicious applications and protecting the permission protected interfaces of the innocuous applications. Our main focus is on the permission related security measures because the permission model of the Android OS is coarse-grained and it is vulnerable to attacks. The presented model is a PROMELA based model.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127223821","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":"Requirement Gathering Techniques Widely Used in Global Software Engineering: A Comprehensive Study","authors":"Mubashir Ali","doi":"10.54692/lgurjcsit.2020.0401139","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2020.0401139","url":null,"abstract":"The research paper is solely based upon conducting the study with respect to analysis of the recent work done in the field of Global Software Engineering (GSE). It is massively spreading within various organizations. GSD is significant with respect to cost reduction, efficiency in context of delivery of software and extending economic resources. The working model of GSE is a complex and there are certain threats that are directly targeting the audiences. The factors affecting are the differences in context of Culture and geographic distances that can directly affect the performance of a software process. One of the important aspects that is kept in consideration in Global Requirement engineering is particularly communication. The issues with respect to communication can be divided further into theteam and targeted clients. The study is highlighting the concept is to generate the best practices in Global software engineering (GSE) along with Lexicon model. The research has focused on more than one technique along with demonstrating their advantages to present a solution and a technique that can be adopted to generate requirements in GSE.","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122925890","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":"Performance Evaluation of Dynamic Routing Protocols","authors":"Waleed Iftikhar","doi":"10.54692/lgurjcsit.2020.0401141","DOIUrl":"https://doi.org/10.54692/lgurjcsit.2020.0401141","url":null,"abstract":"Routing protocols are an essential component while performing routing. Majority of the researches put stress on the analysis of the security of IPv6 routing protocols as a future research work. In case of DB query response time, EIGRPv6 did not perform well as compare to other two routing protocols. While for voice and video, jitter, packet end-to-end delay, EIGRPv6 performed best among other routing protocols. Their evaluation involved four pairs of scenarios and each pair dedicated to respective routing protocols to be analyzed. Finally, their results also predicted that communication between ISIS and OSPF routing protocols is quite noticeable. The major purpose of their research was to figure out the best possible combined solution of routing protocols in a complex scenario to provide a seamless flow of communication. While, in the combined network, RIP-OSPF combination had a low CPU utilization in comparison to EIGRP-OSPF combination. This paper will conduct a performance evaluation and analysis of routing protocols, RIP, OSPF, EIGRP and IGRP using different performance metrics. In a situation where there are frequent network topological changes, RIP and IGRP are the least suited routing protocols. While EIGRP and OSPF are the best suited routing protocols in a changing network environment. OSPF can be a better choice than EIGRP considering transmission cost and router overhead, while EIGRP performed best in terms of convergence, utilization, delay and throughput. Hence it becomes really difficult to select among OPSF and EIGRP. Future research can be based on selecting a routing protocol among OSPF","PeriodicalId":197260,"journal":{"name":"Lahore Garrison University Research Journal of Computer Science and Information Technology","volume":"15 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516594","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}