iosr-JCE   Volume-17 ~ Issue-2 ~ March-April 2015

Abstract: Exchange rate forecasting has become a new research topic in present time for best market strategy, planning of investment for investor in foreign project and also for business profit. The methods or process which give the accurate forecasting result are not easy because there are several types of forecasting methods. Exchange Rate Forecasting is most important financial topic for individual investor, stock fund manager, financial analyst for their investment and stock market. Forecasting is to predict the future value of a particular field with the help of previous value or history.

[1]. Alizadeh, M. , Rada, R., Balagh , A.K.G, Esfahani, M. M. S., "Forecasting Exchange Rates: A Neuro-Fuzzy Approach" in International Fuzzy System Association and European Society for Fuzzy Logic and Technology, (IFSA-EUSFLAT) 2012, pp.1745-1750
[2]. Perwej, Y., Perwej,A., "Forecasting of Indian Rupee(INR)/US Dollar(USD) Currency Exchange Rate Using Artificial Neural Network" in International Journal of Computer Science, Engineering And Application(IJCSEA) vol.2, No.2, April 2012, pp.41-52
[3]. Rout, M., Majhi , B. , Majhi , R., Panda, G. "Forecasting of currency exchange rates using an adaptive AMRA model with differential evolution based training" in Journal of King Saud University-Computer and Information Science, 2014 , pp.7-18
[4]. Zhang,G P., Berardi,V L., "Time series forecasting with neural network ensembles: an application for exchange rate prediction" in Journal of the Operational Research Society, 2001, pp.652-664.
[5]. Khashei , M., Bijari , H., "Exchange rate forecasting better with Hybrid Artificial Neural Networks Model" in Journal of Mathematical and Computational Science, Vol 1, No 1, 2011, pp.103-125
[6]. Chang, J.F., Hsiao, C.T., Tsai , P.W., "Using Interactive Bee Colony to Forecast Exchange Rate" in International Conference on Robot, Vision And Signal Processing, 2013. pp. 133-136

Abstract: Breast cancer is the most commonly observed cancer in women both in the developing and the developed countries of the world. The survival rate in it has improved over the past few years with the development of effective diagnostic techniques and improvements in treatment methodologies. About 1 in 8 U.S. women (about 12%) will develop invasive breast cancer over the course of lifetime. In 2014, an estimated 232,670, new cases of invasive breast cancer were expected to be diagnosed in women, along-with 62,570 new cases of non-invasive (in situ) breast cancer. By using mammogram image classification.

[1]. BrijeshVerma and Ping Zhang."A novel neural-genetic algorithm to find the most significant combination of features in digital mammograms", Applied Soft Computing, no.7, pp.513-525, 2007.
[2]. H.S.SheshadriandA.Kandaswamy,"Experimental investigation on breast tissue classification based on statistical feature extraction of mammograms", Computerized Medical Imaging and Graphics, no.31, pp.46-48, 2007.
[3]. Ali Keles, AyturkKeles and UgurYavuz,"Expert system based on neuro-fuzzy rules for diagnosis breast cancer", Experts Systems with Applications, pp.5719-5726, 2011.
[4]. M.Vasantha. DR, V.Subbiahbharathi and R.Dhamodharan,"Medical Image Feature, Extraction, Selection and Classification", International Journal of Engineering Science and Technology Vol. 2(6), pp. 2071- 2076, 2010.
[5]. Mohammed J.Islam, MajidAhamadi and Maher A.Sid-Ahmed, "An efficient automatic mass classification method in digitized mammograms using artificial neural network", Vol.1, No.3, 2010.

Abstract: Vigenère cipher is one of the polyalphabetic substitution ciphers. Its weakness is the key repetition. To overcome this weakness there are many researchesgoing on to modify the key generation. In this paper a key generator function isimplemented with C++. Itgenerates a key with length depends on the message security level.This level is determined by the sender of the message, according to the security importance of the message. The security level determines the key length, which is a ratio from the plain-text message. This ratio varies from 10% to 100% from the plain-text length. This paper studies the effect of varying the key length on the performance of Vigenère cipher andits frequency analysis attack. When the key length increases the encryption and decryption time increases, the frequency analysis attack becomes more difficult and also the confusion is increased.

Keywords –Vigenère cipher, poly-alphabetic cipher, substitution cipher, Index of Coincidence, Kasiski-test, varying key-length.

[1]. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography(CRC Press Inc.1996).
[2]. Bruce Schneier,Applied Cryptography: Protocols, Algorithms, and Source Code in C(2nd Edition, John Wiley & Sons, 1996).
[3]. Miles E. Smid and Dennis K. Branstad, the data encryption standardPast and future(IEEE, 1992).
[4]. http://user.it.uu.se/~olgag/Cryptology/Vigenère.html
[5]. http://en.wikipedia.org/wiki/Substitution_cipher
[6]. William Stallings, cryptography and network security(5th edition, Prentice Hall, USA, 2010).

Abstract: An A MANET(Mobile Ad-Hoc NETwork)is a network of wireless mobile nodes,without a centralized control.MANET can be characterized as unstructured Ad-Hoc,mobile nodes with limited resources including energy.AODV is one of the most popular,widely accepted and researched reactive protocol of MANET.AODV doesn't consider the residual energy and local situation of the nodes while route selection.So,sometimes the choosen route gets fail because either the node starts acting selfishly(because of their low energy) or the node gets disconnected(because of battery life). To analyse this problem,in this paper, authors have studied in detail role of the nodein a communication for AODV protocol i.e source,intermediate and destination.The goal of this work is to find out where are the chances of energy being more consumed.Either as source or intermediate or as destination.For this NS-2 simulator has been used.The simulator study/research can concluded that intermediate node consume more energy.

Keyword: MANET, AODV ,Route Discovery, Route Maintenance ,intermediate node,Reactive, Proactive,Hybrid, RREQ, RREP, RRER,

[1]. Perkins, "Ad hoc on-demand distance vector (AODV)routing",RFC3561,July2003.
[2]. P. S. Karadge, Dr.S.V.Sankpal, "A Performance Comparison of Energy Efficient AODV Protocols Mobile Ad hoc Networks", International Journal of Advanced Research in Computer and Communication Engineering Vol.2, Issue1, January2013
[3]. Anjum Asma1, Gihan Nagib2, "Energy Efficient Routing Algorithms for Mobile Ad Hoc Networks –A Survey", Web Site: www.ijettcs.org Email: editor@ijettcs.org, Volume 1, Issue3,September–October2012.
[4]. R.Rajeshkanna, Dr.A.Saradha, "Energy Efficient Enhanced AODV Routing Protocol for maximize the lifetime of Mobile Ad hoc Networks", IJCTA et al, Int.J.Computer Technology & Applications,Vol 4 (5),856-863
[5]. C E Perkins and E M Royer "Ad Hoc On Demand Distance Vector (AODV) Routing draft-ietf-manet aodv-txt" 02-Nov (work in progress)

Abstract: security of the data on internet can be obtained by the steganography. It is combination of science and art for hiding the data or information in cover medium. So, that observer cannot arouse suspicious. In this regards Discrete Wavelet Transform (DWT) plus adaptive quantization are the effective tools for enhancing the cover media visual quality and hence attracts much attention in recent years. In this paper the steganography technique which embeds the secret messages in frequency domain after DWT and adaptive quantization. To improve steganography parameters such as embedding capacity and visual quality of cover media. Here, embedding capacity changes over techniques and quality can be measured with Peak Signal Noise Ratio (PSNR) and Human Visual System (HVS). Keywords: Steganography,Watermarking, DWT, HVS, PSNR, Adaptive Quantization

[1]. V Padmanabha Reddy and Dr. S. Vardharajan "Human Visual System Sentient Imperceptible and Efficient Wavelet-Based Watermarking Scheme for Copyright Protection of Digital Images", IJCSNS Vol. 9 No. 4 April, 2009.
[2]. J. Fridrich, M. Goljan, and R. Du, "Detecting LSB steganography in color and gray-scale images," IEEE Multimedia, Special Issue on Security, vol. 8, no. 4, pp. 22–28, Oct./Dec. 2001.
[3]. S. Dumitrescu, X.Wu, and Z.Wang, "Detection of LSB steganography via sample pair analysis," IEEE Trans. Signal Process., vol. 51, no. 7, pp. 1995–2007, Jul. 2003.
[4]. J. Fridrich and M. Goljan, "On estimation of secret message length in LSB steganography in spatial domain," in Proc. SPIE, Security, Steganography, and Watermarking of Multimedia Contents VI, E. J. Delp, III and P. W. Wong, Eds., San Jose, CA, 2004, vol. 5306, pp. 23–34.
[5]. Sagar G and B. B. Amberkar "A DCT Based Near Reversible Data Embedding scheme for MPEG-4 Video", Springer Fourth International Conference on Signal and Image Processing 2012 (ICSIP 2012), India.

Abstract: This study is to analyze and identify solutions for software degeneration lifecycle. A software runs on multiple platforms (Operating Systems) these days and makes use of their resources which communicate directly with the hardware. It is, at the time of installation, in its most critical and vulnerable state because at that moment, it is dealing the system files which were created or configured with latter. Hence, a software is likely and most probable to degenerate at this stage. So, in a mechanism where the application state can be saved during its update and installation would act as a rescue measure if the software degeneration happens during the same.

[1]. https://www.tele-task.de/archive/podcast/9186/ [2]. Operating System Concepts: by Avi Silberschatz, Peter Galvin, Greg Gagne [3]. Guide to Software Development: Designing and Managing the Life Cycle by Arthur M. Langer [4]. Operating System: A Design-oriented Approach by Charles Crowley [5]. A Brief Introduction to Software Development and Quality Assurance Management
[6]. by Steven C. Shaffer

Abstract: Requirement engineering is the first phase for the development of any software. Software have been discarded due to poor and ambiguous requirements. This study based on the results of surveys conducted to the professionals that have industrial experience in development of software. Numerous investigations carried for the identification of factors cause of poor requirement. These factors have deep effects on productivity and communication among the individuals involved in software development. The qualitative and quantitate research techniques were adopted to carried out this work. This research examined how cultural barrier (e.g., language, attitudes, roles, social organization, and time) affect the communication process in software development projects. The study showed that language and attitudes as dominant factors for communication that impact software productivity. Time, roles, and social organization had less influence. Also various cultures have different attitudes and behaviors, which in turn have distinct impacts on productivity in terms of more rework and delay.

Keywords: Requirement engineering, Problems in requirement engineering, Cultural factors affecting requirement engineering

[1]. J.M.C. Gea, J. Nicolás.,J. L. F. Alemán,and A. oval, A. Vizcaíno, Reusing Requirements in Global Software engineering. Department of Informatics / MOBIS, University of Hamburg.2013. 171-197.
[2]. A. Haroon, and S. Sahibuddin, The Strength and Weakness of Requirement Engineering (RE)Process.2nd International Conference on Computer Technology and Development (ICCTD), 3 (12) ,2010, 56-59.
[3]. H. Deresky, International Management: Managing Across Borders and Cultures. United States of America, Addison-Wesley, 2007.
[4]. T.Hall, S. Beecham and A. Rainer,Requirements problems in twelve software companies : an empirical analysis, IEEE Proceedings online , 49(5) , 2002, 153-160.
[5]. T.Javed, M. Maqsood and Q . Durrani, A Survey to Examine the Effects of Team Communication on Job Satisfication in Software Industry. ACM SIGSOFT,29(2), 2004, 50-55.
[6]. I. Perera , Impact of Poor Requirement Engineering in Software Outsourcing: A Study on Software Developer's Experience. Int. J. of Computers, Communications & Control, 6(2), 2011, 337-348.

Abstract: Nowadays stack of biological data growing steeply, so there is need of smart way to handle and process these data to extract meaningful information related to biological life. The purpose of this survey is to study various parallel models which perform alignment of the sequences as fast as possible, which is a big challenge for both engineer and biologist. The various parallel models discussed in this paper are: implementation using associative massive parallelism contain architecture such as associative computing, ClearSpeed coprocessor and Convey Computer. Some parallel programming models such as MPI, OpenMP and hybrid (combination of both). Then the implementation of alignment using systolic array and lastly uses single and multi-graphics processors, that is, using graphics processing units.

Keywords: ASC, MTAP, PE, recursive variable expansion, Smith Waterman Algorithm, SIMD, scoring matrix.

[1]. S. Steinfadt, J.W. Baker, SWAMP: Smith–Waterman using associative massive parallelism, International Symposium on Parallel and Distributed Processing, 2008, 1–8.
[2]. S. Steinfadt, Fine-grained parallel implementations for SWAMP+ Smith–Waterman alignment, Parallel Computing, 39(12), 2013, 819-833.
[3]. Potter, J. W. Baker, S. Scott, A. Bansal, C. Leangsuksun, and C. Asthagiri, ASC: an associative-computing paradigm, Computer, 27 (11), 1994, 19-25.
[4]. M. Farrar, Striped Smith-Waterman speeds database searches six times over other SIMD implementations, Bioinformatics, 23(2), 2007, 156–161.
[5]. L. Hasan and Z. Al-Ars, An efficient and high performance linear recursive variable expansion implementation of the Smith-Waterman algorithm, Proc. Annual International Conference of the IEEE Engineering in Medicine and Biology Society, The Netherlands, 2009, 3845–3848.

Abstract: This paper present a combined method for image inpainting. Inpainting is the art of modifying an image in a visually plausible manner so that it seems reasonable to the human eye. There are numerous and very different approaches to tackle the inpainting problem, these are based upon one the following basic techniques: copy-and-paste texture synthesis, geometric partial differential equations (PDEs), coherence among neighboring pixels, and exemplar based inpainting. We combine these techniques in a variational model, and provide a working algorithm for image inpainting trying to approximate the minimum of the proposed energy functional and its also helpful for video inpainting of stationary back ground by considering the temporal coherence among frames. So obviously say that the combination of all terms of the proposed energy works better than taking each term separately.

Keywords: Image inpainting, texture synthesis, partial differential equations (PDEs), coherence, variational models.

[1]. Aurelie Bugeau, Marcelo Bertalmío, Vicent Caselles, "A Comprehensive Framework for Image Inpainting," IEEE Trans. Image processing, vol.19.NO. 10, Oct.2010.
[2]. A. Efros and T. Leung, "Texture synthesis by non-parametric sampling," in Proc. IEEE Int. Conf. Computer Vision, 1999, vol. 2, pp.1033–1038.
[3]. L. Demanet, B. Song, and T. Chan, "Image inpainting by correspondence maps: a deterministic approach," UCLA CAM R, Tech. Rep. 03-04, Aug. 2003.
[4]. S. Masnou and J. M. Morel, "Level lines based disocclusion," in Proc. IEEE Int. Conf. Image Processing, 1998, pp. 259–263.
[5]. S. Masnou, "Disocclusion: A variational approach using level lines," IEEE Trans. Image Process., vol. 11, no. 2, pp. 68–76, Feb. 2002.
[6]. Y. Wexler, E. Shechtman, and M. Irani, "Space-time video completion,"IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 3, pp.1463–476, Mar. 2007.

Abstract: There are many situations in which two or more agents (e.g., human or computer decision makers) interact with each other repeatedly in settings that can be modeled as repeated stochastic games. In such situations, each agent's performance may depend greatly on how well it can predict the other agents' preferences and behavior. For use in making such predictions, we adapt and extend the Social Value Orientation (SVO) model from social psychology, which provides a way to measure an agent's preferences for both its own payoffs and those of the other agents.

[1]. T.-C. AU AND D. NAU, 'IS IT ACCIDENTAL OR INTENTIONAL? A SYMBOLIC APPROACH TO THE NOISY ITERATED PRISONERS DILEMMA', THE ITERATED PRISONERS' DILEMMA: 20 YEARS ON, 4, 231, (2007).
[2]. S. Bogaert, C. Boone, Declerck, and C. Declerck, 'Social value orientation and cooperation in social dilemmas: A review and conceptual model', Brit. Jour. Social Psych., 47(3), 453–480, (September 2008).
[3]. Colin F Camerer, Teck-Hua Ho, and Juin-Kuan Chong, 'Sophisticated experience-weighted attraction learning and strategic teaching in repeated games', Journal of Economic Theory, 104(1), 137–188, (2002).
[4]. Ananish Chaudhuri, Sara Graziano, and Pushkar Maitra, 'Social learning and norms in a public goods experiment with inter-generational advice', The Review of Economic Studies, 73(2), 357–380, (2006).

Abstract: It is observed that users tend to like and follow a particular type music/movies based on their social interests. Users like music of particular artists, album; movies/TV shows of a particular actor, director, genre, etc. Generally, peer-to-peer networks do not use this vital information to perform effective search using the metadata of media files. This information can be used to create social profile of users and cluster the peers based on their interests as reflected in the social profiles. This clustering of users over a peer-to-peer network will help in finding the users their interested files more easily. Also, peer-to-peer networks usually flood the entire network to search a particular file. But, due to clustering of peers based on their social interest, there is no need to flood the entire network to find a particular file, as most of the times the required file will be found in the cluster itself, which will in turn reduce the network overhead. We simulated this system using JXTA to connect the peers after clustering over P2P network. The peers with similar social profiles were connected via a common communication channel and therefore the results were better than the normal P2P network.

Keywords: clustering,media, peer-to-peer, sharing, similarity

[1]. Kate Ching-Ju Lin, Chun-Po Wang, Cheng-Fu Chou, and LeanaGolubchik, "SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks"
[2]. Ching-Ju Lin, Shuo-Chan Tsai, Yi-Ting Chang and Cheng-Fu Chou, "Enabling Keyword Search and Similarity Search in Small-World-based P2P Systems"
[3]. Practical JXTA,Cracking the P2P puzzle DawningStreamsInc
[4]. JXTA in a Nutshell, O'Reilly
[5]. OMDB API, http://omdbapi.com/
[6]. JAudioTagger,http://www.jthink.net/jaudiotagger/