Volume-3 , Issue-8 , Aug - 2015 Go Back

In these days many people are using e-commerce market for online shopping like example: Flip kart, Amazon and etc. With huge demand in-shopping or increasing popularity of online shopping security issues of debit, credit and personnel information has been raised. This project presents a new approach for providing restricted or limited information that’s only necessary for fund transfer during online transaction with this we are reducing the entering detailed information of customer like card number, CVV and etc. And this project or approach uses combined application of LSB based steganography and visual cryptography. In this project first we encrypt the user or customer credentials in an image by using LSB Steganography process and then we use visual cryptography to divide an image into two shares. Reverse visual cryptography is applied to get an original image and data is retrieved from image and sent to the bank for verification of legitimate user if user is valid the fund will be transferred to the merchant. A quick development in E-Commerce business sector is seen in late time all through the world. With steadily expanding prominence of internet shopping, Debit or Credit card misrepresentation and individual data security are significant attentiveness toward clients, dealers and banks particularly on account of CNP (Card Not Present). This paper displays another methodology for giving restricted data just that is vital for store exchange amid web shopping subsequently defending client information and expanding client certainty and forestalling wholesale fraud. The system uses joined utilization of steganography and visual cryptography for this reason.

Online Shopping(E-Commerce),IdentityTheft,LSB Stegnography and VisualCryptography

[1] Fridrich, J., Goljan, M. and Du,R, Reliable Detection of LSBSteganography in Color and Grayscale Images, Proceedings of ACM Workshop on Multimedia and Security,Ottawa, October 5, 2001, pp.27-30.
[2] Jaya, Siddharth Malik, Abhinav Aggarwal, Anjali Sardana, “Novel Authentication System Using Visual Cryptography,” Proceedings of 2011 World Congress on Information and Communication Technologies, pp. 1181-1186, Mumbai, India, 2011.
[3] K. Thamizhchelvy, G. Geetha, “E-Banking Security: Mitigating Online Threats Using Message Authentication Image (MAI) Algorithm,” Proceedings of 2012 International Conference on Computing Sciences (ICCS), pp. 276 – 280, 2012.
[4] Sathiamoorthy Manoharan, an empirical analysis of rs steganalysis,proceedings of the third international conference on internet monitoring and protection, ieee computer society washington, 2008
[5] Shailendra M. Pardeshi, Sandip R. Sonawane, Vipul D. Punjabi, Puja Saraf,” A Survey on compound use of Cryptography and Steganoghaphy for Secure Data Hiding,” International Journal of Emerging Technology and Advanced Engineering (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 10, October 2013)
[6] Souvik Roy, P.Venkateswaran,2014 IEEE Students’ Conference on Electrical, Electronics and Computer Science 978-1-4799-2526-1/14/$31.00 ©2014 IEEE Online Payment System using Steganography and Visual Cryptography.
[7] Usha B A, Srinath N K, Narayan K, Sangeetha K N,” A Secure Data Embedding Technique In Image Teganography For Medical Images,” International Journal Of Advanced Research In Computer And Communication Engineering Vol. 3, Issue 8, August2014.

Vinod. L. B and Nithyanada. C. R, "Visual Cryptographic Authentication for Online Payment System," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.109-114, 2015.

Stemming algorithms are used to convert the words in text into their grammatical base form, and are mainly used to increase the Information Retrieval System’s efficiency. Several algorithms exist with altered techniques. The most widely used is the Porter Stemming algorithm. However, it still has several drawbacks, although many attempts were made to improve its structure. This paper discloses the inaccuracies encountered during the stemming process and proposes the corresponding solutions.

Stemming, stop word, Text mining, NLP, IR

[1] Porter M.F. “An algorithm for suffix stripping” Program. 1980; 14, 130.
[2] Porter M.F. “Snowball: A language for stemming algorithms”. 2001
[3] Eiman Tamah Al-Shammari “Towards An Error-Free Stemming”, in Proceedings of ADIS European Conference Data Mining 2008, pp. 160-163.
[4] “A Survey on various stemming algorithms” International Journal of Computer Engineering In research trends(IJCERT), VOLUME 2, ISSUE 5, May 2015, PP 310-315
[5] Frakes W.B. “Term conflation for information retrieval”. Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval. 1984, 383-389.
[6] Frakes William B. “Strength and similarity of affix removal stemming algorithms”. ACM SIGIR Forum, Volume 37, No. 1. 2003, 26-30.
[7] M. Nithya, “Clustering Technique with Porter stemmer and Hyper graph Algorithms for Multi-featured Query Processing”, International Journal of Modern Engineering Research (IJMER), Vol.2, Issue.3, pp-960-965, May-June 2012
[8] Galvez Carmen and Moya-Aneg•n F˜lix. “An Evaluation of conflation accuracy using finite-state transducers”. Journal of Documentation 62(3). 2006, 328-349
[9] J. B. Lovins, “Development of a stemming algorithm,” Mechanical Translation and Computer Linguistic., vol.11, no.1/2, pp. 22-31, 1968.
[10] Harman Donna. “How effective is suffixing?” Journal of the American Society for Information Science. 1991; 42, 7-15 7.
[11] Funchun Peng, Nawaaz Ahmed, Xin Li and Yumao Lu. “Context sensitive stemming for web search”. Proceedings of the 30th annual international ACMSIGIR conference on Research and development in information retrieval. 2007, 639-646.
[12] R. Sun, C.-H. Ong, and T.-S. Chua. “Mining Dependency Relations for Query Expansion in Passage Retrieval”. In SIGIR, 2006.
Kjetil , Randi, “News Item Extraction for Text Mining in Web Newspapers” WIRI’05,IEEE ,2009

Sundar Singh and R K Pateriya, "Enhanced Suffix Stripping Algorithm to Improve Information Retrieval," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.115-119, 2015.

Huge data is the term on the other hand an accumulation of data sets which are expansive also, complex, it contain organized also, unorganized both sort of data. Data comes from everywhere, sensors utilized to gather climate information, posts to social media sites, digital pictures also, and videos and so forth this data is known as enormous data. Useful data can be extracted from this enormous data with the help of data mining. Data mining is a system on the other hand discovering interesting designs as well as descriptive, understand capable models from expansive scale data. In this paper we overviewed sorts of enormous data also, challenges in enormous data on the other hand future.

Huge data, Data mining, Hace theorem,3V’s,Privacy

[1] Hessling, Hermann “[Keynote Speaker-2] Challenges in Handling and Processing Huge Data” Published in:Artificial Intelligence, Modelling and Simulation (AIMS), 2014 2nd International Conference on Date of Conference: 18-20 Nov. 2014
[2] Yuan Ye ; Sch. of Bus. Inf. Manage., Shanghai Univ. of Int. Bus. & Econ., Shanghai, China” A Data Extraction Algorithm for Huge Data Visualization Based on Computational Meshes” Published in:Management of e-Commerce and e-Government (ICMeCG), 2014 International Conference on Date of Conference:Oct. 31 2014-Nov. 2 2014
[3] Feng Hu ; Wang, Guoyin “ Huge Data Mining Based on Rough Set Theory and Granular Computing” Published in: Web Intelligence and Intelligent Agent Technology, 2008. WI-IAT '08. IEEE/WIC/ACM International Conference on (Volume:3 )Date of Conference:9-12 Dec. 2008
[4] Fazio, M. ; Fac. of Eng., Univ. of Messina, Messina, Italy ; Paone, M. ; Puliafito, A. ; Villari, M. “Huge amount of heterogeneous sensed data needs the cloud” Published in: Systems, Signals and Devices (SSD), 2012 9th International Multi-Conference onDate of Conference: 20-23 March 2012
[5] Chao-Tung Yang ; Dept. of Comput. Sci., Tung[12hai Univ., Taichung, T"aiwan ; Wen-Chung Shih ; Guan-Han Chen ; Shih-Chi Yu “Implementation of a Cloud Computing Environment for Hiding Huge Amounts of Data” Published in:Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on Date of Conference: 6-9 Sept. 2010
[6] Wang, Guoyin ; Inst. of Comput. Sci. & Technol., Chongqing Univ. of Posts & Telecommun., Chongqing Jun Hu ; Qinghua Zhang ; Xianquan Liu “Granular computing based data mining in the views of rough set and fuzzy set” Published in:Granular Computing, 2008. GrC 2008. IEEE International Conference on Date of Conference: 26-28 Aug. 2008
[7] Lei Xu ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Chunxiao Jiang ; Jian Wang ; Jian Yuan “Information Security in Big Data: Privacy and Data Mining” Published in:Access, IEEE (Volume:2 ) Date of Publication :09 October 2014
[8] Shen Bin ; Ningbo Inst. of Technol., Zhejiang Univ., Ningbo, China ; Liu Yuan ; Wang Xiaoyi” Research on data mining models for the internet of things” Published in:Image Analysis and Signal Processing (IASP), 2010 International Conference on Date of Conference: 9-11 April 2010
[9] Refonaa, J. ; Dept. of Comput. Sci. & Engineeering, Sathyabama Univ., Chennai, India ; Lakshmi, M. ; Vivek, V. “Analysis and prediction of natural disaster using spatial data mining technique” Published in:Circuit, Power and Computing Technologies (ICCPCT), 2015 International Conference on Date of Conference:19-20 March 2015
[10] Nestorov, S. ; Dept. of Comput. Sci., Chicago Univ., IL, USA ; Jukic, N. “Ad-hoc association-rule mining within the data warehouse” Published in System Sciences, 2003. Proceedings of the 36th Annual Hawaii International Conference on Date of Conference: 6-9 Jan. 2003
[11] Xindong Wu ; Sch. of Comput. Sci. & Inf. Eng., Hefei Univ. of Technol., Hefei, China ; Xingquan Zhu ; Gong-Qing Wu ; Wei Ding “Data mining with big data” Published in: Knowledge and Data Engineering, IEEE Transactions on (Volume:26 , Issue: 1 ) Date of Publication : 26 June 2013
[12] Wu, X. ; University of Vermont, Burlington ; Chen, H. ; Wu,G. ; Liu,J. more authors “Knowledge Engineering with Big Data” Published in Intelligent Systems, IEEE (Volume:PP, Issue: 99 ) Date of Publication : 13 July 2015
[13] Xiongyan Li ; State Key Lab. of Pet. Resource & Prospecting, China Univ. of Pet., Beijing, China ; Hongqi Li ; HeXu ; ZhouJinyu more authors “Task-driven data mining in the formation evaluation field” Published in:Advanced Information Management and Service (IMS), 2010 6th International Conference on Date of Conference: Nov. 30 2010-Dec. 2 2010
[14] Zhang Yun ; Inst. of Comput. Sci., Northwestern Polytech. Univ., Xi''an, China ; Li Weihua ; Chen Yang “The Study of Multidimensional-Data Flow of Fishbone Applied for Data Mining” Published in: Software Engineering Research, Management and Applications, 2009. SERA '09. 7th ACIS International Conference on Date of Conference: 2-4 Dec. 2009
[15] Nirkhi, S. ; Dept. of Comput. Sci., G.H.Raisoni Coll. of Eng., Nagpur, India “Potential use of Artificial Neural Network in Data Mining” Published in Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on (Volume:2 )Date of Conference: 26-28 Feb. 2010

R.Indhunisha and M.V.Srinath, "SSH: Shark Search Algorithm and Gray-Box Program with Hadoop in Distributed Network," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.120-124, 2015.

Throughout human civilization, content has been an indispenscapable channel of communication. Modern computers equipped with desktop consoles have dramatically increased the ease and volume of text-based communication in the structure of email, content chat, and Web posting. As computing advances expanded beyond the confines of the desktop, the need on the other hand compelling content section on versatile gadgets has been increasingly felt over the last two decades. Such a need has inspired both scholarly researchers and the information innovation industry in pursuit of compelling content section techniques elective to the ubiquitous desktop keyboards.

Cloud Computing, Cloud association provider(CSP), Proxy,SaaS, IaaS, PaaS

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265
[8] Thulasiraman, K. ; Xi Fang ; Dejun Yang more authors,” Computing a Most Probable Constrained Path: NP-Hardness and ApproximatioScheme”. Published in:Computers, IEEE Transactions on (Volume:61 , Issue: 5 Page(s)738 – 744.
[9] Hongbo Wang ; Adamou, B. ; Shiduan Cheng Finding the Most Balanced Delay Constrained PathPublished in: Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on (Volume:3 )Date of Conference:6-8 Jan. 2009Page(s):201 – 205.

V. Maniraj and E. Manohari, "The Term Wave Console: Reimagining Console Communication," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.125-135, 2015.

The paper gives the outline of key analyses and methods, accommodating at that point again enterprise structural planning change and based on social system approach. Social system is a place where individuals exchange and share data related to the current events all over the world .This behavior that point again of clients made us focus on this logic that handling these substance might commercial us to the extraction the current subject of interest between the users. Applying data clustering system like post Text-Frequency-based approach over these content might leads us up to the mark be that as it may there will be some shot of false positives. We propose a likelihood model that can catch both normal saying behavior that point again of a customer and too the recurrence of clients happening in their mentions. It too lives up to expectations great indeed the substance of the messages are non-literary data like pictures and so forth .The proposed mention-abnormality based approaches can distinguish new points at slightest as early as text-abnormality based approaches, and in some cases much previous at the point when the subject is poorly identified by the literary substance in the posts.

Change Point Detection, Abnormality Scores, Notice

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265; Tvarožek, M.
[8] Bielikova, M.,” Semantic History Map: Graphs Aiding Web Revisitation Support” Published in: database and Expert Systems Applications (DEXA), 2010 Workshop onDate of Conference:Aug. 30 2010-Sept. 3 2010Page(s):206 – 210.
[9] Jurnecka, P. ; Kajan, R. ; Omelina, E. more authors,” Adaptive Educational Gameplay within Smart Multipurpose Interactive Learning Environment”. Published in:Semantic Media Adaptation and Personalization, Second International Workshop onDate of Conference:17-18 Dec. 2007Page(s):165 – 170.
[10] Barla, M. ; Bielikova, M” From Ambiguous Words Key-Concept Extraction”, Published in:Database and Expert Systems Applications (DEXA), 2013 24th InternationalWorkshop onDate of Conference:26-30 Aug. 2013Page(s):63 – 67.

S.Saratha and V. Geetha, "Discovering Emerging Topics in Social Streams Using NADS And VFDT," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.136-139, 2015.

The online briefest way issue aims at processing the briefest way based on live change circumstances. This is extremely imperative in present day car route frame lives up to expectations as it makes a difference drivers to make sensible decisions. To our best knowledge, there is no capable system/arrangement that can offer affordable costs at both customer and server sides on the other hand online briefest way computation. Unfortunately, the ordinary customer server building design scales poorly with the number of clients. A promising approach is to let the server gather live change information and at that point telecast them over radio on the other hand remote network. This approach has excellent versatility with the number of clients. Thus, we create a new framework called live change file (LTI) which empowers drivers to rapidly and effectively gather the live change information on the broadcasting channel. An impressive result is that the driver can compute/update their briefest way result by receiving just a little part of the index. The test study shows that LTI is robust to different parameters and it offers moderately short tune-in fetched (at customer side), quick question reactivity time (at customer side), little telecast size (at server side), and light support time (at server side) on the other hand online briefest way problem.

Most Constrained Path, Air Index, Broadcasting

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265
[8] Thulasiraman, K. ; Xi Fang ; Dejun Yang more authors,” Computing a Most Probable Constrained Path: NP-Hardness and ApproximatioScheme”. Published in:Computers, IEEE Transactions on (Volume:61 , Issue: 5 Page(s)738 – 744.
[9] Hongbo Wang ; Adamou, B. ; Shiduan Cheng Finding the Most Balanced Delay Constrained PathPublished in:Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on (Volume:3 )Date of Conference:6-8 Jan. 2009Page(s):201 - 205

S.Sinthuja and V.Geetha, "Towards Online Shortest Path Computation Using Energy Based Clustering And Aggregation Algorithm," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.140-142, 2015.

Magic word questions on data bases offer simple accessibility to data, however for the most part endure from low positioning quality, i.e., low exactitude and/at that point again recall, as demonstrated in recent benchmarks. It’d be accommodating to spot questions that square measure presumably to own low positioning quality to make strides the customer satisfaction. at that point again example, the framework could recommend to the customer diverse questions at that point again such onerous queries.. We set forth a high-principled framework and proposed novel calculations to live the degree of the issue of a question over a dB, exploitation the positioning strength principle. Supported our framework, we tend to proposture novel calculations that with proficiency anticipate the adequacy of a magic word question. Our intensive tests show that the calculations anticipate the issue of a question with comparatively low errors and negligible time overheads.

Inquiry Performance, Question Effectiveness, Magic Word Query, Robustness, Databases.

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265
[8] Tanaka, A. ; Miyazaki, T.,” Hardware Accelerator for BLAST”. Published in:Embedded Multicore Socs (MCSoC), 2012 IEEE 6th International Symposium onDate of Conference:20-22 Sept. 2012Page(s):16 – 22.
[9] Woojay Jeon,” Efficient speech indexing and search for embedded devices using uniterms”. Published in:Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference of Date of Conference:19-24 April 2000 Page(s):1297 – 1300.

K.Sivaranjani and V.Geetha, "A Novel Framework Using Structured Robustness Score in Keyword Quries Over Database by Feedback Algorithm and Profile Migration Scheme," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.143-147, 2015.

The robotized PC programs utilizing data mining and prescient technologies do a fare sum of exchanges in the markets. Information mining is well founded on the hypothesis that the memorable data holds the key memory at that point again foreseeing the future direction. This innovation is composed to help speculators find covered up designs from the memorable data that have probable prescient capacity in their venture decisions. The forecast of stock markets is regarded as a testing assignment of monetary time arrangement prediction. Information investigation is one way of foreseeing in the occasion that future stocks costs will increment at that point again decrease. Five procedures of breaking down stocks were joined to anticipate in the occasion that the day’s shutting cost would increment at that point again decrease. These procedures were Regular Cost (TP), Bollinger Bands, Relative Quality List (RSI), CMI and Moving Normal (MA). This paper discussed different procedures which are able to anticipate with future shutting stock cost will increment at that point again diminish better than level of significance. Also, it investigated different worldwide events and their issues foreseeing on stock markets. It supports numerically and graphically.

Information mining, Time arrangement Analysis, Binomial test, Regular Price, Bollinger Bands, Relative Quality List and Moving Average

[1] J. Borsje, F. Hogenboom, and F. Frasincar, “Semi-automatic financial events discovery based on lexico-semantic patterns,” International Journal of Web Engineering and Technology, vol. 6, no. 2, pp. 115–140, 2010.
[2] W. IJntema, J. Sangers, F. Hogenboom, and F. Frasincar, “A lexico-semantic pattern language for learning ontology instances from text,” Journal of Web Semantics: Science, Services and Agents on the World Wide Web, vol. 15, no. 1, pp. 37–50, 2012.
[3] P. C. Tetlock, “Giving content to investor sentiment: The role of media in the stock market,” Journal of Finance, vol. 62, no. 3, pp. 1139–1168, 2007.
[4] K. Mehta and S. Bhattacharyya, “Adequacy of training data for evolutionary mining of trading rules,” Decision Support Systems, vol. 37, no. 4, pp. 461–474, 2004.
[5] M. L. Mitchell and J. H. Mulherin, “The impact of public information on the stock market,” Journal of Finance, vol. 49, no. 3, pp. 923–950, 1994.
[6] W. S. Chan, “Stock price reaction to news and no-news: drift and reversal after headlines,” Journal of Financial Economics, vol. 70, no. 2, pp. 223–260, 2003.
[7] S. T. Kim, J. C. Lin, and M. B. Slovin, “Market structure, informed trading, and analyst’ recommendations,” Journal of Financial and Quantitative Analysis, vol. 32, no. 4, pp. 507–524, 1997.
[8] J. B. Warner, R. L. Watts, and K. H. Wruck, “Stock prices and top management changes,” Journal of Financial Economics, vol. 20, no. 1, pp. 461–492, 1988.
[9] Bonnier and R. F. Bruner, “An analysis of stock price reaction to management change in distressed firms,” Journal of Accounting and Economics, vol. 11, no. 1, pp. 95–106, 1989.
[10] D. L. Ikenberry and S. Ramnath, “Under reaction to self-selected news events: the case of stock splits,” Review of Financial Studies, vol. 15, no. 2, pp. 489–526, 2002.

B.Sowmiya and V.Geetha, "News Based Trading Framework Using Genetic Programming," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.148-152, 2015.

Customized Web Look has established to make strides the quality of different look administrations on the Internet. Due to tremendous data opportunities in the internet, the security assurance is exceptionally critical to preserve customer look behaviors and their profiles. In the existing framework the summed up calculation specifically Covetous DP calculation were connected to secure private data’s in modified look engine. The existing frame lives up to expectations failed to resist successive and foundation information adversaries who has the broader foundation information such as richer relationship among topics. The proposed framework introduces vector that point again quantization approach piecewise on the datasets which segmented each column of datasets and that quantization approach is performed on each segment, utilizing the proposed approach which later is again united to structure a transformed data set. The proposed work is implemented and is analyzed utilizing certain parameters such as Precision, Recall, Frequency Measure, Distortion and Computational Delay.

Security Protection, Customized Web Search, Profile, Vector, Quantization

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265
[8] He Bai ; Ke Chen ; Gang Chen,” Supporting Privacy Protection in Personalized Web Search” Published in:Knowledge and Data Engineering, IEEE Transactions on (Volume:26 , Issue: 2 )Page(s):453 – 467.
[9] Wanying Ding ; Mengwen Liu ; Xiaoli Song more authors,” Scalable user intent mining using a multimodal Restricted Boltzmann Machine”. Published in:Computing, Networking and Communications (ICNC), 2015 International Conference of Date of Conference 16-19 Feb. 2015Page(s):618 – 624.
[10] Lina Zhou ; Dongsong Zhang,” An integrated method for hierarchy construction of domain-specific terms” Published in:Computer and Information Science (ICIS), 2014 IEEE/ACIS 13th International Conference onDate of Conference:4-6 June 2014Page(s):485 – 490
[11] Shekhar, S. ; Jalal, A.S.,” Semantic Based Image Retrieval using multi-agent model by searching and filtering replicated web images”. Published in:Information and Communication Technologies (WICT), 2012 World Congress ofDate of f Conference:Oct. 30 2012-Nov. 2 2012Page(s):817 - 821

Privacy Enhanced Web Search Using MKSE in KNN, "R.Sumathi and V.Geetha," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.153-159, 2015.

Human eyes can recognize person ID substances based on some little not capable regions. However, such value capable not capable data is regularly covered up at the point when registering similarities of pictures with existing approaches. Moreover, numerous existing approaches learn discriminative highlights and handle drastic perspective change in an administered way and require labeling new preparing data fat that point again a diverse pair of camera views. In this paper, we proposture a novel perspective fat that point again per-child re-distinguishing proof based on administered striking nature learning. Distinctive highlights are separated without needing element names in the preparing procedure. First, we apply nearness obliged patch coordinating to assemble thick correspondence between picture pairs, which shows effective-ness in taking care of misalignment caused by huge perspective and posture variations. Second, we learn human striking nature in an administered manner. To make strides the execution of person re-identification, human striking nature is incorporated in patch coordinating to find re capable and discriminative coordinated patches. The adequacy of our approach is validated on the generally used Snake dataset and ETHZ dataset.

Area Privacy, Area Based Administrations (LBSs), Security

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265.

T.Thangaponnu and V.Geetha, "Person Re-Identification Using MTMCML and Graph Based Method," International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.160-167, 2015.