Pub Date : 2020-05-20DOI: 10.18535/ijecs/v9i05.4487
A. Salunke, Ruchika Kukreja, Jayesh Kharche, Amit K. Nerurkar
With the advancement of technology there are millions of songs available on the internet and this creates problem for a person to choose from this vast pool of songs. So, there should be some middleman who must do this task on behalf of user and present most relevant songs that perfectly fits the user’s taste. This task is done by recommendation system. Music recommendation system predicts the user liking towards a particular song based on the listening history and profile. Most of the music recommendation system available today will give most recently played song or songs which have overall highest rating as suggestions to users but these suggestions are not personalized. The paper purposes how the recommendation systems can be used to give personalized suggestions to each and every user with the help of collaborative filtering which uses user similarity to give suggestions. The paper aims at implementing this idea and solving the cold start problem using content based filtering at the start.
{"title":"Personalized Suggestion For Music Based On Collaborative Filtering","authors":"A. Salunke, Ruchika Kukreja, Jayesh Kharche, Amit K. Nerurkar","doi":"10.18535/ijecs/v9i05.4487","DOIUrl":"https://doi.org/10.18535/ijecs/v9i05.4487","url":null,"abstract":"With the advancement of technology there are millions of songs available on the internet and this creates problem for a person to choose from this vast pool of songs. So, there should be some middleman who must do this task on behalf of user and present most relevant songs that perfectly fits the user’s taste. This task is done by recommendation system. Music recommendation system predicts the user liking towards a particular song based on the listening history and profile. Most of the music recommendation system available today will give most recently played song or songs which have overall highest rating as suggestions to users but these suggestions are not personalized. The paper purposes how the recommendation systems can be used to give personalized suggestions to each and every user with the help of collaborative filtering which uses user similarity to give suggestions. The paper aims at implementing this idea and solving the cold start problem using content based filtering at the start.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126592920","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-05-20DOI: 10.18535/ijecs/v9i05.4488
Rahul C Kore, Prachi Ray, P. Lade, Amit K. Nerurkar
Reading legal documents are tedious and sometimes it requires domain knowledge related to that document. It is hard to read the full legal document without missing the key important sentences. With increasing number of legal documents it would be convenient to get the essential information from the document without having to go through the whole document. The purpose of this study is to understand a large legal document within a short duration of time. Summarization gives flexibility and convenience to the reader. Using vector representation of words, text ranking algorithms, similarity techniques, this study gives a way to produce the highest ranked sentences. Summarization produces the result in such a way that it covers the most vital information of the document in a concise manner. The paper proposes how the different natural language processing concepts can be used to produce the desired result and give readers the relief from going through the whole complex document. This study definitively presents the steps that are required to achieve the aim and elaborates all the algorithms used at each and every step in the process.
{"title":"Legal Document Summarization Using Nlp and Ml Techniques","authors":"Rahul C Kore, Prachi Ray, P. Lade, Amit K. Nerurkar","doi":"10.18535/ijecs/v9i05.4488","DOIUrl":"https://doi.org/10.18535/ijecs/v9i05.4488","url":null,"abstract":"Reading legal documents are tedious and sometimes it requires domain knowledge related to that document. It is hard to read the full legal document without missing the key important sentences. With increasing number of legal documents it would be convenient to get the essential information from the document without having to go through the whole document. The purpose of this study is to understand a large legal document within a short duration of time. Summarization gives flexibility and convenience to the reader. Using vector representation of words, text ranking algorithms, similarity techniques, this study gives a way to produce the highest ranked sentences. Summarization produces the result in such a way that it covers the most vital information of the document in a concise manner. The paper proposes how the different natural language processing concepts can be used to produce the desired result and give readers the relief from going through the whole complex document. This study definitively presents the steps that are required to achieve the aim and elaborates all the algorithms used at each and every step in the process.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122431209","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-05-18DOI: 10.18535/ijecs/v9i05.4482
Saransh Kotha, P. Patel
Blockchain is defined as a group of unsegregated blocks over a P2P network. It is also considered as a decentralised ledger which holds the records of any online event. It offers a secure platform for knowledge and value transfer even in an untrustworthy network. In digital transactions on blockchain, each transaction is verified by all the nodes within the network using consensus protocol. Through this paper we will give a comprehensive overview of how Blockchain technology works, its current and future applications and how it can change the digital events in future.
{"title":"Blockchain In Depth","authors":"Saransh Kotha, P. Patel","doi":"10.18535/ijecs/v9i05.4482","DOIUrl":"https://doi.org/10.18535/ijecs/v9i05.4482","url":null,"abstract":"Blockchain is defined as a group of unsegregated blocks over a P2P network. It is also considered as a decentralised ledger which holds the records of any online event. It offers a secure platform for knowledge and value transfer even in an untrustworthy network. In digital transactions on blockchain, each transaction is verified by all the nodes within the network using consensus protocol. Through this paper we will give a comprehensive overview of how Blockchain technology works, its current and future applications and how it can change the digital events in future.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122927403","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}
In today’s scenario, there are various ways the attackers can gain access to secure information and use it for their own benefit. In this paper, we aim to improve the gateway entry system by providing more security. This system involves the use of TOTP (Time-Based One-Time Password) with QR (Quick Response) code. A QR code is a 2D matrix barcode where a large amount of information can be stored in a compact manner. TOTP is a temporary password that is active for a short duration of time. For every 30 seconds, an OTP is generated. A QR code is generated which contains the TOTP. The QR code is scanned and the server checks the TOTP generated on the server-side. If this TOTP matches with the TOTP in the QR code then the user is allowed to enter. This method increases the security of the system and prevents unauthorized access.
{"title":"TOTP Based Authentication Using QR Code For Gateway Entry System","authors":"Abhishek Arvind, Pradyumna Mahajan, Rishikesh Chalke","doi":"10.18535/ijecs/v9i05.4481","DOIUrl":"https://doi.org/10.18535/ijecs/v9i05.4481","url":null,"abstract":"In today’s scenario, there are various ways the attackers can gain access to secure information and use it for their own benefit. In this paper, we aim to improve the gateway entry system by providing more security. This system involves the use of TOTP (Time-Based One-Time Password) with QR (Quick Response) code. A QR code is a 2D matrix barcode where a large amount of information can be stored in a compact manner. TOTP is a temporary password that is active for a short duration of time. For every 30 seconds, an OTP is generated. A QR code is generated which contains the TOTP. The QR code is scanned and the server checks the TOTP generated on the server-side. If this TOTP matches with the TOTP in the QR code then the user is allowed to enter. This method increases the security of the system and prevents unauthorized access.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114751625","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-05-10DOI: 10.18535/ijecs/v9i05.4476
Mandeep Singh, Sunny Kumar, Tushant Garg, N. Pandey
Abstract— In this paper, we will discuss how to perform a penetration test on Metasploitable 2 using Metasploit. Metasploitable 2 is a vulnerable system that we decide to use, as using some other system to do the same it would be considered as hacking and could have awful results. The primary purpose of this research is to tell about the various tools used when someone trying to find possible vulnerabilities in a system. By using the Metasploit system to test a system, we can find possible vulnerabilities that need to be fixed to protect and make the system better. Different areas like firewalls, network protocols, and other basic security is-sues will be explored in this research.While there are many other different ways to do penetration testing, but we decide to use Metasploit be-cause of its broad uses and simplicity. We will have the option of either using the command line within Metasploit or by using the community version of the product, which is mostly automated. Both alternatives will be explored in this paper. If anyone going through all of the steps given in this paper should be able to try and exploit any vulnerable system.
{"title":"Penetration Testing on Metasploitable 2","authors":"Mandeep Singh, Sunny Kumar, Tushant Garg, N. Pandey","doi":"10.18535/ijecs/v9i05.4476","DOIUrl":"https://doi.org/10.18535/ijecs/v9i05.4476","url":null,"abstract":"Abstract— In this paper, we will discuss how to perform a penetration test on Metasploitable 2 using Metasploit. Metasploitable 2 is a vulnerable system that we decide to use, as using some other system to do the same it would be considered as hacking and could have awful results. The primary purpose of this research is to tell about the various tools used when someone trying to find possible vulnerabilities in a system. By using the Metasploit system to test a system, we can find possible vulnerabilities that need to be fixed to protect and make the system better. Different areas like firewalls, network protocols, and other basic security is-sues will be explored in this research.While there are many other different ways to do penetration testing, but we decide to use Metasploit be-cause of its broad uses and simplicity. We will have the option of either using the command line within Metasploit or by using the community version of the product, which is mostly automated. Both alternatives will be explored in this paper. If anyone going through all of the steps given in this paper should be able to try and exploit any vulnerable system.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122459997","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-16DOI: 10.18535/ijecs/v9i04.4468
P. H. Kumar, J. Sudharshana, M. SunilKannah
In the cloud computing model, users access services according to their requirements. Most of the people use cloud since it has low cost, high speed computing, backup and restore, mobility and unlimited flexible storage capacity. Cloud resources are hosted in large datacentres operated by companies such as Amazon, Apple, Google and Microsoft. During cloud application deployment, an application is managed over a single service. Such an approach has several short comings. One side-effect of the lack of interoperability among cloud providers is vendor lock in, which means lack of ability to migrate application components from one cloud provider to another cloud provider. If a user finds some required platforms in new service provider but the user cannot leave the current provider as the resources are present with them. This is known as vendor lock in. To solve this issue in achieving interoperability several efforts are underway. Our project is that a user who creates a unique channel that can be used to gain the services provided by different providers. So that the user can use another vendor’s service which is not present in present vendor’s cloud. That is user can use multiple clouds having different resources using a single API without depending on their own APIs.
{"title":"Interoperability of Cloud Using Single API","authors":"P. H. Kumar, J. Sudharshana, M. SunilKannah","doi":"10.18535/ijecs/v9i04.4468","DOIUrl":"https://doi.org/10.18535/ijecs/v9i04.4468","url":null,"abstract":"In the cloud computing model, users access services according to their requirements. Most of the people use cloud since it has low cost, high speed computing, backup and restore, mobility and unlimited flexible storage capacity. Cloud resources are hosted in large datacentres operated by companies such as Amazon, Apple, Google and Microsoft. During cloud application deployment, an application is managed over a single service. Such an approach has several short comings. One side-effect of the lack of interoperability among cloud providers is vendor lock in, which means lack of ability to migrate application components from one cloud provider to another cloud provider. If a user finds some required platforms in new service provider but the user cannot leave the current provider as the resources are present with them. This is known as vendor lock in. \u0000To solve this issue in achieving interoperability several efforts are underway. Our project is that a user who creates a unique channel that can be used to gain the services provided by different providers. So that the user can use another vendor’s service which is not present in present vendor’s cloud. That is user can use multiple clouds having different resources using a single API without depending on their own APIs. \u0000 ","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877218","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-14DOI: 10.18535/ijecs/v9i04.4470
O. O. Elohor, Akinbohun Folake, Thompson Aderonke, Korede Bashir
This work explores the field of biometric finger vein recognition – which is the identification of individuals using the unique vein patterns under their finger skins. This work also includes the implementation of an Android fingerprint biometric system using the Android Near InfraRed (NIR) module, which exists to show the similarities and differences between the two (fingervein and fingerprint) prevalent biometric features. This work thus confirms that finger vein recognition shows great promise as an accurate solution to modern society’s problem of automated personal authentication
{"title":"Biometric, Fingervein, Machine L Implementation of a Security System, Using Captured Fingervein, Applying the Concepts of Machine Learning","authors":"O. O. Elohor, Akinbohun Folake, Thompson Aderonke, Korede Bashir","doi":"10.18535/ijecs/v9i04.4470","DOIUrl":"https://doi.org/10.18535/ijecs/v9i04.4470","url":null,"abstract":"This work explores the field of biometric finger vein recognition – which is the identification of individuals using the unique vein patterns under their finger skins. This work also includes the implementation of an Android fingerprint biometric system using the Android Near InfraRed (NIR) module, which exists to show the similarities and differences between the two (fingervein and fingerprint) prevalent biometric features. This work thus confirms that finger vein recognition shows great promise as an accurate solution to modern society’s problem of automated personal authentication","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130590698","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-08DOI: 10.18535/ijecs/v9i04.4465
A. C. Sekhar, Ch. Ambedkar
Protein-Protein Interactions (PPI) have important role in drug binding with the Proteins called drug targets. For identifying the potential drug targets there are different techniques. In this paper we are presenting application of Centrality Measures for identifying the drug targets. Centrality measure indicates importance of node in the graph or network. Protein-Protein Interactions for proteins which are involved in a particular disease are identified and centrality measures will be calculated based on the graph built suing the PPI interactions. Further the nodes which are playing crucial role will be identified using the various centrality measures and these drug targets can be used for drug discovery of a particular disease through insilico docking studies.
{"title":"Application of Centrality Measures for Potential Drug Targets: Review","authors":"A. C. Sekhar, Ch. Ambedkar","doi":"10.18535/ijecs/v9i04.4465","DOIUrl":"https://doi.org/10.18535/ijecs/v9i04.4465","url":null,"abstract":"Protein-Protein Interactions (PPI) have important role in drug binding with the Proteins called drug targets. For identifying the potential drug targets there are different techniques. In this paper we are presenting application of Centrality Measures for identifying the drug targets. Centrality measure indicates importance of node in the graph or network. Protein-Protein Interactions for proteins which are involved in a particular disease are identified and centrality measures will be calculated based on the graph built suing the PPI interactions. Further the nodes which are playing crucial role will be identified using the various centrality measures and these drug targets can be used for drug discovery of a particular disease through insilico docking studies.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"17 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673153","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-03-31DOI: 10.18535/ijecs/v9i04.4457
Vaidehi Shrivastava, H. Dhakad, Samarth Bajaj, Viplove Divyasheesh
This research paper focuses on creating a platform for street vendors which will improve their availability to users by displaying their real-time location nearby user’s locality along with their respective services. This doesn’t require any expensive hardware allowing users to get notified when a hawker providing services of user’s interest pass through her street. Small-scaled business people like hawkers have a large impact on a country's economy because of their large population in developing countries like India. Due to minimal exposure to technology, they use classic business methods which struggle to uphold their position against tough competition from large organizations. These hawkers can be uplifted by providing a platform which will be based on advanced business strategies developed on the basis of those which are introduced by modern economists and business ideologists. This platform will be as useful for static vendors as it is for dynamic vendors not limiting to a single service but to all street vendors present despite the service they provide. Hence, users won’t have to look for vendors floating in the streets as their location will be visible on the map in the application.
{"title":"GPS Based City Wise Integration System for City Vendors","authors":"Vaidehi Shrivastava, H. Dhakad, Samarth Bajaj, Viplove Divyasheesh","doi":"10.18535/ijecs/v9i04.4457","DOIUrl":"https://doi.org/10.18535/ijecs/v9i04.4457","url":null,"abstract":"This research paper focuses on creating a platform for street vendors which will improve their availability to users by displaying their real-time location nearby user’s locality along with their respective services. This doesn’t require any expensive hardware allowing users to get notified when a hawker providing services of user’s interest pass through her street. \u0000Small-scaled business people like hawkers have a large impact on a country's economy because of their large population in developing countries like India. Due to minimal exposure to technology, they use classic business methods which struggle to uphold their position against tough competition from large organizations. These hawkers can be uplifted by providing a platform which will be based on advanced business strategies developed on the basis of those which are introduced by modern economists and business ideologists. \u0000This platform will be as useful for static vendors as it is for dynamic vendors not limiting to a single service but to all street vendors present despite the service they provide. Hence, users won’t have to look for vendors floating in the streets as their location will be visible on the map in the application.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"434 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122876500","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-03-19DOI: 10.18535/ijecs/v9i03.4452
P. Sridevi
The modern Science of Social Networks has brought significant advances to our understanding of the Structure, dynamics and evolution of the Network. One of the important features of graphs representing the Social Networks is community structure. The communities can be considered as fairly independent components of the social graph that helps identify groups of users with similar interests, locations, friends, or occupations. The community structure is closely tied to triangles and their count forms the basis of community detection algorithms. The present work takes into consideration, a triangle instead of the edge as the basic indicator of a strong relation in the social graph. A simple triangle counting algorithm is then used to evaluate different metrics that are employed to detect strong communities. The methodology is applied to Zachary Social network and discussed. The results bring out the usefulness of counting triangles in a network to detect strong communities in a Social Network.
{"title":"A Note on Detection of Communities in Social Networks","authors":"P. Sridevi","doi":"10.18535/ijecs/v9i03.4452","DOIUrl":"https://doi.org/10.18535/ijecs/v9i03.4452","url":null,"abstract":" The modern Science of Social Networks has brought significant advances to our understanding of the Structure, dynamics and evolution of the Network. One of the important features of graphs representing the Social Networks is community structure. The communities can be considered as fairly independent components of the social graph that helps identify groups of users with similar interests, locations, friends, or occupations. The community structure is closely tied to triangles and their count forms the basis of community detection algorithms. The present work takes into consideration, a triangle instead of the edge as the basic indicator of a strong relation in the social graph. A simple triangle counting algorithm is then used to evaluate different metrics that are employed to detect strong communities. The methodology is applied to Zachary Social network and discussed. The results bring out the usefulness of counting triangles in a network to detect strong communities in a Social Network. \u0000 ","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130257517","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
扫码关注我们
求助内容：
应助结果提醒方式：