Pub Date : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977695
Surbhi Thukral, Om Prakash Mahela, B. Kumar
Wind energy conversion system (WECS) is one of the significant electrical power generation sources that have been given focus in electrical industry in recent time. On integration of WECS units in distributed and transmission networks of utility grid, behaviour of system changes and these units impose different effects on system behaviour. One major effect of such plants is observed on protection distributed network. A Stockwell Transform based algorithm is proposed in this paper for recognition of power system faults with wind energy power generation source integrated to the network. Fault recognition issues are investigated with different faults on power system network. Voltage signals are recorded and decomposed with the help of Stockwell Transform based multi-resolution for recognition and discrimination of faults on power network. Faults like between line and ground (LG), between two phases (LL), between two phases and ground (LLG) and between all phases and ground (LLLG) are investigated. Results are evaluated in MATLAB/Simulink.
{"title":"Detection of Transmission Line Faults in the Presence of Wind Energy Power Generation Source Using Stockwell’s Transform","authors":"Surbhi Thukral, Om Prakash Mahela, B. Kumar","doi":"10.1109/ICICT46931.2019.8977695","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977695","url":null,"abstract":"Wind energy conversion system (WECS) is one of the significant electrical power generation sources that have been given focus in electrical industry in recent time. On integration of WECS units in distributed and transmission networks of utility grid, behaviour of system changes and these units impose different effects on system behaviour. One major effect of such plants is observed on protection distributed network. A Stockwell Transform based algorithm is proposed in this paper for recognition of power system faults with wind energy power generation source integrated to the network. Fault recognition issues are investigated with different faults on power system network. Voltage signals are recorded and decomposed with the help of Stockwell Transform based multi-resolution for recognition and discrimination of faults on power network. Faults like between line and ground (LG), between two phases (LL), between two phases and ground (LLG) and between all phases and ground (LLLG) are investigated. Results are evaluated in MATLAB/Simulink.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127286291","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977649
Abhishek Sharma, Amit Kumar
Quantum key distribution is a catchword among industry specialist now a day.It is arising an alarming situation to all the current network security techniques. These are the basic properties of Quantum Mechanics, which makes a combination with network security. At present there are so many companies out there in market which are making progress it this fields day by day.Quantum cryptography is a very important technology now days as it is helping a lot to secure the future network communication. This particular field has gained the attention from industry as well as from academics. Here we are writing this paper to provide the general review of various fields belongs to Quantum Computing, but our main aim is to provide a brief review and analysis of recent development in the field of Quantum Key Distribution, most famous and developed field of Quantum Computing. This paper presents review of Quantum Computing including different application fields like Quantum public key cryptography, QKD, Quantum Authentication. First we discuss the basics of Quantum Cryptography then we discuss the definition of Quantum key Distribution, Various protocols of this field. Then after we discuss the opportunities in this field.
{"title":"A Survey on Quantum Key Distribution","authors":"Abhishek Sharma, Amit Kumar","doi":"10.1109/ICICT46931.2019.8977649","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977649","url":null,"abstract":"Quantum key distribution is a catchword among industry specialist now a day.It is arising an alarming situation to all the current network security techniques. These are the basic properties of Quantum Mechanics, which makes a combination with network security. At present there are so many companies out there in market which are making progress it this fields day by day.Quantum cryptography is a very important technology now days as it is helping a lot to secure the future network communication. This particular field has gained the attention from industry as well as from academics. Here we are writing this paper to provide the general review of various fields belongs to Quantum Computing, but our main aim is to provide a brief review and analysis of recent development in the field of Quantum Key Distribution, most famous and developed field of Quantum Computing. This paper presents review of Quantum Computing including different application fields like Quantum public key cryptography, QKD, Quantum Authentication. First we discuss the basics of Quantum Cryptography then we discuss the definition of Quantum key Distribution, Various protocols of this field. Then after we discuss the opportunities in this field.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115921934","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977643
Parita Jain, Swati Sharma
This research attempts to prioritize the factors that are important for the designing of test cases. There are many researches done on making testing complexities easier such as by applying various algorithms, approaches and processes to make testing automated. There are techniques that have been applied to prioritize the test cases so that testing time can be reduced. Therefore, in this research we have considered some factors by taking advice of experts and by the help of literature in this field that are taken care of for designing of test case. We have applied a new methodology that is ISM (Interpretive Structural Modelling) with MICMAC analysis technique. This theory has been applied in various field like management, science etc. but in the field of software engineering we have tried to implement it for the first time. By the help of this we have prioritized the factors. The rank has been associated with all the factors as per the partitioning theory applied in ISM. A diagraph has been formed and an ISM model is developed that clearly differentiate the factors on the basis of ranks. Then a MICMAC analysis is performed on the ISM model, in which factors are differentiated on the basis of their dependence power and driver power. A graphical representation of MICMAC is done. And the factors have been prioritized.
{"title":"Prioritizing Factors Used in Designing of Test Cases: An ISM-MICMAC Based Analysis","authors":"Parita Jain, Swati Sharma","doi":"10.1109/ICICT46931.2019.8977643","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977643","url":null,"abstract":"This research attempts to prioritize the factors that are important for the designing of test cases. There are many researches done on making testing complexities easier such as by applying various algorithms, approaches and processes to make testing automated. There are techniques that have been applied to prioritize the test cases so that testing time can be reduced. Therefore, in this research we have considered some factors by taking advice of experts and by the help of literature in this field that are taken care of for designing of test case. We have applied a new methodology that is ISM (Interpretive Structural Modelling) with MICMAC analysis technique. This theory has been applied in various field like management, science etc. but in the field of software engineering we have tried to implement it for the first time. By the help of this we have prioritized the factors. The rank has been associated with all the factors as per the partitioning theory applied in ISM. A diagraph has been formed and an ISM model is developed that clearly differentiate the factors on the basis of ranks. Then a MICMAC analysis is performed on the ISM model, in which factors are differentiated on the basis of their dependence power and driver power. A graphical representation of MICMAC is done. And the factors have been prioritized.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127716158","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977636
Dayanand, Mohini Chauhan
Tor protects against a common form of Internet monitoring known as "traffic analysis". Traffic analysis can be used to find out who is being talked to on a public network. Knowing the source and destination of your Internet traffic allows others to track your behavior and interests. This can affect your check book, for example, an e-commerce site uses price discrimination based on your country or origin. It even reveals who and where you are. For example, if you are traveling abroad and you connect to your[1] employer's computer to check or send mails, you inadvertently send your national origin and professional affiliation to someone observing the network Can appear, even if the connection is encrypted. This paper will discuss how network traffic will be clear and transparent. People using tools such as ToR can now be easily tracked and therefore the organization can easily filter malicious content from the entire stack of networks. Using specific algorithms and its associated code, the tool will also simplify filtering traffic based on certain categories and, after operating some pre-defined algorithms, traffic will also be analyzed.
{"title":"Anonymized searches and their tracing","authors":"Dayanand, Mohini Chauhan","doi":"10.1109/ICICT46931.2019.8977636","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977636","url":null,"abstract":"Tor protects against a common form of Internet monitoring known as \"traffic analysis\". Traffic analysis can be used to find out who is being talked to on a public network. Knowing the source and destination of your Internet traffic allows others to track your behavior and interests. This can affect your check book, for example, an e-commerce site uses price discrimination based on your country or origin. It even reveals who and where you are. For example, if you are traveling abroad and you connect to your[1] employer's computer to check or send mails, you inadvertently send your national origin and professional affiliation to someone observing the network Can appear, even if the connection is encrypted. This paper will discuss how network traffic will be clear and transparent. People using tools such as ToR can now be easily tracked and therefore the organization can easily filter malicious content from the entire stack of networks. Using specific algorithms and its associated code, the tool will also simplify filtering traffic based on certain categories and, after operating some pre-defined algorithms, traffic will also be analyzed.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127552282","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977700
Rishabh Kamal, Priyanka Ahlawat
Wireless Sensor Network (WSN) consists of a large amount of sensor nodes fitted with restricted memory and computing capacities that have been powered by batteries. These contained sensors face several threats to safety and therefore some cryptographic mechanism is needed for secure communication. In WSNs, key management is a working research subject. In this paper, we have proposed a Lightweight Matrix based key management scheme for WSN. Our proposed key management system used encryption method to enhance storage space and node to become lightweight and nodes connectivity. We assessed our scheme and it is shown that our proposed scheme provide better connectivity and storage space for the network.
{"title":"Improved matrix based Key Management Scheme for Wireless Sensor Network security","authors":"Rishabh Kamal, Priyanka Ahlawat","doi":"10.1109/ICICT46931.2019.8977700","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977700","url":null,"abstract":"Wireless Sensor Network (WSN) consists of a large amount of sensor nodes fitted with restricted memory and computing capacities that have been powered by batteries. These contained sensors face several threats to safety and therefore some cryptographic mechanism is needed for secure communication. In WSNs, key management is a working research subject. In this paper, we have proposed a Lightweight Matrix based key management scheme for WSN. Our proposed key management system used encryption method to enhance storage space and node to become lightweight and nodes connectivity. We assessed our scheme and it is shown that our proposed scheme provide better connectivity and storage space for the network.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129040803","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977674
P. Yadav, Sanjiv Sharma, Amarkant Singh
Big Data is a collection of large amount of data which is growing very rapidly with the popularity of social networking sites. The size of the Big data has been extended from terabytes to petabytes. Big data are characterized by four important attributes: volume, velocity, variety and veracity. The volume attributes describe the data at rest in the range from terabytes to Exabyte’s, the velocity deals with data in motion, i.e streaming the data to respond within milliseconds rather than in seconds, the variety discuss the data in many different forms such as structured, unstructured, text and multimedia data, whereas the veracity deals with the data in doubt, i.e. uncertainty in data due to data inconsistency. These attributes of big data make it a challenge for organizations to have control over, and use such data. In today’s era we are overloaded with the information, however we are lacking the insight. The 90% of the data in the world today has been created in the last two years by various social networking sites. As big data grows it challenges the capabilities of traditional data warehouses that collect and store large amounts of internal and external data. Data drawn from these repositories are used to improve decision making, increase organizational efficiencies, and improve organizational effectiveness. In this paper an attempt has been made to explore the real life application of Big Data , cloud database, Hadoop, Map Reduce and Cloud Computing, in various domains.
{"title":"Big Data and Cloud Computing: An Emerging Perspective and Future Trends","authors":"P. Yadav, Sanjiv Sharma, Amarkant Singh","doi":"10.1109/ICICT46931.2019.8977674","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977674","url":null,"abstract":"Big Data is a collection of large amount of data which is growing very rapidly with the popularity of social networking sites. The size of the Big data has been extended from terabytes to petabytes. Big data are characterized by four important attributes: volume, velocity, variety and veracity. The volume attributes describe the data at rest in the range from terabytes to Exabyte’s, the velocity deals with data in motion, i.e streaming the data to respond within milliseconds rather than in seconds, the variety discuss the data in many different forms such as structured, unstructured, text and multimedia data, whereas the veracity deals with the data in doubt, i.e. uncertainty in data due to data inconsistency. These attributes of big data make it a challenge for organizations to have control over, and use such data. In today’s era we are overloaded with the information, however we are lacking the insight. The 90% of the data in the world today has been created in the last two years by various social networking sites. As big data grows it challenges the capabilities of traditional data warehouses that collect and store large amounts of internal and external data. Data drawn from these repositories are used to improve decision making, increase organizational efficiencies, and improve organizational effectiveness. In this paper an attempt has been made to explore the real life application of Big Data , cloud database, Hadoop, Map Reduce and Cloud Computing, in various domains.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130400025","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}
Face Affirmation (FR), the methodology toward recognizing people with the help of their facial pictures, has various affordable applications within the zone of statistics, information security; get to control, law demand, savvy cards and observation framework. Convolutional Neural Networks (Connets), a form of profound systems has been incontestable to be fruitful for Face Affirmation (FR). For in progress frameworks, some pre-process methods like examining ought to be done before utilizing to Connets. Be that because it could, at that time likewise complete footage (all the constituent esteems) square measure passed as contribution to Connets and each one amongst the suggests that (highlight determination, embody extraction, preparing) square measure performed by the system. this can be the rationale that death penalty Connets square measure once during a whereas advanced and tedious. Connets square measure at the start stage and also the exactnesses got square measure extraordinarily high, in order that they have way to travel. The paper proposes another technique for utilizing a profound neural system (another quite profound system) for facial acknowledgment. During this methodology, instead of giving crude constituent esteems as data, simply the separated facial highlights square measure given. This brings down the multifarious nature of whereas giving the exactness of ninety seven.05% on Yale faces dataset.
{"title":"Face Identification System","authors":"Prerit Goel, Ritin Behl, Pranjul Aggarwal, Manish Srivastava, Sanyam Gupta","doi":"10.1109/ICICT46931.2019.8977684","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977684","url":null,"abstract":"Face Affirmation (FR), the methodology toward recognizing people with the help of their facial pictures, has various affordable applications within the zone of statistics, information security; get to control, law demand, savvy cards and observation framework. Convolutional Neural Networks (Connets), a form of profound systems has been incontestable to be fruitful for Face Affirmation (FR). For in progress frameworks, some pre-process methods like examining ought to be done before utilizing to Connets. Be that because it could, at that time likewise complete footage (all the constituent esteems) square measure passed as contribution to Connets and each one amongst the suggests that (highlight determination, embody extraction, preparing) square measure performed by the system. this can be the rationale that death penalty Connets square measure once during a whereas advanced and tedious. Connets square measure at the start stage and also the exactnesses got square measure extraordinarily high, in order that they have way to travel. The paper proposes another technique for utilizing a profound neural system (another quite profound system) for facial acknowledgment. During this methodology, instead of giving crude constituent esteems as data, simply the separated facial highlights square measure given. This brings down the multifarious nature of whereas giving the exactness of ninety seven.05% on Yale faces dataset.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128134296","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977698
A. Anil, Hardik Gupta, Monika Arora
Scientific testing of mushroom (Agaricus Bisporus) samples, and especially non-destructive can prove to be very beneficial in different fields of research including agriculture, food processing, health care, etc. This is mainly because, when these mushrooms are left exposed in the open atmosphere, these tend to react with surrounding and develop a brown coloured pigment. This phenomenon is commonly referred to as the "enzymatic browning". Here, this reaction is utilized to observe certain chemical changes over a course of time. This has led to a result which can be used for classification of mushroom samples. Hence, this classification can be used to prove the gradual change in pattern behaviour of mushrooms during different time intervals. SVM classifier is seen to give the result with an accuracy of 80%. Thus, this classification can also give an overlook of whether these mushroom samples are fresh for consumption or not.
{"title":"Computer vision based method for identification of freshness in mushrooms","authors":"A. Anil, Hardik Gupta, Monika Arora","doi":"10.1109/ICICT46931.2019.8977698","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977698","url":null,"abstract":"Scientific testing of mushroom (Agaricus Bisporus) samples, and especially non-destructive can prove to be very beneficial in different fields of research including agriculture, food processing, health care, etc. This is mainly because, when these mushrooms are left exposed in the open atmosphere, these tend to react with surrounding and develop a brown coloured pigment. This phenomenon is commonly referred to as the \"enzymatic browning\". Here, this reaction is utilized to observe certain chemical changes over a course of time. This has led to a result which can be used for classification of mushroom samples. Hence, this classification can be used to prove the gradual change in pattern behaviour of mushrooms during different time intervals. SVM classifier is seen to give the result with an accuracy of 80%. Thus, this classification can also give an overlook of whether these mushroom samples are fresh for consumption or not.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133833688","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977637
Amit Kumar Sharma, A. Ghunawat
Recently researchers have been explored quantum phenomena’s for computation purpose and demonstrated important computational algorithms such as integer factorization using Shor’s algorithm, unsorted date base search using Grover’s algorithm, quantum cryptography, teleportation and many more. Many approaches have been investigated for implementing quantum algorithm physically. In this review quantum computer implementation techniques are introduced with an emphasize on linear optics quantum computing.
{"title":"A Review on Quantum Computers with Emphasize on Linear Optics Quantum Computing","authors":"Amit Kumar Sharma, A. Ghunawat","doi":"10.1109/ICICT46931.2019.8977637","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977637","url":null,"abstract":"Recently researchers have been explored quantum phenomena’s for computation purpose and demonstrated important computational algorithms such as integer factorization using Shor’s algorithm, unsorted date base search using Grover’s algorithm, quantum cryptography, teleportation and many more. Many approaches have been investigated for implementing quantum algorithm physically. In this review quantum computer implementation techniques are introduced with an emphasize on linear optics quantum computing.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122680598","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 : 2019-09-01DOI: 10.1109/ICICT46931.2019.8977717
Prashant S. Patil, Sanjay Thakur
At this moment, mainly hospitals are overloaded and require a helpful patient wait in line management. Patient row executive and wait for time prophecy appearance a tough, as well as difficult occupation since every patient capacity, involves different segment or procedures, such as checkups, a variety of check-up like a Urine test, injection or a regular checkup, negligible operations, throughout the action. Consequently although evaluating these whole check patients have to pass the time in a queue and redundant waiting time as well as also give frustration during waiting in the queue. To reduce patient waiting times using minimized path-awareness we propose an Incremental Patient Treatment Time Prediction (IPTTP) algorithm based on improved Random Forest method which is used to calculate the waiting instant for all handling jobs for a patient. It would be innovative suitable if a patient possibly will get the predicted waiting time and treatment plan on an application that shows the treatment preparation and forecast waiting moment in real-time. We utilize realistic patient data from the data acquisition model where data is generated by randomly using some features like patient gender, age, task, hospital departments, etc. to accomplish a patient handling time for every one job. Depend on this significant, sensible information, the action waiting time for every patient in the wait in a line of every task is suggested. Based on the forecast behind you occasion for every patient, Hospital Queuing-Recommendation (HQR) with the minimized path- awareness system is developed by makes use of treatment task features. HQR determines and forecasts a well-organized and suitable management plan suggested for every patient. For the reason that of the significant, sensible information, the prerequisite for instantaneous come back with, An IPTTP as well as HQR system with minimized path-awareness, acquiescence effectiveness, and low-latency reaction. We bring into play a Hadoop pig script implementation at the Department of Computer Engg at Lord Krishna College Of Technology in Indore, India to achieve the objective as mentioned earlier. Widespread conducting experiment and imitation consequences reveal the effectiveness and applicability of our projected representation to propose a successful action plan for patients to reduce their waiting time in the hospital.
{"title":"Patient waiting time prediction in hospital queuing system using improved random forest in big data","authors":"Prashant S. Patil, Sanjay Thakur","doi":"10.1109/ICICT46931.2019.8977717","DOIUrl":"https://doi.org/10.1109/ICICT46931.2019.8977717","url":null,"abstract":"At this moment, mainly hospitals are overloaded and require a helpful patient wait in line management. Patient row executive and wait for time prophecy appearance a tough, as well as difficult occupation since every patient capacity, involves different segment or procedures, such as checkups, a variety of check-up like a Urine test, injection or a regular checkup, negligible operations, throughout the action. Consequently although evaluating these whole check patients have to pass the time in a queue and redundant waiting time as well as also give frustration during waiting in the queue. To reduce patient waiting times using minimized path-awareness we propose an Incremental Patient Treatment Time Prediction (IPTTP) algorithm based on improved Random Forest method which is used to calculate the waiting instant for all handling jobs for a patient. It would be innovative suitable if a patient possibly will get the predicted waiting time and treatment plan on an application that shows the treatment preparation and forecast waiting moment in real-time. We utilize realistic patient data from the data acquisition model where data is generated by randomly using some features like patient gender, age, task, hospital departments, etc. to accomplish a patient handling time for every one job. Depend on this significant, sensible information, the action waiting time for every patient in the wait in a line of every task is suggested. Based on the forecast behind you occasion for every patient, Hospital Queuing-Recommendation (HQR) with the minimized path- awareness system is developed by makes use of treatment task features. HQR determines and forecasts a well-organized and suitable management plan suggested for every patient. For the reason that of the significant, sensible information, the prerequisite for instantaneous come back with, An IPTTP as well as HQR system with minimized path-awareness, acquiescence effectiveness, and low-latency reaction. We bring into play a Hadoop pig script implementation at the Department of Computer Engg at Lord Krishna College Of Technology in Indore, India to achieve the objective as mentioned earlier. Widespread conducting experiment and imitation consequences reveal the effectiveness and applicability of our projected representation to propose a successful action plan for patients to reduce their waiting time in the hospital.","PeriodicalId":412668,"journal":{"name":"2019 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127538490","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}