Volume-07 , Special Issue-04 , Feb - 2019 Go Back

Mobile App market refers to fraudulent or deceptive activities which have a purpose of bumping up the Apps in the popularity list. It becomes more frequent for App developers to use adumbral means, such as inflating their Apps’ sales or posting phony App ratings, to commit Review cheats. While the importance of preventing ranking cheat has been widely recognized, there is limited understanding and research in this area. We propose a new algorithm for this kind of the problem using Marshal Classification scam identification technique for mobile Apps. Specifically, we first propose to accurately locate the ranking fraud by mining the active periods, namely leading sessions, of mobile Apps. Such leading sessions can find out the local anomaly instead of global anomaly of App rankings. Furthermore, we investigate three types of evidences, i.e., ranking based evidences, rating based evidences and review based evidences, by modelling Apps’ ranking, valuation, review and behaviours through analytical detection principle tests using Marshal Classification Scan Analysis Technique.

Mobile Apps, ranking fraud detection, evidence aggregation, historical ranking records, rating and review

[1] (2014). [Online]. Available: http://en.wikipedia.org/wiki/ cohen’s_kappa
[2] (2014). [Online]. Available: http://en.wikipedia.org/wiki/information_retrieval.
[3] (2012). [Online]. Available: https://developer.apple.com/news/index.php?id=02062012a
[4] (2012). [Online]. Available: http://venturebeat.com/2012/07/03/apples-crackdown-on-app-ranking-manipulation/
[5] (2012). [Online]. Available: http://www.ibtimes.com/applethreatens- crackdown-biggest-app-store-ranking-fra ud-406764
[6] (2012). [Online]. Available: http://www.lextek.com/manuals/onix/index.html
[7] (2012). [Online]. Available: http://www.ling.gu.se/lager/mogul/porter-stemmer.
[8] L. Azzopardi, M. Girolami, and K. V. Risjbergen, “Investigating the relationship between language model perplexity and ir precision- recall measures,” in Proc. 26th Int. Conf. Res. Develop. Inform. Retrieval, 2003, pp. 369–370.
[9] D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent Dirichlet allocation,” J. Mach. Learn. Res., pp. 993–1022, 2003.
[10] Y. Ge, H. Xiong, C. Liu, and Z.-H. Zhou, “A taxi driving fraud detection system,” in Proc. IEEE 11th Int. Conf. Data Mining, 2011, pp. 181–190.
[11] D. F. Gleich and L.-h. Lim, “Rank aggregation via nuclear norm minimization,” in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 60–68.
[12] T. L. Griffiths and M. Steyvers, “Finding scientific topics,” Proc. Nat. Acad. Sci. USA, vol. 101, pp. 5228–5235, 2004.
[13] G. Heinrich, Parameter estimation for text analysis, “ Univ. Leipzig, Leipzig, Germany, Tech. Rep., http://faculty.cs.byu.edu/~ringger/CS601R/papers/Heinrich-GibbsLDA.pdf, 2008.
[14] N. Jindal and B. Liu, “Opinion spam and analysis,” in Proc. Int. Conf. Web Search Data Mining, 2008, pp. 219–230.
[15] J. Kivinen and M. K. Warmuth, “Additive versus exponentiated gradient updates for linear prediction,” in Proc. 27th Annu. ACM Symp. Theory Comput., 1995, pp. 209–218.
[16] A. Klementiev, D. Roth, and K. Small, “An unsupervised learning.
[17] A. Klementiev, D. Roth, and K. Small, “Unsupervised rank aggregation with distance-based models,” in Proc. 25th Int. Conf. Mach. Learn., 2008, pp. 472–479.
[18] A. Klementiev, D. Roth, K. Small, and I. Titov, “Unsupervised rank aggregation with domain-specific expertise,” in Proc. 21st Int. Joint Conf. Artif. Intell., 2009, pp. 1101–1106.
[19] E.-P. Lim, V.-A. Nguyen, N. Jindal, B. Liu, and H. W. Lauw, “Detecting product review spammers using rating behaviors,” in Proc. 19thACMInt. Conf. Inform. Knowl. Manage., 2010, pp. 939–948.
[20] Y.-T. Liu, T.-Y. Liu, T. Qin, Z.-M. Ma, and H. Li, “Supervised rank aggregation,” in Proc. 16th Int. Conf. World Wide Web, 2007, pp. 481–490.
[21] A. Mukherjee, A. Kumar, B. Liu, J. Wang, M. Hsu, M. Castellanos, and R. Ghosh, “Spotting opinion spammers using behavioral footprints,” in Proc. 19th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2013, pp. 632–640.
[22] A. Ntoulas, M. Najork, M. Manasse, and D. Fetterly, “Detecting spam web pages through content analysis,” in Proc. 15th Int. Conf. World Wide Web, 2006, pp. 83–92.
[23] G. Shafer, A Mathematical Theory of Evidence. Princeton, NJ, USA: Princeton Univ. Press, 1976.
[24] K. Shi and K. Ali, “Getjar mobile application recommendations with very sparse datasets,” in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2012, pp. 204–212.
[25] N. Spirin and J. Han, “Survey on web spam detection: Principles and algorithms,” SIGKDD Explor. Newslett., vol. 13, no. 2, pp. 50–64, May 2012.

M. Mary Priyadharshini, C. Premila Rosy, "Implementation of Data Mining Techniques to Detect Ranking Fraud", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.59-61, 2019.

Reliability is a vital aspect for the safe operation of any modern technological system. This work presents a methodology for evaluating the reliability of a composite power system with Binary Grasshopper Optimisation (BGHO) algorithm in its search mechanism to select the dominant states of the system which have large existing probability and higher load curtailment. A Grasshopper of a BGHO algorithm represents the possible system state. BGHO is used for efficient exploration of system states in the problem space by generating different potential solution to achieve optimal objective. The examined system states are used to evaluate annualized system and load point reliability indices. The proposed search methodology is applied to IEEE-RTS test system and the results are compared with state of art approaches. This proposed methodology evaluates the indices similar to the existing benchmark methods while visiting less number of system states.

Power System Reliability Evaluation; Reliability indices; Binary Grasshopper Optimisation Algorithm

[1] Pereira MVF, Pinto LMVG, Cunha SHF, Oliveira GC, Monte Carlo based Composite Reliability Evaluation – Modeling Aspect and Computational Results. IEEE tutorial course on Reliability assessment of composite generation and transmission systems. IEEE special publication, 1989.
[2] Pereira MVF, Balu NJ, Composite generation/transmission reliability evaluation. Proceedings of the IEEE 80:470, 1992.
[3] Chanan singh, Linghfeng Wang (2008) Role of artificial intelligence in the reliability evaluation of electric power systems. Turkish Journal of Electrical Engineering & Computer Sciences 16(3):189, 2008.
[4] Samaan N, Singh C, Adequacy assessment of power system generation Using a modified simple genetic algorithm. IEEE Transactions on Power Systems 17:974, 2002.
[5] Mohammed Benidris, Salem Elsaiah and Joydeep Mitra, Power System Reliability Evaluation using a State Space Classification Technique and Particle Swarm Optimisation Search Method, IET Generation, Transmission and Distribution, Vol 9, No 14, pp 1865–1873, Nov 2015.
[6] Green, R. C., Wang, L., Alam, M., Singh, C.: ‘An Examination of Ar- tificial Immune System Optimization in Intelligent State Space Pruning for LOLP Estimation’. Proc. North American Power Symposium, pp. 1-7, 2011.
[7] Green, R. C., Wang, L., Wang, Z., Alam, M., Singh, C.: ‘Power System Reliability Assessment Using Intelligent State Space Pruning Techniques: A Comparative Study’. Proc. IEEE International Conference on Power System Technology, pp. 1–8, 2010.
[8] Miranda V, de Magalhaes Carvalho L, da Rosa MA, da Silva AML, Singh C, Improving Power System Reliability Calculation Efficiency With EPSO Variants. IEEE Transactions on Power Systems 24:1772 , 2009.
[9] R.Ashok Bakkiyaraj and N.Kumarappan, Differential Evolution Based Intelligent System State Search Method for Composite Power System Reliability Evaluation, Journal of the Institution of Engineers (India): Series B, Springer, Vol. 96, pp.237–244, 2015.
[10] Shahrzad Saremi, Seyedali Mirjalili, Andrew Lewis, ‘‘Grasshopper Optimisation Algorithm: Theory and application,’’ Advances in Engineering Software, pp. 30–47, 2017.
[11] Majdi Mafarja et.al, Binary grasshopper optimisation algorithm approaches for feature selection problems, Expert Systems With Applications, Vol. 117, pp. 267–286, 2019.
[12] Billinton R, Kumar S, Chowdhury N, Chu K, Debnath K, Goel L, et al, A reliability test system for educational purposes-basic data. IEEE Transactions on Power Systems 14: 1238, 1989.
[13] IEEE Committee Report, IEEE Reliability Test System. IEEE transactions on Power apparatus and systems 98:2047, 1979.
[14] Billinton R, Wenyuan L, Hybrid approach for reliability evaluation of composite generation and transmission systems using Monte-Carlo simulation and enumeration technique. IEE proceedings-C on Generation, Transmission and Distribution 138: 233, 1991.
[15] Jonnavithula A, Composite System reliability evaluation using sequential Monte Carlo simulation. Ph.D. Thesis. University of Saskatchewan. Canada,1997.

K.Jayanthi, R. Ashok Bakkiyaraj, "Composite Power System Reliability Evaluation Based on Efficient State Search Using Binary Grasshopper Optimisation Algorithm", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.62-66, 2019.

WiMAX has several competitors within the market, together with cellular 3G and LTE specifications. although every of those technologies has its own benefits and drawbacks, mobile WiMAX has a grip as a result of it`s associate all IP-based packet switched network designed for information traffic WiMAX is that the finish to finish technology that has low price applications and walk resolution for broadband wireless access. WiMAX is predicated on the quality family outlined by IEEE 802.16 that provides Coverage of up to thirty miles (last mile) compared to alternative technologies. WiMAX has distinctive characteristics that permits the bottom station to handle thousands of subscriber stations (SS), it conjointly provides economical relinquishing procedure and Power management mechanism by introducing the sleeping mode for mobile stations. The key downside of WIMAX system is high BER and as BER will increase, signal to noise quantitative relation decreases. It means, the less the BER, result`s the upper the SNR and also the higher communication quality This paper presents simulation of WiMAX exploitation OFDM technique exploitation secret writing technique . BER versus Eb/No curves area unit used for comparison the results.

Wimax, Ofdm , wireless networks

[1] Manal Al-bzoor and Khaled Elleithy, ”WIMAX basics from Phy layer to scheduling and multicasting approaches”, International Journal of Computer Science & Engineering Survey , Vol.2, No.1, pp.1-17 , Feb 2011.
[2] Mike Linsey, Prosy Nalweyiso, Preethi Srinivasan, Lou Ann Stroup, Narasimhan Vasudevan,” Mobile WiMAX: Design & Applications”, The 8th Annual Conference on Telecommunications and Information Technology, pp. 1-15 ,10--11 April 2010.
[3] Ed Agis , Henry Mitchel, Shlomo Ovadia,,” Global, Interoperable Broadband Wireless Networks: Extending WiMAX Technology to Mobility”, Intel Technology Journal, Vol 8, Issue 3, pp.1-18 , August 2004.
[4] Arathi.R.Shankar , Adarsh Pattar, and V.Sambasiva Rao,” Qualitative Analysis Of the Qos Parameters at the Layer 1 And 2 Of Mobile WiMAX 802.16e”, International Journal of Wireless & Mobile Networks ,Vol. 4, No. 2,pp.1-14, April 2012.
[5] J. G. Andrews, A. Ghosh, and R. Muhamed, Fundamentals of WiMAX: Understanding Broadband Wireless Networking, Prentice Hall, 2007
[6] Tarokh V., Jafarkhani H., and Calderbank A. R., “Space–time block codes from orthogonal designs,” IEEE Transactions on Information Theory, vol. 45, pp. 1456–1467, June 1999.
[7] Prabhakar Telagarapu, G.B.S.R.Naidu, K.Chiranjeevi,” Analysis of Coding Techniques in WiMAX”, International Journal of Computer Applications , Vol 22,No.3, pp. 1-8 ,May 2011.

M. Vaishnavi, "A heuristic Approach of Wimax System with Different Modulation Process", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.67-69, 2019.

In information network security is one of the most important elements because it is responsible for providing security to all information passed through network devices. System security includes the approval of access to information in a system and it will controlled by the system administrator. Cryptography gives secure correspondence within the sight of vindictive outsiders-known as foes. Cryptography is the way toward changing over standard plain text into cipher text. There are two sorts of cryptography they are symmetric and asymmetric. In symmetric frameworks use a similar key (the mystery key) to scramble and unscramble a message. In asymmetric frameworks use an open key to scramble a message and a private key to decode it. Utilization of uneven frameworks upgrade makes secure correspondence. Asymmetric frameworks incorporate RSA (Rivest-Shamir-Adleman), and ECC (Elliptic Curve Cryptography). The proposed framework utilizes AEDA calculation for information encryption as a result of its significant points on high security, bring down CPU time and less memory use. In AEDA Encryption and Decryption techniques can just scramble and decode a pixel value. The Encoding (converting message to a point) and Decoding (changing over a point to a message) are imperative capacities in Encryption and Decryption in AEDA.

Cryptography, Symmetric Key, Asymmetric Key, ECC, RSA, AEDA

[1] Jasmin Syed, J S Ananda Kumar “ Cryptography Algorithms For Providing Security To Data While Transferring Over Network” International Journal of Scientific & Engineering Research Volume 8, Issue 5, May-2017 ISSN 2229-5518
[2] William Stallings, “Cryptography and etwork Security: Principles and Practice”, Pearson Education/Prentice Hall, 5th Edition.
[3] E. Thambiraja, G. Ramesh and Dr. R. Umarani, "A Survey on Various Most Common Encryption Techniques", International Journal of Advanced Research in Computer Science and Software Engineering, Volume 2, Issue 7, pp. 226-233, July 2012.
[4] Gurpreet Singh, Supriya “ A Study of Encryption Algorithms (RSA, DES, 3DES and AES) for Information Security” international Journal of Computer Applications (0975 – 8887) Volume 67– No.19, April 2013.
[5] William Stallings, Cryptography and Network Security, Principles and Practice. ed.,Prentice Hall, New Jersey,2003.
[6] Padma Bh, D.Chandravathi, P.Prapoorna Roja Encoding And Decoding of a Message in the Implementation of Elliptic Curve Cryptography using Koblitz’s MethodPadma Bh et. al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 05, 2010, 1904-1907
[7] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p. Mathematics of Computation, Vol. 44, No. 170, pp. 483-494, April 85.
[8] C. Nithiya, IIR. Sridevi ECC Algorithm & Security in CloudInternational Journal of Advanced Research in Computer Science & Technology (IJARCST 2016) Vol. 4, Issue 1 (Jan. - Mar. 2016)
[9] Atul Kahate “Cryptography and Network Security”, Tata McGraw-Hill Companies, 2008.
[10] William Stallings “Network Security Essentials (Applications and Standards)”, Pearson Education,2004.
[11] Mitali, Vijay Kumar and Arvind Sharma, “A Survey on Various Cryptography Techniques” International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) Volume 3, Issue 4, July-August 2014
[12] Samta Gajbhiy e,Dr. Sanjeev Karmakar, D r. Monisha Sharma,Dr. Sanjay Sharma, Dr. M K Kowar, “Application of Elliptic Curve Method in Cryptography: A Literature Review”, Samta Gajbhiye et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (3) , 2012,4499 - 4503
[13] Udayakumar R., Kaliyamurthie K.P., Khanaa, Thooyamani K.P., Data mining a boon: Predictive system for university topper women in academia, World Applied Sciences Journal, v-29, i-14, pp-86-90, 2014.
[14] Kaliyamurthie K.P., Parameswari D., Udayakumar R., QOS aware privacy preserving location monitoring in wireless sensor network, Indian Journal of Science and Technology, v-6, i-SUPPL5, pp-4648-4652, 2013.
[15] Brintha Rajakumari S., Nalini C., An efficient cost model for data storage with horizontal layout in the cloud, Indian Journal of Science and Technology, v-7, i-, pp-45-46, 2014.
[16] Brintha Rajakumari S., Nalini C., An efficient data mining dataset preparation using aggregation in relational database, Indian Journal of Science and Technology, v-7, i-, pp-44-46, 2014.
[17] Khanna V., Mohanta K., Saravanan T., Recovery of link quality degradation in wireless mesh networks, Indian Journal of Science and Technology, v-6, i-SUPPL.6, pp-4837-4843, 2013.
[18] Khanaa V., Thooyamani K.P., Udayakumar R., A secure and efficient authentication system for distributed wireless sensor network, World Applied Sciences Journal, v-29, i-14, pp-304-308, 2014.
[19] Udayakumar R., Khanaa V., Saravanan T., Saritha G., Retinal image analysis using curvelet transform and multistructure elements morphology by reconstruction, Middle - East Journal of Scientific Research, v-16, i-12, pp-1781-1785, 2013.
[20] P.R.Hariharan & Dr. K.P. Thooyamani, “ Various Schemes for Database Encryption - A Survey”, International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 8763-8767.
[21] Sharad Kumar Verma and Dr. D.B. Ojha , A Discussion on Elliptic Curve Cryptography and Its Applications , IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 1, January 2012 ISSN (Online): 1694-0814
[22] Victor S. Miller. Use of elliptic curves in cryptography. In H.C. Williams, editor, Advances in Cryptology CRYPTO`85, vol. 218 of Lecture Notes in Computer Science, pp. 417-426. Springer-Verlag, 1986.
[23] Whitfield Diffie and Martin E. Hellman. New directions in cryptography, IEEE Transactions on Information Theory, 22(6):644-654, 1976.
[24] Taher ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469- 472, 1985.
[25] https://en.wikipedia.org/wiki/Elliptic-curve_cryptography
[26] William Stallings, “Cryptography and network Security: Principles and Practice”, Pearson Education/Prentice Hall, 5th Edition.

A. Suresh, M. Hemamalini, "A Review on Secured Network with Cryptographic Modelling", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.70-76, 2019.

Information retrieval is the process of retrieving relevant documents for the given query over a large document collection. As the technology emergence of digital library and electronic information exchange there is a clear need for organizing and accessing the large quantity of information. Information retrieval focus on the study of storing, organizing and retrieving the information from this large collection. This paper focuses on the types of information retrieval, different fundamental retrieval models and also gives brief overview on document processing.

Boolean Model, Information Retrieval(IR),Information Retrieval System (IRS), Indexing, Vector SpaceModel (VSM)

[1] K. Aas and L. Eikvil, “Text Categorisation: A Survey,” Technical Report Raport NR 941, Norwegian Computing Center, 1999.
[2] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases,” Proc. 20th Int’l Conf. Very Large Data Bases (VLDB ’94), pp. 478-499, 1994.
[3] H. Ahonen, O. Heinonen, M. Klemettinen, and A.I. Verkamo, “Applying Data Mining Techniques for Descriptive Phrase Extraction in Digital Document Collections,” Proc. IEEE Int’l Forum on Research and Technology Advances in Digital Libraries (ADL ’98), pp. 2-11, 1998.
[4] R.Baeza-Yates and B.Ribeiro-Neto, Modern Information Retrieval. Addison Wesley, 1999.
[5] N. Cancedda, N. Cesa-Bianchi, A. Conconi, and C. Gentile, “Kernel Methods for Document Filtering,” TREC, trec.nist.gov/ pubs/trec11/papers/kermit.ps.gz, 2002.
[6] N. Cancedda, E. Gaussier, C. Goutte, and J.-M. Renders, “Word- Sequence Kernels,” J. Machine Learning Research, vol. 3, pp. 1059-1082, 2003.
[7] M.F. Caropreso, S. Matwin, and F. Sebastiani, “Statistical Phrases in Automated Text Categorization,” Technical Report IEI-B4-07- 2000, Instituto di Elaborazionedell’Informazione, 2000.
[8] C. Cortes and V. Vapnik, “Support-Vector Networks,” Machine Learning, vol. 20, no. 3, pp. 273-297, 1995.
[9] S.T. Dumais, “Improving the Retrieval of Information from External Sources,” Behavior Research Methods, Instruments, and Computers, vol. 23, no. 2, pp. 229-236, 1991.
[10] J. Han and K.C.-C. Chang, “Data Mining for Web Intelligence,” Computer, vol. 35, no. 11, pp. 64-70, Nov. 2002.
[11] J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. ACM SIGMOD Int’l Conf. Management of Data (SIGMOD ’00), pp. 1-12, 2000.
[12] Y. Huang and S. Lin, “Mining Sequential Patterns Using Graph Search Techniques,” Proc. 27th Ann. Int’l Computer Software and Applications Conf., pp. 4-9, 2003.
[13] N. Jindal and B. Liu, “Identifying Comparative Sentences in Text Documents,” Proc. 29th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’06), pp. 244-251, 2006.
[14] T. Joachims, “A Probabilistic Analysis of the Rocchio Algorithm with tfidf for Text Categorization,” Proc. 14th Int’l Conf. Machine Learning (ICML ’97), pp. 143-151, 1997.
[15] T. Joachims, “Text Categorization with Support Vector Machines: Learning with Many Relevant Features,” Proc. European Conf. Machine Learning (ICML ’98),, pp. 137-142, 1998.
[16] T. Joachims, “Transductive Inference for Text Classification Using Support Vector Machines,” Proc. 16th Int’l Conf. Machine Learning (ICML ’99), pp. 200-209, 1999.
[17] W. Lam, M.E. Ruiz, and P. Srinivasan, “Automatic Text Categorization and Its Application to Text Retrieval,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 6, pp. 865-879, Nov./Dec. 1999.42 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 24, NO. 1, JANUARY 2012
[18] D.D. Lewis, “An Evaluation of Phrasal and Clustered Representations on a Text Categorization Task,” Proc. 15th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’92), pp. 37-50, 1992.
[19] D.D. Lewis, “Feature Selection and Feature Extraction for Text Categorization,” Proc. Workshop Speech and Natural Language, pp. 212-217, 1992.
[20] D.D. Lewis, “Evaluating and Optimizing Automous Text Classification Systems,” Proc. 18th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’95), pp. 246-254,1995.

R. Meera, "A Survey on Information Retrieval Models in Document Mining", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.77-80, 2019.

A radio spectrum higher data rates is a challenging task that requires inventive advances prepared for giving better methodologies for using the open radio spectrum. The issue of applying the Cognitive radio technique successfully is how to sense exactly and quickly whether or not the Primary User (PU) exists, and searching for the spectrum holes to provide the Secondary User (SU). The proposed system focus on Advanced Cluster Based Spectrum Sensing (ACBSS) algorithm which combines hierarchical data-fusion idea with jointly compressive reconstruction technology. To validate the efficiency and effectiveness, we compare the ACBBSS with Independent Compressive Sensing (ICS) and Joint Compressive Sensing (JCS) in the detection probability, false-alarm probability and algorithm execution time under the situation of unusual SNR and compression ratio. The majority of existing work has focused on Single band Cognitive Radio, multiband cognitive radio represents great promises toward implementing efficient cognitive networks compared to single-based networks. This has primarily motivated the introduction of Multiband Cognitive Radio (MB-CR) paradigm, which is also referred to wideband CR. In addition, it helps contribute seamless handoff from band to band, which get better the link maintenance and reduces data transmission interruptions.

Cluster, ICS, JCS, Cognitive Radio Technique, Single and Multiband, ACBSS

[1] Li, C. M., & Lu, S. H. (2016). Energy-based maximum likelihood spectrum sensing method for the cognitive radio. Wireless Personal Communications, 89(1), 289-302.
[2] Salahdine, F., Kaabouch, N., & Ghazi, H. E. (2018). One-Bit Compressive Sensing Vs. Multi-Bit Compressive Sensing for Cognitive Radio Networks. In IEEE Int. Conf. Industrial Techno(pp. 1-6).
[3] Manesh, M. R., Quadri, A., Subramaniam, S., & Kaabouch, N. (2017, January). An optimized SNR estimation technique using particle swarm optimization algorithm. In Computing and Communication Workshop and Conference (CCWC), 2017 IEEE 7th Annual (pp. 1-6). IEEE.
[4] Salahdine, F., & El Ghazi, H. (2017, October). A real time spectrum scanning technique based on compressive sensing for cognitive radio networks. In Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON), 2017 IEEE 8th Annual (pp. 506-511). IEEE.
[5] Salahdine, F., Kaabouch, N., & El Ghazi, H. (2016, October). Bayesian compressive sensing with circulant matrix for spectrum sensing in cognitive radio networks. In Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON), IEEE Annual (pp. 1-6). IEEE.
[6] Yarkan, S. (2015). A generic measurement setup for implementation and performance evaluation of spectrum sensing techniques: Indoor environments. IEEE Transactions on Instrumentation and Measurement, 64(3), 606-614.
[7] Sun, H., Nallanathan, A., Wang, C. X., & Chen, Y. (2013). Wideband spectrum sensing for cognitive radio networks: a survey. IEEE Wireless Communications, 20(2), 74-81.
[8] Sharma, S. K., Lagunas, E., Chatzinotas, S., & Ottersten, B. (2016). Application of compressive sensing in cognitive radio communications: A survey. IEEE Communication Surveys & Tutorials.
[9] Tian, Z., Tafesse, Y., & Sadler, B. M. (2012). Cyclic feature detection with sub-Nyquist sampling for wideband spectrum sensing. IEEE Journal of Selected topics in signal processing, 6(1), 58-69.
[10] Shahrasbi, B., & Rahnavard, N. (2013, December). A clustering-based coordinated spectrum sensing in wideband large-scale cognitive radio networks. In Global Communications Conference (GLOBECOM), 2013 IEEE (pp. 1101-1106). IEEE.
[11] Yadav, N., & Rathi, S. (2011). Spectrum Sensing Techniques: Research, Challenge and Limitations 1.
[12] E. Axell, G. Leus, E. Larsson, and H. Poor, “Spectrum sensing for cognitive radio : state-of-the-art and recent advances,” IEEE Signal Process. Mag., vol. 29, no. 3, p. 101-116, 2012.
[13] F. Salahdine, N. Kaabouch, and H. El Ghazi, “Techniques for dealing with uncertainty in cognitive radio networks,” IEEE Ann. Comput. Commun. Workshop Conf., p. 1-6, 2017.
[14] W. Jinlong et al., “Hierarchical cognition cycle for cognitive radio networks,” Commun., .108-121,2015.
[15] R. Tandra and A. Sahai, “SNR walls for signal detection,” Sel. Top. Signal Process. vol. 2,p. 4-17, 2008.

T.Jothi, P. Panimalar, "Advanced Cluster Based Spectrum Sensing in Broadband Cognitive Radio Network", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.81-86, 2019.

Most of the clustering techniques must presume some cluster relationship relating to the data thing. Similarity among some items is usually defined clearly or sometimes absolutely. In this paper, is an introduction to some novel reference centered similarity gauge and two related clustering approaches. The significant difference between an old-fashioned dissimilarity/similarity gauge and the approach considered in this paper is how the former uses simple single standpoint. In the existing approach it considers the origin, while the latter utilizes a number of reference details, which are objects assumed not to ever be inside the same cluster while using two things being scored. Using several reference details, more useful assessment of similarity could be possibly achieved. In document clustering two qualification functions are proposed and is determined by the fresh measure. The above functions are being examined along with frequently used clustering based algorithms which use other well known similarity measures in various document collections in order to verify the approach under consideration in this paper.

Document Clustering, Correlation Measure, Similarity Measure, Data Mining

[1] X. Wu, V. Kumar, J. Ross Quinlan, J. Ghosh, Q. Yang, H. Motoda, G. J. McLachlan, A. Ng, B. Liu, P. S. Yu, Z.-H. Zhou, M.steinbach,D.J.Hand,andD.Steinberg,―Top10algorithmsindata mining,‖Knowl. Inf. Syst., vol. 14, no. 1, pp. 1–37, 2007.
[2] HChimand X. Deng, ―Efficient phrase-based document similarity for clustering,‖ IEEE Trans. on Knowl. and Data Eng., vol. 20, no. 9, pp. 1217–1229,2008.
[3] D. Lee andJ. Lee, ―Dynamic dissimilarity measure for support based clustering,‖ IEEE Trans. on Knowl. and Data Eng., vol. 22, no. 6, pp. 900–905,2010.
[4] P. Lakkaraju, S. Gauch, andM. Speretta, ―Document similarity based on concept tree distance,‖ in Proc. of the 19th ACM conf. on Hypertext and hypermedia, 2008, pp.127–132.
[5] D. Ienco, R. G. Pensa, andR. Meo, ―Context-based distance learning for categorical data clustering,‖ in Proc. of the 8th Int. Symp. IDA, 2009, pp.83–94.
[6] I. Guyon, U.von Luxburg, and R. C. Williamson, ―Clustering: Science or Art?‖ NIPS‘09 Workshop on Clustering Theory,2009.
[7] E. Pekalska, A. Harol, R. P. W. Duin, B. Spillmann, and H. Bunke,―Non-Euclideanornon-metricmeasurescanbeinformative,‖ in Structural, Syntactic, and Statistical Pattern Recognition, ser. LNCS, vol. 4109, 2006, pp.871–880.
[8] M.Pelillo, ―What is a cluster?Perspectivesfromgametheory,‖in Proc. of the NIPS Workshop on Clustering Theory,2009.
[9] I. Dhillon and D. Modha, ―Concept decompositionsfor large sparse text data using clustering,‖ Mach. Learn., vol. 42, no. 1-2, pp. 143–175, Jan2001.
[10] S. Zhong, ―Efficient online spherical K-means clustering,‖in
IEEE IJCNN, 2005, pp. 3180–3185.

K. Lakshmi, "Document Clustering with Omni-Directional Data Similarity Process", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.87-90, 2019.

Hacking is a task in which, a person utilize the weakness in a system for self-profit or indulgence. Ethical hacking is an indistinguishable activity which aims to find and rectify the weakness in a system. In the growing era of internet computer security is of utmost concern for the organizations and government. These companies are using Internet in their wide variety of applications such as marketing, electronic commerce, and database access. But at the same time, data and network security is a serious issue that has to be talked about. This paper attempts to discuss the overview of hacking and how ethical hacking disturbs the security. Also the Ethical Hackers and Malicious Hackers are different from each other and playing their important roles in security. This paper studied the different types of hacking with its phases. The hacking can also be categorized majorly in three categories such as white hat, black hat and grey hat hacking. This paper also presents a comparison of the hacking categories with different methods of penetration testing.

Hackers, Ethical Hacking, Hacking Phases

[1] Agarwal, AnkitKumar, Hacking : Research paper, online http://ankitkumaragarwal.com /hacking-a-research- paper/ (visited on may2012)
[2] Wilhelm, Douglas. "2". Professional Penetration Testing.Syngress Press. p. 503.ISBN 978-1-59749-425-0
[3] Moore, Robert (2006). Cybercrime: Investigating High- Technology Computer Crime (1st ed.). Cincinnati, Ohio:
[4] Anderson Publishing. ISBN 978-1-59345-303-9
[5] EC-Council (n.d.). Ethical Hacking and Countermeasures, online http://www.eccouncil.org/ipdf/EthicalHacker.pdf (visited on may 2012)
[6] Ethical Hacking Basics Class part , online http://www.go4expert.com/forums/ showthread.php?t=11925 (visited on may 2012)
[7] Palmer, C.C.(2001,April 13). Ethical Hacking. IBM Systems Journal Vol. 40 No.3 2001
[8] Http://1000projects.org/how-is-ethical-hacking-done-cs- student-project-seminar.html
[9] en.wikipedia.org/wiki/Penetration_testing
[10] About Effective Penetration Testing Methodology byByeong-Ho KANG

J. Sathya, T. Manivannan, "A Survey on Ethical Hacking Techniques", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.91-96, 2019.

Cloud Computing has attracted considerable attention in both industry and academic. It leads to gain effectiveness deployment, efficiency development and pay on- demand in purchasing and maintaining infrastructure. The resources stored in the cloud are managed by the Cloud Service Provider. Even though, cloud computing provides more advantages to the users, there exists security problem in cloud computing. The data owner who outsources their critical data are unaware of how data being stored in the cloud and who accessing their data. This arises many security issues in cloud computing. This paper discusses several security issues that occur over the cloud and solutions offered by various researches.

Cloud Computing, Security issues, Data Security

[1] Nareshvurukonda and B.ThirumalaRao, “A Study on Data Storage Security Issues in Cloud Computing”, 2nd International Conference on Intelligent Computing, Communication & Convergence, 2016.
[2] R.VelumadhavaRao and K.Selvamani, “Data Security Challenges and Its Solutions in Cloud Computing”, International Conference on Intelligent Computing, Communication & Convergence, 2015.
[3] Sultan Aldossary and William Allen, “Data Security, Privacy, Availability and Integrity in Cloud Computing: Issues and Current Solutions”, IJACSA International Journal of Advanced Computer Science and Applications, 2016, Vol. 7, Iss.4,pp.485-498.
[4] Ahmed Albugmi, Madini O. Alassafi and Robert Walters,Gary Wills, “Data Security in Cloud Computing”, IEEE Fifth International Conference on Future Generation Communication Technologies, 2016, pp.55- 59.
[5] Dr.K.B.Priyalyer, Manisha R, Subhashree R and Vendhavalli K, “Analysis of Data Security in Cloud Computing”, IEEE International Conference onAdvances in Electrical, Electronics, Information, Communication and Bio-Informatics,2016.
[6] [6]. Babitha.M.P and K.R.RemeshBabu, “Secure Cloud Storage Using AES Encryption”, IEEE International Conference on Automatic Control and Dynamic Optimization Techniques, 2016,pp.859-864.
[7] AkshitaBhandari, Ashutosh Gupta and Debasis Das, “A Framework for Data Security and Storage in Cloud Computing”, IEEE International Conference on Computational Techniques in Information and Communication Technologies,2016.
[8] MrinalKantiSarkar and Sanjay Kumar, “A Framework to Ensure Data Storage Security in Cloud Computing”, IEEE Annual Ubiquitous Computing, & Mobile Communication Conference, 2016.
[9] G. PrabuKanna and V.Vasudevan, “Enhancing the security of user data using the Keyword Encryption and Hybrid cryptographic algorithm in cloud”, IEEE International Conference on Electrical, Electronics and Optimization Techiques, 2016, pp.1-6.
[10] ShakeebaS.Khan and R.R.Tuteja, “Cloud Security using Multilevel encryption algorithms”, International Journal of Advanced Research in Computer and Communication Engineering, 2016, Vol.5, Iss.1, pp.70-75.
[11] Dr.L.Arockiam and S.Monikandan, “A Security Service Algorithm to Ensure the Confidentiality of Data in Cloud Storage”, IEEE International Journal of Engineering Research & Technology, 2016, Vol.3, Iss.12, pp.1053-1058.
[12] Geeta Sharma and SheetalKalra, “A Noval Scheme for Data Security in Cloud Computing using Quantum Cryptography”, IEEE AICTC,2016.
[13] M.D. Boomija and S.V. Kasmir Raja, “Secure data sharing through Additive Similarity based ElGamal like Encryption”, IEEE International Conference on Advances in Electrical, Electronics, Information, Communication and Bio-Informatics,2016.
[14] S. Arul Oli and L. Arockiam, “A Novel Approach for Ensuring Data Confidentiality in Public Cloud Storage”, IEEE International Journal of Computer Applications, 2014, pp.1- 5.
[15] Munwar Ali Zardari, Low Tang Jung and NordinZakaria, “K-NN Classifier for Data Confidentiality in Cloud Computing”, IEEE International Conference on Computer and Information Sciences, 2014.
[16] Yuhong Liu, JungwooRyooand SyedRizvi, “Ensuring Data Confidentiality in Cloud Computing: An Encryption and Trust- based Solution”, IEEE WOCC,2014.
[17] Khaled M. Khan and MahboobShaheen, “Empowering Users of Cloud Computing on Data Confidentiality”, IEEE 3rd International Conference on Cloud Networking, 2014, pp.272-274.
[18] S.ArulOli and Dr.L. Arockiam, “Confidentiality Technique using Data Obfuscation to Enhance Security of Stored Data in Public Cloud Storage”, IEEE International Journal of Advanced Research in Electronics and Communication Engineering, 2016, Vol.5, Iss.1, pp.169-174.
[19] MalekNajib Omar, MazleenaSalleh and MajidBakhtiari, “Biometric Encryption to Enhance Confidentiality in Cloud Computing”, IEEE International Symposium on Biometrics and Security Technologies, 2014,pp.45-50.
[20] N.Jayapandian, Dr.A.M.J.Md.ZubairRahman and Rahman, “ImprovedCloud
[21] Security Trust on Client Side Data Encryption using HASBE and Blowfish”, IEEE Online International Conference on Green Engineering and Technologies, 2016.
[22] [21]. Manjeet Singh, “Study on Cloud Computing and Cloud Database”, IEEE International Conference on Computing, Communication and Automation, 2015, pp.708-713.
[23] [22]. A.VithyaVijayalakshimi, N.Veeraragavan and Dr.L.Arockiam “A Study on Cloud Data Security Issues”, Research Journal Misbah, 2015, Vol.15, pp.15-25.
[24] [23]. Harshitha. K. Raj, “A Survey on Cloud Computing”, International Journal of Advanced Research in Computer Science and Software Engineering, 2014, Vol.4, Iss.7, pp.352-357.
[25] [24]. S. Arul Oil, S. Monikandan and Dr.L.Arockiam “A Framework for Data Confidentiality in Public Cloud Storage”, Research Journal Misbah, 2015, Vol.15, pp.8- 14.
[26] [25]. JasleenKaur, AnupmaSehrawat and NehaBishnoi, “Survey paper on Basics on Cloud Computing and Data Security”, International Journal of Computer Science Trends and Technology (IJCST), 2014, Vol.2, Iss.3, pp. 16-19.

M. Vishnupriya, "A Study on Research Problems in Data Security in Cloud Computing", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.97-101, 2019.

QoS (Quality of Services) is a very important research topic in cloud computing. When we select an optimal cloud service from functionally equivalent service we use QoS value for a good decision making. QoS ranking provides priceless information in selecting the best cloud service in cloud computing. In order to avoid time consumption and to select the best service for the cloud customer a good QoS ranking prediction framework is required. It should be a much user as friendly and less time consuming. In this paper Spearman Rank Correlation Based Nature Inspired Firefly Optimization (SRC-NIFO) method is analyzed for ranking prediction. It will give higher accuracy and be less time consuming. When the proposed framework is compared with the previous works on the basics of response in time, throughput, and latency the proposed work is proved to be much better than the previous works.

Cloud computing, quality of service (QoS), Cloud Service Provider, Ranking Prediction, Rank Correlation, Selection.

[1] Nur Farahlina Johari, Azlan Mohd Zain, Noorfa Haszlinna Mustaffa1 and Amirmudin Udin, “Firefly Algorithm for Optimization Problem”, Applied Mechanics and Materials Vol. 421 (2013) pp 512-517.
[2] OnlineAvailable: https://en.wikipedia.org/wiki/Spearman%27s_rank_correlation_coefficient
[3] Danilo ArdagnaGiuliano, Casale, Michele Ciavotta and Juan F Pérez, “Quality-of-service in cloud computing: modeling techniques and their applications”, Journal of Internet Services and Applications December 2014
[4] Jieming Zhu, Pinjia He, Zibin Zheng and Michael R. Lyu, “Online QoS Prediction for Runtime Service Adaptation via Adaptive Matrix Factorization”, IEEE Transactions on Parallel and Distributed Systems, Volume 28, Issue 10, October 2017, Pages 2911 – 2924.
[5] K. Jayapriya, N. Ani Brown Mary and R. S. Rajesh, “Cloud Service Recommendation Based on a Correlated QoS Ranking Prediction”, Journal of Network and Systems Management, Volume 24, Issue 4, October 2016, Pages 916–943.
[6] Hua Ma, Haibin Zhu, Zhigang Hu, Keqin Li and Wensheng Tang, “Time-aware trustworthiness ranking prediction for cloud services using interval neutrosophic set and ELECTRE”, Knowledge-Based Systems, Elsevier, Volume 138, December 2017, Pages 27-45.
[7] Neeraj Yadav and Major Singh Goraya, “Two-way Ranking Based Service Mapping in Cloud Environment”, Future Generation Computer Systems, Elsevier, Volume 81, April 2018, Pages 53-66.
[8] Zhen Ye, Sajib Kumar Mistry, Athman Bouguettaya, and Hai Dong, “Long-term QoS-aware Cloud Service Composition using Multivariate Time Series Analysis”, IEEE Transactions on Services Computing, Volume 9, Issue 3, May-June 2016, Pages 382 – 393.
[9] Online Available: https://en.wikipedia.org/wiki/CloudSim.

S. Beghin Bose, S.S. Sujatha, "QoS Ranking Prediction Approach for Cloud Services Using Spearman Rank Correlation Based Nature Inspired Firefly Optimization", International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.102-106, 2019.