IOSR Journal of Computer Engineering (IOSR-JCE)

Jan - Feb 2014Volume 16 ~ Issue 1

Version 1 Version 2 Version 3 Version 4 Version 5 6 7 8 9

Paper Type : Research Paper
Title : Character Identification in Movie Using Graph Matching Algorithm
Country : India
Authors : T. R. Mageswari, M.Tech CSE IIyr, Mrs.Murunya M.C.A., M.E.,
: 10.9790/0661-16180104    logo
Abstract: The character Identification in films are a challenging problem due to the hugevariation in the appearance of each character. It drawn significant research interests and had a many interestingapplications. In this paper, we investigate the problem of identifying characters using graph matching algorithm to get the most accurate identification.
[1] J. Sang, C. Liang, C. Xu, and J. Cheng, "Robust movie character identification and the sensitivity analysis," in ICME, 2011, pp. 1–6.
[2] Y. Zhang, C. Xu, H. Lu, and Y. Huang, "Character identification in feature-length films using global face-name matching," IEEE Trans.Multimedia, vol. 11, no. 7, pp. 1276–1288, November 2009.
[3] M. Everingham, J. Sivic, and A. Zissserman, "Taking the bite out of automated naming of characters in tv video," in Jounal of Image andVision Computing, 2009, pp. 545–559.
[4] C. Liang, C. Xu, J. Cheng, and H. Lu, "Tvparser: An automatic tv video parsing method," in CVPR, 2011,pp. 3377–3384.
[5] J. Sang and C. Xu, "Character-based movie summarization," in ACM MM, 2010.
[6] R. Hong, M. Wang, M. Xu, S. Yan, and T.-S. Chua, "Dynamic captioning: video accessibility enhancement for hearing impairment,"inACM Multimedia, 2010, pp. 421–430.

Paper Type : Research Paper
Title : Automated Detection of Cancerous Lung Nodule from the Computed Tomography Images
Country : India
Authors : Mr. Vaibhav K. Likhitkar, Prof. Ujwalla Gawande, Mr. Kamal O. Hajari
: 10.9790/0661-16180511    logo
Abstract: An automated Computer Aided Diagnosis (CAD) system is proposed in this paper for the detection of lung nodule from the computed tomography (CT) images. CT Images are more efficient and provideappropriate details on anatomical features of the lung nodule than X-ray. There are two types of lung nodule, cancerous and non-cancerous nodules. Lung nodules are classified with the help of CAD system. The CAD system can classify the lung nodule from CT images on the basis of nodule feature such as growth rate, density, shape and boundary of the nodule. These feature values are calculated in image processing tool by using image enhancement, segmentation, and feature extraction. The feature values are given as input to classifier to classify nodule. Keywords: Lung nodule, cancerous lung nodule, non-cancerous nodule, computed tomography (CT), computer aided diagnosis (CAD) system.
[1] AhmedinJemal, Rebecca Siegel, Elizabeth Ward, and YongpingHao", Cancer journal for clinicians,vol.58, pp.71-96, Dec 31, 2008.
[2] Ann Leung,RobinSmithuis,"Solitary Pulmonary Nodule:Benign Versus Malignant Differentiation wit CT and PET-CT",May20,2007.
[3] HanspeterWitschi,"A Short History Of Lung Cancer",Toxicological Sciences, vol. 64, pp.4-6,2001.
[4] PoonamBhayan, Gagandeep Jindal "A Segmented Morphological Approach to Detect Tumor in Lung Images",International Journal of Computer Science and Technology vol. 2, pp. 499-503Issue 3, September, 2011
[5] Robert N. Proctor "Golden Holocaust Origins of the Cigarette Catastrophe and the Case for Abolition",Univerity of CaliforinaPress,2012.

Paper Type : Research Paper
Title : Scalable Schedule Routing and Minimizing Delay in Tolerant Networks
Country : India
Authors : Dhanasekaran.P, Ramani.R
: 10.9790/0661-16181215    logo

Abstract: There are many routing strategies for message delivery in Delay Tolerant Networks. Among them Multicopying routing strategies have been considered the most applicable DTNs. Epidemic routing and two-hop forwarding routing are the two best approaches of DTN. These two approaches belong to multicopying routing strategies as they allow multiple message replicas to increase message delivery delay.

[1] Ahmed Elwhishi, Pin-Han Ho, K. Naik, and Basem Shihada "A Novel Message Scheduling Framework for Delay Tolerant Networks Routing". IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 24, NO. 5, MAY 2013
[2] Member, IEEE, Thierry Turletti, Member, IEEE, and Katia Obraczka, Member, IEEE , " Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations Thrasyvoulos Spyropoulos", IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 8, NO. 8, AUGUST 2009
[3] Cong Liu and Jie Wu,Fellow "Scalable Routing in Cyclic Mobile Networks". IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 20, NO. 9, SEPTEMBER 2009
[4] Eyuphan Bulut, Member, IEEE, Zijian Wang, and Boleslaw Karol Szymanski, Fellow "Cost-Effective Multiperiod Spraying for Routing inDelay-Tolerant Networks", IEEE. IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 5, OCTOBER 2010
[5] Yong Li, Student Member, IEEE, Yurong Jiang, Depeng Jin, Member, IEEE, Li Su,Lieguang Zeng, and Dapeng (Oliver) Wu, Senior Member, IEEE "Energy-Efficient Optimal Opportunistic Forwarding for Delay-Tolerant Networks". IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 59, NO. 9, NOVEMBER 2010

Paper Type : Research Paper
Title : Design and Architecture for Web Graph Mining Base Recommender System for Query, Image and Social Network using Query Suggestion Algorithm and Heat Diffusion Method
Country : India
Authors : Asst. Prof. Sonal Patil, Ankush Mahajan
: 10.9790/0661-16181623    logo
Abstract: Recommendation techniques is now a day's very important. various kinds of recommendations are done on the Web, example movies, music, images, books recommendations, query suggestions and tags recommendations, etc. it is not important that what kind of data sources are used for the recommendations, these data sources can be modeled or taken in the various types of graphs. In this paper,
[1] Hao Ma, Irwin King and Michael Rung-Tsong Lyu, "Mining Web Graphs for Recommendations ", IEEE Transaction on knowledge and data engineering, Vol.24, No.6, June 2012.
[2] Hao Ma, Haixuan Yang, Michael R. Lyu and Irwin King, "Mining Social Networks Using Heat Diffusion Processes for Marketing Candidates Selection", published in international conference on information and knowledge management – CIKM, 2008.
[3] R.A. Baeza-Yates, C.A. Hurtado, and M. Mendoza," Query Recommendation Using Query Logs in Search Engines," Proc. Current Trends in Database Technology (EDBT) Workshops ,pp. 588-596, 2004
[4] D. Beeferman and A. Berger, "Agglomerative Clustering of a Search Engine Query Log ,"KDD '00: Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 407-416, 2000.
[5] J.S. Breese, D. Heckerman, and C. Kadie, "Empirical Analysis ofPredictive Algorithms for Collaborative Filtering,"Proc. 14th Conf.Uncertainty in Artificial Intelligence (UAI),1998.
Paper Type : Research Paper
Title : Dissemination of Link State Information for Enhancing Security in Mobile Ad Hoc Networks
Country : India
Authors : Chandrasekar P, BeaulahDavid ,Shaheen H
: 10.9790/0661-16182431    logo
Abstract: A mobile adhoc network is a Self-configuring network of mobile routers connected by wireless links. In the mobile adhoc network, each and every device moves independently in any direction so that there are frequent changes in the links. It is essential to learn the position of the neighbors because there is increase in location-aware services. So, there is a chance that the malicious nodes are easily abused the process. The significant problem in mobile networks is correctness of node locations and also it is primarily challenging in the presence of adversaries. So, the neighbor position verification protocol is used to a fully distributed, a lightweight NPV procedure which allows each node to obtain the locations advertised by its neighbors and asses their truthfulness.
[1] P. Papadimitratos and A. Jovanovich, "GNSS-Based Positioning: Attacks and Countermeasures," Proc. IEEE Military Comm. Conf. (MILCOM), Nov. 2008.
[2] L. Lazos and R. Poovendran, "HiRLoc: High-Resolution Robust Localization for Wireless Sensor Networks," IEEE J. Selected Areas in Comm., vol. 24, no. 2, pp. 233-246, Feb. 2006.
[3] R. Poovendran and L. Lazos, "A Graph Theoretic Framework for Preventing the Wormhole Attack," Wireless Networks, vol. 13, pp. 27-59, 2007.
[4] Y.-C. Hu, A. Perrig, and D.B. Johnson, "Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks," Proc. IEEE INFOCOM, Apr. 2003.
[5] J. Eriksson, S. Krishnamurthy, and M. Faloutsos, "True Link: A Practical Countermeasure to the Wormhole Attack in Wireless Networks," Proc. IEEE 14th Int'l Conf. Network Protocols (ICNP), Nov. 2006.
[6] R. Maheshwari, J. Gao, and S. Das, "Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information," Proc. IEEE INFOCOM, Apr. 2007.

Paper Type : Research Paper
Title : Hybrid Cryptography Algorithms for Enhanced Adaptive Acknowledgment Secure in MANET
Country : India
Authors : Ramya K, Beaulah David, Shaheen H
: 10.9790/0661-16183236    logo
Abstract: The mobile adhoc network is a group of mobile nodes without having the fixed infrastructure. Due to the infrastructure less network and distributed nature, make mobile adhoc network susceptible to malicious attackers. So, we use an intrusion detection system called Enhanced Adaptive ACKnowledgement (EAACK) especially for mobile adhoc networks. Based on the digital signature algorithm (DSA) and RSA the EAACK is designed. To enhance the strength of the security in the mobile adhoc networks, we introduce an innovative approach called Hybrid Security Protocol that provides integrity, confidentiality and authentication. This Hybrid Security Protocol consists of Cryptography based on Elliptic curve, Dual-RSA algorithm and Message Digest MD5. Encryption is achieved by using Elliptic Curve Cryptography, Dual-RSA algorithm for authentication and MD-5 for integrity. By using a combination of both symmetric and asymmetric cryptographic techniques, we achieve better security with integrity.
[1] D. Johnson and D. Maltz, "Dynamic Source Routing in ad hoc wireless networks," in Mobile Computing. Norwell, MA: Kluwer, 1996, ch. 5, pp. 153–181.
[2] K. Liu, J. Deng, P. K. Varshney, and K. Balakrishnan, "An acknowledgment-based approach for the detection of routing misbehavior in MANETs," IEEE Trans. Mobile Comput., vol. 6, no. 5, pp. 536–550, May 2007.
[3] J.-S. Lee, "A Petri net design of command filters for semiautonomous mobile sensor networks," IEEE Trans. Ind. Electron., vol. 55, no. 4, pp. 1835–1841, Apr. 2008.
[4] A. Patcha and A. Mishra, "Collaborative security architecture for black hole attack prevention in mobile ad hoc networks," in Proc. Radio Wireless Conf., 2003, pp. 75–78.
[5] B. Sun, "Intrusion detection in mobile ad hoc networks," Ph.D. dissertation, Texas A&M Univ., College Station, TX, 2004.
[6] N. Kang, E. Shakshuki, and T. Sheltami, "Detecting misbehaving nodes in MANETs," in Proc. 12th Int. Conf. iiWAS, Paris, France, Nov. 8–10, 2010, pp. 216–222.

Paper Type : Research Paper
Title : A Coalitional Game Approach for Packet Delivery in Mobile Adhoc Network
Country : India
Authors : S.V.Karthik, V.Shyamala
: 10.9790/0661-16183742    logo
Abstract: A coalitional game is residential to study the actions of the rational mobile nodes for supportive packet delivery. We consider the problem of supportive packet delivery to mobile nodes in a cross wireless mobile network, where both wired and wireless network communications are used. A group of mobile nodes makes a conclusion to join or to leave a coalition based on their creature payoffs . The individual payoff of each mobile node is a function of the usual delivery delay for packets transmitted to the mobile node from a base station and the cost incur by this mobile node for relay packets to other mobile nodes.
[1] Khajonpong Akkarajitsakul, Ekram Hossain And Dusit Niyato," Cooperative Packet Delivery In Hybrid Wireless Mobile Networks: A Coalitional Game Approach," IEEE Transactions On Mobile Computing, Vol. 12, No. 5, May 2013.
[2] T. Yamada, R. Shinkuma, and T. Takahashi, "Connectivity and Throughput Enhancement by Inter-Vehicle Packet Relay in Road Vehicle Comm. Systems," Proc. IEEE Global Telecomm. Conf., pp. 1-5, Nov./Dec. 2006.
[3] Y. Yamao and K. Minato, "Vehicle-Roadside-Vehicle Relay Communication Network Employing Multiple Frequencies and Routing Function," Proc. Sixth Int'l Symp. Wireless Comm. Systems, pp. 413-417, Sept. 2009.
[4] H. Su and X. Zhang, "Clustering-Based Multichannel MAC Protocols for QoS Provisionings over Vehicular Ad Hoc Networks,"IEEE Trans. Vehicular Technology, vol. 56, no. 6, pp. 3309-3323, Nov. 2007.
[5] W. Saad, Z. Han, M. Debbah, A. Hjørungnes, and T. Basar, "Coalitional Game Theory for Communication Networks: A Tutorial," IEEE Signal Processing Magazine, vol. 26, no. 5, pp. 77-97, Sept. 2009.
[6] D. Niyato, P. Wang, W. Saad, and A. Hjørungnes, "Coalition Formation Games for Bandwidth Sharing in Vehicle-to-Roadside Communications," Proc. IEEE Wireless Comm. and Networking Conf.(WCNC), pp. 1-5, Apr. 2010.

Paper Type : Research Paper
Title : A note on application of Tensor Space Model for semantic problems
Country : India
Authors : Prashant Singh, P.K.Mishra
: 10.9790/0661-16184347    logo

Abstract: A Model is an abstract representation of system that allows the investigation of properties of the system and in some cases prediction of future outcomes We have seen many mathematical models but Tensor Space Model is area of interest for new researchers. It is an effective tool for notational convenience and memory optimization. In this paper I have to tried to prognosticate applicability of some Tensor Space Model for simple and higher dimensional problems and propose a model that can account for meaning of a word with respect to another word in a given text.

Keywords : Vector Space Model, Tensor Space Model(TSM)

[1] Introduction to Riemannian Geometry and Tensor Calculus , C.E.Weatherburn
[2] Differential Geometry , N.J. Hicks
[3] Nisan Haramati, Natural Language Processingwith Vector Spaces, PHYSICS 210 ,University of British Columbia
[4] Croft ,W.B. and Lafferty, Language Modeling For Information Retrieval, Kluwer Academics,2003
[5] K.Erk ,A simple similarity based model for selection preferences
[6] Deng Cai, Xiaofei He, Jiawei Han, Tensor Space Model for document analysis
[7] Baeza Yates and R Neto, Modern Information Retrieval.Addison-Wesley,1999

Paper Type : Research Paper
Title : Distributed Processing of Probabilistic Top-kQueries with Efficient Query Evaluation
Country : India
Authors : B.Prakash, T.S.Murunya
: 10.9790/0661-16184853    logo
Abstract: Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important tool for exploring large uncertain data sets. So, we introduce the efficient query evaluation of the sufficient set-based (SSB), necessary set-based (NSB), and boundary-based (BB) algorithm for distributed processing in Top-K queries in wireless sensor networks, for inter cluster query processing with bounded rounds of communications and in responding to dynamic changes of data distribution in the network,
[1] V. Bychkovskiy, S. Megerian, D. Estrin, and M. Potkonjak, "A Collaborative Approach to in-Place Sensor Calibration," Proc.Second Int'l Conf. Information Processing in Sensor Networks (IPSN), pp. 301-316, 2003.
[2] M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '08), 2008.
[3] D. Zeinalipour-Yazti, Z. Vagena, D. Gunopulos, V. Kalogeraki, V. Tsotras, M. Vlachos, N. Koudas, and D. Srivastava, "The Threshold Join Algorithm for Top-k Queries in Distributed Sensor Networks," Proc. Second Int'l Workshop Data Management for Sensor Networks (DMSN '05), pp. 61-66, 2005.
[4] X. Lian and L. Chen, "Probabilistic Ranked Queries in Uncertain Databases," Proc. 11th Int'l Conf. Extending Database Technology (EDBT '08), pp. 511-522, 2008.
[5] Y. Xu, W.-C.Lee, J. Xu, and G. Mitchell, "Processing Window Queries in Wireless Sensor Networks," Proc. IEEE 22nd Int'l Conf. Data Eng. (ICDE '06), 2006.

Paper Type : Research Paper
Title : Adaptive Discrimination Detection for DDoS Attacks from Flash Crowds Using Flow Correlation Coefficient with Collective Feedback
Country : India
Authors : N. V. Poorrnima, K. Chandra Prabha, B. G. Geetha
: 10.9790/0661-16185458    logo

Abstract: A Distributed denial of service (DDoS) attack is a most popular and crucial attack in the internet. Its motive is to make a network resource unavailable to the legitimate users. Botnets are commonly the engines behind the attack. In our deep study of the size and organization of current botnets, found that the current attack flows are usually more similar to each other compared to the flows of flash crowds In this paper we are concentrating flash crowd and DDoS there are two steps involved, first it is necessary to differentiate normal traffic and flashcrowd by using Flash Crowd Detection Algorithm. Second we have to differentiate flash crowd and DDoS by using Flow Correlation Coefficient (FCC). By using this FCC value, algorithmproposedcalled Adaptive discrimination algorithm is used to detect the DDoS from the flash crowd event. And a sequential detection and packing algorithm used to detect the attacked packets and filter it out.By using above mentioned algorithms we can improve the accuracy in filtering the attacked packets and also the time consummation is reduced.

Index Terms—DDoS attacks ,flash crowd event, discrimination.

[1] Ke Li, Wanlei Zhou, Ping Li, and Jianwen Liu , Distinguishing DDoS Attacks from Flash Crowds Using Probability Metrics, IEEE Third International Conference on Network and System Security2009,pages 9-17.
[2] Shui Yu, TheerasakThapngam, Jianwen Liu, Su Wei and WanleiZhou,DiscriminatingDDoS Flows from Flash Crowds Using Information Distance, IEEE Third International Conference on Network and System Security,2009, pages 351-355
[3] TheerasakThapngam, Shui Yu, Wanlei Zhou andGlebBeliakov,DiscriminatingDDoS Attack Trafficfrom Flash Crowd through Packet Arrival Patterns,The First IEEE International Workshop on Security inComputers, Networking andCommunications,2011,pages 952-958
[4] Jie Wang, Raphael C.W. Phan, John N. Whitley and David J. Parish ,DDoS Attacks Traffic and FlashCrowds Traffic Simulation with a Hardware TestCenter Platform, IEEE
[5] Y. Xie and S.Z. Yu, "A Large-Scale Hidden Semi-Markov Model forAnomaly Detection on User Browsing BehaviorsNetworking,"IEEE/ACM Transactions on Networking, vol. 17, no. 1, pp. 54 - 65,February 2009.
[6] G. Oikonomou and J. Mirkovic, "Modeling Human Behavior for Defense against Flash-Crowd Attacks," in Proceedings of IEEEInternational Conference on Communications 2009 (ICC '09), pp. 1 - 6,11 August 2009.

Paper Type : Research Paper
Title : Intelligent Fire Extinguisher System
Country : India
Authors : Poonam Sonsale, Rutika Gawas, Siddhi Pise, Anuj Kaldate
: 10.9790/0661-16185961    logo

Abstract: The multisensor fire-detection algorithm is one of the current important issues in the field of fire-detection systems for intelligent buildings. This paper proposes an adaptive fusion algorithm for fire detection, and uses a smoke sensor, flame sensor, and temperature sensor to detect fire incident. In reality, the phenomenon of the fire incident may have smoke, flame, and high temperature situations. However, these signals may happen simultaneously or sequentially. We develop an intelligent multisensor based security system that contains a fire fighting system in our daily life. The security system can detect abnormal and dangerous situation and notify us. First, we design a firefighting system with extinguisher for the intelligent building. We design the fire detection system using sensors in the fire fighting system, and program the fire detection and fighting procedure using sensor based method. Finally, we implement the fire detection system using fire fighting system.

Keywords: ADC, Device Control , Fire Fighting System, Sensors, Sprinklers.

[1] Design of Intelligent Fire Extinguishing System of Interior Large Space"-E-Product E-Service and E-Entertainment (ICEEE), 2010 International Conference.

[2] Voice Operated Intelligent Fire Extinguisher Vehicle, March 29, 2013.
[3] "Wireless Intelligent Fire Fighting Systems Software Platform R&D"- Internet of Things (iThings/CPSCom), 2011 International Conference on and 4th International Conference on Cyber, Physical and Social Networking

[4] "Develop a Multiple Interface Based Fire Fighting System"- Mechatronics, ICM2007 4th IEEE -International Conference Date of Conference: 8-10 May 2007

[5] Design of Gas fire-extinguishing control panel based on multi-sensor information fusion Multimedia Technology (ICMT), 2011 International Conference 10-12 Aug. 2010


Paper Type : Research Paper
Title : Microaneurysm Techniques for Diabetic Patients
Country : India
Authors : R.Bharathi Devi, D. Jagadiswary, R.Backiyalakshmi
: 10.9790/0661-16186266    logo

Abstract: Diabetic Retinopathy (DR) is a serious eye disease that originates from diabetes mellitus and is the most common cause of blindness in the developed countries. Early treatment can prevent patients to become affected from this condition or at least the progression of DR can be slowed down. The proposed system is used to detect microaneurysm (MA) in eye retinal images. An ensemble-based microaneurysm detector proved its high efficiency. The experimental results show that the proposed ensemble based MA detector outperforms the current individual approaches in MA detection. It has been also proven that the framework is high flexibility in different datasets. The selection of the appropriate threshold is also an important issue for our detector to provide sufficient sensitivity and specificity rate. The System provides a friendly environment to deal with images. An effective MA detector based on the combination of preprocessing methods and candidate extractors is used. An ensemble creation framework selects the best combination. An exhaustive quantitative analysis is also given to prove the superiority of our approach over individual algorithms. It also investigates the grading performance of this method, which is proven to be competitive with other screening system.

Index Terms: Diabetic Retinopathy (DR) microaneurysm (MA), MA detection and Candidate extractors.

[1] Abramoff M., Niemeijer M., and Van Ginneken B. (2008), "Evaluation of a system for automatic detection of diabetic retinopathy from color fundus photographs in a large population of patients with diabetes‟, Diabetes Care, vol. 31, pp. 193–198.

[2] Abramoff M., Reinhardt J., and Quellec G. (2010), "Automated early detection of diabetic retinopathy‟, Ophthalmology, vol. 117, no. 6, pp. 1147–1154.

[3] Antal B., Lazar I., Hajdu A., and Peto T. (2010), "A multilevel ensemble-based system for detecting microaneurysms in fundus images‟, in Proc. 4th IEEE Int. Workshop Soft Comput, pp. 137–142.


Paper Type : Research Paper
Title : Elaborating the performance of Sensor Networks with merest energy to prolong network endurance
Country : India
Authors : M. Ramananthini, Mrs. Mary Joseph
: 10.9790/0661-16186771    logo

Abstract:The routing process in Wireless Sensor Networks may differ from other normal routing methods because it contains no link to follow and no definite structure. The Wireless Sensor Networks is created by densely deployed sensor nodes. These nodes are powered by batteries.The energy-efficient coverage(EEC) problem is solved in other optimization algorithm but the idea of extending the lifetime capacity of the sensor networks fails when it communicates with several networks. The Bee Hive Optimization approach is used for increasing the lifetime of Wireless Sensor Networks. This generates a new path by taking energy as the fitness value to analyze different paths and provides best optimized path with low energy

Keywords: Bee-hive, network optimization, WSN.

[1] Andre Vargas Abs da Cruz, Marley M. B. R. Vellasco, Marco Aurelio C. Pacheco, (2010)"Quantum-Inspired evolutionary algorithms applied to numerical optimization problems", Applied Computational Intelligence, Pontifical Catholic University of Rio de janeiro, Brazil.

[2] Department of Computer Science, Sun yat-Sen University, Guangzhou, China. Gibing Lim, Leonard J.cimini, Jr., (2012) "Energy-efficient co-operative relaying in heterogeneous radio access networks", IEEE Wireless communication letters, VOL. 1, NO. 5.

[3] Giuseppe Anastasi, Marco Conti, and Mario Di Francesco, (2009) "Extending the lifetime of wireless sensor networks through adaptive sleep", IEEE transactions on industrial informatics, Vol. 5, NO. 3.

[4] Gubong Lim and Leonard J. Cimini, Jr, (2008) "Energy-efficient best-select relaying in wireless cooperative networks", University of Delaware, Newark.Huawei Technologies, Co. Ltd., Shanghai, China, IEEE.

[5] Jiming Chen, Junkun Li, Shibo He, Youxian Sun, Hsiao-Ha Chen, (2010) "Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks", IEEE Communications letters, VOL. 14, NO. 9.

[6] Soumyadipsengupta, Swagatam Das, Md. Nasir, Athanasiosv. Vasilakos and Witold Pedryez, (2012) "Energy-efficient differentiated coverage of dynamic objects using an improved evolutionary multi-objective optimization algorithm with fuzzy dominance", WCCI 2012 IEEE World Congress on computational intelligence.


Paper Type : Research Paper
Title : Flexible Dynamic Recommender System
Country : India
Authors : Umakant Tupe, Prof.R.B.Joshi
: 10.9790/0661-16187275    logo

Abstract: A Recommender System now becoming decision maker for the people who lack sufficient personal experience to evaluate the items that are on website. It provides recommendation for specific items such as books, news, tourism services etc. Personalization is common term for improving online services and attract more users. The previous recommender system like Amazon, Suggest, e-bay provide suggestion for specific items but drawback that service provider can see the ratings of users. It may happen that owner can give more ratings for particular item and can increase product popularity. This results in misguiding to user and privacy is violated. In our flexible recommender system users give ratings for some product in encrypted format, so service provider does not able to decrypt it. In this recommender system users decision time is saved, because time plays vital role in recommender system. During less amount of time user should get more rated products.

Keywords: Homomorphic Encryption, probe technique ,Recommender System

1] Generating Private recommendation using Homomorphic Encryption and Data Packing. IE EE TR ANS AC TIONS ON INF OR MAT ION F ORE NS IC S AND S EC UR ITY, VOL. 7, NO. 3 , J UNE 2 01 2 10 53

[2] G. Adomavicius and A. Tuzhilin, "Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions,"IEEE Trans. Knowl. Data Eng., vol. 17, no. 6, pp. 734–749, Jun. 2005.

[3] N. Ramakrishnan, B. J. Keller, B. J. Mirza, A. Y. Grama, and G.Karypis, "Privacy risks in recommender systems," IEEE Internet Comput., vol. 5, no. 6, pp. 54–63, Nov./Dec. 2001.

[4] N. Kroes, Digital agenda, Brussels, May 19, 2011.

[5] R. Agrawal and R. Srikant, "Privacy-preserving data mining," in Proc.SIGMOD Rec., May 2000, vol. 29, pp. 439–450.

[6] Y. Lindell and B. Pinkas, "Privacy preserving data mining," J. Cryptol., pp. 36–54, 2000, Springer-Verlag.

[7] H. Polat and W. Du, "Privacy-preserving collaborative filtering using randomized perturbation techniques.," in Proc. ICDM, 2003, pp. 625–628.


Paper Type : Research Paper
Title : Modified Method of Generating Randomized Latin Squares
Country : India
Authors : D. Selvi, G. Velammal, ThevasahayamArockiadoss
: 10.9790/0661-16187680    logo

Abstract: In combinatorics and in experimental design, Latin square (LS) plays a vital role. It has been studied for centuries and especially used in statistics. Let L(n) be the number of Latin square of order n . L(n) increases exponentially as n increases. The feasible solutions of three dimensional planar assignment problem (3DPAP) are latin squares. The 3DPAP and related problems are NP hard. Hence to solve these problems using genetic algorithms, randomly creating a Latin square method is essential. O'Carroll has given a method for random generation of Latin square. The method however fails occasionally. So we have given a modified method and this modified method is efficient in the generation of random Latin square.

Keywords: Latin square, Random

[1]. M. Jacobson, P. Matthews, Generating Uniformly Distributed Random Latin Squares, Journal of Combinatorial Designs, Vol. 4, No. 6 ,1996 [2]. Roberto Fontana ,Random Latin squares and Sudoku designs generation, IOP, air Xiv:1305.3697v1[stat.co], May 2013 [3]. Czeslaw Koscielny, Generating Quasigroups for Cryptographic Applications, International Journal of Applied Mathematics and Computer Science, 2002, vol.12.No.4 559-569

[4]. A.Frieze, complexity of a 3-Dimensional Assignment Problem, European Journal of Operational Research, 1983,13:161–164

[5]. O'Carroll, F, A Method of Generating Randomized Latin Squares, Biometrics. December 1963, 652-653


Paper Type : Research Paper
Title : Enhancement of Cryptographic Security using Stopping Sets
Country : India
Authors : Preeti L Darade, Vanaja R Chirchi ,IEEE Memeber
: 10.9790/0661-16188187    logo

Abstract: In this paper, we have used channel codes in cryptographic secrecy. Main idea of this paper is to develop the notion of combined security due to cryptography and channel coding. Thus, it is providing a more complete security solution. To achieve this goal, we cast coding into a cryptographic enhancement role, and seek to prevent an attacker from obtaining a noise free cryptogram using channel coding. In this paper, we have used degrees of freedom to characterize security which analyzes combined cryptographic and physical-layer security in a practical coding. In this scheme was shown to inflict a passive eavesdropper using a message-passing decoder with stopping sets with very high probability when a legitimate receiver and an eavesdropper view transmitted data through statistically independent packet erasure channels (PEC). The scheme relies on a nonsystematic low-density parity-check (LDPC) code design, with puncturing and interleaving steps in the encoder.

Keywords: Automatic repeat-request (ARQ), low-density parity-check (LDPC) codes, packet erasure channels(PEC), physical-layer security, stopping sets.

[1] C. E. Shannon, "Communication theory of secrecy systems," Bell Syst.Tech. J., vol. 28, no. 4, pp. 656–715, 1949.
[2] A. D. Wyner, "The wire-tap channel," Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355–1387, Oct. 1975.
[3] I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339–348,
May 1978.
[4] M. Bloch and J. Barros, Physical-Layer Security: From Information Theory to Security Engineering. Cambridge, U.K.: Cambridge
Univ.Press, Sep. 2011.
[5] W. Meier and O. Staffelbach, "Fast correlation attacks on certain stream ciphers," J. Cryptology, vol. 1, pp. 159–176, 1989.
[6] W. K. Harrison and S.W.McLaughlin, "Physical-layer security: Combining error control coding and cryptography," in Proc. IEEE
Int. Conf. Communications (ICC), Dresden, Germany, Jun. 2009, pp. 1–5.
[7] W. K. Harrison, J. Almeida, D. Klinc, S.W. McLaughlin, and J. Barros, "Stopping sets for physical-layer security," in Proc. IEEE
Information Theory Workshop (ITW), Dublin, Ireland, Aug.–Sep. 2010, pp. 1–5.
[8] A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J.-M. Merolla, "Applications of LDPC codes to the wiretap
channel," IEEE Trans. Inf. Theory, vol. 53, no. 8, pp. 2933–2945, Aug. 2007.

Paper Type : Research Paper
Title : Risk Factor for Periodontitis
Country : India
Authors : Saraswati Sachan
: 10.9790/0661-16188892    logo

Abstract: Periodontal disease possesses a significant challenge to the patient and the oral health care professional equally .Risk factor that are associated with periodontal disease must be properly identified and examine by professional before the patient is treated by periodontal treatment. It is important as how we educate a patient on risk management .This article offers strategies for professional to use and helps in establishing a balance preventive oral management plan. Pathogenesis of periodontal disease is more complex than the presence of virulent microorganism. Susceptibility to periodontitis varies between individuals who carry the same pathogenic micro flora.

[1]. TimmermanMF,Van der Weijden.Risk factors for periodontitis .Int J Dent Hyg.2006;4:2-7[PubMed]
[2]. Albandar et al.,2000 J IntAcad periodontal .2005 January ;7(1):3-7. Risk Factor for periodontitis
[3]. BergstromJ,EliassonS.Jack Dock Exposure to tobacco smoking and periodontal health .J Clin Periodontol .2000;27:61-8[PubMed]
[4]. Bergstrom and bostrom ,2001;Muller et al .,2001 J IntAcad periodontal .2005 January ;7(1):3-7. Risk Factor for periodontitis
[5]. Bergstrom ,1999 J IntAcad periodontal .2005 January ;7(1):3-7.Risk Factor for periodontitis
[6]. bostram et al.,1998;Ah,et al.,1994 J IntAcad periodontal .2005 January ;7(1):3-7.Risk factor for periodontitis

Paper Type : Research Paper
Title : Anti-spam Filter Based on Machine Learning Algorithm
Country : India
Authors : Khandekar Amol, Garje Pramod, Rakesh Thakare
: 10.9790/0661-16189396    logo

Abstract: We building one of the filter which help the user relief from the unwanted mails in his inbox of the mail account which is develop using the machine learning algorithm and which also contain the filter. In this we creates product which should secure the user from flooding of the unwanted mail we can call it as spam.. There are number of machine learning algorithm from this machine learning algorithm we are used the best of them.. According to the speed and efficiency .In this we are training a system according use of user. So it gives better result while using this system.

[1]. I. Androutsopoulos, G. Paliouras, and E. Michelakis. Learning to filter unsolicited commercial e-mail. Technical report, National Centre for Scienti_c Research \Demokritos", 2004.
[2]. H. D. Drucker, D. Wu, and V. Vapnik. Support Vector Machines for spam categorization. IEEE Transactions On Neural Networks, 10(5):1048{1054, 1999.
[3]. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: A statistical view of boosting. Annals of Statistics, 28(2):337{374, 2000.
[4]. J.M. Gomez Hidalgo and M. Mana Lopez. Combining text and heuristics for cost-sensitive spam filtering. In Proceedings of the 4th Computational Natural Language Learning Workshop, pages 99{102, Lisbon, Portugal, 2000.
[5]. T. Joachims. Text categorization with support vector machines: Learning with many relevant features. In Proceedings of the 10th European Conference on Machine Learning, pages 137{142, Heidelberg, Germany, 1998.
[6]. G.H. John and P. Langley. Estimating continuous distributions in Bayesian classifiers. In Proceedings of the 11th Conference on Uncertainty in Arti_cial Intelligence, pages 338{345, Montreal, Quebec, 1995
[7]. D.D. Lewis. Naive (Bayes) at forty: The independence assumption in information retrieval. In Proceedings of the 10th European Conference on Machine Learning, pages 4{15, Chemnitz, Germany, 1998.
[8]. T.M. Mitchell. Machine learning. McGraw-Hill, 1997.

Paper Type : Research Paper
Title : Finding Fast Changing Patterns In the presence of hierarchy
Country : India
Authors : Sahane Priya, Prof A.N. Nawathe
: 10.9790/0661-1618101103   logo

Abstract: History Generalized Algorithm is used in this paper which is used to find the generalized as well as non generalized itemsets .after finding those itemsets find out the particular node in the tree structure and attach those itemsets in specific order. One dynamic pattern, the history generalized pattern ,that represents the development of an itemset in successive time periods, by accounting the information about its recurrent generalizations characterized by minimal redundancy some time it becomes infrequent. Higen mining, The higen miner, that focuses on avoiding itemset mining followed by postprocessing by developing a support-driven itemset generalization .To focus the attention on the minimally redundant recurrent generalizations and reduce the amount of the generated patterns, the finding a subset of higens, namely the nonredundant higens, . Tests do on both real and synthetic datasets show the competence and the effectiveness.

Keywords: Data mining algorithm, Data mining Method.

[1] Discovering Temporal Change Patterns in the Presence of Taxonomies Luca Cagliero
[2] R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases," ACM SIGMOD Record, vol. 22, pp. 207-216, 1993.
[3] R. Agrawal and G. Psaila, "Active Data Mining," Proc. First Int'l Conf. Knowledge Discovery and Data Mining, pp. 3-8, 1995.
[4] R. Agrawal and R. Srikant, "Mining Generalized Association Rules," Proc. 21th Int'l Conf. Very Large Data Bases (VLDB '95),pp. 407-419, 1995.
[5] M.L. Antonie, O.R. Zaiane, and A. Coman, "Application of Data Mining Techniques for Medical Image Classification," Proc. Second Int'l Workshop Multimedia Data Mining (MDM/KDD '01), 2001.
[6] W.-H. Au and K.C.C. Chan, "Mining Changes in Association Rules: A Fuzzy Approach," Fuzzy Sets Systems, vol. 149, pp. 87-104, Jan. 2005.

Paper Type : Research Paper
Title : Language Mobile Learning Design: The Tamazight Language
Country : MOROCCO
Authors : Khadija Achtaich, Habib Benlahmar, Naceur Achtaich
: 10.9790/0661-1618104109    logo

Abstract: Even though Tamazight language in Morocco has been legitimate for eleven years and official for almost two years, its learning needs a huge effort to successfully make it in this enormous batch of existing unformatted documents. In this article, we present a method for learning the Tamazight language in a mobile environment. The mobile is chosen to free the learner from the constraints of time and space. Indeed, the use of mobile devices allows it to be anywhere and anytime. An immediate question is how to involve the learner in the learning process, which is why we propose to put him in real or fictitious situations that are part of his experience and to which he is used to react. At the end of this article, we also present a prototype of a mobile application implementing our method. Keywords: Learning, Mobile, Situation, Tamazight.

[1] Laouris, Y. (2005). We need an educationally relevant definition of mobile learning.
[2] Pinkwart, N, Hoppe, H.U, Milras, M and Perez, J. (2003). Educational scenarios for the cooperative use of Personal Digital Assistants. Journal of Computer Assisted Learning, pp. 383-391
[3] MoLeNET. (2009). Seen on www.molenet.org.uk, May 2nd, 2012 (2009)
[4] O'Malley, UoN, C, Vavoula, G, UoB, J.P. Glew, UoB, J. Taylor, OU, M. Sharples, UoB, P. Lefrere, (Juin 2003)
[5] Zhong, L. Xue, Q., Liu, H., Yuan, J. (2010). Research on 3G Mobile Learning Based on Cloud Service, IEEE, International Conference on E-Product E-Service and E-Entertainment (ICEEE) , pp. 1-4.
[6] MoLeNET. (2011). Seen on www.molenet.org.uk, May 2nd, 2012 (2011)
[7] Reference to the king's speech in Ajdir At October 17, 2001
[8] Constitution of Morocco. (July 2011). Paragraph 1, Article 5.

Paper Type : Research Paper
Title : Incremental Sequential Pattern Tree Mining
Country : Bangladesh
Authors : Ashin Ara Bithi, Z.M. Tarek Shahriar, Abu Ahmed Ferdaus
: 10.9790/0661-1618110116    logo

Abstract: In this paper, we have proposed an Incremental Sequential Pattern Tree mining algorithm to retrieve new updated frequent sequential patterns from dynamic sequence database. Sequential Pattern Tree stores both frequent and non-frequent items from the old sequence database. So that, our proposed algorithm updates the old Sequential Pattern Tree by scanning only the new sequences, does not require to scan the whole updated database (old + new) that reduces the execution time in reconstructing the tree. We have compared our proposed incremental mining approach with three existing algorithms those are GSP, PrefixSpan and FUSP-Tree Based mining and we have got satisfactory results.

Keywords: Data Mining, Sequence Database, Sequential Pattern, Sequential Pattern Mining, Frequent Patterns, Tree Based Mining, Incremental Mining.

[[1] R. Agrawal and R. Srikant, "Mining sequential patterns," in ICDE, P. S. Yu and A. L. P. Chen, Eds. IEEE Computer Society, 1995, pp. 3-14. [Online] Available: http://doi.ieeecomputersociety.org/10.1109/ICDE.1995.380415
[2] R. Srikant and R. Agrawal, "Mining sequential patterns: Generalizations and performance improvements," in EDBT, ser. Lecture Notes in Computer Science, P. M. G. Apers, M. Bouzeghoub, and G. Gardarin, Eds., vol. 1057. Springer, 1996, pp. 3-17. [Online] Available: http://dx.doi.org/10.1007/BFb0014140
[3] M. J. Zaki, "Spade: An efficient algorithm for mining frequent sequences," Machine Learning, vol. 42, no. 1/2, pp. 31-60, 2001. [Online] Available: http://dx.doi.org/10.1023/A:1007652502315
[4] J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M. Hsu, "Freespan: frequent pattern-projected sequential pattern mining," in KDD, 2000, pp. 355-359. [Online] Available: http://doi.acm.org/10.1145/347090.347167

Paper Type : Research Paper
Title : Prediction levels of heavy metals (Zn, Cu and Mn) in current Holocene deposits of the eastern part of the Mediterranean Moroccan margin (Alboran Sea)
Country : Morocco
Authors : Imad Manssouri, Abdellah El Hmaidi, Taj Eddine Manssouri,
Bouchta El Moumni
: 10.9790/0661-1618117123    logo

Abstract: The Alboran basin is part of the bético Rif chain and represents a point of exchange through the Strait of Gibraltar between the Atlantic Ocean to the west and the Algerian-Balearic Basin to the east. The purpose of this work is placed in the prediction of levels of heavy metals (Zn, Cu and Mn) in the Holocene to current deposits in the eastern part of the Moroccan Mediterranean margin of the Alboran sea, using the Artificial Neural Networks MLP-type RNA (Multi Layer Perceptron) non recurrent and supervised learning.

[1] P. Perez, A. Trier, Prediction of NO and NO2 concentrations near a street with heavy traffic in Santiago, Atmospheric Environment, 2001, 1783-1789.
[2] A. Abdallaoui, H. El Badaoui, Prédiction des teneurs en métaux lourds des sédiments à partir de leurs caractéristiques physico-chimiques, Journal Physical and Chemical News, 2011, 90-97.
[3] El Hmaidi A., El Badaoui H., Abdallaoui A., El Moumni B., Application des réseaux de neurones artificiels de type PMC pour la prédiction des teneurs en carbone organique dans les dépôts du quaternaire terminal de la mer d'Alboran, European Journal of Scientific Research, 107, 2013, 400-413.
[4] El Moumni B., Monaco A., Etude minéralogique et géochimique des dépôts du Quaternaire récent de la partie orientale de la marge méditerranéenne marocaine (mer d'Alboran). Géologie Méditerranéenne, Tome XIX, 2, 1992, 55-68.
[5] Michard A., Chalouan A., Feinberg H., Goff´e B., Montigny R., How does the Alpine belt end between Spain and Morocco? Bull. Soc. Geol. Fr., 173, 2002, 3-15.

Paper Type : Research Paper
Title : Comparison Of Neural Network And Differential Evolution In Estimation Of Air Quality Using Mean Square Error
Country : Nigeria
Authors : Ima O. Essiet
: 10.9790/0661-1618124129    logo

Abstract: Softcomputing techniques are fast becoming reliable and efficient means of prediction and estimation. This has made their application more wide spread in recent years. With the growing need for intelligent devices and systems comes the need to explore these techniques even further. This paper applies neural networks and differential evolution (two of the most effective softcomputing algorithms) to the estimation of air quality and compares the accuracy of their results using the mean square error (MSE) method. Air pollution is an ever increasing menace in major cities around the world. Air contaminants such as those from motor vehicles and industrial wastes are the most common forms of pollutants.

[1]. Aleksander, I. & Morton, H. (1990). An Introduction to Neural Computing.
[2]. Alkon, D. (1989). Memory Storage and Neural Networks. Scientific American.
[3]. Ardia, D., Boudt, K. et al. (2011). Differential Evolution with DEoptim: An Application to Non-Convex Portfolio Optimization. R Journal , 27-34.
[4]. Ayodele, J. A. (2007). Carbon Monoxide as Indoor Pollutant in Kano Metropolis. Journal of Applied Science and Environmental Management , 27-30.
[5]. Bassel, F. (1981). Air Pollution Control. New York: John Wiley.

Paper Type : Research Paper
Title : Increasing Quality of the Interframe and also extract Histogram using Super-Imposing
Country : India
Authors : Ms K.Lavanya, Prof J.R Balakrishnan
: 10.9790/0661-1618130133    logo

Abstract: Video enhancement approach aiming to achieve high qualities in entire video. Proposes a Super-imposing algorithm for improve quality of intraframe based on multiple regions-of-interest and create piecewise tone mapping curve for entire frame, interframe constraints to improve the temporal quality consistency and based on result extract histogram. Two step are used for object quality retrieval (i) ACB step improve intraframe analysis features for region-of-interest ,a global tone curve is created by fusing from other region and (ii) ECB step improve interframe quality implement by histogram equalization method. Learning-based color tone mapping method to conduct global color transfer by turning the color statistic of the face region according to a per-trained set. These methods can improve the quality of some specific regions.

Keywords: Interframe, Intraframe, Super-imposing algorithm.

[1]. T. Arici, S. Dikbas, and Y. Altunbasak, (2009) "A histogram modification framework and its application for image contrast enhancement‟, IEEE Trans. Image Process., pg no. 1921–1935.
[2]. S. Battiato and A. Bosco, (2004) "Automatic image enhancement by content dependent exposure correction‟, Journal of Appl. Signal Process.,pg no. 1849–1860.
[3]. W.C. Chiou and C.-T. Hsu, (2009) "Region-based color transfer from multi reference with graph-theoretic region correspondence estimation‟, IEEE Trans on Image Process., pg no. 501–542.
[4]. Z. Liu, C. Zhang, and Z. Zhang, (2007) "Learning-based perceptual image quality improvement for video conferencing‟, IEEE Trans on Image Process., pg no.1035–1038.
[5]. E. Reinhard, M. Ashikhmin, B. Gooch, and P. Shirley, (2001) "Color transfer between images‟, IEEE Comput. Graphics Applicat., pg no.34–41.R. Schettini and F. Gasparini, (2010) "Contrast image correction method‟, Journal of Electronic Imaging, pg no.5-16.
[6]. J. A. Stark, (2000) "Adaptive image contrast enhancement using generalizations of histogram equalization‟, IEEE Trans. Image Process., pg no.889–896.

Paper Type : Research Paper
Title : Conceptual Framework for cloud supported E-Governance Services
Country : India
Authors : Naveen Tewari, Dr. M K Sharma,
: 10.9790/0661-1618134145    logo

Abstract:The focus of this paper is to develop an architecture using cloud for e-governance. Cloud computing offers an easy means of achieving the application model of e-Governance with multi-tenancy. We can use public Internet as a type of communication medium and provide a framework, which can be used by every citizen in spite of his or her diversity & location. This model combines SaaS, PaaS, IaaS and SWAN (State wide area network) architecture.

  1. “Business Innovation Through Technology” e-Governance, SETLabs Briefings, Vol 9 - No 2, 2011
  2. (2009)Wikipedia The free Encyclopedia [online]. Available: http://en.wikipedia.org /wiki.
  3. Sameer Sachdeva,” E-Governance Strategy in India”, White Paper on E-Governance Strategy in India, December’2002
  4. “Cloud Computing for E-Governance”, A White Paper, IIIT Hyderabad, January 2010 , http://search.iiit.ac.in/uploads/CloudComputingForEGovernance.pdf
  5. Naveen Tewari, Dr. M K Sharma, “Cloud based Working Concept for E-Governance Citizen Charter”, International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE), Volume 3,Issue 6,June- 2013
  6. http://csrc.nist.gov/publications/nistpubs/800-145/SP800-145.pdf accessed on December 2014
  7. http://deity.gov.in/content/state-wide-area-network-swan accessed on December 2013

IOSR Journals are published both in online and print versions.