Handwritten Hindi Character Recognition using Deep Learning Techniques
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.1-7, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.17
Abstract
In this paper we present a handwritten Hindi character recognition system based on different Deep learning technique. Handwritten character recognition plays an important role and is currently getting the attention of researchers because of possible applications in assisting technology for blind and visually impaired users, human–robot interaction, automatic data entry for business documents, etc. In this work, we propose a technique to recognize handwritten Hindi characters using deep learning approaches like Convolutional Neural Network (CNN) With Optimizer RMSprop (Root Mean Square Propagation) , Adaptive Moment (Adam) Estimation and Deep Feed Forward Neural Networks(DFFNN). The proposed system has been trained on samples of large set of database images and tested on samples images from user defines data set and from this experiment we achieved very high recognition results. Experimental results are compared with other neural network based algorithm.
Key-Words / Index Term
DFFNN, CNN, Softmax classifier, RMSprop and Adam Estimation, Deep Learning
References
[1] Ciregan, D.; Meier, U.; Schmidhuber, J, “Multi-column deep neural networks for image classification”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Providence, RI,USA, 16–21 June 2012.
[2] . Krizhevsky, A.; Sutskever, I.; Hinton, G.E, “Imagenet classification with deep convolutional neural networks” .In Proceedings of the Advances in Neural Information Processing Systems, Lake Tahoe, NV, USA,3–8 December 2012.
[3] Lecun, Y.; Bottou, L.; Bengio, Y.; Haffner P, “Gradient-based learning applied to document recognition”, Proc. IEEE 1998, 86, 2278–2324.
[4] Navneet, D.; Triggs, B. “Histograms of oriented gradients for human detection”, In Proceedings of the CVPR2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Diego, CA, USA,20–25 June 2005; Volume 1
[5] Wang, X.; Paliwal, K.K. “Feature extraction and dimensionality reduction algorithms and their applications in vowel recognition”, Pattern Recognit. 2003, 36, 2429–2439.
[6] Zeiler, M.D.; Rob, F. “Visualizing and understanding convolutional networks”, In Proceedings of the EuropeanConference on Computer Vision, Zurich, Switzerland, 6–12 September 2014.
[7] Simonyan, K.; Andrew, Z. “Very deep convolutional networks for large-scale image recognition”. arXiv, 2004.
[8] Jaderberg, M.; Simonyan, K.; Zisserman, A, “Spatial transformer networks”, In Proceedings of the Advances inNeural Information Processing Systems, Montreal, QC, Canada, 11–12 December 2015.
[9] Cire¸san, D.; Ueli, M. “Multi-column deep neural networks for offline handwritten Chinese characterclassification”, In Proceedings of the 2015 International Joint Conference on Neural Networks (IJCNN),Killarney, Ireland, 12–17 July 2015.
[10] . Sarkhel, R.; Das, N.; Das, A.; Kundu, M.; Nasipuri, M. “A Multi-scale Deep Quad Tree Based Feature Extraction Method for the Recognition of Isolated Handwritten Characters of popular Indic Scripts”, Pattern Recognition.2017, 71, 78–93.
[11] . Ahranjany, S.S.; Razzazi, F.; Ghassemian, M.H. “A very high accuracy handwritten character recognition system for Farsi/Arabic digits using Convolutional Neural Networks”, In Proceedings of the 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), Changsha,China, 23–26 September 2010.
[12] Choudhary, A., Rishi, R., and Ahlawat, S., “Off-Line Handwritten Character Recognition using Features Extracted from Binarization Technique”, AASRI Conference on Intelligent Systems and Control, 2013, pp. 306-312.
[13] Baheti M. J., Kale K.V., Jadhav M.E., “Comparison of Classifiers for Gujarati Numeral Recognition”, International Journal of Machine Intelligence, Vol. 3, Issue 3, pp. 160-163, 2011.
[14] Sonu Varghese K, Ajay James, Dr.Saravanan Chandran , “A Novel Tri-Stage Recognition Scheme for Handwritten Malayalam Character Recognition”, International Conference on Emerging Trends in Engineering, Science and Technology (ICETEST - 2015),2016 pp-1333-1340.
[15] Parshuram M. Kamble, Ravinda S. Hegadi, “Handwritten Marathi character recognition using R-HOG Feature”, International Conference on Advanced Computing Technologies and Applications (ICACTA- 2015),2015 pp- 266 – 274.
[16] B. K. Verma, "Handwritten Hindi character recognition using multilayer perceptron and radial basis function neural networks in Neural Networks”, 1995. Proceedings, IEEE International Conference on. vol. 4, pp. 2111-2115, 1995.
[17] Hailiang Ye, Feilong Cao, Dianhui Wang, Hong Li , “Building feed forward neural networks with random weights for large scale datasets”, Expert Systems with Applications Volume 106, 2018, pp. 233-243
[18] Feilong Cao, Dianhui Wang, Houying Zhu, Yuguang Wang, “An iterative learning algorithm for feedforward neural networks with random weights”, Information Sciences, Volume 328, 2016, pp. 546-557.
Citation
R. Vijaya Kumar Reddy, U. Ravi Babu, "Handwritten Hindi Character Recognition using Deep Learning Techniques," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.1-7, 2019.
Analyzing the Vulnerability in Open Source Software
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.8-15, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.815
Abstract
Secure code is one of the key parameters which must be taken care while software is being developed. Inspecting the source code at the earlier stages is always a better approach. Inspection involves carefully examining the source code for any flaws which may cause problems in the later stage of the software life cycle. The Vulnerability is a kind of weakness or security flaws in code that can be exploited by an attacker to perform unauthorized actions. A vulnerable code will lead to severe threats to the security of software. In this paper, we have investigated the source code of a well-known open source software (OSS) projects written in C and C++ programming language and figure out the presence of vulnerability in the software. The results also indicate that the vulnerabilities in the source code have shown an increasing trend with the lines of code (LOC). It pointed to the fact that addition of new features or change request into the OSS project will cause an increase in the vulnerability as well. It gives significant implication to the developers or project managers of OSS projects to not deny the existence of security flaws in the software as the software evolves. The obtained results will also help the project managers and developers to measure the state of software.
Key-Words / Index Term
Open Source Software, Software Quality, Hits, Flawfinder, Vulnerability, Code Scanning tools
References
[1] Younan, Y., W. Joosen, and F. Piessens. "Code Injection in C and C++: A Survey of Vulnerabilities and Countermeasures (Tech. Rep. No. CW 386)." Leuven, Belgium: Departement Computerwetenschappen, Katholieke Universiteit Leuven (2004)
[2] Piessens, Frank. "A taxonomy of causes of software vulnerabilities in internet software." Supplementary Proceedings of the 13th International Symposium on Software Reliability Engineering. 2002.
[3] “Glossary.” Risk Management & Information Security Management Systems - ENISA, 20 Jan. 2016, www.enisa.europa.eu/topics/threat-risk-management/risk-management/current-risk/risk-management-inventory/glossary#G52.
[4] Abbott, Robert P., et al. Security analysis and enhancements of computer operating systems. No. NBSIR-76-1041. NATIONAL BUREAU OF STANDARDS WASHINGTONDC INST FOR COMPUTER SCIENCES AND TECHNOLOGY, 1976.
[5] Aslam, Taimur. "A taxonomy of security faults in the unix operating system." Master`s thesis, Purdue University 199.5 (1995).
[6] Yamaguchi, Fabian, et al. "Chucky: Exposing missing checks in source code for vulnerability discovery." Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. ACM, 2013.
[7] Ball, Thomas, et al. "Thorough static analysis of device drivers." ACM SIGOPS Operating Systems Review 40.4 (2006): 73-85.
[8] DeKok, Alan. "PScan: A limited problem scanner for C source files." (2013).
[9] Evans, David, and David Larochelle. "Improving security using extensible lightweight static analysis." IEEE software 1 (2002): 42-51.
[10] Kernighan, Brian W., and M. Dennis. "Ritchie. The C Programming Language." (1988).
[11] Stroustrup, Bjarne. The C++ programming language. Pearson Education India, 2000.
[12] HeapOverflow:https://www.owasp.org/index.php/Testing_for_Heap_Overflow,StackOverflow:https://www.owasp.org/index.php/Testing_for_Stack_Overflow,FormatString:https://www.owasp.org/index.php/Testing_for_Format_String .
[13] Conover, Matt. "w00w00 on heap overflows." (1999).
[14] Intel Corporation. IA-32 Intel Architecture Software Developer’s Manual Volume 1: Basic Architecture, 2001. Order Nr 245470.
[15] scut. Exploiting format string vulnerabilities. http://www.team-teso.net/articles/formatstring/, 2001
[16] IDA PRO, https://www.hex-rays.com/products/ida/overview.html
[17] Brumley, David, et al. "RICH: Automatically protecting against integer-based vulnerabilities." Department of Electrical and Computing Engineering (2007): 28.
[18] Zitser, Misha, Richard Lippmann, and Tim Leek. "Testing static analysis tools using exploitable buffer overflows from open source code." ACM SIGSOFT Software Engineering Notes. Vol. 29. No. 6. ACM, 2004.
[19] Viega, John, et al. "ITS4: A static vulnerability scanner for C and C++ code." Computer Security Applications, 2000. ACSAC`00. 16th Annual Conference. IEEE, 2000.
[20] Flawfindetr: https://dwheeler.com/flawfinder/flawfinder.pdf and A book entitled as “Secure Programming HOWTO” by David A. Wheeler.
[21] Fatima, Anum, Shazia Bibi, and Rida Hanif. "Comparative study on static code analysis tools for C/C++." Applied Sciences and Technology (IBCAST), 2018 15th International Bhurban Conference on. IEEE, 2018.
[22] GIT HUB, https://github.com/mysql/mysql-server.
Citation
Madanjit Singh, Munish Saini, Manevpreet Kaur, "Analyzing the Vulnerability in Open Source Software," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.8-15, 2019.
Simulation of Routing protocol for Low power and Lossy Networks with Cooja Simulator
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.16-20, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.1620
Abstract
Low power and Lossy Networks now regarded as one of the most extensive study areas are comprised of a huge number of constrained nodes with restricted power, memory and processing facility. Besides, nodes in these networks consistently function on batteries and shows evidence of unpredictable communication often. Routing in such constrained networks is extremely tough since the available protocols were not suitable for low-power and lossy networks and thus the Internet Engineering Task Force (IETF) ROLL Working Group proposed an IPv6 based Routing Protocol for Low power and Lossy Networks called RPL capable of forming network routes issuing information about routing among nodes and adapting to network topologies. This paper mainly focuses on the simulation study of routing protocol for low power and lossy networks with Cooja simulator.
Key-Words / Index Term
WSN, RPL, Contiki, Cooja, LLN
References
[1] T. Winter, "RPL: IPv6 routing protocol for low power and lossy networks," Internet Eng. Task Force, Fremont, CA, USA, RFC 6550, accessed: Sep. 2017.
[2] G. Montenegro, C. Schumacher, and N. Kushalnagar,"IPv6 over low-power wireless personal area networks (6LoWPANs): Overview, assumptions, problem statement and goals,"Internet Eng. Task Force, Fremont, CA, USA, RFC 4919, accessed: Sep. 2017.
[3] A Brandt and G. Porcu, "Home automation routing requirements in low-power and lossy networks," Internet Eng. Task Force, Fremont, CA, USA, RFC 5826, accessed: Sep. 2017.
[4] M. Dohler, T. Watteyne, T. Winter, and D. Barthel , "Routing requirements for urban low-power and lossy networks," Internet Eng. Task Force, Fremont, CA, USA, RFC 5548, accessed: Sep. 2017.
[5] J. Martocci, P.D. Mil, N. Riou, and W. Vermeylen, "Building automation routing requirements in low-power and lossy networks," Internet Eng. Task Force, RFC 5867.
[6] K. Pister, P. Thubert, S. Dwars, and T. Phinney, "Industrial routing requirements in low-power and lossy networks," Internet Eng. Task Force, RFC 5673.
[7] P. Levis, T. Clausen, J Hui, O. Gnawali, and J. Ko, "The Trickle algorithm," Internet Eng. Task Force, RFC 6206.
[8] D. Barthel, J. Vasseur, K. Pister, M. Kim, and N. Dejean, "Routing metrics used for path calculation in low-power and lossy networks," Internet Eng. Task Force, RFC 6551.
[9] T. Zhang, L. Xianfeng, "Evaluating and analysing the performance of RPL in Contiki," Intenational workshop on mobile sensing, computing and communication," pp: 19-24, 2014.
[10] Olfa Gaddour, and Anis Koubaa, "RPL in a nutshell: A survey," 2013.
[11] J. Wang, and H. Li, "Researching and hardware implementation of RPL protocol based on Contiki operating system," International Journal of Future Computer and Communication, Dec. 2014.
[12] Xun Yang, "The Application of RPL routing protocol in low-power wireless sensor and lossy networks," Sensors and Transducers, Vol . 170, Issue 5, May 2014, pp. 107-111.
[13] Iova, O., et al. "The love-hate relationship between IEEE 802.15.4 and RPL," IEEE Communications Magazine, pp: 188-194, 2017.
[14] Olfa Gaddour, Anis Kaubaa and Mohammed A, "Quality-of-Service aware routing for static and mobile ipv6 based low-power and lossy networks using RPL," Adhoc Networks, pp: 233-256, 2015.
[15] J.P Vasseur, and Adam Dunkels, "Interconnecting smart objects with IP- The next Internet", 2010.
[16] J. P. Vasseur, N. Agarwal, J. Hui, Z. Shelby, P. Bertrand, and C. Chauvener, "RPL: The IP Routing protocol designed for low-power and lossy networks"", Internet Protocol for Smart Objects (IPSO) Alliance, April 2011.
[17] Contiki: The open source operating system for Internet of Things.
[18] Olfa Gaddour, Anis Koubaa, "Co-RPL RPL Routing for mobile low power wireless sensor networks using Corona mechanism," 9th IEEE International Symposium, pp: 200-209, 2014.
[19] Olfa Gaddour, et. al, "OF-FL: QoS-aware fuzzy logic objective function for RPL routing protocol," Proceedings of 12th International symposium on Modelling and Optimization in Mobile, Ad-Hoc and Wireless networks, pp. 365-372, May 2014
[20] An introduction to Cooja, https://github.com/contiki-os/contiki/wiki.
[21] O. Gnawali, P.Levis, "The Minimum Rank with Hysteresis Objective Function," Internet Eng. Task Force, RFC 6719.
Citation
Nithya Lakshmi N, M. Hanmandlu, "Simulation of Routing protocol for Low power and Lossy Networks with Cooja Simulator," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.16-20, 2019.
Frequent Sequential Pattern Mining in Web Log Data – A Simple Approach
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.21-26, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.2126
Abstract
With nurturing reputation of the World Wide Web, large quantity of web usage data is collected by the web servers and stored in web access log files. Web usage mining is a technology to mine valuable knowledge from the World Wide Web. It intends to discover interesting user access patterns from web log files. Analysis of these user access patterns is used to determine that the information architecture of the web site can be reorganized to better facilitate information retrieval. Association rule mining is also used to find association relationships amongst large data sets. Mining frequent sequential patterns is a significant aspect in association rule mining. Based on this, the changes can be suggested to the web site by placing embedded hyperlinks on the home page to the frequently accessed sections of the web site. In this paper, a very efficient algorithm has been adopted for expert systems to mine frequent sequential patterns in web usage data
Key-Words / Index Term
Data Mining, Web Mining, Association rule mining, Frequent sequential pattern mining, Web Log files, Web usage
References
[1] Renáta Iváncsy, István Vajk, “Frequent Pattern Mining in Web Log Data”, Acta Polytechnica Hungarica, Vol. 3, No. 1, 2006.
[2] S. K. Madria, S. S. Bhowmick, W. K. Ng, and E.-P. Lim, “Research issues in web data mining”, Data Warehousing and Knowledge Discovery, pp. 303-312, 1999.
[3] J. Borges and M. Levene, “Data mining of user navigation patterns, WEBKDD, pp. 92-111, 1999.
[4] M. N. Garofalakis, R. Rastogi, S. Seshadri, and K. Shim, “Data mining and the web: Past, present and future”, ACM CIKM’99 2nd Workshop on Web Information and Data Management (WIDM’99), Kansas City, Missouri, USA, C. Shahabi, Ed. ACM, pp. 43-47, 1999.
[5] S. Chakrabarti, “Data mining for hypertext: A tutorial survey”, SIGKDD: SIGKDD Explorations: Newsletter of the Special Interest Group (SIG) on Knowledge Discovery and Data Mining, ACM, Vol. 1, No. 2, pp. 1-11, 2000.
[6] M. Eirinaki and M. Vazirgiannis, “Web mining for web personalization”, ACM Trans. Inter. Tech., Vol. 3, No. 1, pp. 1-27, 2003.
[7] J. Pei, J. Han, B. Mortazavi-Asl, and H. Zhu, “Mining access patterns efficiently from web logs”, PADKK ’00: Proceedings of the 4th Pacific- Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications. London, UK: Springer-Verlag, pp. 396-407, 2000.
[8] Vinita Shrivastava, Neetesh Gupta, “Performance Improvement Of Web Usage Mining By Using Learning Based K-Mean Clustering”, International Journal of Computer Science and its Applications.
[9] Craig Peter Oosthuizen, “Web Usage Mining of Organisational Web Sites”, December 2005.
[10] B.Mortazavi-asl, “Discovering and Mining User Web-Page Traversal Patterns”, Computer Science, Simon Fraser University, 1999.
[11] M. Géry and H.Haddad, “Evaluation of web usage mining approaches for user`s next request prediction”, Proc. 5th ACM International workshop on web information and data management, New Orleans, Louisiana, USA. pp 74-81. 7-8 November, 2003.
[12] R. Kosala, H. Blockeel, “Web Mining Research: A Survey”, SIGKKD Explorations, vol. 2(1), July 2000.
[13] J. Srivastava, R. Cooley, M. Deshpande, P.-N. Tan, “Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data”, SIGKKD Explorations, vol.1, Jan 2000.
[14] J. Punin, M. Krishnamoorthy and M. Zaki, “Web usage mining: Languages and algorithms, Studies in Classification”, Data Analysis, and Knowledge Organization. Springer-Verlag, 2001.
[15] M. S. Chen, J. S. Park, and P. S. Yu, “Data mining for path traversal patterns in a web environment”, Sixteenth International Conference on Distributed Computing Systems, pp. 385-392, 1996.
[16] P. Batista, M. Ario, and J. Silva, “Mining web access logs of an on-line newspaper”, 2002.
[17] O. R. Zaiane, M. Xin, and J. Han, “Discovering web access patterns and trends by applying olap and data mining technology on web logs”, ADL ’98: Proceedings of the Advances in Digital Libraries Conference. Washington, DC, USA: IEEE Computer Society, pp. 1-19, 1998.
[18] J. F. F. M. V. M. Li Shen, Ling Cheng and T. Steinberg, “Mining the most interesting web access associations”, WebNet 2000-World Conference on the WWW and Internet, 2000, pp. 489-494.
[19] B. Jeudy and F. Rioult, “Database transposition for constrained closed pattern mining”, Proceedings of Third International Workshop on Knowledge Discovery in Inductive Databases (KDID) co-located with ECML/PKDD, 2004.
[20] R. Agrawal, R. Srikant, “Fast algorithms for mining association rules”, Proceedings of the 20th International Conference on Very Large Data Bases, 1994, pp. 487–499.
[21] J. Han, “Research challenges for data mining in science and engineering”, NGDM 2007.
[22] R. Agrawal, R. Srikant, “Mining sequential patterns”, Proceedings of the 11th International Conference on Data Engineering, pp. 3, 1995.
[23] Han J, Pei J, Yin Y, “Mining frequent patterns without candidate generation”, Proceeding of the 2000 ACM-SIGMOD international conference on management of data (SIGMOD’00), Dallas, TX, pp 1–12, 2000.
[24] Jian Pei, Jiawei Han et al, “PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth”, Proceeding ICDE `01 Proceedings of the 17th International Conference on Data Engineering, IEEE Computer Society Washington, DC, USA, 2001.
[25] Jiawei Han, Hong Cheng, Dong Xin, “Frequent pattern mining: current status and future directions”, Data Mining and Knowledge Discovery, 15, 55–86, 2000.
[26] P.V. Nikam, D.S. Deshpande, “Different Approaches for Frequent Itemset Mining”, International Journal of Scientific Research in Computer Science and Engineering, Vol.6, Issue.2, pp.10-14, 2018.
[27] Pradeep Chouksey, “Mining Frequent model Using mass-produced Approach”, International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.4, pp.89-94, 2017.
[28] Sunil Joshi, “A Dynamic Approach for Frequent Pattern Mining Using Transposition of Database”, The IEEE 2010 International Conference on Communication software and Netweorks (ICCSN 2010) from 26 - 28 February 2010.
[29] Sunil Joshi, Dr. R. S . Jadon, Dr. R. C. Jain, “An Implementation of Frequent Pattern Mining Algorithm using Dynamic Function”, International Journal of Computer Applications (0975 – 8887), Volume 9– No.9, November 2010.
[30] Sonia Sharma, Munishwar Rai, “Customer Behaviour Analysis using Web Usage Mining”, International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.6, pp.47-50, 2017.
Citation
A. Saravanan, S. Sathya Bama, "Frequent Sequential Pattern Mining in Web Log Data – A Simple Approach," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.21-26, 2019.
Naive Bayes Based QoS for Wireless Sensor Networks
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.27-33, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.2733
Abstract
Sensor networks is widely used in real-time applications that have made emergent of Quality of Service (QoS) based communication schemes. Recently QoS in sensor network becoming an interesting topic among the research community. This paper proposes a Naïve Bayes based QoS mechanism, which is suitable for both real-time and non-real-time applications. The proposed mechanism achieves the desired QoS by selecting the neighboring nodes in a way to meet the required QoS. Performance of the scheme is evaluated through simulations. The results provide insights on the performance of the system based on different evaluation metrics such as end-to-end delay, packet delivery ratio and the node failure probabilities. The results demonstrate that the scheme is able to outperform the compared mechanisms such as Multi-constraint Multi-Path (MCMP) routing protocol and energy efficient QoS aware routing protocol (EQSR) using both real time traffic (EQSR-RT) and non-real time traffic(EQSR-NRT).
Key-Words / Index Term
Sensor Network, Wireless, Quality of Service, Naive Bayes classifier, Real-time applications
References
[1] Chahat Aggarwal, B.B. Gupta, "A Survey of Civilian Applications of WSN and Security Protocols", International Journal of Scientific Research in Computer Science and Engineering, Vol.6, Issue.3, pp.56-66, 2018.
[2] Y. Bala Supriya , C. Sudhakar Reddy, "Privacy-Preserving Data Transmission protocol for Wireless Medical Sensor Data", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.3, pp.132-135, 2017.
[3] Ishita Chakraborty, Prodipto Das, "Data Fusion in Wireless Sensor Network-A Survey", International Journal of Scientific Research in Network Security and Communication, Vol.5, Issue.6, pp.9-15, 2017.
[4] Aditya Singh Mandloi and Vineeta Choudhary, "Study of Various Techniques for Data Gathering in WSN", International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.3, pp.12-15, 2013.
[5] I. Maarouf, U. Baroudi,Naseer, A.R.: “Efficient monitoring approach for reputation system-based trust-aware routing in wireless sensor network”`, IET Communications, 2009,vol. 3, no. 5, pp. 846-858.
[6] D. Djenouri, I. Balasingham, "Traffic-Differentiation-Based Modular QoS Localized Routing for Wireless Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 10, no. 6, pp. 797-809, June 2011.
[7] Tommaso Melodia, Ian F. Akyildiz, “Cross Layer QoS –Awre Communication for AREAS IN Ultra Wide Band Wireless MultimediaSensor Networks”IEEE JOURNAL ON SELECTED COMMUNICATIONS, Vol. 28, No. 5,June 2010, Pages653-663.
[8] H. Wang, X. Zhang, F. Nait-Abdesselam, A. Khokhar, "Cross-Layer Optimized MAC to Support Multihop QoS Routing for Wireless Sensor Networks", in IEEE Transactions on Vehicular Technology, vol. 59, no. 5, pp. 2556-2563, Jun 2010.
[9] Ing-Ray Chen, AnhPhanSpeer, Mohamed Eltoweissy”,Adaptive Fault Tolerant QoS control algorithms for maximizing system lifetime of Query based WSN”, IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, Vol. 8, No. 2, April 2011.
[10] A. Fallahi, E. Hossain, "A Dynamic Programming Approach for QoS-Aware Power Management in Wireless Video Sensor Networks", in IEEE Transactions on Vehicular Technology, vol. 58, no. 2, pp. 843-854, Feb. 2009.
[11] N. Friedman, D. Geiger, Goldszmidt M. Bayesian network
classifiers. Machine Learning, 29:131–163, 1997.
[12] Tom M. Mitchell. Machine Learning. McGraw-Hill, 1997.
[13] I. Rish, J. Hellerstein, T. Jayram. “An analysis of data characteristics that affect naive Bayes performance”, Technical Report RC21993, IBM T.J. Watson Research Center, 2001.
[14] T.Beula Darling, G.Suganthi"Enhanced EQSR based QoS Mechanism for Wireless Sensor Networks” International journal on Future Revolution in Computer Science And ommunication Engineering, Vol 4 issue 6, Jun 2018.
[15] András Varga, A Rudolf Hornig, "An overview of the OMNeT++ simulation environment", Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops, Marseille, France, pp. 1-10, 2008.
[16] A. Rastegarnia and V. Solouk, "Castalia Network Animator (CNA): A Visualization Tool for Castalia Wireless Sensor Network Simulator", Ninth International Conference on Information Technology - New Generations, Las Vegas, NV, 2012, pp. 48-53, 2012.
Citation
T. Beula Darling, G. Suganthi, "Naive Bayes Based QoS for Wireless Sensor Networks," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.27-33, 2019.
Luminescence and impedance analysis of CaSiO3:Tb3+ nanophosphors material prepared by combustion method for OLED
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.34-39, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.3439
Abstract
Calcium Silicate acquires a higher luminous efficiency when it is doped with rare earth activated ions. The luminescence behaviour of unhoped CaSiO3 was investigated by a very few research groups. Effect of Tb3+ ion composition on the structural and phosphorescence properties from CaSiO3:Tb3+ nanocrystals has been evaluated using powders grown by the solution combustion technique. The surface morphology were analyzed by SEM and the chemical composition of phosphor characterized by EDX analysis. The XRD study indicates that as the terbium concentration increases the phase changes from CaSiO3 to Ca3Si2O7. Broad band emissions peaking between 280 - 360 nm derived from excited states of Tb3+ ions were observed for all powders grown from various Tb compositions. The green emission transition at 550nm due to an electronic transition of 5D4-7F5 was found to be more prominent and intense. Intensity of afterglow phosphorescence was greatly influenced by the composition of the activator ions. It is found that the composition shows optimum PL properties at 7% of terbium Tb3+ ions concentration. The impedance spectroscopic study shows that the present phosphor shows electrical behavior like dielectric material in AC field. The activation energy of phosphor analysed by Chem’s imperials formula in thermoluminescence analysis found to be.0.86eV. It is found that the prepared luminesce material is a new alternative for making cheap green organic light emitting diodes(OLED’s).
Key-Words / Index Term
Impedance spectroscopic, Thermoluminescence, Photoluminescence, Energy Dissipative spectroscopic
References
[1] Chua B.S., Xu S., Ren Y.P., Cheng Q.J., Ostrikov K., J. Alloys Compd.Vol. 485, pp. 379, 2009.
[2] Biasi R.S.D., Grillo M.L.N., J. Alloys Compd. Vol. 485 pp. 26, 2009.
[3] Hong K. S., Meltzer R. S., Bihari B., Williams D. K., and Tissue B. M., J. Luminiscence. Vol. 234, pp.76. 1998
[4] Bhargara R. N., Gallaghar D., Hong X., and Nurmikko A., Physical Review Letters, Vol. 72, pp. 416 1994
[5] Jiao H. and Wang Y. “Ca2Al2SiO7: Ce3+, Tb3+ “A White–Light Phosphor Suitable for White–Light-Emitting Diodes” Journal of the Electrochemical Society, Vol. 156 (5) pp117-120, 2009.
[6] Merino R.I., Pardo J.A., Pena J.I., Orera V.M. “Microstructure-size dependence of the 1.520 mm Er3+ luminescence lifetime in Al2O3ZrO2 eutectic melt growth composites” Appl. Phys. Lett. Vol. 80, pp.589, 2002.
[7] Rivera T., Sosa R., Azorín J., Zarate J., Ceja A. “Synthesis and luminescent characterization of sol-gel derived zirconia-alumina”, Radiat. Meas. Vol. 45, pp.465-467.2010.
[8] Jinjun CAI, Huanhuan PAN and WANG Yi, “Luminescence properties of red-emitting Ca2Al2SiO7:Eu3+ nanoparticles pre- pared by sol-gel method” RARE METALS Vol. 30(4), pp. 374.2011.
[9] Talwar G.J., Joshi C.P., Moharil S.V. Dhopte S.M. “Combustion synthesis of Sr3MgSi2O8:Eu2+and Sr2MgSi2O7:Eu2+ phosphors” Journal of Luminescence, Vol 129. Pp.1239–1241, 2009.
[10] Harrison E.C., McLamed N.T. “A new family of self-activated phosphors” J. Electrochem. Soc. Vol. 110,pp.23. 1963.
[11] Ping Li, Wei Chen, “X-ray-absorption studies of zirconia polymorphs. III. Static distortion and thermal distortion” Physic Rev. B. Vol. 48, pp.10082, 1993.
[12] Lange F.F. “Transformation toughening” J. Mater. Sci. Vol. 17, pp. 255-263, 1982.
[13] Sakai R, Katsumata T, Komuro S, Morikawa T., J. Lumin. Vol. 85 (1–3), pp.149, 1999.
[14] Yuan Z X, Chang C K, Mao D L, Ying W J, J. Alloys Compd. Vol. 377, pp.3, 2004.
[15] Ramesh, S. and Arof, A. K. Mater Sci. Eng. B. Vol. 85: pp. 11. 2001.
[16] Cole, K.S., Cole, R.H. “Dispersion and Absorption in Dielectrics - I Alternating Current Characteristics”.J. Chem. Phys. Vol. 9, pp. 341-352. 1941.
[17] Cole, K.S., Cole, R.H. “Dispersion and Absorption in Dielectrics - II Direct Current Characteristics” Journal of Chemical Physics Vol. 10, pp. 98-105. 1942
Citation
Ohm Prakash Verma, Shailendra Verma, M R Meshram, Nirbhay K Singh, "Luminescence and impedance analysis of CaSiO3:Tb3+ nanophosphors material prepared by combustion method for OLED," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.34-39, 2019.
New State Based Algorithm For Rubik’s Cube
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.40-45, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.4045
Abstract
Rubik`s cube is a 3-dimensional mechanical puzzle. The aim of this research paper is to describe a new algorithm which is state based to solve the Rubik`s cube. There 40 quintillion possibilities to solve this problem. Hence without knowing the principles behind cube it is nearly impossible to solve in proper manner. It will take you through everything in order to solve the Rubik`s cube. It is really simple, you just need to follow the algorithm and you will be solving Rubik`s cube in less than two minutes. This paper on how to do the Rubik’s Cube will take about 45 minutes to understand, but once you get, you can impress all your friends with how you can solve one of life’s great mysteries: how to do a Rubik’s Cube.
Key-Words / Index Term
Flowchart, Algorithm of Rubik’s Cube, Artificial Intelligence, Group theory
References
[1] James G. Nourse, “The Simple Solution to Rubik`s”, McGraw-Hill Publication, India
[2] Dan Harris, Robert Steimle” Speed solving the Cube”,H&C Publications
[3] Daniel Ross,” Rubik`s cube best algorithms”,pearl publications
[4] Hill main,“Group Theory” H & C publicaions
[5] Kevin Warwick,” Artificial Intelligence”,Hill publications
[6] https://en.wikipedia.org/wiki/Rubik%27s_Cube
[7] https://www.computerhope.com/jargon/f/flowchar.html
[8] http://erikdemaine.org/papers/Rubik_ESA2011/paper. pdf
[9] https://www.quora.com/What-are-the-best-papers-Rubiks-cube-theory
[10] https://study.com/academy/lesson/flowchart-symbols
[11] http://www.genetic-programming.org/hc2010/7-Borschbach
[12] http://news.mit.edu/2011/rubiks-cube-0629
[13] http://www.divaportal.org/smash/get/diva2:816583/FULLTEXT01.pdf
[14] http://www.csc.kth.se/utbildning/kth/kurser/DD143X/dkand13/Group3
Citation
Jeslin Jery, "New State Based Algorithm For Rubik’s Cube," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.40-45, 2019.
Recent Advancement in Feature Extraction tools for Biometric System: Comparative Analysis
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.46-50, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.4650
Abstract
Biometrics is the new technology for body measurements and calculations that is use to identifying a person. It signifies to metrics related to human physiological or behavioral characteristics. Many specific physiological and behavioral parts, personal characteristics have been suggested and used for biometric security scheme [1]. Any Biometric system comprises of four modules: sensor module, feature extraction module, database module and matching module. Out of all these module feature extraction module of any recognition system plays an important role in recognizing the particular objects with same set of images [3]. This paper presents an analysis on the use of the newly introduced modern and popular key-points feature extracting tools and methodologies that can be applicable in the biometric domain. The implementation is carried out using MATLAB programming environment and tested on CASIA database for Iris and FVC2004 DB3_A for Fingerprint.
Key-Words / Index Term
Biometric; Iris; Fingerprint; Feature;Templte; Matching
References
[1] A. K. Jain, Fellow, IEEE, A. Ross, Member, IEEE, and S. Prabhakar, Member, IEEE, “An Introduction to Biometric Recognition”, IEEE transactions on circuits and systems for video technology, vol. 14, no. 1, january 2004.
[2] S Prakash and P Gupta, “An Efficient Ear Localization Technique”, Image and Vision Computing, 30(1), pp. 38-50, (2012).
[3] O P Sharma and J Sheetlani, “Biometric based authentication system: a survey”, International Journal of Current Advanced Research Volume 6; Issue 7; July 2017; Page No. 4487-4492
[4] D. Lowe, “Distinctive Image Features from Scale-Invariant Keypoints”, International Journal of Computer Vision 60(2): 91-110, 2006.
[5] H. Bay, T. Tuytelaars, and L. V. Gool, “SURF: Speeded up Robust Features”, Journal of Computer vision and image understanding 110 (3): 346-359, 2008.
[6] P. M. Panchal, S. R. Panchal, S. K. Shah, "A Comparison of SIFT and SURF", International Journal of Innovative Research in Computer and Communication Engineering, Vol. 1, Issue 2, April 2013
[7] D. Mistry, A. Banerjee, “Comparison of Feature Detection and Matching Approaches: SIFT and SURF”, Global Research and Development Journal for Engineering, Volume 2, Issue 4, March 2017.
[8] Guerrero, Maridalia, “A Comparative Study of Three Image Matcing Algorithms: Sift, Surf, and Fast”, (2011). All Graduate Theses and Dissertations. Paper 1040.
[9] L. Masek, “Recognition of Human Iris Patterns for Biometric Identification”, The University of Western Australia 2003 [http://www.csse.uwa.edu.au/~pk/studentprojects/libor/LiborMasekThesis.pdf].
[10] R. Wildes, “Iris Recognition: An Emerging Biometric Technology”, Proc IEEE 1997, 85:1348-1363.
[11] Chinese Academy of Sciences Institute of Automation (CASIA) iris database [http://www.cbsr.ia.ac.cn/english/IrisDatabase.asp]
[12] R. Kabbani,“Selecting Most Efficient Arabic OCR Features Extraction Methods Using Key Performance Indicators”, 2nd International Conference on Communications, Computing and Control Applications (CCCA), 2012.
[13] Yakubu Ajiji Makeri, “The role of Cyber Security and Human-Technology Centric for Digital Transformation”, International Journal of Scientific Research in Computer Science and Engineering (IJSRCSE), Vol.6, Issue.6, pp.53-59, December (2018).
Citation
Om Prakash Sharma, Jitendra Sheetlani, Praveen Shrivastava, "Recent Advancement in Feature Extraction tools for Biometric System: Comparative Analysis," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.46-50, 2019.
Design of an Improved Data Deduplication Technique for Cloud Storage
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.51-56, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.5156
Abstract
Exchanging data over the system is generally utilized quick and solid hotspot for correspondence. Clients from wide devotion utilize this component for exchanging and getting to data. Portability and between operability inside cloud framework through disconnected and online mediums are persistently alluring yet the issue of security emerges amid the transmission process. Security and unwavering quality is the key issue during the exchange process which is considered in this exploration. Data security is given utilizing the public and private key block level de-duplication. The analysis is inferred at disconnected information as well as an online information, for example, googledocs. Redundancy handling mechanism of the component is utilized to guarantee that space at information storage supplier is slightest utilized since taken a cost in DSP is went with a measure of capacity utilized. Overall space necessity if there should arise an occurrence of heavy documents is decreased and security of online data getting to is improved by the utilization of Byte level de-duplication.
Key-Words / Index Term
de-duplication, redundancy handling mechanism, cryptosystem
References
[1] F. Sabahi, “Cloud Computing Security Threats and Responses,” pp. 245–249, 2011.
[2] X. Wu, R. Jiang, and B. Bhargava, “On the Security of Data Access Control for Multiauthority Cloud Storage Systems,” pp. 1–14, 2015.
[3] J. Aikat et al., "Rethinking Security in the Era of Cloud Computing," no. June 2017.
[4] K. Hwang, X. Bai, Y. Shi, M. Li, W.-G. Chen, and Y. Wu, “Cloud Performance Modeling with Benchmark Evaluation of Elastic Scaling Strategies,” IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 1, pp. 130–143, Jan. 2016.
[5] T. H. Noor, Q. Z. Sheng, L. Yao, S. Dustdar, and A. H. H. Ngu, “CloudArmor: Supporting Reputation-Based Trust Management for Cloud Services,” IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 2, pp. 367–380, Feb. 2016.
[6] M. Armbrust et al., “A view of cloud computing,” Commun. ACM, vol. 53, no. 4, p. 50, 2010.
[7] R. Buyya, C. S. Yeo, and S. Venugopal, “Market-oriented cloud computing: Vision, hype, and reality for delivering IT services as computing utilities,” Proc. - 10th IEEE Int. Conf. High Perform. Comput. Commun. HPCC 2008, pp. 5–13, 2008.
[8] S. J. Nirmala, N. Tajunnisha, and S. M. S. Bhanu, “Service provisioning of flexible advance reservation leases in IaaS clouds,” vol. 3, no. 3, pp. 154–162, 2016.
[9] M. Marwan, A. Kartik, and H. Ouahmane, "Secure Cloud-Based Medical Image Storage using Secret Share Scheme," 2016.
[10] D. V. Dimitrov, “Medical internet of things and big data in healthcare,” Healthc. Inform. Res., vol. 22, no. 3, pp. 156–163, 2016.
[11] J. Li, J. Li, X. Chen, C. Jia, W. Lou, and S. Member, “Identity-based Encryption with Outsourced Revocation in Cloud Computing,” pp. 1–12, 2013.
[12] S. Seo, M. Nabeel, and X. Ding, "An Ef fi client Certi fi cateless Encryption for Secure Data Sharing in Public Clouds," pp. 1–14, 2013.
[13] S. Wang, J. Zhou, J. K. Liu, J. Yu, and J. Chen, “An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing,” vol. 6013, no. c, pp. 1–13, 2016.
[14] D. Xu, C. A. I. Fu, G. Li, and D. Zou, “Virtualization of the Encryption Card for Trust Access in Cloud Computing,” vol. 5, 2017.
[15] A. Alabdulatif, H. Kumarage, I. Khalil, M. Atiquzzaman, and X. Yi, “Privacy-preserving cloud-based billing with lightweight homomorphic encryption for sensor-enabled smart grid infrastructure,” IET Wirel. Sens. Syst., vol. 7, no. 6, pp. 182–190, 2017.
[16] J. Li, X. Lin, Y. Zhang, and J. Han, "KSF-OABE Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage," vol. 1374, no. c, pp. 1–12, 2016.
[17] L. Jiang, D. Guo, and S. Member, “Dynamic Encrypted Data Sharing Scheme Based on Conditional Proxy Broadcast Re-Encryption for Cloud Storage,” vol. 5, 2017.
[18] C. Liu, S. Member, L. Zhu, J. Chen, and S. Member, “Graph Encryption for Top-K Nearest Keyword Search Queries on Cloud,” vol. 3782, no. c, pp. 1–11, 2017.
[19] C. Song, Y. Park, J. Gao, S. K. Nanduri, and W. Zegers, “Favored Encryption Techniques for Cloud Storage,” pp. 267–274, 2015.
[20] N. Veeraragavan, “Enhanced Encryption Algorithm ( EEA ) for Protecting Users ’ Credentials in Public Cloud.”
[21] P. Xu, S. He, W. Wang, W. Susilo, and H. Jin, “Lightweight Searchable Public-key Encryption for Cloud-assisted Wireless Sensor Networks,” IEEE Trans. Ind. Informatics, vol. XX, no. XX, pp. 1–12, 2017.
[22] K. L. Tsai et al., “Cloud encryption using distributed environmental keys,” Proc. - 2016 10th Int. Conf. Innov. Mob. Internet Serv. Ubiquitous Comput. IMIS 2016, pp. 476–481, 2016.
[23] A. El-yahyaoui, “A verifiable fully homomorphic encryption scheme to secure big data in cloud computing,” 2017.
[24] G. Thomas, “Cloud computing security using encryption technique,” pp. 1–7.
Citation
Sunil Gupta, Rajeev Bedi, Amandeep Kaur, "Design of an Improved Data Deduplication Technique for Cloud Storage," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.51-56, 2019.
Process of Data Visualization: Voyage from Data to Knowledge
Research Paper | Journal Paper
Vol.7 , Issue.2 , pp.57-63, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i2.5763
Abstract
The voyage of data begins with collection of data, followed by storing this data in precise format, further traveling through the process of Data Analysis and Data Visualization, ultimately concluding the journey by reaching to valuable knowledge. Thus, this journey originates from Data, reaching to Knowledge. This original data has various dimensions, several logical formats like text, numbers and also physical structures such as structured, semi-structured and unstructured. The complexity of the data increases with the increased number of dimensions of data. During this entire journey, the data has to travel through various phases including Data Analysis and Data Visualization. However, the outcome of data analysis may not be adequate to provide the knowledge. Visualization Process involves seven steps, Acquire, Parse, Filter, Mine, Represent, Refine and Interact. Acquiring refers to obtaining the data, Parsing structures the data, Filtering allows to select the precise data, Mining supports in uncovering the patterns, Representing provides visual data, Refining allows to enhance the presentation of data, Interacting develops an interaction with the gained knowledge. Each phase makes data more meaningful as the process of data visualization contributes in enhancing the quality of the analysed data. Thus, role of visualization in this voyage is significant as it transforms data into knowledge. The purpose of this research paper is to describe the various phases in the process of data visualization along with several formats of original data and also presents comparison between data and information, before and after visualization.
Key-Words / Index Term
Data Visualization, Data Transformation, Visualization Process, Information
References
[1] Kirti Nilesh Mahajan and Leena Ajay Gokhale, “Comparative Study of Static and Interactive Visualization Approaches”, International Journal on Computer Science and Engineering (IJCSE), e-ISSN: 0975-3397 p-ISSN: 2229-5631, Vol. 10 No.03, DOI: 10.21817/ijcse/2018/v10i3/181003016 Vol. 10 No.03 Mar 2018 85, pp.85-91, March 2018.
[2] Kirti Mahajan and Leena Ajay Gokhale, “Significance of Digital Data Visualization Tools in Big Data Analysis for Business Decisions”, International Journal of Computer Applications (IJCA), Volume 165 – No.5, pp.15-18, May 2017.
[3] Kirti Mahajan and Leena Ajay Gokhale, “Advanced Charting Techniques of Microsoft Excel 2016 Aiming Visualization”, International Journal of Computer Sciences and Engineering (IJCSE), Vol.-7, Issue-1, E-ISSN: 2347-2693, Jan 2019.
[4] Robert Radburn, Jason Dykes, Jo Wood, "vizLib: Using The Seven Stages of Visualization to Explore Population Trends and Processes in Local Authority Research".
[5] Michael Alexander and Dick Kusleika, “Excel 2016 Formulas”, Wiley India Pvt. Ltd., India, pp. 99-123, 2016.
[6] Mantripatjit Kaur, Anjum Mohd Aslam, “Big Data Analytics on IOT: Challenges, Open Research Issues and Tools”, International Journal of Scientific Research in Computer Science and Engineering, Vol.6, Issue.3, pp.81-85, 2018.
[7] Rakesh. S.Shirsath, Vaibhav A.Desale, Amol. D.Potgantwar, “Big Data Analytical Architecture for Real-Time Applications”, International Journal of Scientific Research in Network Security and Communication, Volume-5, Issue-4, ISSN: 2321-3256, 2017.
Citation
Kirti Nilesh Mahajan, Leena Ajay Gokhale, "Process of Data Visualization: Voyage from Data to Knowledge," International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.57-63, 2019.