Volume-4 , Issue-2 , Feb - 2016 Go Back

According to importance the energy consumption in wireless sensor networks, aim of this research is presenting a method to efficient energy consumption in wireless sensor networks. The proposed protocol is based on the basic protocol of topology control with dynamic weight regarding the status of neighbor nodes. Each sensor node has been found its single-stage neighbor, in the first round; it creates graphs and routing using the topology control and only by the distance parameter. In the next periods, regarding the differences in the residual energy of nodes and their load traffic in the previous round, using the fuzzy inference system and applied fuzzy rules and by applying the parameters of residual energy, traffic load and distance, will be performed for selection the connectivity node. The proposed idea is that the degree of any node is not more than 4. One advantage of an efficient protocol in topology management is having the number of optimal neighbor. As the number of connected neighboring nodes is less and more optimized, work efficiency is higher. Due to balancing the energy consumption in all network nodes, the network lifetime, which is the most important concern of wireless sensor networks, is increased. Simulation results show that the proposed algorithm compared with baseline algorithms has better efficiency and performance.

Wireless Sensor Network, Topology Control, Energy, Fuzzy logic

[1] Blough, Douglas M, Mauro Leoncini, Giovanni Resta, and Paolo Santi, “The k-neigh protocol for symmetric topology control in ad hoc networks", InProceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, , 2003, pp. 141-152.
[2] Chen, G. Q, “Fuzzy Logic in Data Modeling, Semantics, Constraints, and Database Design”, Kluwer Academic Publisher., 1999.
[3] Ecole No, Des Sci. de 1' Informatiques (ENCI), Tunis, Tunisia, Ghabri , A.,Bellalouna,. A Priori methods for fiult tolerance in Wireless Sensor Networks, Computer and Information Technology (WCCIT) ,t2013.
[4] Er. SSaurabh, , July,Dr. Rinkle Rani Aggarwal A Review of Fault Detection Techniques for Wireless Sensor Networks IJCSI International Journal of Computer Science Issues, Vol. 10, Issue 4, no 1, 2013.
[5] Frye, L., & Cheng, L. Topology management for wireless sensor networks. In Guide to Wireless Sensor Networks Springer London.2009, pp. 27-45.
[6] F. G' omez M' armol, and G. Mart' mez P' erez, " Providing Trust in Wireless Sensor Networks Using a Bio-inspired Tecjnique", Proc. of the Networking and Electronic commerce Research Conference, 2008, PP.312-321.
[7] Kang, S. H., & Nguyen ,T. Distance based thresholds for cluster head selection in wireless sensor networks. Communications Letters, IEEE, 16(9). 2012, pp: 1396-1399.
[8] M. A.Razzaque, C. S. Hong, and S. Lee ,Jan, "Data-Centric Multiobjective Qos-Aware Routing Protocol for Body Sensor Networks", sensors, vol. 11, no.1, 2011 PP.917-937.
[9] Amandeep Kaur and Rajneesh Kumar Gujral, "Distributed Clustering Based Data Aggregation Algorithm for Grid Based WSN", International Journal of Computer Sciences and Engineering, Volume-03, Issue-12, Page No (61-66), Dec -2015.
[10] Noori, M., & Khoshtarash, A.BSDCH: new chain routing protocol with best selection double cluster head in wireless sensor networks. Wireless Sensor Network, 5, 9. 2013.
[11] Niewiadomska-Szynkiewicz, Ewa, Piotr Kwaśniewski, and Izabela Windyga, "Comparative study of wireless sensor networks energy-efficient topologies and power save protocols". Journal of Telecommunications and information technology. 2009, pp.68-75.
[12] Rahul Goyal, Student Department of Computer Engineering A REVIEW ON ENERGY EFFICIENT CLUSTERING ROUTING PROTOCOL IN WIRELESS SENSOR NETWORK, 2014.
[13] Sun, Ruozi, Jian Yuan, Ilsun You, Xiuming Shan, and Yong Ren,"Energy-aware weighted graph based dynamic topology control algorithm". Simulation Modelling Practice and Theory 19, no. 8 , 2011, pp: 1773-1781.
[14] Verma S., Sharma K,-Energy Efficient Zone Divided and Energy, "Balanced Clustering Routing Protocol EEZECR in Wireless Sensor Network', 'internatonial ournal of Circuits and System jan, 2014.
[15] Xiaowen Gongm Junshan Zhang, Douglas Cochran, Kai Xing, "Barrier Coverage in BistaticRadar Sensor Networks: Cassini Oval sensing and Optimal Placement ", MobiHoc Conference, 2013.
[16] Xu, Ning, et a,l. "Coverage and connectivity guaranteed topology control algorithm for cluster based wireless sensor networks". Wireless Communications and Mobile Computing 12.1, 2010, pp: 23-32
[17] Y.-chung Fan, A. L. P. Chen, S. Member, and I. C. Society,"Efficient and Rubust Schemes for Sensor Data Aggregation Based on Linear Counting", IEEE Trans, on Parallel and distributed systems, vol. 21,no.11, 2010, PP. 1675-1691.
[18] Zheng, J., & Jamalipour, A. "Wireless sensor networks": a networking perspective. John. 2009, Wiley & Sons.
[19] Bao, Lichun, and J. J. Garcia-Luna-Aceves. "Stable energy-aware topology management in ad hoc networks". Ad Hoc Networks 8.3 , 2010, 313-327.
[20] Bhattacharya, D., & Krishnamoorthy, R. Power Optimization in Wireless Sensor Networks. International Journal of Computer Science Issues (IJCSI), 8(5), 2011.

Hassan javedan and Gholamreza Shahmohammadi, "Presenting a Method for Efficient Energy Consumption in Wireless Sensor Networks Using the Topology control and Fuzzy Systems," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.1-12, 2016.

The objective of this study is to cluster 40 different departments at the Adnan Menderes University Hospital according to some variables. The data used in the study was obtained from the 2014 statistics of the Adnan Menderes University. Among the hierarchical clustering approaches, complete link method was used as the study attempted to determine the way of merging or partitioning of clusters. The study determined that all independent variables had a significant effect in clustering as the result of the ANOVA test which was done for clustering purpose. Chi-square means and discriminant analysis method was used in order to provide evidence on the validity of the cluster results obtained in the analysis. The results of the study were discussed in two stages. The first stage included the analysis of all 40 units while variables of relevant expense, package loss and SGK deduction were evaluated. The second stage included the analysis of 37 units while the variables of expense, lecturer, assistant, nurse, number of personnel, number of polyclinic rooms, polyclinic area, number of service beds and service area were evaluated. Upon the analysis in the first stage, it was determined the units were gathered under 5 clusters. The analysis showed that both the orthopaedics and oncology units were a cluster on their own while the units of hematology and brain surgery were included in the same cluster. The fourth clusters consist of the units of Cardiovascular Surgery, General Surgery, Emergency and Cardiology while the fifth cluster consists of the all other units. As a result of the analysis in the second stage, it was observed that the number of clusters and units within clusters didn’t vary. In order to determine the validity of the results of the study, it was determined that the number of clusters obtained by calculating Wilk’s lambda coefficient was the same with the number of clusters determined by the complete link method. According to the findings obtained in the study, it was determined that the units with highest expenses made a single unit and it is believed that the expenses of both units were significantly different from other units.

Clustering, discriminant analysis, ANOVA, hospital, clinics

[1] Mannila, H. Data mining: Machine learning, statistics, anddatabases. Proc. Of the 8th International Conference on Scientificand Statistical Database Management, 1996, 1-6
[2] Fayyad, U. M., G. Piatetsky-Shapiro, and P. Smyth. Fromdataminingtoknowledge discovery in databases. AI Magazine,1996, 37-54.
[3] Yünel Y. K-means Kümeleme Algoritmasının Genetik Algoritma Kullanılarak Geliştirilmesi, p. 1-2.Zeytinoğlu, F. Ç. (2014) Kümeleme Analizi: Kültür İstatistiklerine Göre İllerin Sınıflandırılmasına Yönelik Bir Çalışma, İstanbul Ticaret Üniversitesi Sosyal Bilimleri Dergisi,2010, 13 (25), 301-320.
[4] Çokluk, Ö, Şekercioğlu, G. ve Büyüköztürk, Ş. Sosyal Bilimler İçin Çok Değişkenli İstatistik SPSS ve Lisrel Uygulamaları, 2014,Ankara: Pegem Akademi.
[5] Kaya, V. ve Türkmen, A. Küresel Krizin Üst Orta Gelir Gurubu Ülkelere Makro Ekonomik Yansımaları, Atatürk Üniversitesi İktisadi ve İdari Bilimler Dergisi, 2013, 27 (4), 317-338
[6] Neil, T.H. AppliedMultivariate Analysis,Springer-Verlag, New York, 2002
[7] Kalaycı, Ş. SPSS Uygulamalı Çok Değişkenli İstatistik, Ankara: Asil Yayın Dağıtım, 2014
[8] Alpar, R. Uygulamalı Çok Değişkenli İstatistiksel Yöntemler, Ankara: Detay Yayıncılık, 2011
[9] Duran, B.S. ve Odell, P.L. Cluster analysis: lecturenotes in economicsandmathematicalsystems, Econometrics. New York: Springer-Verlag.1974
[10] Aldenderfer, M. S. ve Blashfield, R. K. Cluster Analysis, Beverly Hills: SagePublications, 1984
[11] Zeytinoglu, I. U.,Denton, M., Davies, S., Baumann, A., Blyte, J. ve Boos, L.Retainingnurses in theirhospitalsand in theprofession: Effects of jobpreference, unpaidovertime, importance of earningsandstress. HealthPolicy, 2006,79, 57-72.
[12] Gürsoy, U.T. ve Şimşek, G. Veri Madenciliği ve Bilgi Keşfi. Ankara: PegemAkademi, 2009
[13] Anderberg, M. R. Cluster Analysis forapplications, New York: AcademicPress, 1973
[14] Özdamar, K. Paket Programlar ile İstatistiksel Veri Analizi. Eskişehir: Kaan Kitabevi, 2004
[15] Milligan, G. W. ve Cooper, M. C. A Study of theComparability of ExternalCriteriaforHierarchical Cluster Analysis,MultivariateBehavioralResearch, 1986, 21,441-458.
[16] Tatlıdil, H. Uygulamalı Çok Değişkenli İstatistiksel Analiz, H.Ü. Fen Fakültesi İstatistik Bölümü, Ankara, 1992
[17] Mardia, K. V., Kent, J. T. ve Bibby, J. M. Multivariate Analysis, London: AcademicPress, 1989.
[18] Çakmak, Z. Kümeleme Analizinde Geçerlik Problemi ve Kümeleme Sonuçlarının Değerlendirilmesi, Dumlupınar Üniversitesi Sosyal Bilimler Dergisi, 1999,3, 187- 205.
[19] Aslan, Ş., Özata, M. ve Atayeter, C. Sağlık İşletmelerinde Ekip yönetimi: Fırsatlar ve Sınırlılıklar,Standard Ekonomik ve Teknik Dergi,2004, 43 (516), 17-23.
[20] Frawley, W.J. Piatetsky-Shapiro, G. Matheus, C.J. Knowledge discovery in databases, AAAI/MIT Press, 1991, pp. 1–27
[21] Larose, D. T. k-NearestNeighborAlgorithmknowledge in Data: An Introduction to DataMining, ABD: Wiley Online Library, 2005
[22] Weiss, S. M.andKulikowski, C. A. Computersystemsthatlearn. San Mateo, CA: Morgan Kaufmann,1991
[23] Poulsen, J. ve French, A. Discriminantfunctionanalysis (DA).Retrieved August152015, fromhttp://userwww.sfsu.edu/efc/classes/biol710/discrim/discrim.pdf, 2003
[24] Aaker,D. A, Kumar, V. andDay, S. G. Marketing Research, Fifth Edition, Canada, John WileySons, Inc. 1997.
[25] Klecka, W. Discriminant Analysis. London: Sage Publications, 1980.
[26] Djomou, Z. Y.,Monkam, D. ve Woafo, P. Variabilityandtrends of local/regional scale surface climate in northern Af ricaduring the twentieth century, Theoretical and Applied Climatolog, 2013,117, 625-641.

Özel Sebetci and GökhanAksu, "Clustering Analysis of the Departments of Medical Faculty Hospitals Based on Some Variables: Adnan Menderes University," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.13-21, 2016.

Healthcare is one of the essential services required by all, technological developments in recent years have enhanced the way we receive the service. Researches show that a decentralized healthcare provision is what is required to improve quality and reduce cost. Providing healthcare at home is one way of healthcare decentralization. Home Healthcare (HHC) is gaining popularity as more and more patients prefer to receive the care in the comfort of their homes. Providing care at home requires many professionals, organizations and agencies to collaborate and work together. In this paper we apply the concept of Virtual Organization (VO) to HHC as a framework for managing the collaboration of different participants of HHC. To visualize how the VO concept may facilitate the management of possible collaboration, in this paper, we use UML use case and sequence diagram notations to model the structural and behavioral aspect VO of a HHC case study. We later evaluate the suitability of UML model in modeling VO for HHC. Our evaluation show that using the UML standard notations all aspects of HHC virtual organization cannot be modeled and therefore we suggest that UML notations require to be extend to.

Virtual Organization (VO), Unified Modeling Language (UML), Home Healthcare (HHC)

[1] J. Barzdins, J. Barzdins, E. Rencis, and A. Sostaks, “Graphical modelling and query language for hospitals,” Health Information Science and Systems, vol. 1, no. 1, p. 14, 2013.
[2] M. Benyoucef, C. Kuziemsky, A. Afrasiabi Rad, and A. Elsabbahi, “Modelling healthcare processes as service orchestrations and choreographies,” Business Process Management Journal, vol. 17, no. 4, pp. 568–597, 2011.
[3] V. R. Loucks, “HHC,” International journal of technology assessment in health care, vol. 1, no. 02, pp. 301–304, 1985.

[4] L. Huycke and A. C. All, “Quality in health care and ethical principles,” Journal of advanced nursing, vol. 32, no. 3, pp. 562–571, 2000.
[5] Clinical Case Studies in HHC, First. The Atrium, Southern Gate, Chichester, PO19 8SQ, UK: John Wiley & Sons Ltd, 2011.
[6] A. Darkins, P. Ryan, R. Kobb, L. Foster, E. Edmonson, B. Wakefield, and A. E. Lancaster, “Care coordination/home telehealth: the systematic implementation of health informatics, home telehealth, and disease management to support the care of veteran patients with chronic conditions,” Telemedicine and e-Health, vol. 14, no. 10, pp. 1118–1126, 2008.
[7] R. P. Biuk-Aghai, “Visualizing structural and behavioural aspects of virtual collaboration,” in Enabling Technologies: Infrastructure for Collaborative Enterprises, 2001. WET ICE 2001. Proceedings. Tenth IEEE International Workshops on, 2001, pp. 279–284.
[8] M. Schrage, Shared minds: The new technologies of collaboration. Random House Inc., 1991.
[9] J. M. Liedtka, “Collaborating across lines of business for competitive advantage,” The Academy of Management Executive, vol. 10, no. 2, pp. 20–34, 1996.
[10] R. P. Biuk-Aghai and S. Simoff, “Patterns of virtual collaboration in online collaboration systems,” in Proceedings of the IASTED International Conference on Knowledge Sharing and Collaborative Engineering, St. Thomas, USVI, November, 2004, pp. 22–24.
[11] L. Wainfan and P. K. Davis, Challenges in virtual collaboration: Videoconferencing, audioconferencing, and computer-mediated communications. Rand Corporation, 2004.
[12] Y. P. Shao, S. Liao, and H. Wang, “A model of VOs,” Journal of information science, vol. 24, no. 5, pp. 305–312, 1998.
[13] D. Antonacci and N. Modaress, “Second Life: The educational possibilities of a massively multiplayer virtual world (MMVW),” in EDUCAUSE Western Regional Conference, 2005, vol. 26.
[14] P. R. Messinger, E. Stroulia, and K. Lyons, “A typology of virtual worlds: Historical overview and future directions,” Journal For Virtual Worlds Research, vol. 1, no. 1, 2008.
[15] J. M. Balkin and B. S. Noveck, State of Play: Law, Games, and Virtual Worlds: Law, Games, and Virtual Worlds (Ex Machina: Law, Technology, and Society). NYU Press, 2006.
[16] H. Rheingold, “A slice of my life in my virtual community,” High noon on the electronic frontier: Conceptual issues in cyberspace, pp. 413–36, 1996.
[17] J. Koh, Y.-G. Kim, and Y.-G. Kim, “Sense of virtual community: A conceptual framework and empirical validation,” International Journal of Electronic Commerce, vol. 8, no. 2, pp. 75–94, 2003.
[18] U. Lechner and B. F. Schmid, “Communities and media-towards a reconstruction of communities on media,” in System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on, 2000, p. 10–pp.
[19] H. Rheingold, The virtual community: Homesteading on the electronic frontier. MIT press, 1993.
[20] G. Demiris, “The diffusion of virtual communities in health care: concepts and challenges,” Patient education and counseling, vol. 62, no. 2, pp. 178–188, 2006.
[21] G. Demiris, “Virtual communities in health care,” in Intelligent paradigms for healthcare enterprises, Springer, 2005, pp. 121–137.
[22] M. Gurstein, Community informatics: Enabling communities with information and communications technologies. IGI Global, 1999.
[23] A. Dannecker and U. Lechner, “‘Virtual Communities with a Mission’ in the Health Care Sector,” Relationships in Electronic Markets, p. 115, 2004.
[24] T. K. Houston, L. A. Cooper, and D. E. Ford, “Internet support groups for depression: a 1-year prospective cohort study,” American Journal of Psychiatry, vol. 159, no. 12, pp. 2062–2068, 2002.
[25] R. Grenier and G. Metes, Going virtual: Moving your organization into the 21st century. Prentice Hall PTR Upper Saddle River, 1995.
[26] M. Turoff, “Virtuality,” Communications of the ACM, vol. 40, no. 9, pp. 38–43, 1997.
[27] S. Reiff-Marganiec and N. J. Rajper, “Modelling VOs: Structure and reconfigurations,” in Adaptation and Value Creating Collaborative Networks, Springer, 2011, pp. 297–305.
[28] J. W. Bryans, J. S. Fitzgerald, C. B. Jones, and I. Mozolevsky, “Formal modelling of dynamic coalitions, with an application in chemical engineering,” in Leveraging Applications of Formal Methods, Verification and Validation, 2006. ISoLA 2006. Second International Symposium on, 2006, pp. 91–98.
[29] L. Bocchi, J. Fiadeiro, N. Rajper, and S. Reiff-Marganiec, “Structure and behaviour of VO breeding environments,” arXiv preprint arXiv:1001.4413, 2010.
[30] J. Zi-bin, “A Study on Modelling of Multi-agent Collaboration in Virtual Enterprise Based on Extended UML,” in Computer Science and Software Engineering, 2008 International Conference on, 2008, vol. 5, pp. 202–205.
[31] R. James, G. Booch, and I. Jacobson, “The UML reference guide,” Addsion Wesley Longman, 1999.
[32] G. T. Jun, J. Ward, Z. Morris, and J. Clarkson, “Health care process modelling: which method when?,” International Journal for Quality in Health Care, p. mzp016, 2009.
[33] S. Garde, B. Baumgarten, O. Basu, N. Graf, R. Haux, R. Herold, U. Kutscha, F. Schilling, B. Selle, C. Spiess, and others, “A meta-model of chemotherapy planning in the multi-hospital/multi-trial-center-environment of pediatric oncology,” Methods Inf Med, vol. 43, no. 2, pp. 171–183, 2004.
[34] M. Benyoucef, C. Kuziemsky, A. Afrasiabi Rad, and A. Elsabbahi, “Modelling healthcare processes as service orchestrations and choreographies,” Business Process Management Journal, vol. 17, no. 4, pp. 568–597, 2011.
[35] A. Pitsillides, B. Pitsillides, G. Samaras, M. Dikaiakos, E. Christodoulou, P. Andreou, and D. Georgiadis, “DITIS: A collaborative virtual medical team for home healthcare of cancer patients,” in M-Health, Springer, 2006, pp. 247–266.
[36] P. Klemm, M. Hurst, S. L. Dearholt, and S. R. Trone, “Gender differences on Internet cancer support groups.,” Computers in nursing, vol. 17, no. 2, pp. 65–72, 1998.
[37] S. Ferrante, S. Bonacina, and F. Pinciroli, “Modelling stroke rehabilitation processes using the Unified Modelling Language (UML),” Computers in biology and medicine, vol. 43, no. 10, pp. 1390–1401, 2013.
[38] M. Berg and P. Toussaint, “The mantra of modelling and the forgotten powers of paper: a sociotechnical view on the development of process-oriented ICT in health care,” International journal of medical informatics, vol. 69, no. 2, pp. 223–234, 2003.
[39] P. Kumarapeli, S. De Lusignan, T. Ellis, and B. Jones, “Using Unified Modelling Language (UML) as a process-modelling technique for clinical-research process improvement,” Informatics for Health and Social Care, vol. 32, no. 1, pp. 51–64, 2007.
[40] C. Scholz, “The virtual corporation: empirical evidences to a three dimensional model,” in Academy of Management.-Conference in Toronto, 2000.
[41] P. Epstein and R. Sandhu, “Towards a UML based approach to role engineering,” in Proceedings of the fourth ACM workshop on Role-based access control, 1999, pp. 135–143.
[42] D. N. Jutla, P. Bodorik, and S. Ali, “Engineering Privacy for Big Data Apps with the Unified Modelling Language,” in Big Data (BigData Congress), 2013 IEEE International Congress on, 2013, pp. 38–45.

Hoger Mahmud, "Modeling Virtual Organization for Home Healthcare Using UML," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.22-31, 2016.

Internet usage has gone far beyond expectation and continues to grow. Services on the Internet are also more innovative than ever before. Many more different system architectures are currently used to obtain the same pool of services. Now, the trend is to make uniform architecture to provide services. SOA is a service that aims to integrate and be interoperable with various implementation languages. SOA is a concept of distributed computing, the best example of which is file sharing. Remote sharing remains an issue. Although many services are available to provide remote file sharing, they have problems in accessing file with ease, user friendliness, a generic communication protocol, a secured method to communicate during transferring and traversing the secured firewalls. This paper focuses on how easily the file can be shared with the generic communication protocol and a secured method by bypassing the issues of NAT. To provide such service, we do not have any option other than XML, which enables the system to service the end users, who can choose to download or upload files using a browser or an application client. Thus, we have built a middleware for file sharing. The middleware and the application client are equipped with the NAT facilities to traverse the firewalls. Our proposed middleware can service the users of both systems (Browser and Application client). The performance of the proposed system for remote sharing suggests using XML as an interface to implement the SOA-based applications.

File Service, Distributed Systems, XML, SOA, WEB Service

[1] Lee, A.; Girgensohn, A.; Zhang, J., "Browsers to support awareness and social interaction," Computer Graphics and Applications, IEEE , vol.24, no.5, pp.66,75, Sept.-Oct. 2004
doi: 10.1109/MCG.2004.24
[2] Heath, T., "How Will We Interact with the Web of Data?," Internet Computing, IEEE , vol.12, no.5, pp.88,91, Sept.-Oct.2008 doi: 10.1109/MIC.2008.101
[3] Hanson, V.L.; Brezin, J.P.; Crayne, S.; Keates, S.; Kjeldsen, R.; Richards, J.T.; Swart, C.; Trewin, S., "Improving Web accessibility through an enhanced open-source browser," IBM Systems Journal , vol.44, no.3, pp.573,588, 2005 doi: 10.1147/sj.443.0573
[4] Support Protocols, In: Thomas Porter, Jan Kanclirz, Andy Zmolek, Antonio Rosela, Michael Cross, Larry Chaffin, Brian Baskin and Choon Shim, Editor(s), Practical VoIP Security, Syngress, Burlington, 2006, Pages 205-237
[5] Rennie, J.; Zorpette, G., "The social era of the web starts now," Spectrum, IEEE , vol.48, no.6, pp.30,33, June 2011.
[6] David Chen, Guy Doumeingts, François Vernadat, Architectures for enterprise integration and interoperability: Past, present and future, Computers in Industry, Volume 59, Issue 7, September 2008, Pages 647-659, ISSN 0166-3615, 10.1016/j.compind.2007.12.016.
[7] Matjaz B. Juric, Ana Sasa, Bostjan Brumen, Ivan Rozman, WSDL and UDDI extensions for version support in web services, Journal of Systems and Software, Volume 82, Issue 8, August 2009, Pages 1326-1343, ISSN 0164-1212, 10.1016/j.jss.2009.03.001.
[8] Anura Gurugé, 8 - Web Services, Corporate Portals Empowered with XML and Web Services, Digital Press, Burlington, 2002, Pages 245-272, ISBN 9781555582807, 10.1016/B978-155558280-7/50010-3.
[9] P. Resnick Internet message format Request For Comments (RFC), 5322 (2008)
[10] FILE TRANSFER PROTOCOL (FTP), RFC 959.
[11] Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. 2001. Freenet: a distributed anonymous information storage and retrieval system. In International workshop on Designing privacy enhancing technol0ogies: design issues in anonymity and unobservability, Hannes Federrath (Ed.). Springer-Verlag New York, Inc., New York, NY, USA, 46-66.
[12] Napster. http://www.napster.com
[13] Gnutella. http://www.gnutella.co.uk.
[14] Huajian Mao, Nong Xiao, Weisong Shi, Yutong Lu, Wukong: A cloud-oriented file service for mobile Internet devices, Journal of Parallel and Distributed Computing, Volume 72, Issue 2, February 2012, Pages 171-184, ISSN 0743-7315, 10.1016/j.jpdc.2011.10.017.

[15] Ivar Jørstad, Do Thanh van, Personalised ubiquitous file access with XML Web Services, Computer Networks, Volume 51, Issue 16, 14 November 2007, Pages 4655-4668, ISSN 1389-1286, 10.1016/j.comnet.2007.06.009
[16] Dropbox, http://www.dropbox.com
[17] Google Docs, http://docs.google.com
[18] iClouds, https://www.icloud.com/
[19] Coda file http://www.coda.cs.cmu.edu
[20] Addison-Wesley Professional “Understanding web services “1- edition (May 23, 2002)
[21] Suvendi Chinnappen-Rimer and Gerhard P. Hancke, Senior Member “An XML Model for Use across Heterogeneous Client–Server Applications”, IEEE Transactions on Instrumentation and Measurement, VOL. 57, NO. 10, October 2008
[22] Girish M. Tere et.al / International Journal on Computer Science and Engineering (IJCSE) “JAX-WS Web Service for Transferring Image” ISSN : 0975-3397 Vol. 5,Page No- 196
03 Mar 2013

Sumaya Sanober and Amtul Waheed, "File Service Architecture for Heterogeneous Clients," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.32-39, 2016.

Mining frequent closed itemsets from data streams is an important topic. In this paper，we propose an algorithm for mining frequent closed itemsets from data streams based on a time fading module. By dynamically constructing a pattern tree, the algorithm calculates densities of the itemsets in the pattern tree using a fading factor. The algorithm deletes real infrequent itemsets from the pattern tree so as to reduce the memory cost. A density threshold function is designed in order to identify the real infrequent itemsets which should be deleted. Using such density threshold function, deleting the infrequent itemsets will not affect the result of frequent itemset detecting. The algorithm modifies the pattern tree and detects the frequent closed itemsets in a fixed time interval so as to reduce the computation time. We also analyze the error caused by deleting the infrequent itemsets. The experimental results indicate that our algorithm can get higher accuracy results, needs less memory and computation time than other algorithm

Data Streams; Frequent Closed Itemsets; Data Mining; Time Fading Model

[1] Y.H. Pan, J.L. Wang, and C.F. Xu, “State-of-the-art on frequent pattern mining in data streams, ” Acta Automatica Sinica, Vol.32, Issue-4, 2006, pp.594-602.
[2] Y.Y. Zhu, S.S. Dennis, “StatStream: statistical monitoring of thousands of data streams in real time [A]”, Proceedings of the 20th International Conference on Very Large Data Bases[C]. Hong Kong, China, 2002, pp. 358-369.
[3] H.F. Li, C.C. Ho and S.Y. Lee, “Incremental updates of closed frequent itemsets over continuous data streams”, Expert Systems with Applications, Vol.36, 2009, pp. 2451-2458.
[4] J. Nan and G. Le, “Research issues in data stream association rule mining”, SIGMOD Record, Vol.35, Issue-1, 2006, pp. 14-19.
[5] Y. Chi etal, “Catch the moment: Maintaining closed frequent itemsets over a data stream sliding window,” Knowledge and Information Systems, Vol.10, Issue-3, 2006, pp. 265-294.
[6] F.J. Ao etal, “An Efficient Algorithm for Mining Closed Frequent Itemsets in Data Streams,” IEEE 8th International Conference on Computer and Information Technology Workshops, 2008, pp. 37-42.
[7] J.Y. Wang etal, “TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets,” IEEE TRANSACTION ON KNOWLEDGE AND DATA ENGINEERING, Vol.17, 2005, pp. 652-664.
[8] Y. Chi etal, “MOMENT: Maintaining closed frequent Itemsets over a stream sliding window [A]”, Proceedings of the 2004 IEEE International Conference on Data Mining[C], Brighton, UK: IEEE Computer Society Press, 2004, pp. 59-66.
[9] X. Liu etal, “An Algorithm to Approximately Mine Frequent Closed Itemsets from Data Streams”, ACTA ELECTRONICA SINICA, Vol.35, Issue-5, 2007, pp. 900-905.
[10] X. Ji, J. Bailey, “An Efficient Technique for Mining Approximately Frequent Substring Patterns”, Data Mining Workshops, ICDM Workshops Seventh IEEE International Conference, 2007 , pp. 325-330.
[11] S. Zhong, “Efficient stream text clustetring[J]”, Neural Networks, Vol.18, Issue-6, 2006, pp.790-798.
[12] H. F. Li, Z. J. Lu, H. Chen, “Mining Approximate Closed Frequent Itemsets over Stream,” Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, Ninth ACIS International Conference, 2008, pp. 405-410.
[13] H. Yan, Y.S. Sang, “Approximate frequent itemsets compression using dynamic clustering method,” Cybernetics and Intelligent Systems, IEEE Conference, 2008 , pp. 1061-1066.
[14] Z. N. Zou etal, “Mining Frequent Subgraph Patterns from Uncertain Graph Data,” Knowledge and Data Engineering, Vol.22, Issue-9, 2010, pp. 1203 -1218.
[15] C. Andrea, P. Rasmus, “On Finding Similar Items in a Stream of Transactions,” Data Mining Workshops (ICDMW), IEEE International Conference, 2010 , pp. 121-128.
[16] X. N. Ji, J. Bailey, “An Efficient Technique for Mining Approximately Frequent Substring Patterns,” Data Mining Workshops, Seventh IEEE International Conference, 2007, pp. 325-330.
[17] B. Bakariya and G.S. Thakur. “Effectuation of Web Log Preprocessing and Page Access Frequency using Web Usage Mining”, Vol.1 , Issue-01, 2016, pp.1-5.

Caiyan Dai and Ling Chen, "An Algorithm for Mining Frequent Closed Itemsets with Density from Data Streams," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.40-48, 2016.

This paper addresses the procedure to develope an interface to natural language database that is efficient and flexible to handle unrestricted natural language and interpret the request appropriately called as EFFCN, stands for EFFiciently Compliant Natural language interface to database. The Experimental set up is created by developing a database named as CPVBase. The database holds the tables instituted with the sample records of Customer, Product, Vendor and Invoice data. The database tables have foreign key references to the other tables epitomizing a relation database management system. This paper explains about various technical segments of the implementation of the EFFCN algorithm. The working procedure of the algorithm for the natural language statement transformation into SQL query is depicted. The EFFCN algorithm's precision and recall measures for the score of relevancy is obtained with the success rate of 84%. The PR curve shows the variation of precision and recall measures tested on discrete set of input queries.

Natural Language Query, First Order Logic, Structured Query, Precision, Recall, F1-measureNatural Language Query, First Order Logic, Structured Query, Precision, Recall, F1-measure

[1] Mrs. Neelu Nihalani, Dr. Sanjay Silakari and Dr. Mahesh Motwani, “Natural Language Interface for Database: A Brief Review”, IJCSI International Journal of Computer Science Issues, vol. 8, no. 2, pp. 600-608, Mar. 2011.
[2] T. Johnson, “Natural Language Computing-The Commercial Applications”, The Knowledge Engineering Review, vol. 1, no. 3, pp. 11-23, 1984.
[3] Androutsopoulos, G.D. Ritchie and P. Thanisch, “Natural Language Interface to Databases-An Introduction”, Department of Computer Science, University of Edinburgh, King‟s Buildings, Mayfield Road, Edinburgh EH9 3JZ, Scotland, U.K. , Mar. 1995.
[4] W.A. Woods, R.M. Kaplan and B.N. Webber, “The Lunar Sciences Natural Language Information System: Final Report”, BBN Report 2378, Bolt Beranek and Newman Inc., Cambridge, Massachusetts, 1972.
[5] C.R. Perrault and B.J. Grosz, “Natural Language Interfaces”, Exploring Artificial Intelligence, Morgan Kaufmann Publishers Inc., San Mateo, California, 1988, pp. 133-172.
[6] G. Hendrix, E. Sacerdoti, D. Sagalowicz, and J. Slocum, “Developing a Natural Language Interface to Complex Data”, ACM Transactions on Database Systems, pp. 105-147, 1978.
[7] W. Woods, “An experimental parsing system for transition network grammars in Natural Language Processing”, Algorithmic Press, New York, USA, 1973.
[8] L.R.Harris,“Experience with INTELLECT: Artificial Intelligence Technology Transfer”, The AI Magazine, pp. 43-50, 1984.
[9] Faraj A. El-Mouadib, Zakaria S. Zubi, Ahmed A. Almagrous and Irdess S. El-Feghi, “Generic Interactive Natural Language Interface to Databases (GINLIDB)”, International Journal of Computers, vol. 3, no. 3, 2009.
[10] “START Natural Language Question Answering system Online.
[11] M. Joshi, R. A. Akerkar, “Algorithms to improve performance of Natural Language Interface”, International Journal of Computer Science & Applications, vol. 5, no. 2, pp. 52-68, 2008.
[12] Seymour Knowles and Tanja Mitrovic, “A Natural Language Interface For SQL-Tutor”, Nov. 5, 1999.
[13] D.L. Waltz, “An English Language Question Answering System for a Large Relational Database”, Communications of the ACM, pp. 526-539, 1978.

B.Sujatha and S.Vishwanadha Raju, "Natural Language Query Processing for Relational Database using EFFCN Algorithm," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.49-53, 2016.

A MANET consists number of mobile devices form a network together without any centralized coordinator. In this network device changes location and organize itself, connected by wireless link. Ad hoc network is temporary plug in connection for a small session. Due to mobility of nodes or devices dynamically forming a momentary network. It doesn’t have infrastructure because these are useful for temporary connection, so that there is a possibility of a lacking in a permanent source of energy, because the entire independent mobile device are entirely dependent on battery power. Energy consumption is one of the important factors in case of mobile node. Less amount of energy or lack of battery power is directly affect the life time of network. This paper is discussion improvement the lifetime of the path. In ad hoc network some of the energy efficient protocols are: AODV, OLSR, DSR, and DSDV.

MANET, AODV, Energy, routing

[1] Dharma prakash agrawal department of cs university of Cin cinnati and Qing- An Zeng, book of introduction to wireless and mobile system 3c@2003cengage learning.
[2] Umesh Kumar Singh, Shivlal Mewada, Lokesh Laddhani & Kamal Bunkar,“an Overview & Study of Security Issues in Mobile Adhoc Networks”, Int. Journal of Computer Science and Information Security (IJCSIS) USA, Volume-9, No.4, pp (106-111), April 2011.
[3] Basu Dev Shivhare et al comparison of proactive and reactive routing protocols in MANET using routing protocol property volume 2, issue3, March 2012.
[4] www.techopedia.com.
[5] www.en.m.wikipedia.org/wiki/Dynamic_Source_Routing.
[6] Akhilesh tripathi and rakesh kumar, MCEB – AODV:A Modified energy constrained based protocol for mobile ad hoc networks , vol3 No6 2012.
[7] Leena Pal, Pradeep Sharma, Netram Kaurav and Shivlal Mewada, "Performance Analysis of Reactive and Proactive Routing Protocols for Mobile Ad-hoc –Networks", International Journal of Scientific Research in Network Security and Communication, Volume-01, Issue-05, Page No (1-4), Nov -Dec 2013.
[8] Nitiket N Mhala and N K Choudhari, An implementation possibility for AODV routing protocol in real world vol.1, No.2, November 2010.
[9] G.Kalpana and S.Archana, "Performance Analysis of Threshold Based Algorithms under Wormhole Attack in MANET", International Journal of Computer Sciences and Engineering, Volume-03, Issue-07, Page No (133-138), Jul -2015, E-ISSN: 2347-2693.
[10] Amit Singh, Nitin Mishra and Angad Singh, Survey Of Location Aware Based Energy Efficient AODV Routing Protocols In MANET, IJESM, Vol.5, Issue 1, and Jan- Mar, 2015.
[11] P.S Karadge, Dr .S.V. Sankpal presents, A Performance Comparison of Energy Efficient AODV Protocols in Mobile Ad hoc Network. IJARCCE international journal of advanced research in computer and communication engineering, Vol.2, Issue1, Jan-2013.
[12] R.Rajesh Kanna , S.Poorana Senthilkumar and C.kumuthini ,Energy efficient routing protocols in mobile ad hoc network based on enhanced AODV protocol, IJCSMC, Vol.2, Issue 7, July 2013.

Vinita keer and Syed Imran Ali, "A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.54-58, 2016.

An increasing number of optical High-Resolution (HR) remote sensing satellite systems, offering multispectral images. However, acquiring multi temporal HR data may not always be economically viable, particularly for large areas. Data having medium resolution (i.e., a GSD of 30 m) do not offer as much detail, but cover a larger area and may often be preferable from an economical point of view. In this research work present a new method for the multi temporal and contextual classification of georeferenced optical remote sensing images acquired at different epochs with having different geometrical resolutions. The method is based on Conditional Random Fields (CRFs) for contextual classification. But in CRF, pool of features used in this work is rather limited, particularly for the medium-resolution images. To solve this problem proposed work is expanded to pool of features for the medium-resolution images to improve the classification results. The Gaussian model used in the CRF is should be replaced by more sophisticated Random Forests (RFs) classifiers. RF is an ensemble of many decision trees, which have been trained on randomly selected pool of features for the medium-resolution images subsets of the training data, in order to decorrelate the individual trees. Extend such a framework to multitemporal classification and change detection, taking into account interactions between images acquired at different epochs and considering the fact that these images may have different geometrical resolutions. Results are given for two different test sites in Germany, where Ikonos, RapidEye, and Landsat images are available. State-of-the-art multitemporal classification method and that it is feasible to detect changes in lower resolution images.

Remote sensing satellite;Multitemporal classification;Random forest classifier

[1]. Schowengerdt, Robert A. (2007). Remote sensing: models and methods for image processing (3rd ed.). Academic Press. p. 2.
[2]. Schott, John Robert (2007). Remote sensing: the image chain approach (2nd ed.). Oxford University Press. p. 1.
[3]. Guo, H., Huang, Q., Li, X., Sun, Z., & Zhang, Y. (2014). Spatiotemporal analysis of urban environment based on the vegetation–impervious surface–soil model. Journal of Applied Remote Sensing, 8(1), 084597-084597.
[4]. Liu, Jian Guo & Mason, Philippa J. (2009). Essential Image Processing for GIS and Remote Sensing. Wiley-Blackwell. p. 4.
[5]. http://hurricanes.nasa.gov/earth-sun/technology/remote_sensing.html
[6]. Mills, J. P., Newton, I., & Twiss, S. D. (1997). Photogrammetry from archived digital imagery for seal monitoring. The Photogrammetric Record, 15(89), 715-724.
[7]. Twiss, S. D., Thomas, C. J., & Pomeroy, P. P. (2001). Topographic spatial characterisation of grey seal Halichoerus grypus breeding habitat at a subseal size spatial grain. Ecography, 24(3), 257-266.
[8]. Stewart, J. E., Pomeroy, P. P., Duck, C. D., & Twiss, S. D. (2014). Finescale ecological niche modeling provides evidence that lactating gray seals (Halichoerus grypus) prefer access to fresh water in order to drink. Marine Mammal Science, 30(4), 1456-1472.
[9]. Begni, G., Escadafal, R., Fontannaz, D., & Hong-Nga Nguyen, A. T. (2005). Remote sensing: a tool to monitor and assess desertification. Les dossiers thématiques du CSFD, 2, 44.
[10]. S. Kumar and M. Hebert, “Discriminative random fields,” Int. J. Comput. Vis., vol. 68, no. 2, pp. 179–201, Jun. 2006.
[11]. K. Schindler, “An overview and comparison of smooth labeling methods for land-cover classification,” IEEE Trans. Geosci. Remote Sens., vol. 50, no. 11, pp. 4534–4545, Nov. 2012.
[12]. He, X.; Zemel, R.S.; Carreira-Perpinñán, M.A. (2004). "Multiscale conditional random fields for image labeling". IEEE Computer Society. CiteSeerX: 10.1.1.3.7826.
[13]. Sha, F., & Pereira, F. (2003, May). Shallow parsing with conditional random fields. In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology-Volume 1 (pp. 134-141). Association for Computational Linguistics.
[14]. Settles, B. (2004, August). Biomedical named entity recognition using conditional random fields and rich feature sets. In Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (pp. 104-107). Association for Computational Linguistics.
[15]. Chang, K. Y., Lin, T. P., Shih, L. Y., & Wang, C. K. (2015). Analysis and Prediction of the Critical Regions of Antimicrobial Peptides Based on Conditional Random Fields. PloS one, 10(3).
[16]. Sutton, C., & McCallum, A. (2011). An introduction to conditional random fields. Machine Learning, 4(4), 267-373.
[17]. Yang, M. Y., Förstner, W., & Drauschke, M. (2010). Hierarchical Conditional Random Field for Multi-class Image Classification. In VISAPP (2) (pp. 464-469).
[18]. Schindler, K. (2012). An overview and comparison of smooth labeling methods for land-cover classification. IEEE Transactions on Geoscience and Remote Sensing, 50(11), 4534-4545.
[19]. Jianya, G., Haigang, S., Guorui, M., & Qiming, Z. (2008). A review of multi-temporal remote sensing data change detection algorithms. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 37(B7), 757-762.
[20]. Choi, M. J., Chandrasekaran, V., Malioutov, D. M., Johnson, J. K., & Willsky, A. S. (2008). Multiscale stochastic modeling for tractable inference and data assimilation. Computer Methods in Applied Mechanics and Engineering, 197(43), 3492-3515.
[21]. Hoberg, T., Rottensteiner, F., & Heipke, C. (2011, November). Classification of multitemporal remote sensing data of different resolution using conditional random fields. 2011 IEEE International Conference In Computer Vision Workshops (ICCV Workshops), (pp. 235-242).
[22]. Zhong, P., & Wang, R. (2007). A multiple conditional random fields ensemble model for urban area detection in remote sensing optical images. Geoscience and Remote Sensing, IEEE Transactions on, 45(12), 3978-3988.
[23]. Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., ... & Rother, C. (2008). A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(6), 1068-1080.
[24]. Lu, W. L., Murphy, K. P., Little, J. J., Sheffer, A., & Fu, H. (2009). A hybrid conditional random field for estimating the underlying ground surface from airborne lidar data. IEEE Transactions on Geoscience and Remote Sensing, 47(8), 2913-2922.
[25]. D. Lu, P. Mausel, E. Brondizio, and E. Moran, “Change detection techniques,” Int. J. Remote Sens., vol. 25, no. 12, pp. 2365–2401, Jun. 2004.
[26]. Benedek, C., & Szirányi, T. (2009). Change detection in optical aerial images by a multilayer conditional mixed Markov model. Geoscience and Remote Sensing, IEEE Transactions on, 47(10), 3416-3430.
[27]. D. Li, “Remotely sensed images and GIS data fusion for automatic change detection,” Int. J. Image Data Fusion, vol. 1, no. 1, pp. 99–108, Mar. 2010.
[28]. J. Wegner, U. Sörgel, and B. Rosenhahn, “Segment-based building detection with conditional random fields,” in Proc. 6th IEEE/GRSS/ISPRS Joint Urban Remote Sens. Event, 2011, pp. 205–208.
[29]. P. B. C. Leite, R. Q. Feitosa, A. R. Formaggio, G. A. O. P. Costa, and K. Pakzad, “Hidden Markov models for crop recognition in remote sensing image sequences,” Pattern Recognit. Lett., vol. 32, no. 1, pp. 19–26, Jan. 2011.
[30]. J. Shotton, J. Winn, C. Rother, and A. Criminisi, “TextonBoost for image understanding: Multi-class object recognition and segmentation by jointly modeling texture, layout, and context,” Int. J. Comput. Vis., vol. 81, no. 1, pp. 2–23, Jan. 2009.
[31]. P. O. Gislason, J. A. Benediktsson, and J. R. Sveinsson, “Random forests for land cover classification,” Pattern Recognit. Lett., vol. 27, no. 4, pp. 294–300, Mar. 2006.
[32]. J. Shotton, M. Johnson, and R. Cipolla, “Semantic texton forests for image categorization and segmentation,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Anchorage, AK, 2008, pp. 1–8.

A. Chitradevi and S. Vijayalakshmi, "Random Forest for Multitemporal and Multiscale Classification of Remote Sensing Satellite Imagery," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.59-65, 2016.

Magnetic Resonance Images of Brain often contain herringbone artifact in the form of stripes spread in frequency encoding or phase encoding direction throughout the image. The presence of artifacts create problem in image enhancement and reduces the accuracy of segmentation. In this paper, we propose an efficient, powerful and stable filter based on combined wavelet and Fourier transform for the removal of herringbone artifact. The algorithm strictly separates the features between artifact and original image information and also suppresses the unwanted structures present in the artifact image. It tries to preserve original image information at high degree. The quality of the processed image is evaluated using signal to noise ratio and energy loss measures. The performance and feasibility of the filter are tested on several MR images of brain taken from open source and from radiologists. The results shows that there is a greater improvement in signal to noise ratio and minimal energy loss in the processed image and suggests that the algorithm presented in this paper is suitable in processing and removing herringbone artifact in brain MR images.

Magnetic Resonance Imaging (MRI), Herringbone Artifact, Wavelet Transform, Fast Fourier Transform (FFT), Signal to noise ratio (SNR), Energy loss

[1] L J Erasmus, D Hurter, M Naude, H G Kritzinger, S Acho, “A Short overview of MRI artifacts”, South African Journal of Radiology, August 2004,13-17.
[2] Vishnumurthy T.D, Mohana H.S, Vaibhav A Meshram,“A Review on Brain Magnetic Resonance Imaging Artifacts: Description, Causes and their Elimination”, International Journal of Advanced Information Science and Technology, Vol.44, No.44,pp.88-93,December 2015.
[3] Chi Chang-yan, Zhang Ji-xian, Liu Zheng-jun,"Study On Methods of Noise Reduction in a striped Image",The international Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Vol 37, Part B6b, pp.213-216, Beijing 2008
[4] Mohammad Reza Mobasheri, ErfanAmraei, Seyyed Amir Zendehbad, “Implementation and Performance Comparison of Wavelet Based Filters with the Frequency Domain and Spatial Domain Filters in Destriping of Satellite Images”, Current Trends in Technology and Sciences, pp.7-16, 2015
[5] Jinsong Chen, Yun Shao, HuadongGuo, Weiming Wang, and Boqin Zhu,"Destriping CMODIS Data by Power Filtering",IEEE Transactions on Geoscience and Remote Sensing, vol. 41, No.9, pp. 2119-2124, Sept 2003
[6] G.GiovaniCorsini and M.MarcoDiani, “Striping Removal in MOS-B Data,” IEEE Trans.on Geoscience and Remote Sensing, vol. 38, pp. 1439–1446, May 2000
[7] Shu-wen W Chen, Jean-Luc Pellequer“DeStripe: frequency-based algorithm for removing stripe noises from AFM images”.Springer, BMC Structural Biology, 11:7,pp.1-10, 2011
[8] Zuoguan Wang, Yutian Fu, ”Frequency-domain Regularized Deconvolution for Images with Stripe Noise,” ICIG Proc. 4th International Conference, Image and Graphics, 110–115,IEEE, 2007.
[9] P. Rakwatin, W. Takeuchi, Y. Yasuoka, ”Stripe Noise Reduction in MODIS Data by Combining HistogramMatching with Facet Filter,” IEEE Transactions on Geoscience and Remote Sening,Vol. 45, No.6,pp.1844–1856, 2007.
[10] Toney Sebastian, Prem C Pandey, S M M Naidu, Vinod K Pandey “Wavelet Based Denoising for Suppression of Respiratoryand Motion Artifacts in Impedance Cardiography”,Computing in Cardiology;38:501−504, 2011
[11] JianGuo Liu and Gareth Llewellyn Keith Morgan,”FFT Selective and Adaptive Filtering for Removal ofSystematic Noise in ETM+ ImageodesyImages”.IEEE Transactions on Geoscience and Remote Sensing,Vol 44, No. 12, pp.3176-3724, Dec 2006
[12] Ghada A, Al Hudhud and Martin J. Turner, "Digital Removal of Power Frequency Artifacts using a Fourier Space Median Filter", IEEE Signal Processing Letters, Vol 12 No. 8, pp.573-576, Aug 2005
[13] C. Christopoulos, T. Ebrahimi, ”The JPEG2000 Still Image Coding System: An Overview,” IEEE Trans. Consumer Electronics 47, 1103–1127 (2000).
[14] Beat M¨unch, PavelTrtik, Federica Marone, Marco Stampanoni, "Stripe and ring artifact removal with combined wavelet--Fourier filtering", OPTICS EXPRESS 8567, Vol. 17, No. 10 ,2009.
[15] I,Daubechies, ”Ten lectures on Wavelets”, SIAM, Philadelphia, PA (1992).
[16] Gonzalez, R. C.; Woods, R. E., "Digital Image Processing using Matlab", Pearson Education, 2005.
[17] B. Chanda, D. DuttaMajumder, "Digital Image Processing and Analysis". Prentice-Hall of India, 2005
[18] Yi-Hsuan Kao, James R. MacFall “Correctionof MR K-Space Data Corrupted by Spike Noise” IEEE Transactions on medical imaging, vol.19, No.7, pp.671-680, July 2000.
[19] SubhroSarkar,ArdhenduMandal,”Comparison of Some Classical Edge Detection Techniques with their Suitability Analysis for Medical Images Processing”, International Journal of Computer Sciences and Engineering, Volume-3, Special Issue-1,PP(81-87) Feb 2015.

Vishnumurthy T D, Mohana H S Vaibhav A Meshram and Pramod Kammar, "Suppression of Herringbone Artifact in MR Images of Brain Using Combined Wavelet and FFT Based Filtering Technique," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.66-71, 2016.

Cloud computing has emerged as an outstanding service delivery model. Almost all the organizations are switching to cloud in order to avoid the infrastructural cost and utilize the other benefits of the cloud services. As we know with benefits there come the issues, with tremendous increase in growth of technology, huge amount of data is being stored in cloud. Storage of data in cloud requires a high cost of adaptability in order to provide an efficient, reliable and fault tolerance data storage system. Currently fault tolerance is handled by service provider or customer, which is an ineffective way of handling the fault tolerance and lead to in efficient solution. Rather than handling the problem over the service provider or customer this paper deals with an effective and innovative way of handling the fault tolerance in cloud. In this paper we propose a high level approach by deploying the RAID-60 technology to service the fault tolerance problem in cloud.

Fault Tolerance,RAID-60,Reliabiity

[1]Tchana, A.; Broto, L.; Hagimont, D., "Approaches to cloud computing fault tolerance," International Conference on Computer, Information and Telecommunication Systems, 2012, pp.1-6.
[2]Verma,A. Agarwal,N. and Goutam.D.,The performance evaluation of proactive fault tolerant scheme over cloud using Cloud Sim simulator, international conference on Application of Digital Information and Web Technologies,,2014, pp. 171- 176,
[3]Amoon,M ,A Framework for Providing a Hybrid Fault Tolerance in Cloud Computing, science and information conference,2015, pp. 844-849.
[4]www.storagesswitzerland.com/article:A_Better_Answer_than_RAID_and_Replication_for_Cloud_Storage”,2013
[5]”Fault Tolerance- Challenges, Techniques and Implementation in Cloud Computing”, International Journal of Computer Science,2012, Vol. 9,pp.1694-0814

Parminder Singh and Sheetal Bisht, "Implementation of Reliable Fault Tolerant Data Storage System over Cloud using Raid – 60," International Journal of Computer Sciences and Engineering, Vol.4, Issue.2, pp.72-74, 2016.