iosr-JCE   Volume-17 ~ Issue-6 ~ Nov-Dec 2015

Abstract:The study and research in the field of networks MANETs depends alleged understand the protocols well of the simulation process before they are applied in the real world, so that we create an environment similar to these networks. The problem of a set of nodes connected with each other wirelessly, this requires the development of a comprehensive model and full and real emulator for the movement of the contract on behalf of stochastic models. Many models came to address the problems of random models that restricted the movement of decade barriers as well as the signals exchanged between them, but these models were not receiving a lot of light on the movement of the contract, such as direction, speed and path that is going by the node. The main goal is to get a comprehensive model and simulator for all parts of the environment of the barriers and obstacles to the movement of the nodes and the mobile signal between them as well as to focus on the movement transactions for the node of the direction, speed, and best way. . This research aims to provide a realistic mobility model for MANET networks. It also addresses the problem of imprecision in social relationships and the location where we apply Fuzzy logic.
Keywords: Mobility Model, Ad hoc Networks, Realistic, Fuzzy Logic

[1] Radhika Ranjan Roy (2011) "Handbook of Mobile Ad Hoc Networks for Mobility Models" Springer 2011, ISBN 978-1-4419-6048-1 [2] F. Bai, N. Sadagopan, A. Helmy, "The important framework for analyzing the impact of mobility on performance of routing for ad hoc networks", Ad Hoc Networks Journal - Elsevier Science, vol. 1, pp.383-403, Novomber, 2003
[3] Fuzzy Sets, Fuzzy Logic, Applications (Series on Advances in Mathematics for Applied Sciences), January 1, 1996, by George Bojadziev , Maria Bojadziev, ISBN-13: 978-9810223885 ISBN-10: 9810223889 [4] Apurva Sharma , Gurpreet, Jaswinder Singh (2013) " MOBILITY MODELS FOR MANET: MATHEMATICAL PERSPECTIVE", International Journal of Advanced Research in Engineering and Applied Sciences. ISSN: 2278-6252, Vol. 2, No. 5, May 2013
[5] Fan Bai, Ahmed Helmy, "A Survey of Mobility Modeling and Analysis in Wireless Adhoc Networks", Book Chapter in the book "Wireless Ad Hoc and Sensor Networks", Springer, October 2006, ISBN: 978-0-387-25483-8.

Abstract: The present era of globalization is based on knowledge and information as it directly affects the economic, social, cultural and political activities of all the regions of the world. Governments worldwide have realized the role that Information and Communication Technologies (ICT's) can play in socio-economic development and India is no exception to this. Majority of Indian population resides in rural areas and their isolation has restricted them from contributing to the national mainstream, adversely affecting the country's growth. Even after 60 years of independence, rural India has remained poor while the remaining country has developed by leaps and bounds.

[1]. Niraj Kumar Roy, "ICT Enabled Rural Education in India", International Journal of Information and Education Technology, Vol 2, No. 5, October 2012
[2]. Abdul Razaque, Har Baksh, Ghulam Mujtaba, Zulfikar Ahmed. "Information and Communication Technologies for Rural Development in developing countries", Journal of American Science 2013 ; 9(9)
[3]. Arathi Chitla. "impact of Information and Communication technology on Rural india", IOSR Journal of Computer Engineering, , ISSN : 2278-0661, Volume 3, Issue 2 (July –August 2012), Page 32-35
[4]. Charu Malhotra, V.M. Chariar, L. K. Das, P.V. Ilavarasan. "ICT for Rural development : An Inclusive Framework for e-Governance", CSI Publication
[5]. Ashwini Bodkurwar, Dr. Rajesh Kumar U. Sambhe. "Information Technology implementation for educational development of rural India", IOSR Journal of Computer Engineering, , ISSN : 2278-8727, Volume 17, Issue 2, Ver III(March –April 2015), Page 30-34
[6]. "Digital India", http://deity.gov.in/sites/upload_files/dit/files/Digital%20India.pdf

Abstract: The heuristic optimization techniques were commonly used in solving several optimization problems. The present work aims to develop a hybrid algorithm to solve the scheduling optimization problem of JSSP. There are different variants of these algorithms that were addressed in several previous works. The impacts of these two kinds (Genetic Algorithm (GA) and Simulated Annealing (SA) based optimization model) of initial condition on the performance of these two algorithms were studied using the convergence curve and the achieved makespan.

[1]. Aarts, E & Korst, J 1989, Simulated annealing and Boltzmann Machines, J.Wiley and Sons, Chichester.
[2]. Bandyopadhyay, S & Saha, S 2013, "Some Single- and Multiobjective Optimization Techniques‟, Unsupervised Classification, Springer-Verlag Berlin Heidelberg. [3]. Eswaramurthy, VP & Tamilarasi, A 2009, "Hybridization of Ant Colony OptimizationStrategies in Tabu Search for Solving JobShop Scheduling Problems‟, International Journal of Information and Management Sciences, vol. 20, pp. 173-189.
[4]. Evolutionary computing edited by Ben Paechter, Napier University, <http://www.metaheuristics.net>
[5]. Moraglio , H.M.M. Ten Eikelder, R. Tadei, "Genetic Local Search for Job Shop Scheduling Problem", Technical Report, CSM-435 ISSN 1744-8050
[6]. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys. - Sequencing and scheduling: Algorithms and complexity. - In: S.C. Graves, A.H.G. Rinnoy Kan and P. Zipkin, editors, Handbooks in Operations Research and Management Science 4, North- Holland, 1993.

Abstract: In the present days of e-commerce and social engineering the use of artificial intelligent system and data mining is one of the most relevant issue. Several investment sector giants use highly developed data mining procedure to serve the users in a better method. So, Risk factor calculation Algorithms are one of the most important topics in Data Science and Social Engineering.I have developed a web based system that will be fitted with huge amount of transaction data from the financial sectors of the current and the previous days. Now, according to the data from the database our system will be able to approximately guide the user whether he or she should go for that investment, and what is the risk factor about that particular investment.

The methodology section describes the implementation of the system in detail and the result section shows that the system is working as per our expectation.

Abstract:In the past two decades object oriented programming has become the dominant programming OOP paradigm used by application developers. Object oriented programming scales very well, from the most trivial of problems to the most complex tasks. It provides a form of abstraction that resonates with techniques people use to solve problems in their everyday life. Although the fundamental features of what we now call object-oriented programming were invented in the 1960's, object oriented languages really came to the attention of the computing public in the 1980's. Software producers rush to release object oriented versions of their products. Countless books and special issues of academic and trade journals have appeared on the subject.

[1]. Alexander Sergeev in http://32dayz.com/blog/961/
[2]. "App" voted 2010 word of the year by the American Dialect Society (UPDATED) American Dialect Society".
[3]. Ballard, P. Sams Teach Yourself JavaScript in 24 Hours, Fifth Edition. Hour 7. What is Object Oriented Programming (OOP)?. Pearson Education, Inc. United States. November, 2012.
[4]. Bhave, M. Object Oriented Programming with C++, Second Edition. Chapter 4. Object Orientation: An Introduction. Section 4.1. Programming Paradigms. Pearson Education. India. May, 2012.
[5]. Chatzigeorgiou and G. Stephanides. Evaluating Performance and Power of Object-Oriented Vs. Procedural Programming in Embedded Processors. In Ada-Europe 2002, 2002.

Abstract: This paper introduces the concept of Blind Deconvolution for restoration of a digital image and small segments of a single image that has been degraded due to some noise. Concept of Image Restoration is used in various areas like in Robotics to take decision, Biomedical research for analysis of tissues, cells and cellular constituents etc. Segmentation is used to divide an image into multiple meaningful regions. Concept of segmentation is helpful for restoration of only selected portion of the image hence reduces the complexity of the system by focusing only on those parts of the image that need to be restored. There exist so many techniques for the restoration of a degraded image like Wiener filter, Regularized filter, Lucy Richardson algorithm etc. All these techniques use prior knowledge of blur kernel for restoration process. In Blind Deconvolution technique Blur kernel initially remains unknown.

[1]. Image Segmentation and Various Segmentation Techniques – A Review By Binamrata Baral, Sandeep Gonnade, Toran Verma.
[2]. Study of Region Base Segmentation Method By Ku. Vasundhara H. Lokhande Digital Electronics,Babasaheb Naik College of Engg. Saint Gadage Baba Amravati University, India
[3]. Digital Image Processing By Prof. P.K. Biswas. IIT, Kharagpur.
[4]. Removing Blurring From Degraded Image Using Blind Deconvolution with Canny Edge Detection Technique By Mr. A. S. Mane* Prof. Mrs. M. M. Pawar E&TC Department, Solapur Univesity.
[5]. MRF-based Blind Image Deconvolution By Nikos Komodakis1 and Nikos Paragios Ecole des Ponts ParisTech, nikos.komodakis@enpc.fr Ecole Centrale de Paris, nikos.paragios@ecp.fr

Abstract: Epilepsy prediction is a vital demand for people suffering from epileptic onset. Prediction of seizure onsets could be very useful for drug-resistant epileptic patients. We propose an epileptic seizure prediction algorithm to predict an onset of epilepsy and discriminate between pre-seizure periods and seizure free periods. The proposed algorithm is based on entropy features of 60 (1 hour segmented into 60 periods) with free seizure periods and repeated for 24 hour, and 60 (pre-seizure periods) of the CHB-MIT Scalp EEG Database (Female less or equal 12 age). Critical values of the sample entropy and approximate entropy are estimated to locate starting of the seizure onset. These values are taken as warning to a probably seizure starts within a specific time. The prediction time in order of 1min- 49min is achieved in 60 seizure periods under study in this task. SVM is used to classify pre-seizure periods from seizure free periods for the mentioned data. The performance is evaluated and analysed.

Keywords : Epilepsy, Epilepsy Prediction, Sample Entropy, Approximate Entropy, Svm, Eeg Signals.

[1]. Khammari, Anwar: A Spectral Based Forecasting Tool of Epileptic Seizures, International Journal of Computer Science Issues, Vol. 9, Issue 3, No3, May 2012.
[2]. Lehnertz, K., et al.: State –of-the-art of seizure prediction, J Clin Neurophysiology, 24, pp.147-153, 2007
[3]. Jing Xiang et al.: Frequency and spatial characteristics of high-frequency neuromagnetic signals in childhood epilepsy, Epileptic Disord ; 11 (2), 2009.
[4]. Sivasankari N. and et al., : An extensive review of significant researchers on epileptic seizure detection and prediction using electroencephalographic signals, Advances in Biomedical Research, pp. 330-353, 2010
[5]. Leon D and et al.,: Adaptive Epileptic Seizure Prediction System, IEEE Transactions on Biomedical Engineering, Vol. 50, No. 5, May 2003.
[6]. Thomas Maiwald and et al.,: Comparison of three nonlinear prediction methods by means of the seizure prediction characteristic, Physica D 194, 357-368, 2004.

Abstract: Mobile Ad-hoc Network is a decentralized wireless network[1]. Here the mobile nodes make and break the links with the neighbouring nodes available in the radio range without actually being physically connected. These networks are temporary and keep on changing from time to time. MANET applications are getting importance in both civilian and military areas. MANETs can be applied in disaster communications and used as the backup network of traditional mobile communication networks as well. Network throughput, number of packets dropped and average latency are important parameters to evaluate the performance of wireless ad hoc network[3].

[1]. Wenye Wang, Xinbing Wang, and Arne A. Nilsson, "Energy-Efficient Bandwidth Allocation in Wireless Networks: Algorithms,
Analysis, and simulations".
[2]. The ns Manual (formerly ns Notes and Documentation). The Network Simulator, http://www.isi.edu/nsnam/ns
[3]. Mohammad Siraj & Soumen Kanrar, "Performance of Modeling wireless networks in realistic environment".
[4]. Kurose, Ross, "How To Misuse Aodv: A Case Study Of Insider Attacks Against Ad- Hoc Routing Protocols".
[5]. Brian Russell, "Maximizing Throughput in a SimulatedWireless Environment".
[6]. Bounpadith Kannhavong, Hidehisa Nakayama, Yoshiaka Nemoto, Nei Kato, and Abbas Jamalipour, "A survey of Routing Attacks
in Mobile Ad Hoc Networks".

Abstract: This paper is examining the VANET techniques by understanding the various papers published by the authors in IEEE transactions. In this paper the new technique is explored where no of the routing method is applied for connecting the nodes. But using the other information such as speed ,density,time,range and calculating the time required by the vehicle on the road of interests we can link them full time period of their run. We can use the standard frequency bands widths allocated by the Governments

Keywords: VANET; MANET; ADHOC Network; Routing; Link Time, RREQ packet; RF Packet etc.

[1]. Pradnya kamble ,she is a professor at PCE,Nagpur,and presently doing Ph.D. research in VANET systems
[2]. Dr. M.M. Kshirsagar, She is presently working as a Principal, SDMP, Nagpur. She has a versatile experience in teaching and management field

Abstract: There were many techniques for identifying duplicates in relational data, but only a few solutions focus on identifying duplicates which has complex hierarchical structure, as XML data. In this paper, we present a new technique for identifying XML duplicates, so-called XML duplication using Xpath. XML duplication using Xpath technique uses a Bayesian network to conclude the possibility that two xml elements are duplicates, based on the information within the elements and other information organized in the XML. In addition, to increase the proficiency of the web usage, a new pruning strategy was created.

[1] E. Rahm and H.H. Do, "Data Cleaning: Problems and Current Approaches," IEEE Data Eng. Bull., vol. 23, no. 4, pp. 3-13, Dec. 2000.

Abstract: Imprecise computation model is used in dynamic scheduling algorithm having heuristic function to schedule task sets. A task is characterized by ready time, worst case computation time, deadline and resource requirements. A task failing to meet its deadline and resource requirements on time is split into mandatory part and optional part. These sub-tasks of a task can execute concurrently on multiple cores, thus achieving parallelization provided by the multi-core system. Mandatory part produces acceptable results while optional part refines the result further. To study the effectiveness of proposed scheduling algorithm, extensive simulation studies have been carried out. Performance of proposed scheduling algorithm is compared with myopic and improved myopic scheduling algorithm.

[1] Handbook of Real-Time and Embedded Systems (Chapman & HallCrc Computer & Information Science Series), 2008.

[2] W, Zhao and K. Ramamritham, "Simple and Integrated Heuristic Algorithms for Scheduling Tasks with Time and Resource Constraints" J. Syst. Software, 1987.

[3] K. Ramamritham, J.A. Stankovic, and P.F. Shiah, "Efficient Scheduhng Algorithms for Real- Time Multiprocessor Systems", IEEE Trans. on Parallel and Disfribufed System, Vol.1, No.2, pp.184194, April, 1990.

[4] G Manimaran and C.S.R Murthy, "An Efficient Dynamic Scheduling Algorithm for Real-Time Systems", IEEE Trans. on Parallel and Distributed Systems, Vo1.9, No.3, pp.312-319, March, 1998.

[5] Yang Yuhai, Yu Shengsheng, " A new Dynamic Scheduling Algorithm for Real-Time Heterogeneous Multiprocessor Systems", Intelligent Information Technology Application, pp. 112-115, December 2007.

Abstract: Complex ensemble of shapes in an image is very difficult for segmentation. Hough transform is one of the robust algorithms for detecting geometric shapes in the images. The modification of this Hough transform is used for effecting way of segmenting images. By tuning the parameters of the circle detection model, extracting the concentric shapes is achieved. In this paper, we proposed an algorithm for finding the distance between the concentric closed shapes in an image. These achieved by splitting the image into four quadrants and apply the Hough transform for detecting the curves in each quadrant and finally combine the result of four quadrants and achieve the result.

Key-words: Hough Technique, dendrochronologydendroclimatology, edge detection, Gaussian filtering, tree ring.

[1]. FlurinBabst · M. Ross Alexander · Paul Szejner · Olivier Bouriaud · Stefan Klesse · John Roden · Philippe Ciais · Benjamin Poulter David Frank · David J. P. Moore · Valerie Trouet, A tree-ring perspective on the terrestrial carbon cycle,Springer-Verlag Berlin Heidelberg 2014, , published online 01- august 2014. [2]. Vikash Kumar, Dendroclimatology – Present and Future Prospects, Published by Tropical Forest Research Institute, Jabalpur, MP, India, july 2015 .
[3]. Mauricio Cerda1,3, Nancy Hitschfeld-Kahler1, and Domingo Mery2 1 Department of Computer Science, University of Chile, Blanco Encalada 2120, Santiago, Chile, Robust Tree Ring Detection, PSIVT 2007, LNCS 4872, pp. 575–585, 2007. c Springer-Verlag Berlin Heidelberg 2007. [4]. P.MeenakshiSundari, Dr.Britto Ramesh Kumar, An Approach for Dendroclimatology using image processing techniques, published by Published in: Computing and Communication Technologies (WCCCT), 2014 World Congress onFeb. 27 2014-March 1 2014.
[5]. FlurinBabst · M. Ross Alexander · Paul Szejner · Olivier Bouriaud · Stefan Klesse · John Roden · Philippe Ciais · Benjamin Poulter David Frank · David J. P. Moore · Valerie Trouet, A tree-ring perspective on the terrestrial carbon cycle, published online 01- august 2014, Springer-Verlag Berlin Heidelberg 2014.

Abstract:Unstructured data like doc, pdf is lengthy to search and filter for desired information. We need to go through every file manually for finding information. It is very time consuming and frustrating. We can use features of big data management system like Hadoop to organize unstructured data dynamically and return desired information. Hadoop provides features like Map Reduce, HDFS, HBase to filter data as per user input. Finally we can develop Hadoop Addon for content search and filtering on unstructured data.
Index Terms: Hadoop, Map Reduce, HBase, Content BasedRetrieval.

[1] Lars George, "HBase: The Definitive Guide", 1st edition, O'Reilly Media, September 2011, ISBN 9781449396107
[2] Tom White, "Hadoop: The Definitive Guide", 1st edition, O'Reilly Media, June 2009, ISBN 9780596521974
[3] Apache Hadoop HDFS homepage http://hadoop.apache.org/hdfs/
[4] MehulNalinVora ,"Hadoop-HBase for Large-Scale Data",InnovationLabs,PERC,ICCNT Conference
[5] YijunBei,ZhenLin,ChenZhao,Xiaojun Zhu ,"HBase System-based Distributed Framework for Searching Large Graph Databases",ICCNT Conference

Abstract: In conferences, the topics of interest for papers include variety of subjects, if the researcher wants to write a shared researched paper on specific subject with another researcher who is also interested in the same subject and wants to participate in the same conference, here the problem will arise especially when the topics of interest and number of researchers become large. The aim of the paper is to solve this problem by finding a suitable representation of researcher information of topics of interest that can be easily represented and then found shared researcher on the same topics of interest. Two proposed system algorithms are implemented to find the shared researchers in conference which gives an easy and efficient implementation.

Keywords: Binary vector, conference topics, decimal vector, researcher interesting topics.

[1]. Choi Seung-Seok, Cha Sung-Hyuk and Charles C. Tappert, Enhancing binary feature vector similarity measures. Pace University, 2005. [2]. Muja Marius and Lowe David G. Fast matching of binary features. Published in: Computer and Robot Vision (CRV). Ninth Conference on 28-30 May 2012. IEEE- Toronto, 2012.
[3]. Faro Simone and LECROQ Thierry, Efficient pattern matching on binary strings. CS.DS 15 Oct, 2008.
[4]. Choi Seung-Seok, Cha Sung-Hyuk and Charles C. Tappert, A survey of binary similarity and distance measures. Pace University, 2006.
[5]. Bin Zhang and Sargur N. Srihari, Properties of binary vector dissimilarity measures, 2003.

Abstract: Using Cloud Storage, users can remotely store their data and enjoy on-demand high quality applications and services. To ensure safety of stored data, it becomes must to encrypt data before storing in the global space. In cloud data, search arises only with plain data. But it is essential to invoke search with encrypted data. The specialty of cloud data storage is that it allows copious keywords in a solitary query and sorts the resultant data documents in relevance order.

[1] Jiadi Yu, Member, IEEE, Peng Lu, Yanmin Zhu, Member, IEEE, Guangtao Xue, Member, IEEE Computer Society, and Minglu Li, Toward Secure Multikeyword Top-k Retrieval over Encrypted Cloud Data IEEE Transactions On Dependable And Secure Computing, Vol. 10, No. 4, July/August 2013

[2] S. Ji, G. Li, C. Li, and J. Feng, Efficient interactive fuzzy keyword search. In Proc. of 18th International World Wide Web Conference(WWW‟09), Madrid, Spain. ACM, April 2009

[3] C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, "Secure Ranked Keyword Search over Encrypted Cloud Data", Proc. IEEE 30th Intl Conf. Distributed Computing Systems (ICDCS), 2010.

[4] A. Swaminathan, Y. Mao, G.-M. Su, H. Gou, A.L. Varna, S. He, M. Wu, and D.W. Oard, "Confidentiality- Preserving Rank-Ordered Search", Proc. Workshop Storage Security and Survivability, 2007.

[5] Sun-Ho Lee and Im-Yeong Lee,"Secure Index Management Scheme on Cloud Storage Environment" ,International Journal of Security and Its Applications Vol. 6, No. 3, July, 2012
[6] Craig Gentry" Fully Homomorphic Encryption Using Ideal Lattices" In the 41st ACM Symposium on Theory of Computing (STOC), 2009.

Abstract: A mobile botnet is a type of bot that runs automatically when installed on a mobile phone, which does not have any anti-malware. The botnet gains complete access over our mobile device. The common propagation medium for smartphone based botnet attacks are SMS, Bluetooth and Wi-Fi. In our project, we will demonstrate a SMS-cum-Wi-Fi based mobile botnet using a centralized C&C server. The botmaster initiates commands to C&C server and the C&C propagates to infected smartphones i.e. bots. We will try to develop a network which cannot be detected easily and propagates fast. The target of the propagation will be Android Operating System. For detection, an application is created to detect whether smartphone is working as bot or not. In this, we guide user about possible botnet attacks.

Keywords: Botnet , Botmaster , Smartphone , C&C , Bot , Attacks , Malware , Botnet Detection

[1] Prof. Sonali Tidke,Dr. Pravin Karde,International Journal of Advanced Research in Computer Science and Software Engineering,Volume 5, Issue 4, April 2015,ISSN: 2277 128X.
[2] Jingyu Hua ⋆ and Kouichi Sakurai,A SMS-Based Mobile Botnet Using Flooding Algorithm,Department of Informatics, Kyushu University, {huajingyu, sakurai}@itslab.csce.kyushu-u.ac.jp.
[3] Mrs. Sonali Tidke,International Journal of Advanced Research in Computer Science and Software Engineering,Volume 4, Issue 2, February 2014,ISSN: 2277 128X.
[4] Guining Geng, Guoai Xu, Miao Zhang, Yixian Yang ,Guang Yang,An improved SMS based heterogeneous mobile botnet model,Proceeding of the IEEE International Conference on Information and Automation Shenzhen, China June 2011
[5] Meisam Eslahi,Rosli Salleh,Nor Badrul Anuar,MoBots: A New Generation of Botnets on Mobile Devices and Networks, 2012 International Symposium on Computer Applications and Industrial Electronics (ISCAIE 2012), December 3-4, 2012, Kota Kinabalu Malaysia.

Abstract: The aim of image fusion is to mix images of a scene captured below totally different illumination. One image contains most of information from the whole supply images automatically. Contrast enhancement is employed to enhance the standard of visible image with none introducing unrealistic visual appearances. Fusion technique is employed for the important applications like medical imaging, microscopic imaging, remote sensing, and laptop vision and robotics. Contrast enhancement improves the brightness differences within the dark, gray or bright regions at the expense of the brightness differences within the alternative regions. During this paper methodology of the contrast enhancement for images that improves the local image contrast by controlling the local image gradient. The proposed methodology improves the improvement drawback and maximizes the local contrast and global contrast of an image.

[1] Gonzalez RC, Woods RE: Digital Image Processing Prentice Hall, Upper Saddle River, NJ; 2002
[2] Beghdadi A, Negrate AL: Contrast enhancement technique based on local detection of edges. Comput Visual Graph Image Process 1989
[3] Saleem1, Azeddine Beghdadi1and Boualem Boashash, Image fusion based contrast enhancement. Paris : Springer-Verlag, 2012
[4] Tang J, Peli E, Acton S: Image enhancement using a contrast measure in the compressed domain. IEEE Signal Process Lett 2003, 10(10):289-292
[5] Tang J, Kim J, Peli E: Image enhancement in the JPEG domain for people with vision impairment. IEEE Trans Biomed Eng 2004, 51(11):2013-2023
[6] Shivsubramani Krishnamoorthy, K P Soman. "Implementation and Comparative Study of Image Fusion Algorithms", IJCA (0975 – 8887) Volume 9– No.2, November 2010

Abstract: Face recognition is an important problem in many application domains. Matching sketches with digital face image is important in solving crimes and capturing criminals. It is a computer application for automatically identifying a person from a still image. Law enforcement agencies are progressively using composite sketches and forensic sketches for catching the criminals. This paper presents two algorithms that efficiently retrieve the matched results. First method uses multiscale circular Weber's local descriptor to encode more discriminative local micro patterns from local regions. Second method uses image moments, it extracts discriminative shape, orientation, and texture features from local regions of a face.

[1] Himanshu S. Bhatt, Samarth Bharadwaj Richa Singh, and Mayank Vatsa, ‖Memetically Optimized MCWLD for Matching Sketches With Digital Face Images,‖ in Proc. IEEE Transactions on information forensics and security, vol. 7, no. 5, october 2012, pp.1522-1535.
[2] J. Chen, S. Shan, C. He, G. Zhao, M. Pietikainen, X. Chen, and W. Gao, ―WLD—A robust local image descriptor,‖ IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 9, pp. 1705–1720, Sep. 2010.
[3] C. Geng and X. Jiang, ‖Face recognition using SIFT features,‖ in Proc. Int. Conf. Image Processing, 2009, pp. 3313-3316.
[4] Pushpa Gopal Ambhore and Lokesh Bijole, ‖Face Sketch to Photo Matching Using LFDA,‖International Journal of Science and Research (IJSR), 2014, pp.11-14.
[5] Surya Raj, and Navya Jose, ‖Digital Face Recognition Techniques for Matching with Sketches,‖ in Proc. IOSR Journal of Electronics and Communication Engineering, vol. 9, issue 2, Ver. IV (Mar - Apr. 2014), pp.20-36.

Abstract: This review is presented in three parts. The first part explains such terms as climate, climate change, climate change adaptation, remote sensing (RS) and geographical information systems (GIS). The second part highlights some areas where RS and GIS are applicable in climate change analysis and adaptation. Issues considered are snow/glacier monitoring, land cover monitoring, carbon trace/accounting, atmospheric dynamics, terrestrial temperature monitoring, biodiversity conservation, ocean and coast monitoring, erosion monitoring and control, agriculture, flood monitoring, health and disease, drought and desertification.

[1]. Abbas S. H., Srivastava R. K., Tiwari R. P. and BalaRamudu P. (2009) GIS-based disaster management: A case study for Allahabad Sadar sub-district (India). International Journal of Environmental Quality Management, Vol. 20 No. 1, pp. 33-51.
[2]. Adeniyi P. O. (2003): Integration of Remote Sensing and GIS for Agricultural Resource Management in Nigeria. EARSel Advances in Remote Sensing, vol. 2 (3), pp. 6-21.
[3]. Alvaro-Fuentesa J., Easter M., Cantero-Martinez C. and Paustian K. (2011): Modelling soil organic carbon stocks and their changes in the northeast of Spain. European Journal of Soil Science, 62, 685–695.
[4]. Anderson, M. and W. Kustas (2008), Thermal Remote Sensing of Drought and Evapotranspiration.Eos Trans., 89(26), 233.
[5]. Asner G. P., Clark J. K., Mascaro J., Vaudry R., Chadwick K. D., Vieilleden G., Rasamoelina M., Balaji A., Kennedy-Bowdoin T., Maatoug L., Colgan M. S. and Knapp D. E. (2012): Human and environmental controls over aboveground carbon storage in Madagascar. Carbon Balance and Management, 2012, 7:2.

Abstract: This paper suggests a navigation structure for visually impaired/blind people using A star algorithm. The proposed structure is consisted of two parts. In the first part planning the path and in the second part avoiding obstacles. The aim is to guidevisually impaired/blind people from a required location to a desired location. Two tests are run in each part and modeled in C sharp language and MATLABprogram. Simulation results show good performance for the proposed scheme that the visually impaired/blind people reach the desired location successfully without error.

[1]. Shah C., Bouzit M., Youssef M., and Vasquez L., ―Evaluation of RU-Netra Tactile Feedback Navigation System for the Visually
Impaired‖, International Workshop on Virtual Rehabilitation, pp. 72-77, 2006.
[2]. Hopper A. ―Sentient Computing?‖, Phil. Trans. R. Soc. Lond., A, (2000), Vol. 358, pp. 2349-2358, August 2000.
[3]. Hub A., Diepstraten J., Ertl T., ―Design and development of an indoor navigation and object identification system for the bli nd‖.
Assets '04 Proceedings of the 6th international ACM SIGACCESS conference on Computers and accessibility, pp. 147 - 152 ,
October 18 – 20, 2004.
[4]. Gardner J., ―Seeing with Other Senses: Gardens for the Blind‖. The Herb Companion, February 3, 2007.
http://www.perkins.org/news-events/press/seeing-with-other- senses.html, last visit November, 2015.

Abstract: The The automatic identification of Image processing techniques for abnormalities in retinal images. Its very importance in diabetic retinopathy screening. Manual annotations of retinal images are rare and exclusive to obtain. The ophthalmoscope used direct analysis is a small and portable apparatus contained of a light source and a set of lenses view the retina. The existence of diabetic retinopathy detected can be examining the retina for its individual features.

[1] Kinyoun, J., Barton, F., Fisher, M., Hubbard, L., Aiello, L., and Ferris, F., "Detection of diabetic macular edema. Ophthalmoscopy versus photography–Early Treatment Diabetic Retinopathy Study Report Number 5. The ETDRS Research Group." Ophthalmology 96, 746–750 (1989).
[2] Early Treatment Diabetic Retinopathy Study Research Group, "Early Photocoagulation for Diabetic Retinopathy: ETDRS report 9," Ophthalmology 98, 766–785 (1991).
[3] Raju Sahebrao Maher, Sangramsing N. Kayte, Sandip T. Meldhe, Mukta Dhopeshwarkar, "Automated Diagnosis Non-proliferative Diabetic Retinopathy in Fundus Images using Support Vector Machine" International Journal of Computer Applications (0975 – 8887)Volume 125 – No.15, September 2015.
[4] Dura, E., Zhang, Y., Liao, X., Dobeck, G. J., and Carin, L., "Active learning for detection of mine-like objects in side-scan sonar imagery," IEEE Journal of Oceanic Engineering 30(2), 360–371 (2005).

Abstract: Determine the sentiment of sentence that is positive or negative based on the presence of part of speech tag, the emoticons present in the sentences. For this research we use the most popular microblogging sit twitter for sentiment orientation. In this paper we want to extract tweets form the twitter related to the product like mobile phones, home appliances, vehicle etc. After retrieving tweets we perform some preprocessing on it like remove retweets, remove tweets containing few words with minimum threshold of length five, remove tweets containing only urls.

[1] Po-Wei Liang and Bi-Ru Dai. Opinion Mining on Social Media Data, DOI 10.1109/MDM. 2013.73, 978-0-7695-4973-6/13 © 2013 IEEE.
[2] Apoorv Agarwal, Boyi Xie, Ilia Vovsha, Owen Rambow, and Rebecca Passonneau. 2011. Sentiment analysis of twitter data. In Proceedings of the Workshop on Languages in Social Media, pages 30–38. Association for Computational Linguistics.
[3] Go, A., Huang, L., Bhayani, R.: Twitter sentiment classification using distant supervision. In: CS224N Project Report, Stanford (2009).
[4] Alexander Pak and Patrick Paroubek. 2010. Twitter as a corpus for sentiment analysis and opinion mining. Proceedings of LREC.
[5] B. Pang, L. Lee, and S. Vaithyanathan. Thumbs up? Sentiment classification using machine learning techniques. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 79–86, 2002.
[6] P. Turney. Thumbs Up or Thumbs Down? Semantic Orientation Appliedto Unsupervised Classification of Reviews. ACL'02, 2002.
[7] S. Kim and E. Hovy. Determining the Sentiment of Opinions.COLING'04, 2004.