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 : 4-D Authentication Mechanism
Country : India
Authors : Ronak Talati, Shubham Shah
: 10.9790/0661-16250106    logo

Abstract: Computer technology is reaching new milestones with every passing day but authentication schemes are still weak in their approach. It has now become a child's play for others to filch, hack or fabricate our passwords. Many authentication schemes have been proposed but each has some drawbacks. Hence, the 3D password paradigm has been introduced. The 3D password is a multi-layer, multifactor authentication mechanism. It consists of a 3D virtual environment on which a user has to perform certain actions. The sequence of actions determines the user's 3D password.

[1] X. Suo, Y. Zhu, and G. S. Owen, "Graphical passwords: A survey," in Proc. 21st Annu. Comput. Security Appl. Conf., Dec. 5–9, 2005, pp. 463–472.
[2] D. V. Klein, "Foiling the cracker: A survey of, and improvement to passwords security," in Proc. USENIX Security Workshop, 1990, pp. 5–14. Authorized licensed use limited to: IEEE Xplore. downloaded on March 5, 2009 at 02:38 from IEEE Xplore. Restrictions apply. 1938 IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, VOL. 57, NO. 9, SEPTEMBER 2008
[3] Alsulaiman, F.A.; El Saddik, A., "Three- for Secure," IEEE Transactions on Instrumentation and measurement, vol.57, no.9, pp 1929-1938.Sept. 2008.
[4] Fawaz A. Alsulaiman and Abdulmotaleb El Saddik,"Three-Dimensional Password for More Secure Authentication," IEEE,
[5] http://ieeexplore.ieee.org., Last Updated –6 Feb 2008J.
[6] R. Dhamija and A. Perrig, "Deja Vu: A User Study Using Images for Authentication," in Proceedings of 9th USENIX Security Symposium, 2000.

Paper Type : Research Paper
Title : A Short Range Wireless Communication Using Android NFC API
Country : India
Authors : Durga Priya, E.Ramakotaiah
: 10.9790/0661-16250710    logo

Abstract: In this paper, we are proposing the implementation of short range wireless communication using Android's NFC API. Near Field Communication is set of protocols used for communication between two android powered and NFC enabled devices. Near Field Communication is based on the Radio Frequency Identification standards used for contactless communication within the range of 4cm. There are two types of communications possible in NFC based services. One is Passive and another is Active communication, two un-programmed NFC tags can be read in passive communication and in active communication both the devices diffuse power and supports peer to peer communication.

Keywords: Wireless communication, Near Field Communication, Android, NFC tag.

[1] Infographic: Mobile statistics, stats & facts 2011. Available at http://www.digitalbuzzblog.com/2011-mobile-statistics-stats-facts-marketing-infographic/.
[2] Levitt J.(2011), 1 in 6 mobile subscribers to have NFC mobile phones by 2014 according to Juniper research.
[3] Ortiz, C. Enrique "An Introduction to Near-FieldCommunicationandtheContactlessCommunicationAPI", 2008-10-24.
[4] NFC Forum.(2004, march). Nokia, Philips and Sony Establish The Near Field Communication (NFC) Forum.
[5] [Online] developer.android.com.
Paper Type : Research Paper
Title : Study on Pagefile.sys in Windows System
Country : India
Authors : Nisarg Trivedi
: 10.9790/0661-16251116    logo

Abstract: Pagefile.sys is a file that is used by Microsoft Windows to store frames of memory that do not currently fit into physical memory. It means Windows uses a page file to store data that can't be held by your computer's random-access memory when it fills up. Analysis of the Pagefile.sys gives the information of which events were done on PC. Analysis of Pagefile.sys can give the sensitive information such as User Ids, Passwords, Hidden Processes, Download info, Search Activity of Browser etc. This Paper represents various approaches and tools used to capture and analyze data from Pagefile.sys.

Keywords: Physical Memory, Artifacts in Pagefile.sys, Sensitive information.

[1] Harly Carvey, "Windows Forensic Analysis Toolkit"
[2] John Sammons, "The Basics of Digital Forensic"
[3] http://www.howtogeek.com/126430/htg-explains-what-is-the-windows-page-file-and-should-you-disable-it/
[4] Linux Reader Software http://www.freewarefiles.com/DiskInternals-Linux-Reader_program_21787.html
[5] HxD Software http://mh-nexus.de/en/hxd/ .
[6] http://en.kioskea.net/faq/719-pagefile-sys-file
[7] http://netsecurity.about.com/od/windowsxp/qt/aa071004.htm
[8] http://www.neuber.com/taskmanager/process/pagefile.sys.html

Paper Type : Research Paper
Title : Classified Ave Rage Precision For Capturing User Search Intention For Multiattributes
Country : India
Authors : Anjuna D Raj, B.Ankayarkanni
: 10.9790/0661-16251721    logo

Abstract: Due to the tremendous increase in use of internet surfing user may not get the most accurate search result which they preferred for their queries to clarify their known uncertain information. Such search engine may not often bring the user preferred information and does not satisfy the request completely. Hence it is necessary to infer and get user specific interest about a topic. Providing results just based on user's previous search history does not yield needful results since the self feedback and repeatable feedback were not included in the existing system. Those types of problems are solved in proposed system.

[1] R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval.ACM Press, 1999. 512 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 25, NO. 3, MARCH 2013 Clustering of the clicked URLs and feedback sessions, where points represent clicked URLs, ellipses represent feedback sessions, and lines represent class boundaries. Supposing that the clicked URLs have two classes, the points in the left figure are hard to be segmented directly, while the ellipses in the right figure are easier to be segmented.
[2] R. Baeza-Yates, C. Hurtado, and M. Mendoza, "Query Recommendation Using Query Logs in Search Engines," Proc. Int'l Conf. Current Trends in Database Technology (EDBT '04), pp. 588-596, 2004.
[3] D. Beeferman and A. Berger, "Agglomerative Clustering of a Search Engine Query Log," Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD '00), pp. 407-416, 2000.
[4] S. Beitzel, E. Jensen, A. Chowdhury, and O. Frieder, "Varying Approaches to Topical Web Query Classification," Proc. 30th Ann. Int'l ACM SIGIR Conf. Research and Development (SIGIR '07), pp. 783-784, 2007.

Paper Type : Research Paper
Title : Image Retrieval using Sparse Codewords with Cryptography for Enhanced Security
Country : India
Authors : Munmun N. Bhagat, Prof. B. B. Gite
: 10.9790/0661-16252226    logo

Abstract: Now days face image of people is the interesting area of users. Most of the time images are in digital form. Thus, content-based face image retrieval is a technique which facilitates for many emerging applications. In this paper, automatically detected human attributes are used to enhance the performance of content based face image retrieval. Here, low level features of image are combined with high level features of image to get more efficient results about image retrieval. In this work, semantic codewords for face retrieval are constructed by using semantic cues of the face image to improve content based face image retrieval. Secured Quick Crypt (SQC) encryption algorithm is applied on images when they are transferred via network. This will protect image from getting attacked. The proposed method can achieve a set of relevant and secured results as compared to the existing methods.

Key Words: Content based image retrieval, human attributes, encryption, decryption.

[1] Z. Wu, Q. Ke, J. Sun, and H.-Y. Shum, "Scalable face image retrieval with identity-based quantization and multi-reference re-ranking," IEEE Conference on Computer Vision and Pattern Recognition, 2010.
[2] B.-C. Chen, Y.-H.Kuo, Y.-Y.Chen, K.-Y.Chu, and W. Hsu, "Semisupervised face image retrieval using sparse coding with identity constraint," ACM Multimedia, 2011.
[3] Bor-Chun Chen, Yan-Ying Chen, Yin-HsiKuo, Winston H. Hsu, "Scalable Face Image Retrieval using Attribute-Enhanced Sparse Codewords", IEEE Transactions onMultimedia, 2013.
[4] N. Kumar, A. C. Berg, P. N. Belhumeur, and S. K. Nayar, "Describable visual attributes for face verification and image search," in IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), Special Issue on Real-World Face Recognition, Oct 2011.

Paper Type : Research Paper
Title : Data Attribute Security And Privacy In Distributed Database System
Country : India
Authors : Ms. Pragati J. Mokadam
: 10.9790/0661-16252733    logo

Abstract: Now a days there are a need of data attribute security in distributed database while preserving privacy. In the proposed work, we consider problem related in publishing collaborative data for anonymizing vertically and horizontally partitioned data. We consider the attack which may use a subset of the overall data. After in view of entire research work we make the distributed database system in which first, we introduce the notion of data privacy which guarantees the privacy of anonymized data for different data provider. Second, we present algorithms for exploiting the monotonicity of privacy constraints for checking data privacy efficiently with the encryption schema using encryption algorithm. Third, we distribute the data to end user with the anonymization as well as security algorithm, and checking the authentication schema with TTP, which will give the assurance to provide high level security to database. Experiments we use the hospital patient datasets suggest that our approach achieves better or comparable utility and efficiency than existing and baseline algorithms while satisfying of proposed security work.

Keywords: Distributed database, privacy, protection, security, SMC, TTP

[1] S. Goryczka, L. Xiong, and B. C. M. Fung, "m-Privacy for collaborative data publishing," in Proc. of the 7th Intl. Conf. on Collaborative Computing: Networking, Applications and Worksharing, 2011.
[2] C.Dwork,"Differential privacy: A survey of results", in Proc. of the 5th Intl. Conf. on Theory and Applications of Models of Computation, 2008, pp. 1–19.
[3] N. Mohammed, B. C. M. Fung, P. C. K. Hung, and C. Lee, "Centralized and distributed anonymization for high-dimensional healthcare data," ACM Trans. on Knowledge Discovery from Data, vol. 4, no. 4, pp. 18:1–18:33, October 2010.
[4] W. Jiang and C. Clifton, "Privacy-preserving distributed k-anonymity,"in DBSec, vol. 3654, 2005, pp. 924–924.
[5] W. Jiang and C. Clifton, "A secure distributed framework for achieving k-anonymity," The VLDB Journal Special Issue on Privacy Preserving Data Management, vol. 15, no. 4, pp. 316–333, 2006
[6] A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam,"l-Diversity: Privacy beyond k-anonymity," in ICDE, 2006,p. 24

Paper Type : Research Paper
Title : Utility Mining Algorithm for High Utility Item sets from Transactional Databases
Country : India
Authors : Arati, W. Borkar
: 10.9790/0661-16253440    logo

Abstract: The discovery of item sets with high utility like profits is referred by mining high utility item sets from a transactional database. Although in recent years a number of relevant algorithms have been proposed, for high utility item sets the problem of producing a large number of candidate item sets is incurred. The mining performance is degraded by such a large number of candidate item sets in terms of execution time and space requirement. When the database contains lots of long transactions or long high utility item sets the situation may become worse. Internet purchasing and transactions is increased in recent years, mining of high utility item sets especially from the big transactional databases is required task to process many day to day operations in quick time.

[1] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Int'l Conf. on Very Large Data Bases, pp. 487-499, 1994.
[2] C. F. Ahmed, S. K. Tanbeer, B.-S. Jeong, and Y.-K. Lee. Efficient tree structures for high utility pattern mining in incremental databases. In IEEE Transactions on Knowledge and Data Engineering, Vol. 21, Issue 12, pp. 1708-1721, 2009.
[3] R. Chan, Q. Yang, and Y. Shen. Mining high utility itemsets. In Proc. of Third IEEE Int'l Conf. on Data Mining, pp. 19-26, Nov., 2003.
[4] A. Erwin, R. P. Gopalan, and N. R. Achuthan. Efficient mining of high utility itemsets from large datasets. In Proc. of PAKDD 2008, LNAI 5012, pp. 554-561.
[5] J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of the ACM-SIGMOD Int'l Conf. on Management of Data, pp. 1-12, 2000.
[6] Y.-C. Li, J.-S. Yeh, and C.-C. Chang. Isolated items discarding strategy for discovering high utility itemsets. In Data & Knowledge Engineering, Vol. 64, Issue 1, pp. 198-217, Jan., 2008.
[7] Y. Liu, W. Liao, and A. Choudhary. A fast high utility itemsets mining algorithm. In Proc. of the Utility-Based Data Mining Workshop, 2005.
[8] B.-E. Shie, V. S. Tseng, and P. S. Yu. Online mining of temporal maximal utility itemsets from data streams. In Proc.of the 25th Annual ACM Symposium on Applied Computing, Switzerland, Mar., 2010.

Paper Type : Research Paper
Title : ICHALEC Improved Cluster Head And Low Energy Consumption Protocol In Wireless Sensor Network
Country : India
Authors : Gurpreet Kaur Khalsa, Sachi Pandey
: 10.9790/0661-16254148    logo

Abstract: Wireless Sensor Network is an emerging field for research in most of the aspects of mankind. It is a network composed of nodes without any central controller. Sensor network protocols have high ability to be used in each and every field of life. The working of sensor networks depends entirely on the battery power of sensors which cannot be replaced. In this work, cluster based routing protocol is studied precisely. Further leach protocol is modified as ICHALEC protocolby introducing two schemes efficient cluster head replacement scheme and two power level scheme for amplification of signals. The performance of ICHLEAC protocol is shown in terms of network life time and throughput. The cluster head selection in ICHALEC is more efficient than other protocols because energy is not wasted to select the new cluster head for new round and in other scheme two levels of power are used for amplification of signals either low or high power. Thus using different energy for different types of communication. Then at the end ICHALEC is compared with LEACH and MOD-LEACH protocol. ICHALEC outperforms LEACH and MOD-LEACH in terms of network lifetime.

Keywords: Clusters, ICHALEC, LEACH, MOD-LEACH, Power level, Threshold.

[1]. P. Krishna, et al., "A survey on sensor networks", IEEE communications magazine, volume 8, pp 102-114, 2002.
[2]. M. Akbar, N. Javaid, A. A. Khan, Z. A. Khan, U. Qasim, "On Modeling Geometric Joint Sink Mobility with Delay-tolerant Cluster-less Wireless Sensor Networks", 4th IEEE Technically Co-Sponsored International Conference on Smart Communications in Network Technologies (SaCoNet'13) 2013, Paris, France.
[3]. V. Mhatre, et al., "Design of surveillance sensor grids with a lifetime constraint", 1st European Workshop on Wireless Sensor Networks (EWSN), Berlin, January 2004.
[4]. W.R. Heinzelman,et al., "Energy efficient communication protocol for wireless micro sensor networks", Proceedings of the 33rd Hawaii International Conference on System Sciences (HICSS-33), January 2000.
[5] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan."Energy-Efficient Communication Protocols for Wireless Microsensor Networks".In Proceedings of Hawaiian International Conference on Systems Science, January 2000.
[6] C. Intanagonwiwat, R. Govindan, and D. Estrin."Directed Diffusion: AScalable and Robust Communication Paradigm for Sensor Networks".In Proceedings of the 6th Annual ACM/IEEE International Conferenceon Mobile Computing and Networking(MOBICOM), pp. 56-67, August2000.

Paper Type : Research Paper
Title : Survey on Discovering rapid Changing Patterns In the presence of Hierarchy
Country : India
Authors : Priya Sahane, Prof.A.N. Nawathe
: 10.9790/0661-16254953    logo

Abstract: Frequent item set mining is used that focuses on find out recurrent correlations in the data. Change mining, it focuses on frequent itemsets, focuses on important changes in the set of mined itemsets from one point in time period to another. The finding of frequent generalized itemsets, 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 [1] .

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.
[7] E. Baralis, L. Cagliero, T. Cerquitelli, V. D'Elia, and P. Garza,"Support Driven Opportunistic Aggregation for Generalized Itemset Extraction," Proc. IEEE Fifth Int'l Conf. Intelligent Systems (IS '10), 2010.

Paper Type : Research Paper
Title : Performance Evaluation of Digital Image Encryption Using Discrete Random Distributions and MOD Operator
Country : India
Authors : H.B.Kekre, Tanuja Sarode, Pallavi N Halarnkar
: 10.9790/0661-16255468    logo

Abstract: Information security is important in all the domains. Image Processing is one such domain which has huge amount of information in the form of Digital images. To secure image data there are many ways, one of them is Image Encryption. In this paper we have presented a novel approach for Image Encryption. Randomness of Discrete Distributions along with MOD invertible operator is used for encrypting the image. A new Experimental parameter called as Peak Average Fractional Change in Pixel value is introduced. For analysis purpose, Image moments are also calculated

Keywords: Discrete Distributions, Image Encryption, Image Moments, Image Scrambling, PAFCPV

[1] Mishra, Minati, Priyadarsini Mishra, M. C. Adhikary, and Sunit Kumar. Image Encryption Using Fibonacci-Lucas Transformation, International Journal on Cryptography and Information Security (IJCIS).2(.3), September 2012, 131-141.
[2] Zhu, Guiliang, Weiping Wang, Xiaoqiang Zhang, and Mengmeng Wang. Digital image encryption algorithm based on pixels, Proc. IEEE Conf. on Intelligent Computing and Intelligent Systems (ICIS), (1), 2010 , 769-772.
[3] Feng, Yong, and Xinghuo Yu, A novel symmetric image encryption approach based on an invertible two-dimensional map, Proc. 35th IEEE Conf. on Industrial Electronics, IECON'09. 2009, 1973-1978.
[4] Pawan N. Khade and Prof. Manish Narnaware, 3D Chaotic Functions for Image Encryption, IJCSI International Journal of Computer Science Issues, 9( 3),(1), May 2012, 323-328.
[5] Mohammed A. Shreef, Haider K. Hoomod, Image Encryption Using Lagrange-Least Squares Interpolation, International Journal of Advanced Computer Science and Information Technology (IJACSIT) 2, (4), 2013, 35-55

Paper Type : Research Paper
Title : A Novel Approach for Detection of Blackhole Attacks
Country : India
Authors : Ankita V. Rachh, Yatin V. Shukla, Tejas R. Rohit
: 10.9790/0661-16256974    logo

Abstract: The MANET (Mobile Adhoc Network) is a wireless distributed network. It is formed by group of autonomous mobile nodes without any infrastructure like access points. Every node of MANET can acts as router as well as host. It has a basic characteristic of dynamic topology, it means nodes can enter and leave network any time. MANET is vulnerable to many security attacks. Black hole attack is most occurred attack in MANET and very hard to detect which is performed on network layer. Black hole attacks are classified into two types. In single black hole attack, one malicious node will change the route of source to destination and wrong path of malicious node will follow. In collaborative black hole attack one malicious node records packet at one end and send to another malicious node at other end. Black hole attacks are active attacks. In this paper, we propose a solution for detecting black hole attack. Our protocol's name is EBAODV (Enhance Black hole AODV). In this approach, leader nodes are used for detecting black hole nodes.

Keywords: AODV, Black hole attack, EBAODV, MANET

[1] Sunil J. Soni , Suketu D. Nayak, "Enhancing Security Features & Performance of AODV Protocol under Attack for MANET", IEEE International Conference on Intelligent Systems and Signal Processing (ISSP),pp-325-328,2013
[2] Sisily Sibichen1, Sreela Sreedhar, "An Efficient AODV Protocol and Encryption Mechanism for Security Issues in Adhoc Networks ", IEEE- ICMICR-2013
[3] Ali M. Sagheer, IEEE Member, and Hadeel M. Taher, "Identity Based Cryptography for Secure AODV Routing Protocol", IEEE- TELFOR,pp-198-201, 2012
[4] Rajesh Yerneni, Anil K. Sarje, "Secure AODV protocol to mitigate Black hole attack in Mobile Ad hoc Networks", IEEE-ICCCNT-2012
[5] Christian Gottron, Pedro Larbig, Andr´e K¨onig, Matthias Hollick and Ralf Steinmetz, "The Rise and Fall of the AODV Protocol:A TestBed Study on Practical Routing Attacks", IEEE-LCN-2010

Paper Type : Research Paper
Title : An Efficient Adaptive Channel Allocation Scheme For Cellular Networks
Country : India
Authors : R R Kar, S S Nayak
: 10.9790/0661-16257579    logo

Abstract: Cellular networking is providing global information access to users on the move. Handoff algorithms allow the users to move among heterogeneous wireless networks. In this paper, the authors have proposed an efficient Adaptive Channel Allocation Scheme (ACAS) where the number of guard channels is adjusted automatically based on the average handoff blocking rate measured in the past certain period of time. The handoff blocking rate and the new call blocking rates are minimized. It is seen that the proposed scheme is far efficient than the Static Channel Allocation Scheme. The resource utilization of the proposed scheme is more.

Keywords: Handoff, Guard Channel, Adaptive Channel, Fixed Channel, ACAS, Spectrum

[1] S.Choi and K.G.Shin, Adaptive bandwidth reservation and admission control in QoS-sensitive cellular networks, IEEE Transection on Parallel and Distributed Systems, vol.13,no.9, pp.882-897,2002
[2] Nasif Ekiz, Tara Salih, Sibel Kucukoner and Kemal Fidanboylu, An overview of Handoff techniques in Cellular Networks, World Academy of Science, Engineering and Technology, 6 2005
[3] F. Siddiqui and S. Zeadally, Mobility Management across Hybrid Wireless Networks: Trends and Challenges, Computer Communications, vol. 29, no. 9, pp. 1363–1385, May 2006.
[4] Nasser, N., Hasswa, A. and Hassanein, Handoffs in Fourth Generation Heterogeneous Networks, IEEE Communications Magazine, vol. 44, pp. 96-103, 2006
[5] Rami Tawil, Jaques Demergian, Guy Pujolle, A Trusted Handoff Decision Scheme for the Next Generation Wireless Networks, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.6, June 2008
[6] V. S. Kolate, G. I. Patil, A. S. Bhide, "Call Admission Control Schemes and Handoff Prioritization in 3G Wireless Mobile Networks, International Journal of Engineering and Innovative Technology (IJEIT) vol.1, no.3, March 2012

Paper Type : Research Paper
Title : Mobile Streaming: Android Based Mobile Tv
Country : India
Authors : Ms. Reshma T. R., Ms. Jasmine Joseph
: 10.9790/0661-16258086    logo
Abstract: Cloud computing is an emerging technology aimed at providing various computing and storage services over the Internet. Multimedia cloud computing is generally related to multimedia computing over grids, content delivery, server-based computing and P2P multimedia computing. Multimedia services provide an efficient, flexible, and scalable data processing method and offer a solution for the user demands of high quality and diversified multimedia. As intelligent mobile phones, tablets and wireless networks have begun popularize, network services for users are no longer limited to the home. The public has started to use mobile devices to view the multimedia videos by means of streaming. All multimedia file format is not supported by the mobile devices. Users always expect to watch file at anytime from anywhere, no matter what changes occur in the network environments. To overcome the limited bandwidth available for mobile streaming and different device requirements, presented a network and device-aware Quality of Service approach that provides multimedia data suitable for a terminal unit environment. It further considering the overall network environment and adjusting the interactive transmission frequency and the dynamic multimedia transcoding. Based on the bandwidth value the appropriate transcoding format is selected, hence avoiding the wastage of the bandwidth and the terminal power. QoS approach could provide efficient self adaptive multimedia streaming services for varying bandwidth environments.
Keywords: Cloud multimedia, Adaptive QoS, Network and device aware.
[1] Chin-Feng Lai, Honggang Wang, Han-Chieh Chao, and Guofang Nan,"A network and device aware QoS approach for cloud based mobile streaming", IEEE Trans. multimedia., vol.15, no. 4, june 2013.
[2] Wenwu Zhu, Chong Luo, Jianfeng Wang, and Shipeng Li, "Multimedia cloud computing" in IEEE Signal Process. Mag., vol. 28, no. 3, pp. 59–69, 2011.
[3] K. E. Psannis, Y. Ishibashi, and M.G.Hadjinicolaou, "QoS for wireless interactive multimedia streaming," in Proc. ACM Workshop QoS and Security for Wireless and Mobile Networks, 2007, pp. 168–171.
[4] S. Ferretti, V. Ghini, F. Panzieri, and E. Turrini, "Seamless support of multimedia distributed applications through a cloud," in Proc. IEEE 3rd Int. Conf. Cloud Comput. (CLOUD), 2010, pp. 548–549.
[5] H.Choi, J. W.Kang, and J. G. Kim, "Dynamic and interoperable adaptation of SVC for QoS-enabled streaming," IEEE Trans. Consum. Electron., vol. 53, no. 2, pp. 384–385, 2007.

Paper Type : Research Paper
Title : Optimizing Advertisement Targeting Based on Colour and Devices
Country : India
Authors : Anagha Gaikwad, Priyanka Khairnar, Sneha Waghamode, Prof. A. M..Bhadgale
: 10.9790/0661-16258790    logo
Abstract: Over the last few years, we have seen revolutions in the internet technology and its adoption in advertising industry. Internet has become the common platform across the world where people visit different web sites for different type of their interests. It is also the cheapest media where they can place their advertisements as compared to other media like newspapers, Radio, TV etc. And hence we thought of putting a basic idea of exploring this smart era of smart devices and using the same for targeting advertisements along with traditional parameters like colour optimizations. In the project we will be implementing client server architecture for displaying and tracking the advertisements. A data store will be implemented using HDFS which will process data coming through advertisement tracking and also give efficient read and write operations for advertisement targeting. A statistical model will be implemented using statistical and probability based algorithms, which will provide feeds to server component to display the targeted advertisement. A device detection layer will also be implemented.
[1]. Lorrier Faith Cranor "Can Users Control Online Behavioral Advertising Effectively?" March/April 2012 IEEE, www.computer.org/security
[2]. Ahmad .A Kardan , Maryam Hooman "Targeted Advertisement in Social Networks using Recommender Systems" April 17,18,2013,IEEE
[3]. Konstantin Shvachko, Hairong Kuang, Sanjay Radia, Robert Chansler, The Hadoop Distributed File System,2010,IEEE
[4]. Survey Of Internet User Attitudes Toward Internet Advertising, AnnE .Schlosser ,Sharon Shavitt , Alaina Kanfer ,JOURNALOF INTERACTIVE MARKETING VOLUME 13 / NUMBER 3 / SUMMER 1999
[5]. Personalized News Recommendation Based on Click Behavior Jiahui Liu, Peter Dolan, Elin Rønby Pedersen.

Paper Type : Research Paper
Title : An Efficient Face Tracker Using Active Shape Model
Country : India
Authors : S. K. Murugaraja, K. Balamurali
: 10.9790/0661-16259196    logo
Abstract: To perform tracking in an illumination insensitive feature space, called the gradient logarithm field (GLF) feature space. The GLF feature mainly depends on the intrinsic characteristics of a face and is only marginally affected by the lighting source. The GLF feature is a global feature and does not depend on a specific face model, and thus is effective in tracking low-resolution faces. By using the GLF face tracking system, the modified image like editing image did not recognition. To overcome this problem, we propose, to find the original image of the editable image by using the outline dimension of the image. To recognition original face from the modified face, we track the inclusive(complete) region of the face. The Active Shape Model is used to recover the shape of the face and then find the face after comparing the faces.
[1] S. Stalder, H. Grabner, and L. Van Gool, "Beyond semi-supervised tracking: Tracking should be as simple as detection, but not simpler than recognition," in 2009.
[2] T. Ahonen, A. Hadid, and M. Pietikainen, "Face description with local binary patterns: Application to face recognition," in Dec.2006.
[3] H. Grabner, M. Grabner, and H. Bischof, "Real-time tracking via on-line boosting," on 2006.
[4] S. Zhou, R. Chellappa, and B. Moghaddam, "Visual tracking and recognition using appearance-adaptive models in particle filters", in 2008.
[5] B. Babenko, M. Yang, and S. Belongie, "Visual tracking with online multiple instance learning," in 2011.

Paper Type : Research Paper
Title : A Review on Study and Comparison between 2D Gel Electrophoresis and Mass Spectrometry
Country : India
Authors : Ashwini Yerlekar, Priyanka Dudhe
: 10.9790/0661-162597104    logo
Abstract: Protein structure prediction is an important area of life sciences. The Protein prophecy is unbreakable because of its complex structure. The main problem in proteomics is to estimate the several proteins available in cell structure or tissue sample. The protein-protein interaction is essential to study the behaviour of protein in a specific environment, and study molecular relationship in living systems. Therefore, large scale proteomics technologies are required to measure physical connection of proteins in living organisms. A combination of high resolution two-dimensional (2-D)gel electrophoresis, highly sensitive biological mass spectrometry , and the speedily growing protein and DNA databases has resulted for high throughput proteomics. This review concentrates on two main techniques of protein identification 2-D gel electrophoresis and High Throughput Mass Spectrometry.
Keywords: 2-D gel electrophoresis, DNA database , Mass Spectrometry, Protein prediction, Proteomics.
[1] Wilkins M. R., Sanchez J.-Cooley A. A., et al. "Progress with proteome projects: why all proteins expressed by a genome should be identified and how to do it". Biotechnology and Genetic Engineering Reviews, vol. 13 pp. 19–50 1995 2-s2.0-0030333694.
[2] O'Farrell, P.H. High resolution two-dimensional electrophoresis of proteins. J. Biol. Chem. 250, 4007–4021 (1975).
[3] Klose, J. Protein mapping by combined isoelectric focusing and electrophoresis of mouse tissues, A novel approach to testing for induced point mutation in mammals. Humangenetik 26, 231–243 (1975).
[4] IDTutorial: Gel Electrophoresis
[5] Kimberly F. Sellers, Jeffrey C. Miecznikowski," Statistical Analysis of Gel Electrophoresis Data".

Paper Type : Research Paper
Title : Low-Cost Bus Tracking System Using Area-Trace Algorithm
Country : India
Authors : Darshan Ingle, Saumya Omanakuttan
: 10.9790/0661-1625105112    logo
Abstract: This paper proposes a low-cost Bus Tracking System that uses GPS and allows the user to know the bus location on their mobile phone. It has an advantage that it does not use any internet data for the users to be notified. Instead, it uses only a simple sms in a specified format to be sent to the server. It also sends the user, the bus's expected arrival time. The system maintains a track of people travelling in the bus as well as the ticket fare from each required source to required destination. All this information is sent to the user on the receipt of a single sms to the server. This technology aims at providing a low cost solution to the problems faced by common man using the public transport thereby addressing the issues and solving them successfully. The aim is to present the work to the Indian Government which can help the struggling life become more smooth and functional.
Keywords: GPS, Area-Trace Algorithm, Haversine formula, Traffic Management System.
[1] Raj Kishen Moloo, Varun Kumar Digumber, Low-Cost Mobile GPS Tracking Solution, International Conference on Business Computing and Global Informatization, 2011, 516-519.
[2] Prathusha Perugu, An Innovative Method using GPS Tracking,WINS Technologies for Border Security and Tracking of Vehicles, IEEE, 2010, 130-133.
[3] Katina Michael, Andrew McNamee, MG Michael, The Emerging Ethics of Humancentric GPS Tracking and Monitoring, Proceedings of the International Conference on Mobile Business (ICMB'06), 2006.
[4] Hassan A. Karimi, J. Tom Lockhart, GPS-Based Tracking1 Systems for Taxi Cab Fleet Operations, IEEE - IEE Vehicle Navigation & Information Systems Conference, Ottawa - VNlS '93, 1993.
[5] Pham Hoang Oat, Micheal Drieberg and Nguyen Chi Cuong, Development of Vehicle Tracking System using GPS and GSM Modem, IEEE Conference on Open Systems (ICOS), 2013, 89-94.

Paper Type : Research Paper
Title : Network Layer Attacks and Their Countermeasures in Manet: A Review
Country : India
Authors : Manisha, Dr. Mukesh Kumar
: 10.9790/0661-1625113116    logo
Abstract: Mobile ad hoc network(MANET) is a collection of mobile nodes that are free to move in any direction. It is an infrastructureless network means it has no fixed or predefined network. MANET is a self configuring network with no central authority. Security is one of important and desired feature and the major aspect to be concerned in MANET. The performance and security of MANET is affected by various security attacks. MANET is not only affected by the attacks that are faced in wired or wireless medium but it also has its own security threats. This paper outlines various network layer security attacks and their preventive measures in Mobile Ad-hoc Network.
Keywords: MANET , security, attacks, malicious node, countermeasures.
[1] Rajni Sharma, Alisha saini," A Study of Various Security Attacks and their Countermeasures in MANET,"International Journel of Advanced Research in Computer Science and Software Engineering,Volume 1,Issue 1,December 2011.
[2] Bing Wu, Jianmin Chen, Jie Wu, Mihaela Cardei , "A Survey on Attacks and Countermeasures in Mobile Ad Hoc Networks ," Wireless/Mobile Network Security, Y. Xiao, X. Shen, and D.-Z. Du (Eds.) pp, @ 2006 Springer.
[3] Mangesh M Ghonge, Pradeep M Jawandhiya, Dr. M S Ali,"Countermeasures of Network Layer Attacks in MANETs," IJCA special issue on "Network Security and Cryptography ",NSC,2011.
[4] K. SIVAKUMAR, Dr. G. SELVARAJ,"Overview of Various Attacks in MANET and Countermeasures for attacks," International Journal of Computer Science and Management Research, Vol 2 Issue 1 January 2013.
[5] Rashid Hafeez Khokhar, Md Asri Ngadi & Satria Mandala,"A Review of Current Routing Attacks in Mobile Ad Hoc Networks," International Journal of Computer Science and Security, volume (2) issue (3).

Paper Type : Research Paper
Title : Text Extraction of Vehicle Number Plate and Document Images Using Discrete Wavelet Transform in MATLAB
Country : India
Authors : Akash Goel, Prof. Yogesh Kumar Sharma
: 10.9790/0661-1625117126    logo
Abstract: Text Extraction from colour images is a challenging task in computer vision. The concept of text extraction is derived from the vehicle plate recognization and their characters extractions individually. Some examples of the applications are automatic image indexing, visual impaired people assistance or optical character reading, keyword searching in a document image. The continuous research has been done majorly that focuses on the text detection and localization in images. The paper focuses on the colour images text extraction using Two Dimensional Discrete Wavelet Transform (2D-DWT). The transform used for DWT is HAAR DWT with mathematical morphological concept. The speed of Haar DWT operates the fastest among all wavelets because its coefficients are either 1 or -1. It is one of the reasons that Haar DWT is used to detect edges of candidate text regions. Image sub bands contain both text edges and non-text edges. The work is carried out in MATLAB 12.0 image processing tool and simulated results are tested on vehicle plate text extraction and the document images.
Keywords: Text Localization, Mathematical Morphology Discrete Wavelet Transform (DWT), HAAR Transform, Mathematical Morphology.
[1] A. Tognetti, F. Lorussi, R. Bartalesi, S. Quaglini, M. Tesconi, G. Zupone, and D. De Rossi, "Wearable kinesthetic system for capturing and classifying upper limb gesture in post-stroke rehabilitation," J. Neuroeng. Rehabil., vol. 2, no. 1, p. 8, Mar. 2005.
[2] Chen, Datong, Bourlard, H., and Thiran J. P., 2001 "Text identification in complex background using SVM". IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Proceedings of the 2001, 2, 8-14:621-626.
[3] JulindaGllavata, Ralph Ewerth and Bernd Freisleben, A Robust algorithm for Text detection in images, Proceedings of the 3rd international symposium on Image and Signal Processing and Analysis, 2003.
[4] J.D. Foley, A. van Dam, S.K. Feiner and J.F. Hughes, Computer Graphics, Principles and Practice, Addison-Wesley, Reading, 1990.
[5] Keechul Jung, KwangIn Kim and Anil K. Jain, Text information extraction in images and video: a survey, The journal of the Pattern Recognition society, 2004.


Researcher can also search IOSR published article contents through

IOSR Xplore