Existing and Emerging Covariates of Iris Recognition
Review Paper | Journal Paper
Vol.7 , Issue.6 , pp.140-146, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.140146
Abstract
Iris as a biometric trait has established itself in last two decades. Iris being unique and reliable is used for recognition and authentication purpose instead of using Passwords and PINs. Security is a major concern in any recognition system so is the case with iris recognition system. Further, recognition performance depends upon many factors among which distance, lighting conditions, subject cooperation, and pupil dynamics to name some important ones. The above mentioned covariates have been studies vastly in reference to iris recognition. In this paper, we have considered various novel factors that affect the performance of iris recognition system. Pupil dilation, contact lenses, periocular recognition, template aging, use of drugs and alcohol and sensor interoperability have been under investigation as emerging covariates of iris recognition; in recent times. The focus of this paper is to present a review of various covariates (existing as well as emerging) and their effects on recognition performance. This work shows that these covariates have considerable effect on iris recognition performance and need to be considered while implementing any commercial iris recognition systems.
Key-Words / Index Term
Covariates, Iris Recognition, Pupil dilation, Contact Lenses, Synthetic Iris, Template Aging, Interoperability
References
[1] P. Meredith, T. Sarna, “The Physical and Chemical Properties of Eumelanin,” Pigment Cell Research, Vol. 19, pp. 572–594, 2006.
[2] UIDAI Dashboard [Accessed 21st May 2019] https://uidai.gov.in/aadhaar_dashboard/
[3] Z. Sun and T. Tan, “Ordinal Measures for Iris Recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 31, No. 12, pp. 2211–2226, Aug. 2009.
[4] L. Flom and A. Safir, ‘‘Iris Recognition System,’’ U.S. Patent 4 641 349, Feb. 3, 1987.
[5] S. Chawla and A. Oberoi, “A Robust Algorithm for Iris Segmentation and Normalization using Hough Transform,” 5th IEEE Int. Conf. on Advanced Computing & Communication Technologies, pp. 457-460, Nov. 2011.
[6] Richard P. Wildes, “Iris Recognition: An Emerging Biometric Technology,” Proceedings of the IEEE, Vol. 85, No. 9, September 1997.
[7] J. Daugman, “New Methods in Iris Recognition,” IEEE Trans. Syst. Man Cybern. 37(5), 1167–1175 (2007).
[8] H. P. Proenca, “Towards Non-Cooperative Biometric Iris Recognition,” Ph.D. Dissertation, Dept. Comput. Sci., Univ. Beira Interior, Covilhã, Portugal, 2006.
[9] S. P. Fenker and K. W. Bowyer, “Experimental Evidence of a Template Aging Effect in Iris Biometrics,” in Proc. IEEE Comput. Soc. Workshop Appl. Comput. Vis., Jan. 2011, pp. 232–239.
[10] S. Baker, K. Bowyer, P. Flynn, “Empirical Evidence for Correct Iris Match Score Degradation with Increased Time-Lapse between Gallery and Probe Matches”, in Proceedings of the Third International Conference on Biometrics, 2009, pp. 1170–1179.
[11] K. W. Bowyer, S. E. Baker, A. Hentz et al. IDIS 2: 327, 2009.
[12] L. Masek. Recognition of human iris patterns for biometric identification. Bachelors Thesis http://www.csse.uwa.edu.au/˜pk/studentprojects/libor/, The University of Western Australia, 2003.
[13] A. Sgroi, K. W. Bowyer, and P. J. Flynn. “The Impact of Diffuse Illumination on Iris Recognition”, 2013 International Conference on Biometrics (ICB), 2013.
[14] J. G. Daugman, “How Iris Recognition Works,” IEEE Trans. Circuits Syst. Video Technology, vol. 14, no. 1, pp. 21-30, Jan. 2004.
[15] J. Zuo, N. A. Schmid, and X. Chen, “On Generation and Analysis of Synthetic Iris Images,” IEEE Transactions on Information Forensics and Security, 2(1) :77–90, 2007.
[16] S. Makthal and A. Ross, “Synthesis of Iris Images Using Markov Random Fields,” in Proc. of the 13th European Signal Processing Conference (EUSIPCO 05), Antalya, Turkey, Sept. 2005.
[17] F. J. Shareef, S. Sun, M. Kotecha, I. Kassem, D. Azar, M. Cho, “Engineering a Light-Attenuating Artificial Iris,” Invest Ophthalmol Vis Sci. 2016; 57 : 2195–2202. DOI:10.1167/iovs.15-17310.
[18] P. Tome-Gonzalez, F. Alonso-Fernandez, and J. Ortega-Garcia, “On the Effects of Time Variability in Iris Recognition,” in Proc. IEEE Int. Conf. Biometr. Theory, Appl. Syst., Oct. 2008, pp. 1–6.
[19] J. Cui, Y. Wang, J. Huang, T. Tan, and Z. Sun, “An Iris Image Synthesis Method Based on PCA and Super-Resolution,” in Proc. of the 17th Intern. Conf. on Pattern Recognition (ICPR 04), Cambridge, UK, vol. 4, pp. 471-474, 2004.
[20] H. P. Proenca, “Quality Assessment of Degraded Iris Images Acquired in the Visible Wavelength" IEEE Transactions on Information Forensics and Security, pp. 82–95, 2011.
[21] W. W. Boles and B. Boashash, “A Human Identification Technique using Images of the Iris and Wavelet Transform”, IEEE Transactions on Signal Processing, Vol. 46, Issue 4, pp. 1185-1188, Apr. 1998.
[22] S. Shah and A. Ross, “Generating Synthetic Irises by Feature Agglomeration,” In IEEE International Conference on Image Processing, pp. 317–320, 2006.
[23] Z. He, T. Tan, Z. Sun, and X. Qiu, “Toward Accurate and Fast Iris Segmentation for Iris Biometrics,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(9), 1670–1684, 2009.
[24] J. Galbally, S. Marcel and J. Fierrez, “Image Quality Assessment for Fake Biometric Detection: Application to Iris, Fingerprint, and Face Recognition,” in IEEE Transactions on Image Processing, vol. 23, no. 2, pp. 710-724, Feb. 2014.
[25] L. Ma, T. Tan, Y. Wang, and D. Zhang, “Efficient Iris Recognition by Characterizing Key Local Variations,” IEEE Transactions on Image Processing, 13(6), 739– 750, 2004.
[26] D. Monro, S. Rakshit, and D. Zhang, “DCT-based Iris Recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(4), 586–595, 2007.
[27] O. Seyeddain, H. Kraker, A. Redlberger, A. K. Dexl, G. Grabner, M. Emesz, “Reliability of automatic biometric IRIS recognition after phacoemulsification or drug-induced pupil dilation,” European Journal of Ophthalmology, vol. 24, no. 1, pp. 58-62, 2014.
[28] E. H. Hess and J. M. Polt, “Pupil Size in relation to Mental Activity during Simple Problem-Solving,” Science, 143(3611):1190–1192, 1964.
[29] S. S. Arora, M. Vatsa, R. Singh and A. Jain, “Iris recognition under alcohol influence: A preliminary study,” 2012 5th IAPR International Conference on Biometrics (ICB), New Delhi, 2012, pp. 336-341.
[30] J. Peragallo, V. Biousse, N.J. Newman, “Ocular manifestations of drug and alcohol abuse,” Current Opinion in Ophthalmology, Vol. 24(6), pp. 566-73, Nov. 2013, doi:10.1097/ICU.0b013e3283654db2.
[31] I. Tomeo-Reyes, A. Ross and V. Chandran, “Investigating the impact of drug induced pupil dilation on automated iris recognition,” 2016 IEEE 8th International Conference on Biometrics Theory, Applications and Systems (BTAS), Niagara Falls, NY, 2016, pp. 1-8.doi: 10.1109/BTAS.2016.7791178
[32] P. Artal, “Aging Effects on the Optics of the Eye,” in Age-Related Changes of the Human Eye (Springer, 2008), pp. 35–44.
[33] S. Baker et al., Degradation of iris recognition performance due to non-cosmetic prescription contact lenses. Comput. Vis. Image Underst. 114(9), 1030–1044, 2010.
[34] N. Kohli, D. Yadav, M. Vatsa and R. Singh, “Revisiting iris recognition with color cosmetic contact lenses,” 2013 International Conference on Biometrics (ICB), Madrid, 2013, pp. 1-7.
[35] N. D. Kalka, J. Zuo, N. A. Schmid, and B. Cukic. Image quality assessment for iris biometric. In Defense and Security Symposium, pages 62020D–62020D. International Society for Optics and Photonics, 2006.
[36] B. Winn et al., Factors affecting light-adapted pupil size in normal human subjects. Investig. Ophthalmol. Visual Sci. 35(3), 1132–1137, 1994.
[37] D. Yadav, N. Kohli, J. S. Doyle, R. Singh, M. Vatsa, and K. W. Bowyer, “Unraveling the effect of textured contact lenses on iris recognition,” IEEE Transactions on Information Forensics and Security, 9(5):851–862, 2014.
[38] D.L. Woodard, S. Pundlik, P. Miller, R. Jillela, and A. Ross. On the fusion of periocular and iris biometrics in non-ideal imagery. In 20th International Conference on Pattern Recognition (ICPR), pp. 201–204, Aug. 2010.
[39] K.P. Hollingsworth, S.S. Darnell, P.E. Miller, D.L. Woodard, E. Ortiz, and K.W. Bowyer. Human and machine performance on periocular biometrics under near-infrared light and visible light. Information Forensics and Security, IEEE Transactions on, 7(2):588–601, April 2012.
[40] G. Santos, E. Grancho, M. V. Bernardo, P. T. Fiadeiro, Fusing iris and periocular information for cross-sensor recognition, Pattern Recognition Letters (2014), doi:10.1016/j.patrec.2014.09.012
[41] A. Sharma, S. Verma, M. Vatsa and R. Singh, “On cross spectral periocular recognition,” 2014 IEEE International Conference on Image Processing (ICIP), Paris, 2014, pp. 5007-5011.
[42] U. Park, A. Ross and A. K. Jain, “Periocular biometrics in the visible spectrum: A feasibility study,” 2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems, Washington, DC, 2009, pp. 1-6. doi: 10.1109/BTAS.2009.5339068
[43] K. W. Bowyer, K. Hollingsworth, P. J. Flynn, “Image understanding for iris biometrics: A survey”, Computer Vision and Image Understanding, 110(2):281–307, May 2008.
[44] A. K. Jain, A. Ross, and K. Nandakumar. Introduction to Biometrics, Chapter Iris Recognition, pp. 141–147. Springer Link, 2011.
[45] K. P. Hollingsworth, K.W. Bowyer, P.J. Flynn, “Pupil dilation degrades iris biometric performance,” Comput. Vis. Image Underst. (2009), Vol. 113, No. 1, pp. 150-157.
[46] C. N. Padole and H. Proenca, “Periocular recognition: Analysis of performance degradation factors,” 2012 5th IAPR International Conference on Biometrics (ICB), New Delhi, 2012, pp. 439-445.
[47] K. B. Raja, R. Raghavendra, V. K. Vemuri, C. Busch, Smartphone based visible iris recognition using deep sparse filtering, Pattern Recognition Letters, Vol. 57, 2015, pp. 33-42.
[48] A. Ross, R. Pasula and L. Hornak, “Exploring multispectral iris recognition beyond 900nm,” 2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems, Washington, DC, 2009, pp. 1-8.
[49] H. Proenca, “Iris Recognition: On the Segmentation of Degraded Images Acquired in the Visible Wavelength,” in IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 8, pp. 1502-1516, Aug. 2010.
[50] S. Kumar, V. K. Lamba, S. Jangra, “Synthetic Iris as a vulnerability of iris recognition,”, Journal of Image Processing & Pattern Recognition Progress, Vol. 5, No. 3, pp. 15-21, 2018.
[51] O. Bergamin, M.B. Zimmerman, R. H. Kardon, “Pupil light reflex in normal and diseased eyes: Diagnosis of visual dysfunction using waveform partitioning,” Ophthalmology, Vol. 110, No. 1, pp. 106-114, 2003.
[52] M. Fairhurst, M. Erbilek, “Analysis of Physical Ageing Effects in Iris Biometrics”, IET Computer Vision, 5(6), pp. 358–366, 2011.
[53] M. Pedrotti, M. A. Mirzaei, A. Tedesco, J. Chardonnet, F. Merienne, S. Benedetto, and T. Baccino, “Automatic Stress Classification With Pupil Diameter Analysis,” International Journal of Human–Computer Interaction, 30(3), 220-236, 2014.
[54] Z. Sun and T. Tan, "Ordinal Measures for Iris Recognition," in IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2211-2226, Dec. 2009.
[55] S. Baker, K. W. Bowyer, P.J. Flynn, “Contact lenses: handle with care for iris recognition,” Proceedings of The Third Int. Conf. on Biometrics: Theory, Applications and Systems (BTAS 09), September 2009b.
[56] S. Kumar, V. K. Lamba, S. Jangra, “Image Quality Analysis of Segmented Iris using Filters,”, Int. J. of Recent Technology and Engineering, Vol. 7, No. 5, pp. 279-296, Jan. 2019.
[57] L. Dhir, N. E. Habib, D. M. Monro, and S. Rakshit, “Effect of cataract surgery and pupil dilation on iris pattern recognition for personal authentication”, Eye, 224(6):1006–1010, 2010.
Citation
Sunil Kumar, Vijay Kumar Lamba, Surender Jangra, "Existing and Emerging Covariates of Iris Recognition," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.140-146, 2019.
A Survey on Business Policy Violation in Web Service Integration
Survey Paper | Journal Paper
Vol.7 , Issue.6 , pp.147-151, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.147151
Abstract
Rapid changes in the business rules in the world of business have proved to be an ethical factor in the assessment of the business logic. The ever-changing business world and the competitive nature of the process have led to the business logic to be an invaluable property for enterprises. The Web Service is the rising innovation in the field of business forms where the services offered by the association are overseen through the system called Change Management Framework. This framework is helpful for an organization to develop itself by satisfying the client requirements in a self-governing way. Service integration plays a major role in service discovery where there is a need to concentrate on the changing business logics .This is an arduous and time-consuming task. So the current attention is to have an automatic system to investigate the Business logics and distribute the felicitous style to integrate them. This paper gives an overview of recent research efforts made for dynamic web service integration and the methodologies adopted to understand the business policies and the techniques for identifying the business policy violations.
Key-Words / Index Term
Change Management Framework, Web Service Integration, Business Policy Violation
References
[1] Tusha Agarwal, Neeta Sharma.”Efficient Load Balancing Using Restful Web Services in Cloud Computing: A Review”, International Journal of Scientific research in Computer Science and Engineering, Volume6, pp 67-70, 2018.
[2] XuminLiu,AthmanBouguettaya,QuYu,ZakiMalik.”Efficient Change Management in Long Term Composed Services”, Springer, pp 87-103, 2010.
[3] Zakir Laliwala, Amee Desai, Sanjay Chaudhary “Policy-based Services Aggregation in Grid Business Process”, Annual IEEE India conference, 2009.
[4] XuminLiu,,Athman Bouguettaya,Jemma Wu, and Li Zhou.” Ev-LCS: A System for the Evolution of Long-term Composed Services”.IEEE Transaction on Services Computing, pp 102-115, 2011.
[5] Philipp Leitner,Branimir Wetzstein,Florian Rosenberg,Anton Michlmayr, chahram Dustdar and Frank Leymann, “Runtime predictions of Service Level Agreement Violation for composite services”, Service-Oriented Computing, Springer-Verlag Heidelberg, 2010.
[6] C.Müller, M.Oriol, M.Rodríguez, X.Franch, J.Marco, M.Resinas and A.Ruiz--Cortés, “SALMonADA: A Platform for monitoring and displaying violations of WS-Agreement Compliance Document”, Proceedings of the 4th International Workshop on Principles of Engineering Service-Oriented Systems, PP 43-49 ,June 2012.
[7] Lu Liu , Jie Xu, Duncan Russell, John K. Davies, David Webster, Zongyang Luo and Colin Venters, “Dynamic service integration for reliable and sustainable capability provision”, International Journal of Systems Science ,Volume 43, Issue 1, 2010.
[8] Philipp Leitner, Johannes Ferner, Waldemar Hummer and Schahram Dustdar, “Data-Driven and Automated prediction of service level agreement violations in service composition”, International Journal of Distributed and Parallel Databases, Volume 31, Issue 3, 2013.
[9] Yanhua Du , Wei Tan and MengChu Zhou , “Timed Compatibility analysis of Web service composition: A Modular Approach based on Petri Nets”, IEEE Transactions on Automation Science and Engineering, Volume: 11 Issue: 2, 2013.
[10] S.Tiroumalmouroughane,P.Thambidurai,”Identification of Business Policy violation in Service Integration of Long Term Composed Services” International Journal of Applied Engineering Research, Volume 10, 2015.
[11] Marcos Palacios , José García-Fanjul , Javier Tuya and George Spanoudakis, “Coverage-Based Testing for Service Level Agreements”, IEEE Transactions on Services Computing , Volume: 8 Issue: 2, 2015.
[12] Mariano Vargas-Santiago, Saul Pomares Hernndez, Luis, Morales-Rosales, Houda Khlif,Hatem Hadj-Kacem “Towards Dependable Web Services in Collaborative Environments Based on Fuzzy Non-functional Dependencies” 5th International Conference in Software Engineering Research and Innovation (CONISOFT),2017.
[13] Mirsaeid Hosseini Shirvani “Web Service Composition in multi-cloud environment: A bi-objective genetic optimization algorithm” Innovations in Intelligent Systems and Applications (INISTA), 2018.
Citation
G. Amirthayogam, C. Anbu Ananth, "A Survey on Business Policy Violation in Web Service Integration," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.147-151, 2019.
Cloning attack on a Proxy Blind Signature Scheme over Braid Groups
Review Paper | Journal Paper
Vol.7 , Issue.6 , pp.152-155, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.152155
Abstract
Proxy blind signature scheme is a combination proxy signature and blind signature scheme. Verma proposed a proxy blind signature scheme over braid groups and claimed that his scheme is secure against all possible security lapses and also satisfy all essential security attributes. This paper analyzes Verma’s proposed scheme and found that this scheme suffers with the serious security vulnerabilitie: cloning attack.
Key-Words / Index Term
Public Key Cryptography, Braid group, Public key, Private key, Digital signature, Proxy signature
References
[1] Boldyreva, A. Palacio and B. Warinschi, Secure proxy signature schemes for delegation of signing rights, available at http://eprint.iacr.org/2003/096.
[2] B. Lee, H. Kim, and K. Kim, Strong proxy signature and its applications, in the Proceedings of SCIS2001, pp. 603-608,2001.
[3] Cao. T., Lin. D., and Xue. R., Improved privacy-protecting proxy signature scheme, Proc. of AWCC’04 - Advanced Workshop on Content Computing, Chi-Hung Chi, and Kwok- Yan Lam (Eds.), Volume 3309 of LNCS, pp.208-213, Spring-Verlag,2004.
[4] D. Chaum, Blind signature systems, Proceedings of Crypto 83, pp. 153- 158, Springer Verlag, 1984.
[5] D. Chaum, A. Fiat, M. Naor, Untraceable electronic cash, Proceedings of Crypto 88, LNCS - 403, pp. 319-327, Springer Verlag, 1988.
[6] D. Hofheinz and R. Steinwandt, A practical attack on some Braid group based cryptographic primitives, in Public key Cryptography, PKC 2003 proc., LNCS - 2567, pp. 187-198, Springer Verlag 2002.
[7] D. Pointcheval and J. Stern, Probably secure blind signature schemes, Proc. Asiacrypt-96, LNCS - 1163, pp. 252-265, Springer Verlag, 1996.
[8] Dai. J., Yang. X., and Dong. J., A privacy-protecting proxy signature scheme and its application, Proc. of The 42nd annual Southeast regional conference, ACM Southeast Regional Conference, pp.203-206, 2004.
[9] E. A. Elrifai and H. R. Morton, Algorithms for positive braids, Quart. J. Math. Oxford 45 (1994), 479-497.
[10] E. Lee, S. J. Lee and S. G. Hahn, Pseudorandomness from braid groups, Advances in Cryptology, Proceedings of Crypto 2001, LNCS- 2139, ed. J. Kilian, Springer-Verlag (2001), 486- 502.
[11] Emil Artin, Theory of Braids, Annals of Math, 48, pp. 101- 126, 1947.
[12] F. A. Garside, The braid group and other groups, Quart. J. Math. Oxford 20 (1969), no. 78, 235-254.
[13] F. Zhang and K. Kim. ID-Based Blind Signature and Ring Signature from Pairings. In Proceedings of ASIACRYPT 2002, LNCS-2501, pp. 533-547, Springer-Verlag, 2002.
[14] F. Zhang and K. Kim. Efficient ID-Based Blind Signature and Proxy Signature. In Proceedings of ACISP 2003, LNCS 2727, pp. 312-323, Springer-Verlag, 2003.
[15] G. K. Verma, A proxy blind signature schemes over Braid groups, International Journal of Network Security, Vol.9, No.3, pp. 214 - 217, Nov. 2009.
[16] Guo. L.,Wang. G., and Bao. F., On the security of a threshold proxy signature scheme using self-certified public keys, Proc. Of CISC’05 - The SKLOIS conference on information security and cryptology, Higher Education Press of China. Dec. 15-17, 2005.
[17] J. C. Cha, K. H. Ko, S. J. Lee, J. W. Van and J. S. Cheon, An efficient implementation of Braid groups, Proc. Of Asiacrypt- 2001, LNCS -2248, pp. 144-156, Springer Verlag, 2001.
[18] J. S. Birman, Braids, links, and mapping class groups,Annals of Math, study 82, Princeton University Press (1974).
[19] J. S. Birman, K. H. Ko and S. J. Lee, A new approach to the word and conjugacy problem in the braid groups,Advances in Mathematics 139 (1998), 322-353.
[20] J. Zhang, T.Wei, J. Zhang andW. Zou. Linkability of a Blind Signature Scheme and Its Improved Scheme. In Proceedings of ICCSA 2006, LNCS 3983, pp. 262-270, Springer-Verlag, 2006.
[21] J. Zhang and W. Zou. Linkability of a Blind Signature Scheme. In Proceedings of ICICIC 2006, Vol. 1, pp. 468-471, IEEE, 2006.
[22] K. H. Ko, D. H. Choi, M. S. Cho and J. W. Han, New signature scheme using conjugacy problem, 2002, available at http://eprint.iacr.org/2002/168.
[23] K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J. S. Kang and C. S. Park, New public key cryptosystem using Braid groups, Proc. Crypto-2000, LNCS-1880, pp. 166- 183, Springer Verlag 2000.
[24] K. Manoj, Security analysis of a proxy signature scheme over Braid groups, Cryptology eprint archieve report, http://www.eprint.iacr.org/2009/158, 2009.
[25] K. Manoj, Linkability of Blind Signature Schemes over Braid Groups, Cryptology eprint archieve report, http://www.eprint.iacr.org/2009/192, 2009.
[26] K. Zhang, ”Threshold proxy signature schemes,” in the Proc of Information Security Workshop, Japan, pp. 191-197, 1997.
[27] L. Li., S.Tzeng, M. Hwang, : Generalization of proxy signature-based on discrete logarithms, Computers & Security, Vol. 22(3),pp.245-255, Elsevier Science, 2003.
[28] M. Abe and T. Okamoto. Provably Secure Partially Blind Signature. In Proceedings of CRYPTO 2000, LNCS 1880, pp.271-286, Springer-Verlag, 2000.
[29] Mambo. M., Usuda. K., and Okamoto. E., Proxy signatures for delegating signing operation, Proc. of 3rd ACM Conference on Computer and Communications Security, pp.48-57, ACM press, 1996.
[30] S. H. Nagore and M. R. Sekhar, Nonrepudiable threshold proxy signatures with tracebility property, Far East Journal of Applied Mathematics, Vol. 6(3), pp. 233-240, 2002.
[31] S. J. Kim, S. J. Park, D. H.Won, Proxy Signatures, revisited, in the Proceedings of ICICS’97, LNCS - 1334, pp. 223-232, Springer-Verlag.
[32] S. Kim, S. Park and D. Won, Proxy signatures: Revisited, in Y. Han, T. Okamoto, S. Quing, editors, Proceedings in InternationalConference on Information and CommunicationsSecurity (ICICS), of LNCS- 1334, pp 223-232, Springer Verlag, 1993.
[33] Sun. H., and Hsieh. B., On the security of some proxy signature schemes, Cryptology ePrint Archive: Report 2003/068, available at http://eprint.iacr.org/2003/068.
[34] Tan. Z., Liu. Z., andWang. M., On the security of some nonrepudiable threshold proxy signature schemes, Proc. of ISPEC’ 05 - First International Conference on Information SecurityPractice and Experience, Robert H. Deng, Feng Bao, Hwee- Hwa Pang, and Jianying Zhou (Eds.), Volume 3439 of LNCS, pp.374-385. Springer-Verlag, 2005.
[35] Wang. G., Bao. F., Zhou. J., and Deng. R.H., Comments on a Threshold Proxy Signature Scheme Based on the RSA Cryptosystem, Cryptology ePrint Archive: Report 2004/054, available at http://eprint.iacr.org/2004/054.
[36] Wang. G., Bao. F., Zhou. J., and Deng. R.H., Security analysis of some proxy signatures, Proc. of ICISC’03 - 6th International Conference on Information Security and Cryptography, Jong In Lim, and Dong Hoon Lee (Eds.), Volume 2971 of LNCS, pp.305-319, Springer-Verlag, 2003.
[37] Tan, Z., Liu, Z. and Tang, C. (2002), Digital proxy blind signature schemes based on DLP and ECDLP, in MM Research Preprints, No. 21, MMRC, AMSS, Academia, Sinica, Beijing, pp. 212-217.
[38] Z. Huang, K. Chen, Y. Wang. Efficient Identity-Based Signatures and Blind Signatures. In Proceedings of CANS 2005, LNCS 3574, pp. 120-133, Springer-Verlag, 2005.
Citation
Manoj Kumar, "Cloning attack on a Proxy Blind Signature Scheme over Braid Groups," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.152-155, 2019.
A Review on Ontology
Review Paper | Journal Paper
Vol.7 , Issue.6 , pp.156-159, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.156159
Abstract
Ontology and its role in different domain like Tourism, Agriculture, Music, Recommenders, industry 4.0, and big data is mostlyused in literature. With the growing structure of W3 among artificial intelligencetechnique web 2.0 replaced with semantic web. SPARQL, DL-Querywith their flavors are widely used in industry to retrieve information from the semantic web. Reasoning among the semantics are becoming popular in ontology. In this paper our main objective is to revision the various semantic web technology using ontology.
Key-Words / Index Term
Ontology, Web 2.0, Reasoning etc
References
[1] Haya Majid Qureshi, Maliha Qureshi, “Ontology Based Syndrome Diagnostic System” International Conference on Advancements in Computational Sciences (ICACS).
[2] Yutika Amelia Effendi, Riyanarto Sarno, “Implementationofthe Semantic Web inBusiness Process Modeling Using Petri Nets”, 2018 International Conference on Information and Communications Technology (ICOIACT) 978-1-5386-0954-5/18.
[3] Lina Nachabe et. al., “General Semantic System for Monitoring & Assisting Diabetes patient "MySmart Diabetes OntoREFerence" Ontology”, 2018 IEEE Middle East and North Africa Communications Conference, 978-1-5386-1254-5/18.
[4] Susana A Arias T et. al., “Human behavior ontologies: Surveillance Task”, 2018 13th Iberian Conference on Information Systems and Technologies (CISTI).
[5] Swati Tanwar et. al., “Towards blending semantics with an Education based Ontology using Protégé 5.2.0 A Revisit”, 2018 8th international conference on cloud computing and data science.
[6] Lixiao Feng, Guorong Chen, Chengyuan Chen, Liukui Chen, Jun Peng, “Ontology Fault Diagnosis Model for the Hazardous Chemical Storage Device”, Proc.2018IEEE17thInt’l Conf. onCognitive Informatics &Cognitive Computing (ICCI*CC’18) Y. Wang, S. Kwong, J. Feldman, N. Howard, P. Sheu & B. Widrow (Eds.) 978-1-5386-3360-1/18/$31.00 ©2018 IEEE.
[7] Taras Lendyuk et. al., “Ontology Application in Context of Mastering the Knowledge for Students”, IEEE CSIT 2018, 11-14 September, 2018, Lviv, Ukraine.
[8] G.Suganya et. al., “Ontology Based Information Extraction - A Review”, Proceeding of 2018 IEEE International Conference on Current Trends toward Converging Technologies, Coimbatore, India 978-1-5386-3702-9/18
[9] Benlaharche Keltoum et. al., “Towards a Reference Ontology in Islamic Finance and Banking”, 2018 International Conference on Information and Communication Technology for the Muslim World 978-1-5386-7525-0/18.
[10] Apon Saha et. al., “Mining Semantic Web Based Ontological Data”, 2018 21st International Conference of Computer and Information Technology (ICCIT), 978-1-5386-9242-4/18.
[11] Abeer Abdulaziz Alsanad, “A Domain Ontology for Software Requirements Change Management in Global Software Development Environment”, 2169-3536, 2019 IEEE. VOLUME 7, 2019.
[12] Chi-Han Du et. al., “Beyond Word-Level to Sentence-Level Sentiment Analysis for Financial Reports”, 978-1-5386-4658-8/18 ©2019 IEEE.
[13] M. F. Mridha et al., “An Approach for Detectionand Correctionof Missing Word in Bengali Sentence”, 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), 7-9 February, 2019, 978-1-5386-9111-3/19.
[14] Nusrath Tabassum et. al., “Design an Empirical Framework for Sentiment Analysis from Bangla Text using Machine Learning”, 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), 978-1-5386-9111-3/19 7-9 February, 2019.
[15] Monjoy Kumar Roy et. al., “Suffix Based Automated Parts of Speech Tagging for Bangla Language”, 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), 7-9 February, 2019, 978-1-5386-9111-3/19.
[16] Scott Denninget. al., “The Coefficient ofSynonymy”, 2019 IEEE 13thInternational Conference onSemantic Computing, 978-1-5386-6783-5/19.
[17] Yassine Benajiba et. al., “Siamese Networks for Semantic Pattern Similarity”, 2019 IEEE 13th International Conference on Semantic Computing (ICSC), 978-1-5386-6783-5/19.
[18] Enrique Noriega et al., “Extracting Inter-sentence Relations for Associating Biological Context with Events in Biomedical Texts”, 1545-5963 (c) 2018 IEEE
[19] Huaze Xie et. al, “Random Sampling and Inductive Ability Evaluation of Word Embedding in Medical Literature” Global Conference on Consumer Electronics(IEEE GCCE), pp.379-382, 2018.
[20] Shuoming Li et. al., “A Method of Emergent Event Evolution Reasoning Based on Ontology Cluster and Bayesian Network”, 2169-3536 2019 IEEE. VOLUME 7, 2019
Citation
Deepika, Dhiraj Khurana, "A Review on Ontology," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.156-159, 2019.
A Recommender System for YouTube Video based on deep neural network
Review Paper | Journal Paper
Vol.7 , Issue.6 , pp.160-163, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.160163
Abstract
YouTube is video sharing sites where a user can create own profile, upload videos and watch the multiple videos. The YouTube uses the recommender system. With the help of recommendation system we boost the popularity of videos. The recommendation is based on the relation between the number of views and the average number of views on particular videos. The recommendation also considers the likes and comment section. When the viewers view the same type of video then YouTube recommends the same type of video. The YouTube recommendation is based on machine learning technique. In machine learning we used the concept of the deep learning method. With the help of deep learning we solve the sophisticated problem. In this paper we see the working of deep neural network to recommend the video based on viewers.
Key-Words / Index Term
Boost, Sophisticated, Deep Learning
References
[1] M. Deshpande and G. Karypis, ”Item-based top-n recommendation algorithms”, ACM Trans. Inf. Syst., 22(1):143–177, 2004
[2] James Davidson,Benjamin Liebald,Junning Liu,Palash Nandy,Taylor Van Vleet, "The YouTube Video Recommendation System", January 2010.
[3] S. Huffman. Search evaluation at Google.http://googleblog.blogspot.com/2008/09/search-evaluation-at-google.html, 2008.
[4] Shuai Zhang,Lina Yao,Aixin Sun,Yi Tay, "Deep Learning based Recommender System: A Survey and NewPerspectives", ACM Comput. Surv. 1, 1, Article 1 (July 2018), 35 pages.
[5] Paul Covington, Jay Adams, Emre Sargin, ” Deep Neural Networks for YouTube Recommendations”, Boston, Massachusetts, USA — September 15 - 19, 2016
Citation
Rashmi Singh, Suhasini Vijaykumar, "A Recommender System for YouTube Video based on deep neural network," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.160-163, 2019.
Deep Learning through Convolutional Neural Networks for Classification of Image: A Novel Approach Using Hyper Filter
Research Paper | Journal Paper
Vol.7 , Issue.6 , pp.164-168, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.164168
Abstract
The convolutional neural networks (CNN) are artificial neural networks (ANN) having many similarities like layered architecture, neurons, activation function, and learning rate are some of them. There are some differences also like in CNN we can also deal with tensors which is the most distinguishing feature of CNN and these are just multidimensional 2D or 3D arrays. Another difference is layers in CNN are not same as in ANN. The common layers present in CNN are called as convolutional, relu and maxpool and these are generally connected sequentially so that the output of one layer acts as input to another layer. In the current article, the hybrid approach of filters or kernel is proposed and is giving better results in comparison to other kernel initializers like variance scaling normally used in CNN. The dataset used is CIFAR-100.
Key-Words / Index Term
Deep learning, Convolutional Neural Network, Image Classification, CIFAR-100,CIFAR-10
References
[1] Krizhevsky, A., Hinton, G., “Learning multiple layers of features from tiny images”, (2009).
[2] D. H. Hubel and T. N. Wiesel, “Receptive fields of single neurons in the cat’s striate cortex”, J. Physiol., vol. 148, no. 1, pp. 574–591, 1959.
[3] K. Fukushima, “Neocognitron: A self-organizing neural network model for a mechanism of pattern recog-nition unaffected by shift in position”, Biol. Cybern., vol. 36, no. 4, pp. 193–202, April, 1980.
[4] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recogni-tion,” Proc. IEEE, vol. 86, no. 11, pp. 2278–2324, Nov. 1998.
[5] C. B. Bishop, "Neural Networks for Pattern Recogni-tion", Oxford University Press, Oxford, 1995.
[6] Satish Kumar, "Neural Networks A Classroom Ap-proach", Tata McGraw Hill, 2013.
[7] https://keras.io
[8] D. E. Rumelhart, G.E. Hinton, R.J. Williams, "Learn-ing internal representation by error propagation", Paral-lel distributed processing: Explorations in the microstructure of cognition, Vol.1, Bradford books, Cambridge, MA, 1986.
[9] N. Rezazadeh, "Initialization of weights in deep belief neural network based on standard deviation of feature values in training data vectors", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.4, pp.1-8, 2017
[10] Kshitij Tripathi, Rajendra G. Vyas, Anil K. Gupta, “The Classification of Data: A Novel Artificial Neural Network (ANN) Approach through Exhaustive Validation and Weight Initialization”, International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.241-254, 2018.
[11] Mohammad Jafari, Neda Abdollahi, Ali Amiri, Mahmood Fathy, "Generalization of Determinant Ker-nels for Non-Square Matrix and its Application in Video Retrieval", International Journal of Scientific Research in Computer Science and Engineering, Vol.3, Issue.4, pp.1-6, 2015
[12] Yu Liu,Yanming Guo, Theodoros Georgiou, Mi-chael S. Lew, “Fusion that matters: convolutional fusion networks for visual recognition”, Multimedia Tools Appl, 2018.
[13] Yanming Guo, Yu Liu, Erwin M. Bakker
Yuanhao Guo, Michael S. Lew, “CNN-RNN: a large-scale hierarchical image classification framework”, Multimed Tools Appl, 2018.
[14] Yi Zhou, Yue Bai, Shuvra S. Bhattacharyya and Heikki Huttunen," Elastic Neural Networks for Classifi-cation", arXiv, 2019
[15] Yanping Huang, Youlong Cheng, Dehao Chen, HyoukJoong Lee, Jiquan Ngiam, Quoc V. Le and Zhif-eng Chen,"GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism", arXiv, 2018.
Citation
Kshitij Tripathi, Rajendra G. Vyas, Anil K. Gupta, "Deep Learning through Convolutional Neural Networks for Classification of Image: A Novel Approach Using Hyper Filter," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.164-168, 2019.
A Survey on Load Balancing Algorithms in Cloud Computing
Survey Paper | Journal Paper
Vol.7 , Issue.6 , pp.169-176, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.169176
Abstract
Cloud computing mainly does not focus on local resource instead; it uses shared computing resources applications or resources. It has emerged as a new type of computing for accessing present network, managing computer resources and managing distributed computing across the network in order to achieve high degree of precision and reliability various challenges needs to be addressed. One of the challenges in cloud computing is load balancing. Load balancing is important due to the fact that it allows achieving balance in the load by distributing it across the system to all its nodes. Cloud environment allows various ways to achieve load balancing. This includes managing the load on CPU, network load and the load capacity of storage. The greatest impact of balancing the load in cloud computing environment is that it has higher satisfaction of the users as well as it utilizes the resources efficiently. Proper load balancing support substantial improvement of the system, building a fault tolerant system by creating backup and increase flexibility of the system so that it adapts the modification. In cloud computing, there are various algorithms to achieve load balancing and these algorithms behave differently with its some advantages and disadvantages. In this paper we present a study on the different load balancing algorithms in cloud computing environment and analyze the results based on make span metrics. The results of the experiments depict the efficiency of Round Robin, Shortest Job First, Ant Colony Optimization and Honey Bee load balancing algorithm in terms of make span and we find that Honey Bee load balancing algorithm give the best results among the other load balancing algorithms.
Key-Words / Index Term
Cloud computing; Load balancing; Static Load balancing; Dynamic Load balancing; Algorithms; Load balancer; Load balancing metrics
References
[1] Borja Sotomayor, Ruben S. Montero, Ignacio M. Llorente, and Ian Foster, “An Open Source Solution for Virtual Infrastructure Management in Private and Hybrid Clouds”, IEEE Internet Computing, July, 2009.
[2] Shridhar G.Domanal and G.Ram Mohana Reddy,“Load Balancing in Cloud Computing Using Modified Throttled Algorithm “, 2013 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM).
[3] SuchitaKhare, Asst. Prof. Shatendra Dubey, “An Efficient Load Balancing in Public Cloud using Priority based SJF Scheduling”, International Journal of Scientific & Engineering Research, Volume 6, Issue 4, April-2015 1834
[4] Medhat A. Tawfeek, Ashraf E1-SiSi,Arnabi E.KeshK,Fawzy A.Torkey,”Cloud Task Scheduling Based on Ant Colony Optimization”.978-1-4799-0080-0/13@2013 IEEE.
[5] Zhang Z. and Zhang X. “A Load Balancing Mechanism Based on Ant Colony and Complex Network Theory in Open Cloud Computing Federation”, 2nd International Conference on Industrial Mechatronics and Automation, 240-243, 2010
[6] Dhinesh B. L.D , P. V. Krishna, “Honey bee behavior inspired load balancing of tasks in cloud computing environments”, in proc. Applied Soft Computing, volume 13, Issue 5, May 2013.
[7] Sushil Kumar, Deepak Singh Rana and Sushil Chandra Dimri, “Fault Tolerance and Load Balancing algorithm in Cloud Computing: A survey”, International Journal of Advanced Research in Computer and Communication Engineering, July 2015.
[8] Pandey, Suraj, Linlin Wu, SiddeswaraMayura Guru, and Rajkumar Buyya. "A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments." In Advanced Information Networking and Applications (AINA), 2010 24th IEEE International Conference on, pp. 400-407. IEEE, 2010.
[9] Nishant, K. P. Sharma, V. Krishna, C. Gupta, KP. Singh, N. Nitin and R. Rastogi, "Load Balancing of Nodes in Cloud Using Ant Colony Optimization." In proc. 14th International Conference on Computer Modelling and Simulation (UKSim), IEEE, pp: 3-8, March 2012.
[10] Dharmesh Kashyap, Jaydeep Viradiya, “A Survey of Various Load Balancing Algorithms In Cloud Computing”, International Journal of Scientific & Technology Research, Vol. 3, Issue 11, November 2014
[11] Ganesh, Amal, M. Sandhya, and Sharmila Shankar. "A study on fault tolerance methods in Cloud Computing." In Advance Computing Conference (IACC), 2014 IEEE International, pp. 844-849. IEEE, 2014.
[12] Rajani Sajjan,” Load Balancing and its Algorithms in Cloud Computing: A Survey”, JCSE International Journal of Computer Sciences and Engineering, Volume-5, January 2017.
[13] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A.Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “Above the Clouds: A Berkeley View of Cloud Computing”, EECS Department, University of California, Berkeley, Technical Report No., UCB/EECS-2009-28, pages 1-23, February 2009.
[14] Martina Poulose, M. Azath, “A Study of Load Balancing Techniques in Cloud”, Vol3, Issue 1 IJCSE, 2015.
[15] Nidhi Jain Kansal, Inderveer Chana, “Cloud Computing Techniques: A Step Towards green Computing”,IJCSI,Vol. 9, Issue 1, January 2012.
[16] A. Bhadani, and S. Chaudhary, “Performance evaluation of web servers using central load balancing policy over virtual machines on cloud”, Proceedings of the Third Annual ACM Bangalore Conference (COMPUTE), January 2010.
[17] G. Pallis, “Cloud Computing: The New Frontier of Internet Computing”, IEEE Journal of Internet Computing, Vol. 14, No. 5, September/October 2010, pages 70-73.
[18] Q. Zhang, L. Cheng, and R. Boutaba, “Cloud computing: state-of-the-art and research challenges”, Journal of Internet Services and Applications, Vol. 1, No. 1, April 2010, pages 7-18.
[19] R. Mata-Toledo, and P. Gupta, “Green data center: how green can we perform”, Journal of Technology Research, Academic and Business Research Institute, Vol. 2, No. 1, May 2010, pages 1-8.
[20] B. P. Rima, E. Choi, and I. Lumb, “A Taxonomy and Survey of Cloud Computing Systems”, Proceedings of 5th IEEE International Joint Conference on INC, IMS and IDC, Seoul, Korea, August 2009, pages 44-51.
[21] J. Baliga, R. W. A. Ayre, K. Hinton, and R. S. Tucker, “Green Cloud Computing: Balancing Energy in Processing, Storage, and Transport”, Proceedings of the IEEE, Vol. 99, No. 1, January 2011, pages 149-167.
[22] Ishfaq Ahmad, Arif Ghafoor, “Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems”, 1991.
[23] David Escalnte and Andrew J. Korty, “Cloud Services: Policy and Assessment”, EDUCAUSE Review, Vol. 46, July/August 2011.
[24] Parin. V. Patel, Hitesh. D. Patel, Pinal. J. Patel, “A Survey on Load Balancing in Cloud Computing” IJERT, Vol. 1, Issue 9, November 2012.
[25] Ali M Alakeel, “A Guide to Dynamic Load Balancing in Distributed Computer Systems”, International Journal of Computer Science and Network Security, Vol. 10 No. 6, June 2010.
[26] [26] Ram Prasad Padhey, P. Goutam Prasad Rao, “Load Balancing in Cloud Computing Systems”, Department of Computer Science and Engineering, National Institute of Technology, May 2011.
[27] Abhijit A Rajguru, S.S. Apte, “A Comparative Performance Analysis of Load Balancing Algorithms In Distributed Systems Using Qualitative Parameters”, International Journal of Recent Technology and Engineering, Vol. 1, Issue 3, August 2012.
[28] Aarti Vig, Rajendra Singh Kushwah and Shivpratap Singh Kushwah, “An Efficient distributed Approach for Load Balancing in Cloud Computing”, 2015 International Conference on Computational Intelligence and Communication Networks.
[29] Rodrigo N. Calheiros, Rajiv Ranjan, Anton Beloglazov, Cesar A. F. De Rose and Rajkumar Buyya, “CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms”, Software practice and experience, August, 2010.
[30] Meenakshi Sharma, Anitha Y, Pankaj Sharma, “An Optimistic Approach for Load Balancing in Cloud Computing”, IJCSE, Vol 2 Issue 3, 2014.
Citation
Priyanka Sarma, Chandan Kalita, Vaskar Deka, "A Survey on Load Balancing Algorithms in Cloud Computing," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.169-176, 2019.
Modeling and Simulation of Fighter Aircraft Refueling Probe Hydraulic System Using AMESim Software
Research Paper | Journal Paper
Vol.7 , Issue.6 , pp.177-181, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.177181
Abstract
This paper presents the work carried out in the modeling and simulation of fighter aircraft refueling probe hydraulic system with Advanced Modeling Environment for performing Simulations of engineering systems (AMESim) as the basic platform. Various component models like axial piston pump, accumulator, bootstrap reservoir and actuators along with the influence of engine speed are modeled and integrated in the AMESim. Air to air refueling consists in transferring fuel from one aircraft to another during flight. The inputs for simulation are; engine speed, refueling actuation command, flaperon command, rudder command and other flight control surface command which are obtained from tests conducted on hydraulic system test rig for a fighter aircraft. Simulation is carried out to identify the system behaviour.
Key-Words / Index Term
AMESim, Refueling, Fighter Aircraft, Axial Piston Pump, Flight Control Surface.
References
[1] A. Joshi, “Modeling and simulation of aircraft hydraulic system”, AIAA Modeling and Simulation Technologies Conference and Exhibit, 5-8 August 2002, Monterey, California.
[2] Aviation Maintenance Technician Handbook – Airframe, “Chapter no.12 Hydraulic and Pneumatic power systems,”FAA-H-8083-3.
[3] S. Miyashita, S. Zhang and K. Sanada, “A study on a mathematical model of gas in Accumulator using Vander Waalse equation”, SICFP’ 17, June 7-9, 2017, Linkoping Sweden.
[4] V. Mishra and S. Chandel, “Modeling & parameterization of Directional Control Valves using Matlab-Simulink/Sim Hydraulics”, IJETSR, ISSN 2394 – 3386, Volume 5, Issue 3, March 2018.
[5] D. Wen-Si and W. Hui-yan, “Modeling and Simulation on Light Axial Piston Pump”, ISSN: 1662-7482, Vols. 34-35, 2010-10-25.
[6] J.Aaltonen, “Interaction of Bootstrap Reservoir and Hydraulic Pump in Aircraft Hydraulic systems”, ISSN 1459-2045 Tampere University of Technology, 2016.
[7] J. Aaltonen, K. Koskinen, M. Vilenius, “hydraulic fluid quality in aircraft hydraulic systems”, SICFP’07, May 21-23, 2007, Tampere, Finland.
[8] N. Fezans and T. Jann, “Modeling and Simulation for the Automation of Aerial Refueling of Military Transport Aircraft with the Probe-and-Drogue System, AIAA AVIATION Forum 5-9 June 2017, Denver, Colorado.
Citation
Pratik Patil, Prabhakar Maskar, Sanjay Vispute, Ohmkar Akhilesham, "Modeling and Simulation of Fighter Aircraft Refueling Probe Hydraulic System Using AMESim Software," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.177-181, 2019.
Novel Approach to Multi Constraints Reactive Multicast Routing Protocol for MANET
Survey Paper | Journal Paper
Vol.7 , Issue.6 , pp.182-187, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.182187
Abstract
Mobile Ad Hoc Network (MANET) is a widespread research area, where the protocols face challenges due to its dynamic network topology. The adaptive network is an emerging technology that draws attraction as it is cheaper, concise and powerful. In applications where sharing of information is essential, MANET uses multicast routing protocols, as it is easily deployable. The paper describes various system models (like energy model, LLT model, mobility model etc.) related to MANET. The objective of this paper is to introduce multicast routing in MANET with the aid of tree-based clustering and optimization by proposing Cuckoo Search (CS) and M-Tree based Multicast Ad hoc On-demand Distance Vector (CS-MAODV).
Key-Words / Index Term
Multicast Routing, MANET, Cuckoo Search
References
[1] R. Velmani and B. Kaarthick, “An Efficient Cluster-Tree Based Data Collection Scheme for Large Mobile Wireless Sensor Networks”, IEEE Sensors Journal, vol. 15, no. 4, pp. 2377 – 2390, 2015.
[2] Yun-Sheng Yen, Yi-Kung Chan, Han-Chieh Cha and Jong Hyuk Park, “A genetic algorithm for energy-efficient based multicast routing on MANETs”, Computer Communications, vol. 31, no. 4, pp. 2632–2641, 2008.
[3] Chia-Cheng Hu, “Bandwidth-satisfied multicast trees in large-scale ad-hoc networks”, Wireless Networks, vol. 16, no. 3, pp. 829-849, 2010.
[4] Shiow-Fen Hwang, Yi-Yu Su, Kun-Hsien Lu and Chyi-Ren Dow, “A Cluster-Based Approach for Efficient Multi-Source Multicasting in MANETs”, Wireless Personal Communication, vol. 57, no. 2, pp. 255–275, 2011.
[5] Moonseong Kim, Hyunseung Choo and Matt W.Mutka, “On QoS multicast routing algorithms using k-minimum Steiner trees”, Information Sciences, vol. 238, pp. 190–204, 2013.
[6] Xu Li, Tianjiaot Li, Yingt Li and Van Tang, “Optimized Multicast Routing Algorithm Based on Tree Structure in MANETs”, China Communications, vol. 11, no. 2, pp. 90-99, 2014.
[7] Vincenzo Maniscalco, Silvana Greco Polito and Antonio Intagliata, “Binary and m-ary encoding in applications of tree-based genetic algorithms for QoS routing”, Soft Computing, vol. 18, no. 9, pp. 1705-1714, 2014.
[8] N. C. Wang, “Power-aware dual-tree-based multicast routing protocol for mobile ad hoc networks”, IET Communication, vol. 6, no. 7, pp. 724–732, 2012.
[9] Ajay Kumar Yadav and Sachin Tripathi, “QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs”, Peer-to-Peer Networking and Application, pp. 1-13, 2016.
[10] Kong Sun and Chen Zeng qiang, “Tree-based differential evolution algorithm for QoS multicast routing”, The Journal of China Universities of Posts and Telecommunications, vol. 18, no. 4, pp. 76–81, 2011.
[11] Hu Wang, Xiangxu Meng, Shuai Li and Hong Xu, “A tree-based particle swarm optimization for multicast routing”, Computer Networks, vol. 54, no. 15, pp. 775-786, 2010.
[12] I-Ta Lee, Guann-Long Chiou and Shun-Ren Yang, “A cooperative multicast routing protocol for mobile ad hoc networks”, Computer Networks, vol. 55, no. 10, pp. 407-424, 2011.
[13] Rajashekhar Biradar, Sunilkumar Manvi and Mylara Reddy, “Link stability based multicast routing scheme in MANET”, Computer Networks, vol. 54, no. 7, pp. 1183-1196, 2010.
[14] Rajashekhar C. Biradar and Sunilkumar S. Manvi, “Review of multicast routing mechanisms in mobile ad hoc networks”, Journal of Network and Computer Applications, vol. 35, no. 1, pp. 221-239, 2012.
[15] Ahmed Younes, “Multicast routing with bandwidth and delay constraints based on genetic algorithms”, Egyptian Informatics Journal, vol. 12, no. 2, pp. 107-114, 2011.
[16] Kumar Viswanath, Katia Obraczka and Gene Tsudik, “Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs”, IEEE Transactions on Mobile Computing, vol. 5, no. 1, pp. 28-42, 2006.
[17] Sung Ju Lee, William Su and Mario Gerla, “On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks”, Mobile Networks and Applications, vol. 7, no. 6, pp. 441–453, 2002.
[18] Mohammad M. Qabajeh, Aisha H. Abdalla, Othman Khalifa and Liana K. Qabajeh, “A Tree-based QoS Multicast Routing Protocol for MANETs”, In proceedings of IEEE 4th International Conference on Mechatronics (ICOM), pp. 17-19, 2011.
[19] Chang Yeong Oh, Jongho Park and Jihyoung Ahn, “Tree-based Multicast Protocol using Multi-point Relays for Mobile Ad Hoc Networks”, In proceedings of IEEE 2011 Third International Conference on Ubiquitous and Future Networks (ICUFN), pp. 174-178, 2011.
[20] Hasan Abdulwahid, Bin Dai, Benxiong Huang and Zijing Chen, “Scheduled-Links Multicast Routing Protocol in MANETs”, Journal of Network and Computer Applications, vol. 63, pp. 56-67, 2015.
[21] Mohammad Reza Effat Parvar, Mehdi EffatParvar, and Mahmoud Fathy, “Improvement of on Demand Multicast Routing Protocol in Ad Hoc Networks to Achieve Good Scalability and Reliability”, Lecture Notes in Computer Science, vol. 5073, pp. 446–457, 2008.
[22] Xin-She Yang, Suash Deb, "Engineering Optimisation by Cuckoo Search", Int. J. Mathematical Modelling and Numerical Optimisation, Vol. 1, No.4, pp. 330-343, 2010.
[23] Satish Chander, P. Vijaya, Praveen Dhyani, “Fractional Lion Algorithm – An Optimization Algorithm for Data Clustering”, Journal of Computer Science, Vol. 12, no. 7, pp. 323-340, 2016.
[24] Mamatha Balachandra, K. V. Prema, Krishnamoorthy Makkithay, " Multi constrained and multipath QoS aware routing protocol for MANETs", Wireless Networks, Vol. 20, no. 8, pp. 2395-2408, November 2014.
[25] P Yadhav, “Dimensionality Reduction of Weighted Word Affinity Graph using Firefly Optimization”, International Journal of Engineering Research & Technology, Vol. 3, no. 10, pp. 1324-1327, 2014.
[26] Dr. Javad Akbari Torkestani and Mohammad Reza Meybodi, “Multicast routing protocols in MANET”
Citation
D. Madhu Babu, M. Ussenaiah, "Novel Approach to Multi Constraints Reactive Multicast Routing Protocol for MANET," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.182-187, 2019.
Detection and Recovery of Economic Losses in Sales Person Based Pharmaceutical Bussiness
Review Paper | Journal Paper
Vol.7 , Issue.6 , pp.188-190, Jun-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i6.188190
Abstract
It will explore the current supply chain trend which is in the pharmaceutical industry. It’s important objective was to characterize the pharmaceutical industry and it will identify the proper supply chain practice. As we know that The pharmaceutical industry will not be renowned for its supply chain management abilities but on the other hand many other high publicized industries they do have profitably exploit their proper supply chain. It is a interesting topic for particular research. Let’s take a look . we are going to argue that an excellent supply chain is paramount to the pharmaceutical industry boom. This particular business objective of the pharma industry including there was a need so that to be ensure that we have the drugs are protected from adulteration and counterfeiting, remove and it will destroy in the safe and environmental friendly manner. We see that Clearly and they are not at all commonly use metrics so that it assess the major performance of a particular company or a particular supply chain.
Key-Words / Index Term
pharma industry, money flow, money , money loss , money recovery
References
[1]. Abbott Laboratories. 1994-2004. 10-K Forms for Securities and Exchange Commission. http://www.secinfo.com/dRqWm.45Sx.htm, accessed March, 2010.
[2]. AstraZeneca International. 1999-2004. Annual Reports. http://www.astrazeneca.com/investors/annual-reports/, accessed April, 2010.
[3]. Bausch & Lomb Inc. 1994-2004. 10-K Forms for Securities and Exchange Commission. http://www.secinfo.com/$/SEC/Documents.asp?CIK=10427&Party=BFO&Type=10K&Label=Annual+Reports+%2D%2D+Form+10%2DK, accessed March, 2010.
[4]. Bowe, Christopher, and Demetri Sevastopulo. 2004. “Senators unite on bill for cheaper medicines.” Financial Times (UK edition). April 22: p. 8
[5]. Bowe, Christopher. 2004b. “States warm to reimport of drugs in US.” Financial Times (UK edition). August 23: p. 6
[6].Bristol-Myers Squibb Co. 1994-2004. 10-K Forms for Securities and Exchange Commission. http://www.secinfo.com/$/SEC/Documents.asp?CIK=14272&Party=BFO&Type=10K&Label=Annual+Reports+%2D%2D+Form+10%2DK, accessed March, 2010.
[7]. Chiron Corp. 1995-2004. 10-K Forms for Securities and Exchange Commission. http://www.secinfo.com/$/SEC/Documents.asp?CIK=706539&Party=BFO&Type=10K&Label=Annual+Reports+%2D%2D+Form+10%2DK, accessed March, 2010.
[8]. Cytogen Corp. 1995-2004. 10-K Forms for Securities and Exchange Commission. http://www.secinfo.com/$/SEC/Documents.asp?CIK=725058&Party=BFO&Type=10K&Label=Annual+Reports+%2D%2D+Form+10%2DK, accessed March, 2
Citation
Nikhil Bhardwaj, Shubham Jaiswal, Ananya Singh, S.B Nikam, "Detection and Recovery of Economic Losses in Sales Person Based Pharmaceutical Bussiness," International Journal of Computer Sciences and Engineering, Vol.7, Issue.6, pp.188-190, 2019.