Version-1 (May-June 2018)
- Citation
- Abstract
- Reference
- Full PDF
- Download Cover Page
Abstract:CPU scheduling is a process which allows one process to use the CPU while the execution of another process is on hold(in waiting state) due to unavailability of any resource like I/O etc, thereby making full use of CPU. The aim of CPU scheduling is to make the system efficient, fast and fair.The Objective of this paper is to improve the existing Round Robin Scheduling by reducing the individual process waiting time and also reduces average waiting time and turnaround time. In this paper we also compare the existing round robin scheduling algorithm with the proposed algorithm with the help of Gantt charts.
Keywords– CPU Scheduling, Round Robin Scheduling, Improvised Round Robin Scheduling, Waiting Time, Turnaround time.
[1]. A. Silberschatz, P. B. Galvin, and G. Gagne, "Operating System Concepts", 7th Edn., John Wiley and Sons Inc, 2005, ISBN 0-471- 69466-5.
[2]. AbrahamSilberschatz,PeterB.Galvin,GregGagne,"OperatingSystemConcepts",SixthEdition,JohnWiley&SonsInc.,2003. [3]. Andrew S. Tanenbaum, Herbert Bos, "Modern Operating Systems", Fourth Edition, Pearson Education,2014.
[4]. Gary Nutt, "Operating Systems", Third Edition, Pearson Education,2009.
[5]. William Stallings, "Operating Systems: Internals and Design Principles", Seventh Edition, Pearson, 2012Wikipedia
- Citation
- Abstract
- Reference
- Full PDF
Abstract: Job scheduling is an important process in cloud environment to schedule the tasks and to minimize resource utilization. Recently, a lot of research works have been designed for job scheduling using different data mining techniques. The efficiency of existing job scheduling techniques was lower due to misclassification results. In order to solve this limitation, Softmax Bootstrap Ensembled Multiclass Scheduling (SBEMS) Technique is proposed. The SBEMS Technique employs multiple learning algorithms to obtain better predictive performance for job scheduling in cloud environment. The SBEMS Technique is developed by combining Sofmax regression tree classification with boostrap aggregative ensemble method. The SBEMS Technique creates '𝑀' number of Softmax Regression Tree........
Keywords– Boostrap Aggregative Ensemble Method, Job Scheduling, Resource Utilization, Softmax Regression Tree, Strong Learner, Weak Learners
[1]. Yi Yao, Jianzhe Tai, Bo Sheng, and Ningfang Mi, "LsPS: A Job Size-Based Scheduler for Efficient Task Assignments in Hadoop", IEEE Transactions on Cloud Computing, Volume 3, Issue 4, Pages 411-424, 2015
[2]. Zhuoyao Wang, Majeed M. Hayat, Nasir Ghani, Khaled B. Shaban, "Optimizing Cloud-Service Performance: Efficient Resource Provisioning via Optimal Workload Allocation", IEEE Transactions on Parallel and Distributed Systems, Volume 28, Issue 6, Pages 1689 – 1702, 2017
[3]. N.Moganarangan, R.G.Babukarthik, S.Bhuvaneswari, M.S.Saleem Basha, P.Dhavachelvan, "A novel algorithm for reducing energy-consumption in cloud computing environment: Web service computing approach", Journal of King Saud University-Computer and Information Sciences, Elsevier, Volume 28, Issue 1, Pages 55-67, January 2016
[4]. Mohammad Mehedi, HassanAtifAlamri, "Virtual Machine Resource Allocation for Multimedia Cloud: A Nash Bargaining Approach", Procedia Computer Science, Elsevier, Volume 34, Pages 571-576, 2014
[5]. Ziqian Dong, Ning Liu and Roberto Rojas-Cessa, "Greedy scheduling of tasks with time constraints for energy-efficient cloud-computing data centers", Journal of Cloud Computing: Advances, Systems, Springer, Volume 4, Issue 5, 2015
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Delineation of Trivial PGP Security |
Country | : | India |
Authors | : | Mr. Nikhil Joshi || Mr. Gaurav Kumar || Prof. Divya Premchandran |
: | 10.9790/0661-2003011723 |
Abstract: The enhanced PGP Security that we are proposing is based only for digital signatures & encryption/decryption of the messages. The algorithm that is used here consists of asymmetric algorithm as RSA 4096 & the symmetric algorithm used is AES-256(Advance Encryption standard). Also we require hashing function in order to secure the digital signature as well as messages. Hence we use Whirlpool hashing function which is open source & is based on 512 block cipher that makes the application more powerful than the previously used.
Keywords– Asymmetry algorithm, AES-256, Digital Signature, Hash Function, OpenPGP , PGP, RSA 4096, Rijndael Cipher, SHA-256, Symmetric algorithm, Whirlpool.
[1]. Rijmen, V. with Willia Stallings. Private communication September 9th, 2005.
[2]. Barreto, P. and V. Rijmen. 2003. The Whirlpool Hashing Function. Submitted to NESSIE, May.
[3]. P. Kitsos, O. Koufopavlou: "Efficient Architecture and Hardware Implementation of the Whirlpool Hash Function". IEEE Transactions on Consumer Electronics, Vol. 50, No. 1, Feb. 2004
[4]. Zimmermann, "An Introduction to Cryptography", PGP v 6.0 documentation, 1998.
[5]. Alex Biryukov and Dmitry Khovratovich, Related-key Cryptanalysis of the Full AES-192 and AES-256, ".
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Secured Conversion and Generation of Cognitive CAPTCHA Implementing Honeypot Technique |
Country | : | India |
Authors | : | Divyashree N |
: | 10.9790/0661-2003012426 |
Abstract: Internet has both brighter and darker side when it comes to information access. Authentication plays a major role in attempting authorized access to secured sections of web applications. Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA) is a security program used as non-reusable element for authentication purpose. Though there exist few robust CAPTCHA's like complex image CAPTCHA, iCAPTCHA and ReCAPTCHA they are to be used through CAPTCHA service provider(e.g.: Google) In some environments, a system is considered to be strong if the password is not transmitted to the verification process. This paper proposes two real-time authentication mechanisms namely cognitive CAPTCHA and honeypot generation for protecting the information being provided over internet.
[1]. Chris Mitchell, threat Researcher "Securing Websites" A SophpsLabs technical paper, SophosLabs UK, 2011
[2]. SumitSahu, BhartiDongre, Rajesh Vadhwani "Web Spam Detection Using Different Features" International Journal of Soft Computing and Engineering (IJSCE), Volume-1, Issue-3, July 2011
[3]. Dinie Florencio and Cormac Herley Microsoft Research, "Entering Passwords on a Spyware Infected MachineDinei" (textbook)
[4]. Vedprakash Singh, Preet Pal "Survey of Different Types of Captcha" International Journal of Computer Science and Information technologies, Vol. 5(2), 2014,2242-2245
[5]. Divyashree N, Dr.T.Satish Kumar "Survey on Captcha Categories" International Journal Of Engineering and Computer Science. Vol 5 issue 5 May 2016,ISSN:2319-7242
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Privacy in Distributed Access Control Environment |
Country | : | India |
Authors | : | U. M. Mbanaso |
: | 10.9790/0661-2003012733 |
Abstract: Privacy in distributed environments introduces new security challenges since two parties in a typical access control may not always belong to the same security domain. Therefore, protection of personal identifiable information (PII) throws a fresh challenge in privacy equation in this context. Customarily, the challenge is how to preserve privacy when two parties in different security domains are involved in access control, particularly in distributed environments. This paper presents the conceptualization of privacy in typical distributed context, to raise issues when two parties in access control requires to protect privacy sensitive information.
[1]. R. Vidgen, D. Avison, B. Wood, and T. Wood-Harper, Developing Web Information Systems: Butterworth-heinemann Information, 2003.
[2]. B. Carminati, E. Ferrari, and H. Patrick C.K, "Exploring Privacy Issues in Web Services Discovery Agencies," IEEE Security and Privacy, vol. 3, pp. 14-21, 2005.
[3]. M.Lorch, S.Proctor, R.Lepro, D.Kafura, and S.Shah, " First Experience Using XACML for Access Control in Distributed Systems," presented at ACM Workshop on XML Security, Fairfax Va US,, 2003.
[4]. E. Bertino, E.Ferrari, and A. Squicciarini, "Trust Negotiations: Concepts, Systems and Languages," IEEE Computer, pp. 27-34, 2004.
[5]. N. Huntley, "Open and Closed Systems," http://www.users.globalnet.co.uk/~noelh/OpenClosedSystems.htm 2003
- Citation
- Abstract
- Reference
- Full PDF
Abstract: Early study tries to use chatbot for counselling services. They changed drinking habit of who being consulted by leading them via intervene chatbot. However, the application did not concerned about psychiatric status through continuous conversation with user monitoring. Furthermore, they had no ethical judgment method that about the intervention of the chatbot. We argue that more reasonable and continuous emotion recognition will make better mental healthcare experiment. It will be more proper clinical psychiatric consolation in ethical view as well. This paper suggests a introduce a novel chatbot system for psychiatric counselling service. Our system understands content of conversation based on recent natural language processing (NLP) methods with emotion recognition. It senses emotional flow through the continuous observation of conversation. Also, we generate personalized counseling response from user input, to do this, we use additional constrains to generation model for the proper response generation which can detect conversational context, user emotion and expected reaction.
Keywords— conversational service; response generation; deep learning;
[1]. Weizenbaum J. (1966) ELIZA – A computer program for the study of natural language communication between man and machine. Communications of the ACM 9(1):36-45.
[2]. Alice (2002). A.L.I.C.E Artificial Intelligence Foundation. http://www.alicebot.org/
[3]. Wallace, R. (2003). The elements of AIML style. ALICE AI Foundation. http://alice.pandorabots.com/
[4]. Abu Shawar, B. & Atwell, E. (2003). Using dialogue corpora to retrain a chatbot system. In Archer, D., Rayson, P., Wilson, A. and McEnery, T. (eds), proc. Of the Corpus Linguistics 2003 conference(CL2003), Lancaster University, UK, pp. 681-690
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Improvement of Cluster Heads Selection in Hierarchy Sensor Networks Using Bayesian Networks |
Country | : | Turkey |
Authors | : | Farzad Kiani |
: | 10.9790/0661-2003013943 |
Abstract: One of the basic and challenging issues in the wireless sensor networks is energy consumption. They are consist of many small size sensor nodes that have limited memory and battery. The most of the node energy is used in during the transmit data in the network. Therefore, power consumption management in the sensor nodes is very important and has a big role in the network lifetime. The consumed energy to transmit data in sensor networks can be decreased by different techniques so one of the most effective method is organizing nodes in the form of clusters and selection of appropriate cluster heads. In this paper, the Bayesian method is used to select the cluster heads. Selection of nodes using the proposed method reduces the energy loss of nodes in data transmission and increasing network lifetime.
Keywords – Bayesian networks, sensor networks, hierarchical routing, network lifetime
[1] F. Kiani, E. Amiri, M. Zamani, T. Khodadi, AA. Manaf, Efficient intelligent energy routing protocol in wireless sensor networks. International Journal of Distributed Sensor Networks, 2015, 1-13.
[2] A. Anwar, D. Sridharan, A Survey on Routing Protocols for Wireless Sensor Networks in Various Environments, International Journal of Computer Applications, 112(5), 2015, 13-29.
[3] W. Heinzelman, A. Chandrakasan and H. Balakrishnan, Energy-Efficient Communication Protocol for Wireless Microsensor Networks, Proceedings of the 33rd Hawaii International Conference on System Sciences, 2000, 1-10.
[4] P. radhakrishnan, Enhanced routing protocol for graceful degradation in wireless sensor networks during attacks, bachelor of Engineering, University of madras, Chennai, 2003.
[5] A. Sarkar, T. Murugan, Routing protocols for wireless sensor networks: What the literature says?, Alexandria Engineering Journal, 55(4), 2016, 3173-3183.
- Citation
- Abstract
- Reference
- Full PDF
Abstract: Automatic processing of bank cheques is getting more popularity and attracting more researchers. This paper proposes an efficient machine leaning techniques to design and develop an algorithm to read and recognize the nationalized Indian bank cheques using optical character recognition technique, in which binary patterns extracted by applying classification level decision using feed forward artificial Neural network(NN). In the proposed methodology the neural network is trained to classify six standard nationalized Indian bank cheques. The accuracy of the system is analyzed by the invariant features such as different font, size and varieties of characters with noise and the experimental results reveal satisfactory result.
Keywords – Binary pattern; Bank cheque; Neural network; Optical character recognition
[1]. Abdul Mueed Hafiz, Ghulam Mohiuddin Bhat, October 17, 2016, Arabic OCR Using a Novel Hybrid Classification scheme, Journal of Pattern Recognition Research 1 (2016) 55-60.
[2]. Amarjot Singh, Ketan Bacchuwar, and Akshay Bhasin, June 2012, A Survey of OCR Applications International Journal of Machine Learning and Computing, Vol. 2, No. 3.
[3]. Anju K Sadasivan, T. Senthil Kumar, 2011,Automatic Character Recognition in Complex Images International Conference on Communication Technology and System Design, 1877-7058 © Published by Elsevier Ltd.,
[4]. Ankit Sharma, Dipti R Chaudhary, April 2013, Character Recognition Using Neural Network, International Journal of Engineering Trends and Technology (IJETT) - Volume4 Issue4, ISSN : 2231-5381.
[5]. Ashok Kumar. D and Dhandapani. S A, May – June 2014, Bank Cheque Signature Verification system using FFBP Neural Network Architecture and Feature Extraction based on GLCM, International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), Volume 3, Issue 3, ISSN 2278-6856.
- Citation
- Abstract
- Reference
- Full PDF
Abstract: Augmented reality is gaining more popularity and have been considered as a vital technology. A combination of AR and VR is known as Mixed Reality (MR).This concept is more complicated than augmented reality and virtual reality since it integrates the several types of technologies which includes advanced optics, sensors, and computing power. This allows users to visualize the real world and virtual world at same time, a high range of communication between users and computational device for manipulation of the surrounding information. We use SLAM technology to derive some particular application on AR/VR. SLAM technology will allow user the capability to arrange augmented concepts in real time space which gives the best creating scenario of overlying virtual images. We give a brief idea about SLAM technology using which user can clarify the concepts of localization and mapping. Among various techniques to implement SLAM technology we discuss Visual SLAM technology, which is more interested in AR/VR/MR aspects..
Keywords – Mixed Reality, Augmented Reality, Virtual Reality, Computing power, SLAM
[1]. P. Milgram, H. Takemura, A.Utsumi and F. Kishino, Augmented Reality: A class of displays on the reality-virtuality continuum, ATR Communication Systems Research Laboratories, Vol. 2351, 1994. [2]. H. Song, D. B. Rawat, S. Jeschke, C. Brecher, The Need of Dynamic and Adaptive Data Models for Cyber-Physical Production Systems,Cyber physical systems: Foundations, principles and applications(British library, UK: Elsevier, 2018)
[3]. S. Yonemoto, A reference image generation method for marker-less AR, International Conference on Information Visualization, 2013.
[4]. T. Gjøsæter, Interaction with mobile augmented reality: An exploratory study using design research to investigate mobile and handheld augmented reality, University of Bergen, Bergen, Norway, 2015.
[5]. J. K. T. Tang, W. M. Lau, K. K. Chan, K. H. To, AR Interior Designer: Automatic Furniture Arrangement using Spatial and Functional Relationships, Institute of Electrical and Electronics Engineering, 2014..
- Citation
- Abstract
- Reference
- Full PDF
Abstract:Distributed Denial of service (DDOS) has the most dangerous economics damages DDoS Attacks have plagued the Internet, corporate websites, and networks for more than a decade. Although DDoS attacks aren't new, modern threats and tactics are more advanced than ever. DDoS attacks are occurring with increas-ing frequency and causing a great damage against a rapidly growing number of targets worldwide. The most difficult problem against the defense of the Distributed Denial of service attack is how to distinguish between the legitimate traffic and the real traffic? To protect ISP companies against such attack, an IPS system implementation are needed to detect and prevent flooding attack, as it is one of the challenging issue. This paper introduces the major attacks types and tools used by attacker and study the mitigation techniques by implementing snort as IPS system. Moreover, the paper examines various mechanisms of distributed denial of service attacks, its detection, and various approaches to handle these attacks.
Keywords – DOS and DDOS Attacks, Denial of Service (DOS), Detection, Prevention, Mitigation, TCP, UDP and ICMP Attack, Echo Request, Snort, IPS and IDS
[1]. C. D. (1997, January). 1997 Tech Tip: Denial of Service Attacks. Retrieved August 23, 2017, from https://resources.sei.cmu.edu/library/asset-view.cfm?assetid=496599
[2]. S. F., L. G., & P. O. (2005). Network Security and DoS Attacks (2nd ed.).
[3]. Bhattacharyya, ,. %., & Kalita, J. K. (2016). DDoS Attacks, Evolution, Detection,Prevention, Reaction,and Tolerance.
[4]. Parker, D. (2003). Hping. Retrieved February 12, 2010, from Hping: http://gd.tuwien.ac.at/www.hping.org/hping_conv.pdf
[5]. Sanfilippo, S. (2006). hping. Retrieved November 03, 2009, from hping: http://www.hping.org/documentation.php
- Citation
- Abstract
- Reference
- Full PDF
Abstract: DBSCAN is a density based clustering algorithm which groups together data points of similar characteristics. It is based on two input parameters minpoints and epsilon. The disadvantage of DBSCAN algorithm is that it compares each point in the dataset with every other point in the dataset and resulting in runtime complexity of O(n2). In this paper, a new approach of finding clusters similar to the clusters formed by DBSCAN but with improved time complexity is introduced. A quantitative performance analysis of the new methodology, the Bisecting Min Max DBSCAN algorithm on the iris dataset proved that, not only is the algorithm faster than the traditional DBSCAN, but also gives good cluster quality
Keywords – Bisecting Min Max Clustering, Clustering, Data Mining, DBSCAN, Min Max Clustering
[1] W.J. Book, Modelling design and control of flexible manipulator arms: A tutorial review, Proc. 29th IEEE Conf. on Decision and Control, San Francisco, CA, 1990, 500-506.
[2] Terence Johnson, Santosh Kumar Singh, Divisive Hierarchical Bisecting Min–Max Clustering Algorithm, Advances in Intelligent Systems and Computing, Series Volume-468, Series ISSN 2194-5357, Online ISBN 978-981-10-1675-2, DOI 10.1007/978-981-10-1675-2_57 , 2016 International Conference on Data Engineering and Communication Technology -ICDECT 2016,March 10-11, LAVASA, Pune, Springer Singapore, copyright 2017, copyright holder Springer Science + Business Media Singapore, pp 579-592.
[3] Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, ISBN 1-57735-004-9, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), AAAI Press, pp. 226–231.
[4] Terence Johnson, Santosh Kumar Singh, Quantitative Performance Analysis for the Family of Enhanced Strange Points Clustering Algorithms, International Journal of Applied Engineering Research, Series Volume 11, Series ISSN 0973-4562, Number 9 ,(2016), pp 6872-6880, Research India Publications.
[5] Martin Ester, Jörg Sander, Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications, Data Mining and Knowledge Discovery, Berlin, Springer-Verlag. 2 (2), pp. 169–194.