Volume-3 , Issue-7 , Jul - 2015 Go Back

Clustering is a very well known technique of data mining which is mostly used method of analyzing and describing the data. It is one of the techniques to deal with the large geographical datasets. Clustering is the mostly used method of data mining. Kohonen SOM is a classical method for clustering. In this paper, a new approach is proposed by combining neural network and clustering algorithms. We propose a modified Self Organizing Map algorithm which initially starts with null network and grows with the original data space as initial weight vector, updating neighbourhood rules and learning rate dynamically in order to overcome the fixed architecture and random weight vector assignment of simple SOM. In this paper, existing SOM and modified SOM have been compared by using different parameters.

Clustering Algorithms, Learning rate, Weight vector, SOM, Modified SOM

[1] Agrawal, R., Mehta, M., Shafer, J., Srikant, R., Arning, A. and Bollinger, T, “The Quest Data Mining System”, Proceedings of 1996 International Conference on Data Mining and Knowledge Discovery (KDD’96), Portland, Oregon, 1996, pp. 244-249.
[2] Abbas, O.A., “Comparison between Data Clustering Algorithms”, The International Arab Journal of Information Technology, Vol.5, No.3, 2008, pp. 320-325.
[3] Aneetha, A.S. and Bose, S., “The combined approach for anomaly detection using neural networks and clustering techniques”, Computer Science & Engineering: An International Journal, Vol.2, No.4, 2012, pp. 37-46.
[4] Bacao, F., Lobo, V. and Painho, M., “Self-organizing Maps as Substitutes for K-Means Clustering”, International Conference on Computational Science, Springer-Verlag Berlin Heidelberg, Vol.3516, 2005, pp. 476 – 483.
[5] Bacao, F., Lobo, V. and Painho, M., “Clustering census data: comparing the performance of self-organizing maps and k-means algorithms”, Proceedings of KDNet (European Knowledge Discovery Network of Excellence), Knowledge-Based Services for the Public Sector, Workshop 2: Mining Official Data, Petersberg Congress Hotel, Bonn, Germany, Vol.2, 2004.
[6] Birdi, M., Gangwar, R.C. and Singh, G., “A Data Mining Clustering Approach for Traffic Accident Analysis of National Highway-1”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol.4, Issue-10, 2014, pp. 44- 47.
[7] Bhatia, S.K. and Dixit, V.S., “A Propound Method for the Improvement of Cluster Quality”, International Journal of Computer Science Issues, Vol.9, Issue-4, No.2, 2012, pp. 216-222.
[8] Berglung, E. and Sitte, J., “The Parameter-less Self-Organizing Map Algorithm”, IEEE Transactions on Neural Network, Vol.17, No.2, 2006, pp. 305-316.
[9] Chen, Y., Qin. B., Liu, T., Liu, Y. and Li, S., “The Comparison of SOM and K- means for Text Clustering”, Computer and Information Science, Vol.3, No.2, 2010, pp. 268-274.
[10] Dhingra, S., Gilhotra, R. and Ravishanker, R., “Comparative Analysis of Kohonen-SOM and K-Means data mining algorithms based on Academic Activities”, International Journal of Computers & Technology, Vol.6, No.1, 2013, pp. 237-241.
[11] Ganda, R. and Chahar, V., “A Comparative Study on Feature Selection Using Data Mining Tools”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol.3, Issue-9, 2013, pp. 26-33.
[12] Halkidi, M., Batistakis, Y. and Vazirgiannis, M., “On Clustering Validation Techniques”, Journal of Intelligent Information Systems, Vol.17, No.2, 2001, pp. 107–145.
[13]Hosseini, H.S., “The Time Adaptive Self-Organizing Map is a Neural Network Based on Artificial Immune System”, Proceedings of IEEE World Congress on Computational Intelligence, International Joint Conference on Neural Networks, Sheraton Vancouver Wall Centre Hotel, Vancouver, Canada, Vol.6, No.3, 2006, pp.1007-114.
[14] Hemalatha, M. and Saranya, N.N., “A Recent Survey on Knowledge Discovery in Spatial Data Mining”, International Journal of Computer Science Issues, Vol.8, Issue-3, 2011, pp. 473-479.
[15] Johal, H.S., Singh, B., Singh, H., Nagpal, A. and Virdi, H.S.,“Using Kohonen-SOM & K-Means Clustering Techniques to Analyze QoS Parameters of RSVP”, Proceedings of the World Congress on Engineering and Computer Science, Vol.1, 2012, pp. 431-436.
[16] Kohonen, T., “The self-organizing maps”, Proceedings of the IEEE, Vol.78, No.9, 1990, pp. 1464-1480.
[17]Kohonen, T., “Self-Organized Formation of Topologically Correct Feature Maps”, Biological Cybernetics, Springer, Espoo, Finland, Vol.43, 1982, pp. 59-69.
[18] Kohonen, T., “Essentials of the self-organizing maps”, International Conference on Neural Networks, Vol.37, 2013, pp. 52-65.
[19] Kaur, J. and Singh, G., “Review of Error Rate and Computation Time of Clustering Algorithms on Social Networking Sites”, International Journal of Computer Application, Vol.113, No.8, 2015, pp. 32-35.
[20] Mingoti, S.A. and Lima, J.O., “Comparing SOM neural network with Fuzzy c-means, K-means and traditional hierarchical clustering algorithms”, European Journal of Operational Research, Vol.174, 2006, pp. 1742–1759.
[21] Murugavel, P. and Punithavalli, M., “Improved Hybrid Clustering and Distance-based Technique for Outlier Removal”, International Journal on Computer Science and Engineering, Vol.3, No.1, 2011, pp. 333-339.
[22] Mishra, M. and Behera, H.S., “Kohonen Self Organizing Map with Modified K-means Clustering for High Dimensional Data Set”, International Journal of Applied Information Systems, Vol.2, No.3, 2012, pp. 34-39.
[23] Ravikumar, S. and Shanmugam, A., “Comparison of SOM Algorithm and K- Means Clustering Algorithm in Image Segmentation”, International Journal of Computer Applications, Vol.46, No.22, 2012, pp. 21-25.
[24] Raghuwanshi, S.S. and Arya, P.N., “Comparison of K-means and Modified K-means for Large Data-set”, International Journal of Computing, Communications and Networking, Vol.1, No.3, 2012, pp. 106-110.
[25] Sumathi, N., Geetha, R. and Bama, S.S., “Spatial data mining-techniques trends and its applications”, Journal of Computer Applications, Vol.1, No.4, 2008, pp. 28-30.
[26] Sundararajan, S. and Karthikeyan, S., “A Study On Spatial Data Clustering Algorithms In Data Mining”, International Journal Of Engineering And Computer Science, Vol.1, Issue-1, 2012, pp. 37-41.
[27] Subitha, N. and Padmapriya, A., “Clustering Algorithm for Spatial Data Mining:An Overview”, International Journal of Computer Applications, Vol.68, No.10, 2013, pp. 28-33.
[28] Sharma, K. and Dhiman, R., “Implementation and Evaluation of K-Means, Kohonen-SOM, and HAC Data Mining Algorithms base on Clustering”, International Journal of Computer Science Engineering & Information Technology Research, Vol.3, Issue-1, 2013, pp. 165-174.
[29] Sharma, H. and Kaler, N.K., “A Synthesized Approach for Comparison and Enhancement of Clustering Algorithms in Data Mining for Improving Feature Quality”, International Journal of Soft Computing and Engineering, Vol.4, Issue-2, 2014, pp. 114-117.
[30] Toor, A.K. and Singh, A., “Analysis of Clustering Algorithms Based on Number of Clusters, Error Rate, Computation Time and Map Topology on Large Data Set”, International Journal of Emerging Trends & Technology in Computer Science, Vol.2, Issue-6, 2013, pp. 94- 98.
[31] Torma, M., “Comparison between three different clustering algorithms”, The Photogrammetric Journal of Finland, Vol.13, No.2, 1993, pp. 85-95.
[32] Uriarte, E. A. and Martin, F.D., “Topology Preservation in SOM”, International Scholarly and Scientific Research & Innovation, Vol.2, No.9, 2008, pp. 829-832.
[33] Yin, H., “The Self-Organizing Maps: Background, Theories, Extensions and Applications”, Computational Intelligence: A Compendium, Springer Berlin Heidelberg, Vol.115, 2008, pp. 715-762.

Kamalpreet Kaur Jassar and Kanwalvir Singh Dhindsa, "Self-organizing Map with Modified Self Organizing Map Clustering," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.115-119, 2015.

Security has an important role in data communication through internet. When data travel through public network, sometimes unaccredited users access the confidential data. For secure communication various techniques are used from ancient time to the present time. Steganography is such type of technique used for data transmitting through insecure network. It is an art of hiding information inside other cover media such as text, image, audio and video. Various types of Steganography techniques are Text Steganography, Image Steganography, Audio and Video Steganography. But from these, Image Steganography is more usable due to increased frequency of images on the internet. Cryptography is a technique used for encrypting the plain text into cipher text securing from hackers. Cryptography is disparate from Steganography. In Cryptography, data is converted into different form of data. But in Steganography, data are invisible inside other data. In Cryptography, third party knows the presence of the secret message. In Steganography, unauthorized users do not know about the presence of the secret message. Hence, amalgamation of Steganography and Cryptography gives meticulous results. This paper instigates comparative study of pure LSB Steganography and LSB Steganography with Cryptography. One bit and two bits LSB steganography is implemented. Data are encrypted using RSA algorithm. Proposed technique is used to compare results of MSE (mean square error), RMSE (root mean square error), PSNR (peak signal to noise ratio) and NC (normalized coefficient) for both techniques.

LSB, Cryptography, Steganography, RSA, PSNR, MSE, NC

[1] V Tyagi, A Kumar, R Patel, S Tyagi and S Singh Gangwar, “IMAGE STEGANOGRAPHY USING LEAST SIGNIFICANT BIT WITH CRYPTOGRAPHY”, Journal of Global Research in Computer Science, Volume-03, No-03, Page No (53-55), March 2012.
[2] S Gupta, A Goyal and B Bhushan, “Information Hiding Using Least Significant Bit Steganography and Cryptography”, I.J.Modern Education and Computer Science, Page No (27-34), June 2012.
[3] A Kumar and R Sharma, “A Secure Image Steganography Based on RSA Algorithm and Hash-LSB Technique”, Int. Journal of Advanced Research in Computer Science and Software Engineering, Volume-03, Issue-07, July 2013.
[4] R Patel and D Shah “Multiple LSB data hiding based on Pixel value and MSB value”, Nirma University International Conference on Engineering, ISBN: 978-1-4799-0727-4, Page No (1-5), 2013.
[5] K Thangadurai and G Devi, “An analysis of LSB Based Image Steganography Techniques”, Int. Conference on Computer Communication and Informatics, ISBN: 978-1-4799-2352-6, Jan 03 – 05, 2014.
[6] S Patil, P Bhendwad and R Patil, “Steganographic Secure Data Communication”, Int. Conference on Communication and Signal Processing, ISBN: 978-1-4799-3358-7, Page No (953-956), April 03-05, 2014.
[7] G Seivi, L Mariadhasan and K Shunmuganathan, “Steganography Using Edge Adaptive Image”, Int. Conference on Computing, Electronics and Electrical Technologies, ISBN: 978-1-4673-0210-4, Page No (1023-1027), 2012.
[8] M Ramaiya, N Hemrajani and A Saxena, “Improvisation of Security aspect in Steganography applying DES”, Int. Conference on Communication Systems and Network Technologies, ISBN: 978-0-7695-4958-3, Page No (431-436), 2013.
[9] S Nagar and S Alshamma, “High Speed Implementation of RSA Algorithm with Modified Keys Exchange”, Int. Conference on Sciences of Electronics, Technologies of Information and Telecommunications, ISBN: 978-1-4673-1658-3, Page No (639-642), 2012.
[10] N Akhtar, P Johri and S Khan, “Enhancing the Security and Quality of LSB based Image Steganography”, Int. Conference on Computational Intelligence and Communication Networks, Page No (386-390), 2013.

Mandeep Kaur Gill and Rupinder Kaur Randhawa , "Comparative Study of Multibit LSB Steganography with Cryptography," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.120-123, 2015.

Railway authorities aim to provide transportation service to the customer in a safe as well as effective and efficient manner. The main constraints forcing them to regulate their service are the limitation of resources. This paper found the optimal coordination of stopping stations that can increase and improve overall benefits of skip stop service. A skip stop pattern must find an optimal balance between faster passenger travel time and lower service frequencies at each station. The main objective is to optimize passenger travel time with maintaining railway and infrastructural behavior.

Genetic Algorithm, Indian Railway, SkipStop Service , Optimization

[1] Assad, A.A., 1980. Models for rail transportation. Transportation Research Part A: General 14 (3), 205–220.
[2] Cordeau, J.F., Toth, P., Vigo, D., 1998. A survey of optimization models for routing and scheduling. Transportation Science 32 (4), 380– 404.
[3] Fay, A., 2000. A fuzzy knowledge-based system for railway traffic control. Engineering Applications of Artificial Intelligence 13 (6), 719–729.
[4] Peeters L, Kroon L (2000) A cycle based optimization model for the cyclic railway timetabling problem. In: Voss S, Daduna J (eds) Computer-Aided Scheduling of Public Transport, Springer, Berlin.
[5] Li, F., Z. Gao, K. Li, and L. Yang. 2008. “Efficient Scheduling of Railway Traffic Based on Global Information of Train.” Transportation Research Part B 42:1008–1030.
[6] J.-C. Jong, C.-S. Suen and S. J. Chang, "A Decision Support System to Optimize Railway Stopping Patterns: Application To The Taiwan High Speed Rail," in Transportation Research Board 91st Annual Meeting, Washington D.C., 2011.
[7] Corman, F., D’Ariano, A., Pacciarelli, D., Pranzo, M., 2010. Centralized versus distributed systems to reschedule trains in two dispatching areas. Public Transport: Planning and Operations 2 (3), 219–247.
[8] Acuna-Agost, R., Michelon, P., Feillet, D., Gueye, S., 2011. SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions. European Journal of Operational Research 215 (1), 227– 243.
[9] Tnquist Krasemann, J., 2012. Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances. Transportation Research Part C 20 (1), 62–78.

Soumya Sengupta and Amartya Neogi , "A Study on Optimize Skip Stop Service Using Genetic Algorithm in Selected Indian Railway Division," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.124-128, 2015.

Index recommendation is an active research area in query performance tuning and optimization. Designing efficient indexes is paramount to achieving good database and application performance. In association with database engine, index recommendation technique need to adopt for optimal results. Different searching methods used for Index Selection Problem (ISP) on various databases and resemble knapsack problem and traveling salesman. The query optimizer reliably chooses the most effective indexes in the vast majority of cases. Loss function calculated for every column and probability is assign to column. Experimental results presented to evidence of our contributions.

Query Performance, NPH Analysis, Index Selection Problem

[1] Oracle “Performance Tuning Guide 11g Release 2”.
[2] G. Valentin, M. Zuliani, D. C. Zilio, A. Skelley and G. Lohman, “DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes”, ICDE, 2000.
[3] H. Gupta, V. Harinarayan and A Rajaraman, “Index Selection for OLAP,” in IEEE, 1997, pp 208-219.
[4] J. Calle, Y. Saez and D. Cuadra, “An Evolutionary Approach to the Index Selection Problem,” in IEEE, pp 485-490, 2011.
[5] S. Chaudhuri and V. Narasayya, “Self-Tuning Database Systems: A Decade of Progress,” in VLDB Endowment, pp 3-14, 2007.
[6] P. Kolaczkowski and Henryk Rybinski, “Automatic Index Selection in RDBMS by Exploring Query Execution Plan Space,” in IEEE, pp 131-137, 2005.
[7] P. Papadomanolakis and S. Ailamaki, “An integer linear programming approach to database design,” in Workshop on Self-Managing Database Systems, pp 442-449, 2007.
[8] S. Chaudhuri and V. Narasayya, “An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server,” Proc. 23rd Int’l Conf. Very Large Databases (VLDB), pp. 146-155, 1997.
[9] C. S. Blanken and H.M.Chang, “Index selection in relational databases,” in International Conference on Computing and Information, pp. 491–496, 1993.
[10] S. Chaudhuri, M. Datar and V. Narasayya “Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution” in IEEE transactions on knowledge and data engineering, Vol. 16, pp 1313-1323, 2004.
[11] S. Chaudhuri and V. Narasayya, “AutoAdmin ‘What-If’ Index Analysis Utility,” in Proc. ACM SIGMOD, pp 367-378, 1998.
[12] F. Fotouhi and C. Galarce, “Genetic Algorithms and the Search for Optimal Database Index Selection” Springer, pp 249-255, 1991.
[13] S. Agrawal, S. Chaudhuri and S. Narasayya “Automated selection of materialized view and indexes for SQL databases” in Proc 26th VLDB, pp 496-505, 2000.
[14] S. Agrawal, S. Chaudhuri, L. Kollar, A. Marathe, V. R..Narasayya, and M. Syamala,, “Database Tuning Advisor for Microsoft SQL Server 2005,” In Procs. 30th VLDB Conference, pp. 1110-1121, 2004.

Pratham L. Bajaj and Archana Ghotkar, "Index Selection for in-Memory Databases," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.129-132, 2015.

An ad hoc network refers to a network connection established for a single session and does not essential a router or a wireless base station. A MANET is a collection of mobile nodes connected through wireless networks. MANET can join and leave the network dynamically. However, MANET is particularly vulnerable due to its fundamental characteristics, such as dynamic topology, distributed co-operation, and constrained capability. One main challenge on designing these networks is their vulnerability to security attacks.In this paper the performance of Threshold Based Algorithms using routing protocols AODV and DSR with wormhole attack detection have been analysed using NS2 considering various parameters such as packet delivery ratio and average throughput to evaluate its performance.

MANET;AODV;DSR;Wormhole

[1] V. Mahajan, M. Natu, A. Sethi. “Analysis of wormhole intrusion attacks in MANETS”. In IEEE Military Communications Conference (MILCOM), pp. 1-7, 2008.
[2] Dipali Koshti,” Comparative study of Techniques used for Detection of Selfish Nodes in Mobile Ad hoc Networks”, International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, 2011.
[3] S.Archana, Dr.G.Kalpana, “ A Survey on Security Attacks in Mobile Ad Hoc Network”, National Conference on INNOVATIVE TRENDS IN INFORMATION TECHNOLOGY(NCITIT) ISBN:978-93-84743-32-1,7 FEB-2015
[4] Chattopadhyay, Mekhala. AN APPROACH TO DETECT WORMHOLE ATTACK IN AODV BASED MANET. Diss. Jadavpur University Kolkata-700032 India 2014.
[5] S.Archana, Dr.G.Kalpana, “A Comparative Analysis of AODV and DSR Protocol under Wormhole Attack in MANET”, International Conference on Innovation Information and Embedded and Communication System, March-2015
[6] Perkins CE, Royer EM, Chakeres “Ad hoc On-Demand Distance Vector (AODV) Routing”, IETF , October, 2003.
[7] Abhay Kumar Rai, Rajiv Ranjan Tewari & Saurabh Kant Upadhyay, “Different Types of Attacks on Integrated MANET-Internet Communication”, International Journal of Computer Science and Security (IJCSS) Volume (4): Issue (3) 265, 2010.
[8] F. Nait-Abdesselam, B. Bensaou, T. Taleb. “Detecting and Avoiding Wormhole Attacks in Wireless Ad hoc Networks”, IEEE Communications Magazine, 46 (4), pp. 127 - 133, 2008.
[9] Network Simulator 2. http://isi. edu/nsnam/ns/
[10] Saurabh Upadhyay and Aruna Bajpai, Avoiding Wormhole Attack in MANET using Statistical Analysis Approach, International Journal on Cryptography and Information Security(IJCIS),Vol.2, No.1,March 2012.
[11] K.Santhi and Dr.M.Punithavalli “Optimized Reliable And Load Balanced Routing Protocol For Mobile Ad
Hoc Networks” -Journal of Theoretical and Applied Information Technology (JATIT))-Vol.51 No.3 May 2013
[12] Reshmi Maulik and Nabendu Chaki, “A Study on Wormhole Attacks in MANET”, International Journal of Computer Information Systems and Industrial Management Applications, ISSN 2150-7988 Volume 3 (2011) pp. 271-279.
[13] Mohammed Saeed Alkatheiri, Jianwei Liu and Abdur Rashid Sangi, “AODV Routing Protocol Under Several Routing Attacks in MANETs”, 978-1-61284-307-0/11, IEEE, 2011.
[14] Shalini Jain, Dr.Satbir Jain, “Detection and prevention of wormhole attack in mobile adhoc networks”, International Journal of Computer Theory and Engineering, Vol. 2, No. 1 February, 2010 pp 1793-8201.
[15] R. Vembu, R. Syed Hayath, “ Methodology For Comparing Reactive Routing Protocols To Detect And Prevent The Wormhole Attack Using Path Tracing Approach” IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) e-ISSN: 2278-2834, p-ISSN: 2278-8735 PP 12-17.

G.Kalpana and S.Archana, "Performance Analysis of Threshold Based Algorithms under Wormhole Attack in MANET," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.133-138, 2015.

This paper presents an analysis of the CIELAB color feature based tone mapping technique. After analysis of these techniques we had concluded that saliency based tone mapping algorithm is not computationally efficient as good as the proposed methodology. There is different Salience-based Tone mapping methods for High dynamic range images that have the halo artifacts significantly reduced. The visual quality of tone-mapped image, especially based on salient regions, is enhanced by the saliency-aware weighting. Experimental results show that the proposed method produce good results on a variety of high dynamic range images as saliency-aware technique. The proposed method is more computational efficient and the visual quality of the proposed method is also improved as of saliency based tone mapping.

CIELAB Colour Space; Tone Mapping; HDR Image; Weighted Least Square Filter

[1] Zhengguo Li and Jinghong Zheng “Visual-Salience-Based Tone Mapping for High Dynamic Range Images” IEEE Transactions on Industrial Electronics, Vol. 61, No. 12, December 2014,PP. 7076-7082
[2] J. Garcia et al., “Directional people counter based on head tracking,” IEEE Trans. Ind. Electron., vol. 60, no. 9, Sep. 2013, pp. 3991–4000.
[3] A. Borji, D. N. Sihite, and L. Itti, “Quantitative analysis of humanmodel agreement in visual saliency modeling: A comparative study,” IEEE Trans. Image Process., vol. 22, no. 1, Jan. 2013, pp. 55–69.
[4] C. Y. Chang and H. Lie, “Real-time visual tracking and measurement to control fast dynamics of overhead cranes,” IEEE Trans. Ind. Electron., vol. 59, no. 3, Mar. 2012, pp. 1640–1649.
[5] H. L. Zhuang, K. S. Low, and W. Y. Yau, “Multichannel pulse-coupledneural network-based color image segmentation for object detection,” IEEE Trans. Ind. Electron., vol. 59, no. 8, Aug. 2012, pp. 3299–3308.
[6] S. Y. Chen, G. J. Luo, X. Li, S. M. Ji, and B. W. Zhang, “The specular exponent as a criterion for appearance quality assessment of pearllike objects by artificial vision,” IEEE Trans. Ind. Electron., vol. 59, no. 8, Aug. 2012, pp. 3264–3272
[7] J. Li, Y. H. Tian, T. J. Huang, and W. Gao, “Probabilistic multi-task learning for visual saliency estimation in video,” Int. J. Comput. Vis., vol. 90, no. 2, Nov. 2010, pp. 150–165.
[8] P. Y. Hsiao, C. L. Lu, and L. C. Fu, “Multilayered image processing for multiscale Harris corner detection in digital realization,” IEEE Trans. Ind. Electron., vol. 57, no. 5, , May 2010, pp. 1799–1805.
[9] Z. Farbman, R. Fattal, D. Lischinski, and R. Szeliski, “Edge-preserving decompositions for multi-scale tone and detail manipulation,” ACM Trans. Graphics, vol. 21, no. 3, Aug. 2008, pp. 249–256.
[10] E. Reinhard, G. Ward, S. Pattanaik, and P. E. Debevec, High Dynamic Range Imaging: Acquisition, Display and Image-Based Lighting. San Mateo, CA, USA: Morgan Kaufmann, 2005.
[11] R. Fattal, D. Lischinski, and M.Werman, “Gradient domain high dynamic range compression,” ACMTrans. Graphics, vol. 27, no. 3, Jul. 2002, pp. 67:1–67:10.
[12] E. Reinhard, M. Stark, P. Shirley, and J. Ferwerda, “Photographic tone reproduction for digital images,” ACM Trans. Graphics, vol. 21, no. 3, , Jul. 2002, pp. 267–276.
[13] S. Grgic, M. Grgic, and B. Zovko-Cihlar, “Performance analysis of image compression using wavelets,” IEEE Trans. Ind. Electron., vol. 48, no. 3, Jun. 2001 pp. 682–695.
[14] P. E. Debevec and J. Malik, “Rendering high dynamic range radiance maps from photographs,” in Proc. SIGGRAPH, Los Angeles, CA, USA, Aug. 1997, pp. 369–378.
[15] J. Tsotsos, “Analyzing vision at the complexity level,” Behav. Brain. Sci., vol. 13, no. 3, Mar. 1990, pp. 423–445.
[16] A. Adams, The Print. ser. The Ansel Adams Photography series. New York, NY, USA: Little, Brown and Company, 1983.
[17] LAGENDIJK, R. L., BIEMOND, J., AND BOEKEE, D. E. 1988. Regularized iterative image restoration with ringing reduction. IEEE Trans. Acoustics, Speech, and Signal Proc., Speech, Signal Proc. 36, 12, 1874–1888.
[18] K. N. NORDSTROM, 1989. Biased anisotropic diffusion — a unified regularization and diffusion approach to edge detection. Tech. Rep. UCB/CSD-89-514, EECS Department, University of California, Berkeley.
[19] A. LEVIN, D. LISCHINSKI, AND Y. WEISS. 2004. Colorization using optimization. ACM Trans. Graph. 23, 3 (August), 689– 694.
[20] D. LISCHINSKI, Z. FARBMAN, M. UYTTENDAELE, AND R. SZELISKI, 2006. Interactive local adjustment of tonal values. ACM Trans. Graph. 25, 3, 646–653.
[21] P. BURT, AND E. H. ADELSON, 1983. The Laplacian pyramid as a compact image code. IEEE Trans. Comm. 31, 532–540.
[22] J. TUMBLIN, AND G. TURK, 1999. LCIS: A boundary hierarchy for detail-preserving contrast reduction. In Proc. ACM SIGGRAPH 99, A. Rockwood, Ed., ACM, 83–90.
[23] REINHARD, E., STARK, M., SHIRLEY, P., AND FERWERDA, J. 2002, Photographic tone reproduction for digital images. ACM Trans. Graph. 21, 3, 267–276.
[24] H. WINNEM¨OLLER, S. C. OLSEN, AND B. GOOCH, 2006, Realtime video abstraction. ACM Trans. Graph. 25, 1221– 1226.
[25] J. CHEN, S. PARIS, AND F. DURAND, 2007. Real-time edge-aware image processing with the bilateral grid. ACM Trans. Graph. 26, 3, Article 103.

Arpna Patel, Ratnesh Dubey, Vineet Richhariya, "A Suitable LDR Image from HDR by CIELAB Based Tone-Mapping Algorithm," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.139-143, 2015.

A problem of food waste becomes a critical issue and achieving won’t be easy because of growing population and increasing urbanization. It affects the social and environmental problem. Every time food is wasted the other sources like water, energy, time, manpower, land, fertilizer, packaging and mainly money is also wasted. Waste has to paid twice once in the form of packaging and again for disposal. In food waste management collection of waste food from bins plays a crucial role and how it is reduce, reuse and recycling. This paper proposes a discussion about role of geographic information system in management of food waste and its use in collection of waste food for reuse, recycling and reduction in waste and optimization of waste food collection and transport.

Remote Sensing(RS), Geographic Information System(GIS), Food Waste, Food Waste Management(FWM). Network Analysis(NA)

[1] Shweta Karsauliya, “Application of Remote Sensing and GIS in Solid Waste Management: A Case Study of Surroundings of River Yamuna, India”, International Journal of Environmental Engineering and Management, ISSN:2231-1319, Volume 4, pp. 593-604, 2013.
[2] J. Senthil, S. Vadivel1 and J. Murugesan, “Optimum Location of Dust Bins Using Geo-Spatial Technology: A Case Study of Kumbakonam Town, Tamil Nadu, India”, Pelagia Research Library, Advances in Applied Science Research, 3 (5):2997-3003.
[3] Draper/Lennon Incorporation, “Identification, Characterization, and Mapping of Food Waste and Food Waste Generators in Massachusetts”, Massachusetts Department of Environmental Protection, Boston, MA, 2002.
[4] Vivek S. Agrawal, Ambika Nag, “Sustainable Food Waste Prevention Strategies to Achieve Food Security in India”, International Journal of Agriculture and Food Science Technology Volume 4: pp. 189-194, (2013).
[5] Mr. AnkitVerma, Prof. B.K Bhonde, “Optimisation of Municipal Solid Waste Management of Indore City using GIS”, International Journal on Emerging Technologies 5(1): 194-200, 2014.
[6] http//www.greeenhotelier.org/know how-guides/ reducing-and-managing food-waste-in-hotels/ published September 2, 2014.
[7] Aremu, A. S., Adeleke, O. O., Sule, B. F., “A GIS-based optimization technique for spatial location of municipal waste bins in a developing city”,
Ethiopian Journal of Environmental Studies and Management Vol. 4 No.3, 2011.
[8] I.A.K.S.Illeperuma, Dr. LalSamarakoon,“ Locating Bins using GIS”, International Journal of Engineering & Technology IJET-IJENS Vol:10 No:02, 2010.
[9] Nithya.R, Velumani.A, Senthil Kumar.S.R.R, “Optimal Location and Proximity Distance of Municipal Solid Waste Collection Bin Using GIS: a Case Study of Coimbatore City”, WSEAS Transactions on Environment and Development, E-ISSN: 2224-3496, Issue 4, Volume 8, 2012.
[10] Mrs. K.R. Manjula, Dr. S. Jyothi, Mr. S. Anand Kumar Varma, “Digitizing the Forest Resource Map Using ArcGIS”, International Journal of Computer Science Issues (IJCSI), Vol. 7, Issue 6, Nov 2010.
[11] N.F Darquah, Jonathan Annan, K. BaahGyamfi, “Shortest Path Algorithm for Transportation Networks, Case Study: Kumasi Metropolitan Assembly”, ISSN (2304-7151) Vol. 2, Issue 8.
[12] Sumedh D. Kashid, “Solid Waste and Waste Bin Management By Using RS & GIS: A Review”, International Journal of Scientific & Engineering Research, Volume 6, Issue 4, April 2015.
[13] Ajay D Nagne, Rajesh K. Dhumal, A. D. Vibhute, Y. D. Rajendra, K. V. Kale, and S. C. Mehrotra, "Suitable sites identification for solid waste dumping using RS and GIS approach: A case study of Aurangabad,(MS) India." In India Conference (INDICON), 2014 Annual IEEE, pp. 1-6. IEEE, 2014.
[14] MaherArebey, M A Hannan, Hassan Basri, R A Begum and Huda Abdullah, “RFID and Integrated Technologies for Solid Waste Bin Monitoring System”, Proceedings of the World Congress on Engineering Vol I, London, U.K., 2010.
[15] Liu Yalan, RenYuhuan, Wang Aihua , Zhou Huizhen, “Identifying The Location and Distribution of the Open-Air Dumps of Solid Wastes Using Remote Sensing Technique”, The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences. Vol. XXXVII. Part B8. Beijing, 2008.
[16] Dr. Michael AjideOyinloye, “Using GIS and Remote Sensing in Urban Waste Disposal and Management: A Focus on Owo L.G.A, Ondo State, Nigeria”, European International Journal of Science and Technology ISSN: 2304-9693.
[17] Tamilenthi.S, Chandra Mohan. K, VijayaLakshmi.P, R. S. Suja Rose, “The data base, land use and land cover and solid waste disposal site - using remote sensing and GIS: A case study of Sakkottai –block, Sivagangai District, Tamil Nadu, India”, Pelagia Research Library Advances in Applied Science Research, 2 (6):pp:379-392, 2011.
[18] Christos Chalkias, Katia Lasaridi, “Benefits from GIS Based Modelling for Municipal Solid Waste Management”, Integrated Waste Management – Volume I.
[19] Ajay D. Nagne, Amol D. Vibhute, Bharti W.Gawali, Suresh C. Mehrotra, “Spatial Analysis of Transportation Network for Town Planning of Aurangabad City by using Geographic Information System”, International Journal of Scientific & Engineering Research, Volume 4, Issue 7, July 2013.
[20] Alphonce Kyessi and Victoria Mwakalinga, “GIS Application in Coordinating Solid Waste Collection: The Case of SinzaNeighbourhood in Kinondoni Municipality, Dar es Salaam City, Tanzania”, SDI in Municipality and Natural Resources Management, Eilat, Israel, 2009.
[21] F. Benjamin Zhan, “Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures”, Journal of Geographic Information and Decision Analysis, vol.1, no.1, pp. 70-82, 1997.
[22] Vaibhavi Patel, Prof.ChitraBaggar, “A Survey Paper of Bellman-Ford Algorithmand Dijkstra Algorithm for Finding Shortest Path in GIS Application”, International Journal of P2P Network Trends and Technology (IJPTT) – Volume 5 – February 2014.

Hitesh V. Raut, Ajay D. Nagne, Karbhari.V. Kale, "Management Of Food Waste By Using GIS Environment: A Review," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.144-151, 2015.

The Visual Cryptography is an efficient cryptographic scheme which uses the human visual system (HVS) characteristics to decrypt images. But the factor that degrades its efficiency is that it is prone to attacks since OR or XOR operations are used for its decryption (HVS). In order to enhance the security factor of visual cryptographic scheme, watermarking of the encrypted images is proposed. Here we consider the Color Extended VC scheme and Intermediate Significant Bit (ISB) based watermarking technique. The shares produced through VC are watermarked on a host image and is made capable of securely transmitting through even attack prone communication channel.

Visual Cryptography, Watermarking, ISB

[1] Moni Naor and Adi Shamir, “Visual Cryptography”. In Proceedings of Advances in Cryptology, EUROCRYPT 94, Lecture Notes in Computer Science, 1995, (950):Page no( 1-12).
[2] Dr.D.Vasumathi, M.Surya Prakash Rao, M.Upendra Kumar, Dr.Y.Ramadevi, Dr.R.Rajeswara Rao, “Novel Approach for Color Extended Visual Cryptography ,” International Journal of Computer Trends and Technology- Volume-3, Issue4- 2012.
[3] Kai-Hui Lee and Pei-Ling Chiu.”An Extended Visual cryptography Algorithm for General Access Structures” IEEE Transactions on information Forensics and security,Volume- 7, No. 1,February 2012.
[4] Akram M. Zeki and Azizah A. Manaf, “A Novel Digital Watermarking Technique Based on ISB (Intermediate Significant Bit)”, World Academy of Science, Engineering and TechnologyVol:3 2009-02-23.
[5] Color Extended Visual Cryptography using Error diffusion, InKoo Kang, Gonzalo R. Arce and Heung-Kyu Lee, IEEE Transactions on image processing, VOL. 20, NO. 1, JANUARY 2011.
[6] M.Mohammed Sathik,"Feature Extracton on ColorED x-Ray Images by Bit- plane Slicing Technology Vol. 2(7), 2010, 2820- 2824
[7] E. Verheuland H. V. Tilborg, ”Constructions And Properties Of K Out Of N Visual Secret Sharing Schemes.”Designs, Codes and Cryptography, 11(2), pp.179–196, 1997.
[8] Y. C. Hou, “Visual cryptography for color images”, Pattern Recognition, Vol. 36, pp.1619-1629, 2003.
[9] S.Punitha, S. Thompson and N.Siva Rama Ling “Binary Watermarking Technique based on Visual Cryptography ” , 978-1-4244-7770-8/10/ 2010 IEEE .
[10] N.Ravia Shabnam Parveen, Dr. M.Mohamed Sathik, “Feature Extraction by Bit Plane Slicing Technique”, in International Journal of Computing, Communication and Information System,Volume 1
[11] E.Sangeetha Devi, “Enhanced Visual Secret Sharing Scheme via Halftoning Technique”, 978-1-4244-7770-8/10/2010 IEEE.
[12] HAN Yan-yan and Xi’an China, “A Watermarking-based Visual Cryptography Scheme with Meaningful Shares”, 978-0-7695-4584-4/11 2011 IEEE.
[13] Vidyasagar M. Potdar, Song Han, Elizabeth Chang,” A Survey of Digital Image Watermarking Techniques”, 3rd International Conference on Industrial Informatics (INDIN),2005.
[14] Mauro Barni, Franco Bartolini, and Alessandro Piva, “ Improved Wavelet-Based Digital Watermarking Through Pixel-Wise Masking “, IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 10, NO. 5, MAY 2001.
[15] Sanghyun Joo, Youngho Suh, Jaeho Shin, and Hisakazu Kikuchi, “A New Robust Watermarking Embedding into Wavelet DC Components”, ETRI Journal, Volume 24, No. 5, October 2002.
[16] C . S Rawat and Sneha M; S. “Watermarking Of Images Using Hybrid Technique”; International Journal of Application or Innovation in Engineering & Management (IJAIEM) ISSN 2319 - 4847 Special Issue for International Technological Conference-2014.
[17] Preeti Parashar1 and Rajeev Kumar Singh,” A Survey: Digital Image Watermarking Techniques “,International Journal of Signal Processing, Image Processing and Pattern Recognition Vol. 7, No. 6 (2014), pp. 111-124.
[18] Sura Ramzi Sheriff ,”Digital Image Watermarking Using Singular Value Decomposition”, Third Scientific Conference Information Technology Volume 7,No 3,2010.
[19] Voyatzis, G and Pitas, I. “Protecting Digital-Image Copyrights: A Framework”, IEEE Trans. On Computer Graphics and Application, Volume. 19, No. 1, pp. 18-24, 1999.
[20] Tripta Deendayal et al, “Enhanced Visual Cryptography Using Color Error diffusion and Digital Watermarking”, Int. J. ComputerTechnology & Applications,Vol-3(1),261-264.
[21] Jayamohan, M., and K. Revathy. "A Hybrid Fractal-Wavelet Digital Watermarking Technique with Localized Embedding Strength." Wireless Networks and Computational Intelligence. Springer Berlin Heidelberg, 2012. 584-591.
[22] A. J. Gonzalez, G. R. Arce, J. Bacca Rodriguez, and lD. L. Lau, “Human visual alpha-stable models for digital halftoning,” in 18th Annual Symposium on Electronic Imaging Science and Technology: Human Vision and Electronic Imaging XI, San Jose, CA, Jan 2006.
[23] R.B. Wolfgang and E.J. Delp, “A Watermark for Digital Images,” Proc. IEEE Int’l Conf. Image Processing, vol. 3, pp. 219-222, 1996.
[24] Ibrahim Nasir, Ying Weng, Jianmin Jiang,” A New Robust Watermarking Scheme for Color Image in Spatial Domain”, School of Informatics, University of Bradford, U.K.
[25] R. Chandramouli and Nasir Memon, “Analysis of LSB Based Image Steganography Techniques”, IEEE 2001.
[26] S. H. Kim and J. P. Allebach, “Impact of HVS models
On Model -based half toning,” IEEE Transactions on
Image Processing, vol. 11, pp. 258–269, Mar 2002.

Shobha Elizabeth Rajan, Sreedevi P, "Enhancing Visual Cryptography Using Digital Watermarking," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.152-156, 2015.

Many countries of the world are currently suffering from problems caused by speedily growing population in urban areas, both governments and human being have a duty to find ways to overcome these problems. We have discussed different domain of urban modeling and case study of the UrbanSim model system for Aurangabad city. Map including elementary areas of ninety nine zones in Aurangabad city and some applications for planning activities in different areas. For this work, we have used the open source software tool OPUS for urban planning and design. We have used four models, (a) Residential development project location choice model (RDPLCM), (b) Non residential development project location choice model (NRDPLCM), (c) Real estate price model (REPM) and (d) Household location choice mode (HLCM). We have done simulation using OPUS on these four models. The base year data set is the year 2012. The simulation has been performed up to the year 2022. The results for different parametric quantities have been predicted for these years. The result shows variation in population for given data set and map.

Aurangabad City Map, GIS, Urbansim, OPUS

[1] Waddell, Paul. "UrbanSim: Modeling urban development for land use, transportation, and environmental planning." Journal of the American Planning Association 68, no. 3 (2002): 297-314.
[2] Waddell, Paul, and Alan Borning. "A case study in digital government developing and applying urbansim, a system for simulating urban land use, transportation, and environmental impacts." Social science computer review 22, no. 1 (2004): 37-51.
[3] Johnson, Robert A., and Michael C. McCoy. Assessment of integrated transportation/land use models. Information Center for the Environment, Department of Environmental Science and Policy, University of California at Davis, 2006.
[4] Schwartzman, Yael, and Alan Borning. "The indicator browser: A web-based interface for visualizing UrbanSim simulation results." In System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, pp. 92-92. IEEE, 2007.
[5] Kryvobokov, Marko, Nicolas Ovtracht, and Valérie Hiebaut. "Analysis and prediction of household location choice in Grand Lyon with urban land use simulation tool UrbanSim." In 8th International Conference of Territorial Intelligence. ENTI. November, 4th-7th 2009, p. 7p. 2009.

[6] Patterson, Zachary, Marko Kryvobokov, Fabrice Marchal, and Michel Bierlaire. "Disaggregate models with aggregate data: Two UrbanSim applications." The Journal of Transport and Land Use 3, no. 2 (2010): 5-37.
[7] Krishnamurthy, Sriram, and Kara Kockelman. "Propagation of uncertainty in transportation land use models: Investigation of dram-empal and utpp predictions in austin, texas." Transportation Research Record: Journal of the Transportation Research Board 1831 (2003): 219-229.
[8] Lee, Brian HY, and Paul Waddell. "Residential mobility and location choice: a nested logit model with sampling of alternatives." Transportation 37, no. 4 (2010): 587-601.
[9] Paleti, Rajesh, Chandra Bhat, and Ram Pendyala. "Integrated model of residential location, work location, vehicle ownership, and commute tour characteristics." Transportation Research Record: Journal of the Transportation Research Board 2382 (2013): 162-172.
[10] Buergle, Michaela, Michael Löchl, Urs Waldner, and Kay W. Axhausen. "Land use and transport simulation: Applying UrbanSim in the Greater Zürich area." Konferenzpaper für CUPUM, London (2005).
[11] Ševčíková, Hana, Adrian E. Raftery, and Paul A. Waddell. "Assessing uncertainty in urban simulations using Bayesian melding." Transportation Research Part B: Methodological 41, no. 6 (2007): 652-669.
[12] Duthie, Jennifer, Avinash Voruganti, Kara Kockelman, and S. Travis Waller. "Uncertainty Analysis and its Impacts on Decision-Making in an Integrated Transportation and Gravity-Based Land Use Model." Journal of Urban Planning and Development 136, no. 4 (2010): 294-302.
[13] Wang, Liming, Paul Waddell, and Maren Outwater. "Incremental Integration of Land Use and Activity-Based Travel Modeling: Workplace Choices and Travel Demand." Transportation Research Record: Journal of the Transportation Research Board 2255 (2011): 1-10
[14] Waddell, Paul, Gudmundur F. Ulfarsson, Joel P. Franklin, and John Lobb. "Incorporating land use in metropolitan transportation planning." Transportation Research Part A: Policy and Practice 41, no. 5 (2007): 382-410.
[15] De Palma, André, Kiarash Motamedi, Nathalie Picard, and Paul Waddell. "Accessibility and environmental quality: inequality in the Paris housing market." (2007).
[16] Waddell, Paul. "Integrated land use and transportation planning and modelling: addressing challenges in research and practice." Transport Reviews 31, no. 2 (2011): 209-229.
[17] Bonnafous, Alain, and Dominique Bouf. "Simulating housing prices in Lyon with UrbanSim: predictive capacity and sensitivity analysis1." CENTRO STUDI DI ESTIMO E DI ECONOMIA TERRITORIALE–Ce. SET 61 (2012): 133-144.
[18] Hassan, Mohammad Mehedy, Yongjin Joo, and Chulmin Jun. "A Review of the Development and Application of UrbanSim Integrated Land-Use and Transportation Model." International Journal of Urban Sciences 14, no. 3 (2010): 295-306.
[19] Nguyen-Luong, Dany. "An integrated land use-transport model for the Paris region (SIMAURIF): Ten lessons learned after four years of development." Documento de trabalho-Institut d'aménagement et d'urbanisme de la région Ile-de-France-IAURIF (não publicado).[Links] (2008).
[20] Stopher, Peter R., and Stephen P. Greaves. "Household travel surveys: Where are we going?." Transportation Research Part A: Policy and Practice 41, no. 5 (2007): 367-381
[21] Hassan, Mohammad Mehedy, Yongjin Joo, and Chulmin Jun. "A Review of the Development and Application of UrbanSim Integrated Land-Use and Transportation Model." International Journal of Urban Sciences 14, no. 3 (2010): 295-306..

Sagarkumar R. Meshram, Nilesh Shingne, "Urban Simulation modeling of Aurangabad City is regarding different types of model using OPUS (Open Platform for Urban Simulation)," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.157-163, 2015.

In today’s time the working of local government body is very important and to meet the requirement of the digitized society the local body also need to improve their working style. some of the responsibility of the local government body is to take care of the wear and tear in the city and to keep the city clean, As many of the cities in India are not fully digitized or aren’t smart cities yet where sensor and camera would find out the faults the cities are mostly depended on the citizen input as complaints for this work, But the current method for complaining is very tedious and time consuming, so most of the people just ignore the problem and try to live with it, so change this we have come up with online complaint system in which people can easily lodge their complaints from their phone instead of going to the respective office, they can also look what is the current status is of their complaints and what actions are been taken by the local government body, all they need to do is just take a picture of the problem and submit it to the local government body for actions with the details of the problem, So by this we can evolve from being a normal city to smart city in steps.

Complaint system ,Non-emergency ,Smart city,Urban areas,Local Goverment

[1] Diego López-de-Ipiña, Sacha Vanhecke, Oscar Peña, Tom De Nies and Erik Mannens, “Citizen-centric Linked Data Apps for Smart Cities”, Ubiquitous Computing and Ambient Intelligence. Context-Awareness and Context-Driven Interaction,Lecture Notes in Computer Science Volume 8276, 2013, pp 70-77..
[2] Daniel tumminelli o’brien ,”Citizen Connect :A smartphone Application that reduces “Broken windows””[2013].
[3] www.esri.com/news/arcuser/0111/files/citysourced.pdf.
[4] Benouaret, K.; Valliyur-Ramalingam, R.; Charoy, F., "CrowdSC: Building Smart Cities with Large-Scale Citizen Participation," Internet Computing, IEEE , vol.17, no.6, pp.57,63, Nov.-Dec. 2013.
[5] I Blecic,” Online Citizen Reporting on Urban Maintenance: A Collection, Evaluation and Decision Support System”,Eighth International Conference INPUT Smart City - Planning for Energy, Transportation and Sustainability of the Urban System, Naples, 4-6 June 2014,pp.15-25.
[6] Using Geographic Information Systems to Increase Citizen Engagement:
akgul.bilkent.edu.tr/egov/GIS-citizen-engagement-GanapatiReport.pdf
[7] Geographic Information Systems (GIS):
http://www.epa.gov/reg3esd1/data/gis.htm [Accessed: May. 16, 2015]
[8] Swapnil R.Rajput and K.V.Kale, "A Review Paper on GIS Web-System to Support Emergency Situations in Urban Areas and Provide Services", International Journal of Computer Sciences and Engineering, Volume-03, Issue-05, Page No (345-350), May -2015, E-ISSN: 2347-2693.
[9] Aurangabad Municipal Corporation (AMC): http://www.aurangabadmahapalika.org/complaint.jsp?id=14 [Accessed: May. 17, 2015].
[10] Citizen connect :Making Boston Beautiful http://www.cityofboston.gov/doit/apps/citizensconnect.asp [Accessed: feb. 20, 2015].
[11] Wikipedia:http://en.wikipedia.org/wiki/Aurangabad,_Maharashtra[Accessed: May. 17, 2015].
[12] Benjamin y.clark, Jeffrey L.Brudney, sung-Gheel jang “Coproduction of Government Services and the New Information Technology: Investigating the Distributional Basis” Public Adminstration Review ,Volume 73,Issue 5,Page No 687-701,sep-oct 2013.
[13] Jethro B. de Guzman, Ritz Carlo C. de Guzman, and Engr. Remedios G. Ado,” Mobile Emergency Response Application Using Geolocation for Command Centers”, International Journal of Computer and Communication Engineering, Vol. 3, No. 4, 2014,pp.235-238.
[14] Dipali B. Gaikwad, Yogesh W. Wanjari and Karbhari. V. Kale, “Accident Analysis System by Integration of Spatial Data Mining with GIS Web Services”, International Journal of Computer Applications, Volume 103, Issue.10, 2014, pp.15-22.
[15] http://fixmystreet.org/ [Accessed : may 16, 2015] .
[16] Designing Citizen Relationship management systems to cultivate good civic habits
[17] https://cordova.apache.org/ [Accessed : may 16, 2015].

Mohd Sohel Deshmukh, K.V.Kale, "Citizen Complaint System for Urban Maintenance Using GIS," International Journal of Computer Sciences and Engineering, Vol.3, Issue.7, pp.164-169, 2015.