IOSR Journal of Computer Engineering (IOSR-JCE)

Mar - Apr 2014Volume 16 - Issue 2

Version 1 Version 2 Version 3 Version 4 5 6 7 8 9 10 11 12

Paper Type : Research Paper
Title : E-Admission System
Country : India
Authors : Chandraganga Mirji, Vaibhavi Deshpande, Supriya Walunj, Ankita Ambavane
: 10.9790/0661-16220103    logo
Abstract: Directorate of technical education (DTE) conducts online admissions for engineering colleges but they don't have software to help students to select college and branch. They give data in the form of tables in pdf file and a student has to go through it. Many students don't understand the data and many parents who come from rural area and uneducated but want their ward to study in engineering fail to fill options form. Whatever may be the CET score they try to fill best colleges known. Hence, our proposed computer aided system will help the students to get the list of all colleges in which they could get the admission at the click of a button. The students only have to enter their marks of CET, AIEEE etc. With this software, the students can very easily obtain the list of colleges even branch wise and category wise. This will not only make the admission process easy but also minimizes stress of students .The main objective of our system is to make right choice of colleges, so that maximum of the students get selected in the first attempt itself.
Keywords: DTE, CET, AIEEE, C4.5 algorithm, Centralized data handling.
[1] Borah M.D.,Application of knowledge based decision technique to predict student enrollment decision , Recent Trends in Information Systems (ReTIS), 21-23 Dec. 2011,180-184.
[2] Ragab, A.H.M. , Hybrid recommender system for predicting college admission, Intelligent Systems Design and Applications (ISDA), 29 Nov. 2012, 107-113.
[3] Rensong Dong,The module of prediction of College Entrance Examination aspiration, Fuzzy Systems and Knowledge Discovery (FSKD), 31 May 2012 ,1559-1562.

Paper Type : Research Paper
Title : Agile Web Service Composition and Messaging approach fore-government services
Country : Mauritius
Authors : Avinash Ramtohul, Prof. K. M. S. Soyjaudah
: 10.9790/0661-16220414    logo
Abstract: E-Government services are increasingly being deployed using service-based architectures. Individual web services, developed from legacy and modern firmware, are composed to achieve e-service delivery. Current web service composition approaches range from practical languages aspiring to become standards (like BPEL, WS-CDL, OWL-S and WSMO) to theoretical models (like automata, Petri nets and process algebras). In this work, current approaches were studied and a comparison of their features and weaknesses was carried out. It was observed that current composition mechanisms are static and not agile enough to cater for functional change in business needs. This paper proposes a new web service composition and messaging mechanism for electronic government services in which composition of web services is done dynamically to provide for more agility in government e-services. The proposed composition mechanism works on a software architecture which enables application software integration. This architecture has been developed to deploy end-to-end e-services to G2B, G2C and G2G users starting from legacy government software applications. Using the proposed approach, integrating back-end e-Government applications to deliver end-to-end e-services can be agile, simpler and faster. The main contribution of this paper is the novel dynamic web service composition mechanism.
Keywords: e-Government, SOA, Business Process Management, Software architecture.
[1] IBM 2007. Business Process Execution Language for Web Services version 1.1 BPEL 1.1. Available:, Accessed Dec 2011
[2] Kavantzas, D. Burdett, and G. Ritzinger 2004. WSCDL v1.0. Available:
[3] Ankolekar et al., 2007, DAML-S: Web Service Description for the Semantic Web in Proc.
[4] WSMO working group, 2008. Available: Accessed Sep 2011
[5] Bartalos et al. 2011. Effective Automatic Dynamic Semantic Web Service Composition. Information Sciences and Technologies Bulletin of the ACM Slovakia, Vol. 3, 2011, No. 1, pp. 61–72.

Paper Type : Research Paper
Title : Enhanced Data Processing Using Positive Negative Association Mining on AJAX Data
Country : India
Authors : Sumayya Khan, Shrikant Lade
: 10.9790/0661-16221518    logo
Abstract: Knowledge discovery is the process of analyzing data from different perspectives and summarizing it into useful information. [1] Association rule mining is a data mining process used widely in traditional databases to find the positive association rules. Association rules are created by analyzing data for frequent patterns and using the criteria support and confidence to identify the most important relationships. However, there are some other challenging rule mining topics like negative association rule mining. Organizations want to concentrate on their own business and outsource the rest of their work. This approach is named ''Software as a Service Concept'' and provides lots of benefits to data owner, but, at the same time, brings out some security problems. In this research, a rule mining approach has been proposed that provides efficient and secure solution to positive and negative association rule computation on AJAX data streams in software as a service (SaaS) concept. It is important to note that SaaS typically encapsulates enterprise as opposed to consumer-oriented web-hosted software. Software as a service (SaaS) is a way of delivering applications over the Internet—as a service. Instead of installing and maintaining software, you simply access it via the Internet, freeing yourself from complex software and hardware management. SaaS applications are sometimes called Web-based software, on-demand software, or hosted software. By using [3] AJAX, we get the search result in the form of semantic.
Index Terms: Association rules mining, Ajax data stream, horizontal tree approach, Apriori algorithm.
[1]. Agrawal, R.; Imieliński, T.; Swami, A. (1993). "Mining association rules between sets of items in large databases". Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93. p. 207. doi:10.1145/170035.170072. ISBN 0897915925.
[2]. Jesse James Garrett (18 February 2005). "Ajax: A New Approach to Web Applications". Archived from the original on 2 July 2008. Retrieved 19 June 2008.
[3]. Samet Cokpinar, Taflan Imre Gunden, "Positive and negative rule mining on XML data streams in database as a service concept", Expert Systems with Applications, Vol.39, pp.7503-7511, 2012.
[4]. "Data Processing", Available:
[5]. Rakesh Agrawal and Ramakrishnan Srikant Fast algorithms for mining association rules in large databases. Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pages 487-499, Santiago, Chile, September 1994

Paper Type : Research Paper
Title : Secure Data Transmission Using Dna Sequencing
Country : India
Authors : Bama R., Deivanai S., Priyadharshini K.
: 10.9790/0661-16221922    logo
Abstract: The medical record system includes substantial information such as diagnoses of diseases, treatment undergone, patient's health condition, medication information, examination results and nursing actions. Consequently, these information helps medical staff understand the patient's medical record instantly and can provide accurate diagnoses for the disease. Traditional paper based medical report system has many problems including illegible handwriting, conversation difficulty, slow data transfer, easily damaged and rampant . To overcome such drawbacks, we reformed it into electronic patient records. With the increased development of internet, sharing the medical reports over a public domain is not much secured that it can be accessed by attackers and destroy them. To protect these information from attackers, existing system provides access control through Lagrange Interpolation in which the key we use is randomized, no relationship between each key so that the key can be managed effectively. To provide access control and to enhance security Elliptic Curve Cryptography was used in which the attackers encounter Elliptic Curve Discrete Logarithmic Problem. Once the prime number is big enough, attackers will have trouble deciphering the key but it increases the size of the encrypted message, is difficult, increases implementation errors and not much secured too. So that, we proposed DNA sequencing which ensures secured data authorization, storage and transmission.
Keywords: Access Control , Mobile Agent, DNA Sequence.
[1] Tsung-Chih Hsiao, Tzer-Long Chen, Chih-Sheng Chen, Fu-Sheng Xu, Starlition Tsui, Yu-Fang Chung and Tzer-Shyong Chen, "Secure Data Transmission for Controlling Access via Key Management Scheme", IEEE 2013.
[2] Jin-Shiuh Taur, Heng-Yi Lin, Hsin-Lun Lee and Chin-Wang Tao, "Data Hiding In Dna Sequences Based On Table LookUp Substitution", International Journal of InnovativeComputing, Information and Control, Volume 8, Number 10(A), October 2012
[3] M. H. Kao, "The Study of Agent-based Secure Schemes on ElectronicMedical Records System", Master Thesis, Tunghai University,Taichung, 2010.
[4] Monica BORDA, Olga TORNEA, "DNA Secret Writing Techniques", Technical University of Cluj-Napoca,2010.
[5] Ban Ahmed Mitras , Adeeba Kh. Aboo, "Proposed Stenography Approach using DNA Properties", College of Computer & Mathematic Science-Mosul Univ./ IRAQ, 2013.

Paper Type : Research Paper
Title : A Survey Report on: Become Prudent with Big Data - Technological sophistication in India
Country : India
Authors : Sujata A. Pardeshi, Pooja K. Akulwar
: 10.9790/0661-16222330    logo
Abstract: In the world of globalization at 360 degree, a heavy digitalized rainy season has raised & the rain drops of digital data is falling from the digitalized sky through lots of clouds of E-Commerce, Mobile-Commerce , Social Media, Internet things, Digital devices like Smart phones, Sensors, etc and the data streams have been escalating at the eye moment continuously without halt. Such a digitalized torrent of data stream is accommodating by a huge and very big ocean of the technological advancement of Big Data. Recently it has been seen that this big ocean of large data set mitigates and offers a big number of opportunities both for the existing and upcoming players to become big on the competitive track and also have a great impact on India and Indian Economy. According to NASSCOM & CRISL, in India the Big Data Industry will grow from $200 million in 2012 to an estimated $1 billion in 2015 at a Calculated Annual Growth Rate of more than 83 percent and IDC states that, the market for big data moves around India & will soon reach $16.1 billion in 2014, growing 6 times faster than the overall IT market. Therefore to dive on the growing economical waves, it is important for Entrepreneur's and Organizers to become prudent in driving the technological sophistication ship in the journey of Big Data Ocean. The proposed study will be experienced about prudence in getting what is Big Data, how it was evolved, and what it involved in it?
Keywords: Big Data, Economy, Infrastructure, Investment, Technological Advancement.
[1] Gil Press, A very short history of Big Data, 2013,
[2] Tekiner, Firat ; Keane, John A., Big Data framework, IEEE International Conf. on Systems, Man, and Cybernetics (SMC), 2013.
[3] Wielki, Implementation of Big Data concept in organizations – possibilities, impediments and challenges, IEEE Federated Conf. on Computer Science and Information Systems, Conference,2013
[4] Jay Lee, Edzel Lapira, Behrad Bagheri, Hung-an Kao, Recent advances and trends in predictive manufacturing systems in big data environment, ScienceDirect Journal, 1(1),October 2013.
[5] IDC. Worldwide Big Data Technology and Services 2012-2015 Forecast. <>

Paper Type : Research Paper
Title : Congestion Control Technique for Wireless Networks
Country : India
Authors : Alhamali Masoud Alfrgani Ali, Raghav Yadav, Hari Mohan Singh
: 10.9790/0661-16223133    logo
Abstract: Congestion control in wireless networks has been extensively investigated over the years and several schemes and techniques have been developed, all with the aim of improving performance in wireless net-work. With the rapid expansion and implementation of wireless technology it is essential that the congestion control problem be solved. This paper presents a congestion control schemes which are different in slow start threshold calculation, bandwidth estimation, and congestion window manipulation. A comprehensive comparison of these approaches is given in relation to assumptions, bandwidth estimation, congestion window size manipulation, performance evaluation, fairness and friendliness and improved throughput.
[1]. Balakrishnan, H. and Padmanabhan, V. and Seshan, S. and Stemm, M. and Katz,R.: TCP behavior of a busy internet server:
Analysis and improvements. Proceedingsof IEEE INFOCOM, 1998
[2]. Chandran, K. and Raghunathan, S. and Venkatesan, S. and Prakash, R.: AFeedback-based Scheme for Improving TCP Performance
in Ad Hoc Wireless Networks.Proceedings of ICDCS, 1998
[3]. Chen, K. and Nahrstedt, K. and Vaidya, N.: The Utility of Explicit Rate-BasedFlow Control in Mobile Ad Hoc Networks.
Proceedings of IEEE WCNC, 2004322 Y. Su and T. Gross
[4]. D. Kim, C.-K. Toh, and Y. Choi. "TCP-BuS: improving TCP performance in wireless ad hoc networks".journal ofcommunications
and networks, vol. 3, no.2, june 2001.
[5]. Dina Katabi, Mark Handley, and Charlie Rohrs. "Congestion control for high bandwidth delay product networks."SIGCOMM

Paper Type : Research Paper
Title : Study on Face Recognition Algorithm
Country : India
Authors : Mr. Sarath P. S., Ms. Kumary R Soumya
: 10.9790/0661-16223439    logo
Abstract: Biometrics authentication is started to be used worldwide since the security it provides is of greater extends. Face recognition is an important method of such an authentication. Face recognition can be carried out by many algorithms such as PCA, LDA, ICA, BIC, AAM etc. In this paper, a detailed study about these algorithms is performed. The study deals with the definition part, methodology and the classification as well.
Keywords: Face Recognition, Biometrics, PCA, LDA, ICA, BIC, AAM.
[1] S. Gong et al., "Dynamic Vision: From Images to Face Recognition", Imperial College Press, 2001.
[2] Lindsay I Smith ," A tutorial on Principal Components Analysis" , February 26, 2002
[3] Maricio Luis Teixeira,"The Bayesian intrapersonal/extrapersonal classifier" colorado state university, 2003
[4] Marcio L. Teixeira and J. Ross Beveridge ," An Implementation and Study of the Moghaddam and Pentland Intrapersonal/ Extrapersonal Image Difference Face Recognition Algorithm" , may 2003.
[5] R. Duda et al. ,John Wiley, "Pattern Classification", 2001 (pp. 117-124, soft copy).

Paper Type : Research Paper
Title : Efficient Detection of Internet Worms Using Data Mining Techniques
Country : India
Authors : B. Sujatha, G.Rajitha devi
: 10.9790/0661-16224046    logo
Abstract: Internet worms pose a serious threat to computer security.Traditional approaches using signatures to detect worms pose little danger to the zero day attacks. The focus of malware research is shifting from using signature patterns to identifying the malicious behavior displayed by the malwaresThis paper presents a novel idea of extracting variable length instruction sequences that can identify worms from clean programs using data mining techniques.The analysis is facilitated by the program control flow information contained in the instruction sequences. Based upon general statistics gathered from these instruction sequences we formulated the problem as a binary classification problem and built tree based classifiers including C5.0, boosting and random forest. Our approach showed 99.5% detection rate on novel worms whose data was not used in the model building process.
[1] The r project for statistical computing
[2] ExEinfo PE.
[3] Generic Unpacker Win32.
[4] IDA Pro Disassembler.
[5] PEiD.
[6] UPX the Ultimate Packer for eXecutables.

Paper Type : Research Paper
Title : Addressing Mental Health Epidemic among University Students via Web-based, Self-Screening, and Referral System
Country : India
Authors : V.D.Kulkarni, Tanuja Gondkar, Gunjan Singh, Aditi Gulunjkar
: 10.9790/0661-16224752    logo

Abstract: The prevalence and severity of mental health problems in college and university communities are alarming. How-ever, the majority of students with mental disorders do not seek help from professionals. To help students assess their mental conditions and encourage them to take an active role in seeking care, we developed a web-based self-screening, referral, and secure communication application. The proposed system will do the self screening of the student by asking them question in the area of anxiety, depression, attention deficit disorder, alcohol use, eating disorder. If system found any student with mental disorder then that student will be refer to doctor for further checkup.

Index Terms: College, Internet, mental health, referral, screening, university, World WideWeb.

[[1] American College Health Association, "National college health assessment spring 2008 reference group data report," J. Amer. Coll. Health, vol. 57, pp. 477–488, 2009.
[2] [11] K. Zivin, D. Eisenberg, S. E. Gollust, and E. Golberstein, "Persistence of mental health problems and needs in a college student population," J. Affective Disorders, vol. 117, pp. 180–185, 2009.
[3] American College Health Association, "National college health assessment spring 2007 reference group data report," J. Amer. Coll. Health, vol. 56, pp. 469–479, 2008.
[4] R. Kadison and T. F. DiGeronimo, College of the Overwhelmed: The Campus Mental Health Crisis and What to Do about it. San Francisco, CA: Jossey-Bass, 2004.
[5] E. Kim, A. Mayani, S. Modi, C. Soh, and Y. Kim, "Evaluation of patientcentered electronic health record to overcome digital divide," Conf. Proc. IEEE Eng. Med. Biol. Soc., pp. 593–596, 2005.
[6] J. R. Fann, D. L. Berry, S. Wolpin, M. Austin-Seymour, N. Bush, B. Halpenny, W. B. Lober, and R. McCorkle, "Depression screening using the Patient Health Questionnaire-9 administered on a touch screen computer," Psychooncology, vol. 18, pp. 14–22, 2009.

Paper Type : Research Paper
Title : Secure Code Based Mostly Information Forwarding System in Cloud Storage
Country : India
Authors : G.Shaik Abdullah
: 10.9790/0661-16225357    logo

Abstract: Cloud Computing may be a technology that treats the resources on the net as a combined entity, a cloud. This project addresses the matter of forwarding information to a different user by storage servers directly beneath the management of the info owner. With this thought, we tend to propose a completely unique proxy re-encryption theme and integrate it with a secure redistributed code to create a secure distributed wares area structure. The coding set up chains indoctrination operations over encrypted messages and forwarding operations over encrypted and encoded messages. It makes the storage system expeditiously meet the wants of knowledge strength, information confidentiality, and information forwarding. Achieving the mixing considerately of a distributed structure is difficult. Our system meets the wants that storage servers severally perform re- coding and key servers severally perform partial coding. The planned system permits additional versatile adjustment between the quantity of storage servers and strength.

Keywords: Cloud computing, Erasure code, Proxy re- coding techniques, Redistributed Storage system.

[1] Adya, A., Bolosky, W.J., Castro, M., Cermak, G., Chaiken, R.., Douceur, Howell, J.R., Lorch, J.R., Theimer, M., and Wattenhofer, R. (2002). "Farsite: Federated, available, and reliable storage for an incompletely trusted environment," in Proceedings of the 5th Symposium on Operating System Design and Implementation - OSDI, p. 1–14.
[2] Ateniese, G., Benson, K., and Hohenberger, S. (2009) "Key-private proxy reencryption," in Proceedings of Topics in Cryptology - CT-RSA, vol. 5473 of Lecture Notes in Computer Science, p. 279–294.
[3] Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z. and Song, D. (2007) "Provable data possession at untrusted stores," in Proceedings of the 14th ACM Conference on Computer and Communications Security - CCS, p. 598–609.
[4] Ateniese, G., Kamara, S. and Katz, J. (2009) "Proofs of storage from homomorphic identification protocols," in Proceeding of the 15th International Conference on the Theory and Application of Cryptology and Information Security - ASIACRYPT, vol. 5912 of Lecture Notes in Computer Science, p. 319–333.

Paper Type : Research Paper
Title : Security-Aware Packet Scheduling Scheme with Multi-Level Queuing and RSA
Country : India
Authors : J. Antony Suganiya, J. Viji Priya
: 10.9790/0661-16225863    logo

Abstract: Emerging security-aware packet scheduling algorithms can efficiently improve the security measures while forwarding the packets over wireless links. Existing scheduling algorithms for real-time wireless networks are not capable of providing higher level of security. The proposed methodology overcomes the difficulties in the existing scheduling algorithm with the security enhancements. A multilevel queue scheduling algorithm is used to partition the ready queue into several separate queues.For security reasons, the proposed methodology uses the RSA algorithm for encrypting and decrypting the packets. The proposed Security-aware Packet Scheduling (SPS) methodology strives to improve the security levels while achieving high schedulability for real-time packets. The proposed model reduces the congestion occurred during scheduling the packets.The performance of the proposed method results better security than the existing Quality Based Searching algorithm. Also, the system takes lesser time, reduces congestion and traffic also provides higher arrival rate for scheduling the packets.

Index Terms: Encryption, Decryption, Multilevel queue scheduling, RSA, Real-time packets, andScheduling algorithms

[1] Y. Li, Y. Yang, L. Zhou, A. Wei, and C. Cao, "QoS‐aware fair packet scheduling in IEEE 802.16 wireless mesh networks," International Journal of Communication Systems, vol. 23, pp. 901-917, 2010.
[2] T. Nelms and M. Ahamad, "Packet scheduling for deep packet inspection on multi-core architectures," in Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, 2010, p. 21.
[3] W. Jiang, G. Xiong, X. Ding, Z. Chang, and N. Sang, "Confidentiality-aware message scheduling for security-critical wireless networks," Systems Engineering and Electronics, Journal of, vol. 21, pp. 154-160, 2010.
[4] G. R. Gupta and N. B. Shroff, "Delay analysis and optimality of scheduling policies for multihop wireless networks," IEEE/ACM Transactions on Networking (TON), vol. 19, pp. 129-141, 2011.
[5] Z. Wang, W. Hu, W. Sun, H. He, and L. Yi, "An efficient aggregation scheduling algorithm for unbalanced traffic distribution in optical packet switch network," in Communications and Photonics Conference and Exhibition (ACP), 2010 Asia, 2010, pp. 635-636.

Paper Type : Research Paper
Title : Fuzzy C Means Clustering Algorithm for High Dimensional Data Using Feature Subset Selection Technique
Country : India
Authors : N. Manjula1, S. Pandiarajan J.Jagadeesan

: 10.9790/0661-16226469    logo
Abstract:Feature choice involves characteristic a set of the foremost helpful options that produces compatible results because the original entire set of options. A feature choice rule is also evaluated from each the potency and effectiveness points of read. Whereas the potency considerations the time needed to search out a set of options, the effectiveness is expounded to the standard of the set of options. Supported these criteria, an economical Fuzzy C Means (FCM) is projected and by experimentation evaluated in this paper. The quick rule works in 2 steps. Within the commencement, options area unit divided.

[1]       H. Almuallim and T.G. Dietterich (1992),Algorithms for IdentifyingRelevant Features.
[2]       H. Almuallim and T.G. Dietterich (1994), Learning Boolean Concepts inthe Presence of Many Irrelevant Features.
[3]       A. Arauzo-Azofra, J.M. Benitez, and J.L. Castro (2004),A Feature SetMeasure Based on Relief.

Paper Type : Research Paper
Title : Self-Optimized Multihop Routing Protocol founded at Wireless Sensor Networks Cross Layer Architecture
Country : India
Authors : Prof. Homera Durani, Prof. Kaushik I. Manavadariya
: 10.9790/0661-16227074    logo
Abstract: Nowadays, wireless sensor networks (WSNs) are evolving growth wise beneficial, worthwhile and a challenging learning streams. The advancements in WSN endow a broad variety of ecological monitoring and object tracking applications. Moreover, multihop (node by node) routing in WSN is influenced by new instruments certainly entering or departing the network. Thus, nature motivated self-progress and maintained protocols are needed to tackle the problems originating in WSN. We suggested ant colony stimulated routing, which is displaying an extra ordinary performance for WSNs. In this manuscript, a traverse layer conceive founded self-optimized (ACO) routing protocol for WSN and the results are offered. Velocity,
[1] S. Balasubramaniam, D. Botvich, W. Donnelly, M. Foghluh, and J. Strassner, "Biologically Inspired Self-Governance and Self-Organisation for Autonomic Networks," in Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems. vol. 275Cavalese, Italy: ACM, 2006, p. 30.
[2] S. Balasubramaniam, W. Donnelly, D. Botvich, N. Agoulmine, and J. Strassner, "Towards integrating principles of Molecular Biology for Autonomic Network Management," in Hewlett Packard university Association (HPOVUA) conference, Nice, France., 2006.
[3] P. Boonma and J. Suzuki, "MONSOON: A CoevolutionaryMultiobjective Adaptation Framework for Dynamic Wireless Sensor Networks," in In Proc. of the 41st Hawaii International Conference on System Sciences (HICSS) Big Island, HI, 2008.
[4] N. Mazhar and M. Farooq, "BeeAIS: Artificial Immune System Security for Nature Inspired, MANET Routing Protocol, BeeAdHoc," Springer-Verlag Berlin Heidelberg, vol. LNCS 4628, pp. 370–381, 2007.
[5] G. Chen, T.-D. Guo, W.-G. Yang, and T. Zhao, "An improved ant-based routing protocol in Wireless Sensor Networks," in Collaborative Computing: International Conference on Networking, Applications and Worksharing, 2006. CollaborateCom2006., New York, NY, 2006, pp. 1-7.

Paper Type : Research Paper
Title : Collective Behavior of social Networking Sites
Country : India
Authors : Ashwini Vispute, Prerna Jadhav, Prof. P. V Kharat
: 10.9790/0661-16227579    logo

Abstract: Now a days a huge data is generated by social media like Facebook, Twitter, Flickr, and YouTube .This big data present opportunities and challenges to study collective behavior of data. In this work, we predict collective behavior in social media. In particular, given information about some individuals, how can we infer the behavior of unobserved individuals in the same network? A social-dimension-based approach has been shown effective in addressing the heterogeneity of connections presented in social media. However, the networks in social media are normally of colossal size, involving hundreds of thousands of actors. The scale of these networks entails scalable learning of models for collective behavior prediction. To address the scalability issue, we propose an edge-centric clustering scheme to extract sparse social dimensions. With sparse social dimensions, the proposed approach can efficiently handle networks of millions of actors while demonstrating a comparable prediction performance to other non-scalable methods.

Index Terms: Classification with Network Data, Collective Behavior, Community Detection, Social Dimensions.

[1] L. Tang and H. Liu, ―Toward predicting collective behavior via social dimension extraction,‖ IEEE Intelligent Systems, vol. 25, pp. 19–25, 2010.
[2] ——, ―Relational learning via latent social dimensions,‖ in KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2009, pp. 817–826.
[3] M. Newman, ―Finding community structure in networks using the eigenvectors of matrices,‖ Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), vol. 74, no. 3, 2006. [Online]. Available:
[4] L. Tang and H. Liu, ―Scalable learning of collective behavior based on sparse social dimensions,‖ in CIKM '09: Proceeding of the 18th ACM conference on Information and knowledge management. New York, NY, USA: ACM, 2009, pp. 1107–1116.

Paper Type : Research Paper
Title : Soundness to Single Sign on Using OTP in Distributed Networks
Country : India
Authors : Miss. Bhavana M. Bahikar, Prof. Praveen R. Barapatre
: 10.9790/0661-16228086    logo

Abstract: In a distributed system, there are numerous service provider. The user must be authenticated to entrance the services provided by the service provider. It is challenging to recall all secret words for users. So to clarify this problem single sign on is used which is an authentication contrivance in that permit a single license to be validated by multiple service provider. The Wang, Yu, and Qi Xie find that Chang – Lee Scheme undergoes from two attacks one of which is that the aggressor is outside service provider converses with the authenticated user twice and get the license necessary to right to use data in distributed systems. The second attack is the outsider easily receiving right to use to, use services without any license by mimicking authenticate user. This violence also associated with Hsu and Chang Scheme. To sidestep these attacks Wang, Yu, and Qi Xie employed RSA-VES. For enhancement and soundness of authentication, this paper services One Time Password to Wang, Yu, and Qi Xie Method. Now a days OTP plays important role in an authentication, so that using OTP for secure single sign on its easy to provide soundness for authentication.

Index Terms:Authentication, RSA-VES, distributed system, Security, Single Sign On(SSO),One Time Password(OTP).

[1] A. C. Weaver and M. W. Condtry, "Distributing internet services to the network's edge," IEEE Trans. Ind. Electron., vol. 50, no. 3, pp. 404–411, Jun. 2003.
[2] L. Lamport, "Secret word authentication with insecure communication," Commun. ACM, vol. 24, no. 11, pp. 770– 772, Nov. 1981.
[3] W. B. Lee and C. C. Chang, "User identification and key distribution maintaining anonymity for distributed systems," Comput. Syst. Sci. Eng., vol. 15, no. 4, pp. 113–116, 2000.
[4] W. Juang, S. Chen, and H. Liaw, "Robust and efficient secret word authenticated key agreement using smart cards," IEEE Trans. Ind. Electron., vol. 15, no. 6, pp. 2551–2556, Jun. 2008.
[5] X. Li,W. Qiu, D. Zheng, K. Chen, and J. Li, "Anonymity enhancement on robust and efficient secret word-authenticated key agreement using smart cards," IEEE Trans. Ind. Electron., vol. 57, no. 2, pp. 793–800, Feb. 2010.

Paper Type : Research Paper
Title : A Method for Bypassing Keystroke Recognition Based Security System Using Social Engineering
Country : India
Authors : Devbhuti Shounak, Ganguly Debojyoti, Majumder Debdeep, Payra Ritwik
: 10.9790/0661-16228793    logo
Abstract: In this paper we aim to use the power of Social Engineering to bypass Keystroke Recognition based authentication system. We have designed a virtual chat system (basically a chat bot), coded in Python, which performs the much needed social engineering on the victim. A wise victim may think that the bot is trying to extract confidential credentials from him and so provides false credentials to it but in reality the bot has nothing to do with the credentials. Bot's only job is to record the typing speed of the individual which is the basic need of a security system based on keystroke recognition. Our system includes following prime specialties (assuming two machines, one is the victim's and another the attacker's).
[1] Fabian Monrose, Aviel D. Rubin, "Keystroke dynamics as a biometric for authentication", Future Generation Computer Systems, 2000 ELSEVIER, Volume 16, Issue 4, February 2000, Pages 351–359.
[2] Jiyou Jia, "CSIEC: A computer assisted English learning chatbot based on textual knowledge and reasoning", Knowledge-Based Systems, ELSEVIER, Volume 22, Issue 4, May 2009, Pages 249–255.
[3] T Thornburgh, "Social engineering: the Dark Art". Paper presented at InfoSecCD '04 Proceedings of the 1st annual conference on Information Security Curriculum Development
[4] Rusch, J, "The "social engineering" of Internet fraud". Paper presented at the 1999 Internet Society's INET'99 conference. Retrieved from
[5] Manske, K, "An introduction to social engineering", Information Systems Security 9, Pages 53-59. Retrieved from GALILEO: Computer Source database.

Paper Type : Research Paper
Title : Semantic based Automated Service Discovery
Country : India
Authors : Mr.Likhesh N. Kolhe, Prof. Sachin M. Bojewar
: 10.9790/0661-16229499    logo

Abstract: A vast majority of web services exist without explicit associated semantic descriptions. As a result many services that are relevant to a specific user service request may not be considered during service discovery. In this paper, we address the issue of web service discovery given no explicit service description semantics that match a specific service request. Our approach to semantic based web service discovery involves semantic-based service categorization and semantic enhancement of the service request. We propose a solution for achieving functional level service categorization based on an ontology framework. Additionally, we utilize clustering for accurately classifying the web services based on service functionality. The semantic-based categorization is performed offline at the universal description discovery and integration (UDDI). The semantic enhancement of the service request achieves a better matching with relevant services. The service request enhancement involves expansion of additional terms (retrieved from ontology) that are deemed relevant for the requested functionality. An efficient matching of the enhanced service request with the retrieved service descriptions is achieved utilizing Latent Semantic Indexing (LSI). Our experimental results validate the effectiveness and feasibility of the proposed approach.

Keywords: Semantic Matching, Semantic Web services, Service-oriented Computing, SVM, UDDI

1] J. Adcock, A. Girgensohn, M. Cooper, T. Liu, L. Wilcox, and E. Rie, "FXPAL Experiments for TRECVID," Proc. TRECVID, 2004.
[2] R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules Between Sets of Items in Large Databases," Proc. ACMSIGMOD Int'l Conf. Management of Data, 1993.
[3] E. Al-Masri and Q.H. Mahmoud, "Investigating Web Services on the World Wide Web," Proc. 17th Int'l Conf. World Wide Web (WWW '08), Apr. 2008.
[4] M.-L. Antonie and O.R. Zaane, "Text Document Categorization by Term Association," Proc. IEEE Int'l Conf. Data Mining (ICDM '02), 2002.
[5] K. Anyanwu, A. Maduko, and A. Sheth, "SemRank: Ranking Complex Relationship Search Results on the Semantic Web," Proc. 14th Int'l Conf. World Wide Web (WWW '05), 2005.

Paper Type : Research Paper
Title : Experimental study of Web Page Ranking Algorithms
Country : India
Authors : Rachna Singh Bhullar, Dr. Praveen Dhyani
: 10.9790/0661-1622100106    logo

Abstract: Today's life is very much influenced by the internet. Everything can be accessed by making a search on the Internet. Web browsers and web search engines are the two major components of web searching. Web browsers are the software applications and web search engines are the software itself. To achieve the goal of web searching web indexer plays a very important role of indexing the web pages by making use of link analysis algorithms. In this paper we are going to compare the three most commonly used link analysis algorithms which are page rank, weighted page rank and the hub & authority algorithms.

Keywords: Page Rank Algorithm, Weighted Page Rank Algorithm, Link Analysis Algorithm, Hub and Authority Algorithm.

[1]. file:///F:/thesis/Ian%20Rogers%20%C2%BB%20Google%20Page%20Rank%20%E2%80%93%20Whitepaper.htm
[2]. Study of Page Rank Algorithms, A Power Point Presentation.
[3]. Web Page Rank Algorithm based on number of visits of links of web page by Neelam Tyagi in International Journal of Soft Computing and Engineering(IJSCE), ISSN:2231-2307, Vol2, Issue3, July 2012.
[4]. A Survey Paper on Hyperlink Induced Topic Search Algorithm for Web Mining by Ramesh Prajapati in International Journal of Engineering Research and Technilogy, ISSN 2278-0181, volume 1, Issue 2, April2012,

Paper Type : Research Paper
Title : Audio Denoising, Recognition and Retrieval by Using Feature Vectors
Country : India
Authors : Shruti Vaidya, Dr. Kamal Shah
: 10.9790/0661-1622107112    logo
Abstract: In this paper, we present the study of audio signal denoising, recognizing its audio type and retrieving similar signals from the database. Primarily the signal is denoised to remove any noise present in the unknown signal. Time Frequency Block Thresholding is used to achieve this. Removing the noise from audio signals requires processing of time-frequency coefficients in order to keep away from producing the musical noise. A block thresholding estimation procedure is introduced, which relates the parameters adaptively to signal property. Content Based Audio Retrieval system is very useful to identify the unknown audio signals. Audio signals are classified into music, speech and background sounds. This is done by the use of various feature vectors such as zero crossing rate, spectral centroid, spectral flux, spectral roll off. Use of multiple feature vectors improves the accuracy of the results being retrieved from the audio database. Various experiments demonstrate the performance and accurateness, providing good results for non standard signals. Keywords: Audio Classification, Audio Retrieval, Distance Measure, Feature Vectors, Precision Recall, Vector Quantization
1] Dr. H. B. Kekre, Tanuja K. Sarode, "New Clustering Algorithm for Vector Quantization using Rotation of Error Vector ", (IJCSIS) International Journal of Computer Science and Information Security, Vol. 7, No. 3, 2010
[2] Guodong Guo and Stan Z. Li, "Content-Based Audio Classification and Retrieval by Support Vector Machines", IEEE Transactions On Neural Networks, Vol. 14, No. 1, January 2003
[3] Vaishali Nandedkar, "Audio Retrieval Using Multiple Feature Vectors", International Journal of Electrical and Electronics Engineering (IJEEE) ,Volume-1 ,Issue-1 ,2011
[4] Hariharan Subramanian, Prof. Preeti Rao and Dr. Sumantra. D. Roy, "Audio Signal Classification", M.Tech. Credit Seminar Report, Electronic Systems Group, EE. Dept, IIT Bombay, Submitted November2004

Researcher can also search IOSR published article contents through

IOSR Xplore