iosr-JCE   Volume-9 ~ Issue-3

Abstract: In this paper, we present performance improvement techniques for data retrieval from customized data warehouses for efficient querying and Online Analytical Processing (OLAP) in relation to efficient database and memory management. Different database management techniques, e.g. indexing, partitioning etc. play vital role in efficient memory management. A comparison of data retrieval time for a particular query from a relational database as well as data warehouse database with and without indexing is performed. We show that the application of different database management techniques result faster query execution by reducing data retrieval time. This improved efficiency may increase the efficiency of OLAP operations, which results better data warehouse performance.

Keywords - Data Warehouse, Indexing, OLAP, Partitioning, Querying.

[1] M. Barrena, C. Pachon and E. Jurado, JISBD2007-04: Neighbors search in holey multidimensional spaces, IEEE Latin America
Transactions, Vol. 6, No. 4, Aug. 2008, pages 332-338.
[2] M. J. Suarez-Cabal, C. de la Riva and J. Tuya, JISBD04-Populating Test Databases for Testing SQL Queries, IEEE Latin America
Transactions, Vol. 8, No. 2, April 2010, pages 164-171.
[3] Mafruz Zaman Ashrafi, David Taniar, Kate Smith, ODAM: An Optimized Distributed Association Rule Mining Algorithm, Monash University, IEEE Distributed Systems Online, IEEE Computer Society, Vol. 5, No. 3; March 2004.
[4] Bernd Reiner, Karl Hahn. Optimized Management of Large-Scale Data Sets Stored on Tertiary Storage System, IEEE Distributed
Systems Online, IEEE Computer Society, Vol. 5, No. 5; May 2004.
[5] S. Repp, A. Gross and C. Meinel, Browsing within Lecture Videos based on the chain index of speech transcription, IEEE
transactions on learning technologies, Vol. 1, Issue 3, 2008, pages 145-156.
[6] M. Al Mamun. Data Warehouse Performance Analysis for Online Analytical Processing, A Thesis Draft submitted for predefense of MS, Department of Computer Science and Engineering, Jahangirnagar University, Savar, Dhaka-1342.
[7] V. Nebot and R. Berlanga, JISBD02-Populating Data Warehouses with Semantic Data, IEEE Latin America Transactions, Vol. 8,
No. 2, April 2010, pages 150-157.
[8] J.-N. Mazon and J. Trujillo, JISBD2007-02: Model-driven reverse engineering for data warehouse design, IEEE Latin America
Transactions, Vol. 6, No. 4, Aug. 2008, pages 317-323.
[9] E. Soler, J. Trujillo, E. Fernandez-Medina, and M. Piattini, JISBD2007-07: An extension of the relational metamodel of CWM to
represent secure data warehouse at the logical level, IEEE Latin America Transactions, Vol. 6, No. 4, Aug. 2008, pages 355-362.
[10] Morteza Zaker, Somnuk Phon-Amnuaisuk and Su-Cheng Haw, An Adequate Design for Large Datawarehouse systems: Bitmap
indexes versus B-tree index, International Journal of Computers and Communications, Vol. 2, Issue 2, 2008.

Abstract: Handling missing attribute values is the greatest challenging process in data analysis. There are so many approaches that can be adopted to handle the missing attributes. In this paper, a comparative analysis is made of an incomplete dataset for future prediction using rough set approach and random tree generation in data mining. The result of simple classification technique (using random tree classifier) is compared with the result of rough set attribute reduction performed based on Rule induction and decision tree. WEKA (Waikato Environment for Knowledge Analysis), a Data Mining tool and ROSE2 (Rough Set Data Explorer), a Rough Set approach tool have been used for the experiment. The result of the experiment shows that the random tree classification algorithm gives promising results with utmost accuracy and produces best decision rule using decision tree for the original incomplete data or with the missing attribute values (i.e. missing attributes are simply ignored). Whereas in rough set approach, the missing attribute values are filled with the most common values of that attribute domain. This paper brings out a conclusion that the missing data simply ignored yields best decision than filling some data in the place of missing attribute value.

Keywords- Random Tree, WEKA, ROSE2, Missing attribute, Incomplete dataset, Classification, Rule Induction, Decision Tree

[1] Antony Rosewelt and Dr. Sampathkumar Vajeravelu, Mining Software Defects using Random tree, International Journal of
Computer Science & Technology, IJCST Vol. 2, Issue 4, ISSN : 0976-8491(Online) | ISSN : 2229-4333(Print), Oct - Dec 2011.
[2] Frederick Livingston, Implementation of Breiman's Random Forest Machine Learning Algorithm, ECE591Q Machine Learning
Journal Paper, Fall 2005.
[3] Grzymala-Busse, J.W. and Hu, M., A comparison of several approaches to missing attribute values in data mining. Proceedings of
the Second International Conference on Rough Sets and Current Trends in Computing RSCTC-2000, Banff, Canada, October 16–19,
2000, 340–347.
[4] Grzymala-Busse, J.W., Rough set strategies to data with missing attribute values, Workshop Notes, Foundations and New Directions of Data Mining, The 3rd International Conference on Data Mining, Melbourne, FL, USA, November 19–22, 2003, 56–63.
[5] Hongyi Peng and Siming Zhu, Handling of incomplete data sets using ICA and SOM in data mining, Received: 2 September 2005 /
Accepted: 24 April 2006 / Published online: 30 May 2006, Springer-Verlag London Limited 2006.
[6] http://idss.cs.put.poznan.pl/site/rose.html.
[7] J. Han and M. Kamber, Data Mining: Concepts and Techniques (Morgan Kaufmann, 2000).
[8] Jerzy W. Grzymala-Busse and Sachin Siddhaye, Rough Set Approaches to Rule Induction from Incomplete Data, Proceedings of the
IPMU'2004, the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based
Systems, Perugia, Italy, July 4–9, 2004, vol. 2, 923–930.
[9] Kash Barker et al, Learning From Student Data, Proceedings of the 2004 Systems and Information Engineering Design
Symposium, Mathew H. Jones, Stephen D. Patek, and Barbara E. Towney eds. 2004. pp79-86.
[10] Marzena Kryszkiewicz, Rules in incomplete Information Systems, Information Science 113(1999), 271-292.

Abstract: A resilient execution environment can be developed for a critical application even in the presence of corrupted OS kernel. The attacker tries to capture the application content by corrupting the OS when an application is executing. In previous case the attacker corrupts the OS by injecting code then the application terminates immediately without executing it. In this current system even in the presence of corruption the application is executed with out any interception and it provide a resilient authenticated execution of critical application in entrusted environment by using Virtual Machine Monitor (VMM). VMM is a monitoring technique to monitor all the activities during execution and it is one of the online based recovery schemes to identify any such corruption. It repairs the memory corruption and allows the process for normal execution. VMM solutions generally broadcast into two categories they are memory authentication and memory duplication. Memory authentication is to check the integrity of an application and memory duplication is to rectify the corruption. The proposed system is applied for military application, hospitals, and colleges and for all critical applications. Keywords- Memory corruption, operating systems, security, Virtual machine monitors (VMM).

[1] Azab.A.M,Ning.P,Wang.Z,Jiang.X,Zhang.X and Skalsky.N.C, "Hypersentry: Enabling Stealthy In-Context Measurement of
Hypervisor Integrity," Proc. 17th ACM Conf. Computer and Comm. Security (CCS), pp. 38-49, 2010.
[2] Huang.R,Deng.D.Y and Suh.G.E, "Orthrus: Efficient SoftwareIntegrity Protection on Multi -Cores," Proc. Architectural Support for
Programming Languages and Operating Systems (ASPLOS), pp. 371-384, 2010.
[3] Kirkpatrick.M.S,Ghinita.G and Bertino.E,"Resilient Authenticated Execution of Critical Applications in Untrusted
Environments,"IEEETransation on dependable and secure computing,july/august 2012.
[4] Litty.L,Lagar-Cavilla.H.A and Lie.D,"Hypervisor Support for Identifying Covertly Executing Binaries," Proc.17th USENIX Conf.
SecuritySymp., pp.243-258,2008.
[5] Piromsopa.K and Enbody.R.J,"SecureBit:Transparent,Hardware Buffer Overflow Protection," IEEE Trans.Dependable and Secure
Computing, vol.3,no.4,pp.365-376,Oct.-Dec.2006.
[6] Rhee.J,Riley.R,Xu.D and Jiang.X,s"Defeating Dynamic Data Kernel RootkitAttacks via VMM-Based Guest-Transparent Monitoring," Proc.Fifth Int'l Conf.Availability,Reliability and Security(ARES), 2009.
[7] Riley.R,Jiang.X and Xu.D, "Guest-Transparent Prevention of Kernel Rootkits with VMM-Based Memory Shadowing," Proc.11th Int'l Symp. Recent Advances in Intrusion Detection (RAID),pp. 1-20, 2008.
[8] Rinard.M,Cadar.C,Dumitran.D,Roy.D.M,Leu.T and Beebee.W.S,"Enhancing Server Availability and Security Through Failure-
Oblivious Computing," Proc. Sixth Conf. Symp. Operating Systems Design and Implementation (OSDI), pp. 21 -21, 2004.
[9] Salamat.B, Gal.A, Jackson.T, Manivannan.K, Wagner.G, and Franz.M, "Multi-Variant Program Execution: Using Multi-Core
Systems to Defuse Buffer-Overflow Vulnerabilities," Proc. Int'l Conf. Complex, Intelligent and Software Intensive Systems, pp. 843 -
848, 2008.
[10] Salamat.B,Jackson.T,Gal.A and Franz.M, "Orchestra: Intrusion Detection Using Parallel Execution and Monitoring of Program
Variants in User-Space," Proc. Fourth ACM European Conf.Computer Systems (Eurosys), pp. 33 -46, 2009.

Abstract: A broadcasting delay is an important problem for the application of the critical event monitoring in wireless sensor networks. To prolong the network lifetime some of the sleep scheduling methods are always employed in WSNs it results in a significant broadcasting delay. A novel sleep scheduling method to be proposed it is based on the level-by-level offset schedule to achieve a low broadcasting delay in wireless sensor networks (WSNs). There are two phases to set the alarm broadcasting first one is, if a node detects a critical event, it create an alarm message and quickly transmits it to a center node along a pre-determined path with a node-by-node offset way. Then the center node broadcasts the alarm message to the other nodes along another predetermined path without collision. To eliminate the collision in broadcasting, a colored connected dominant set (CCDS) in the WSN via the IMC algorithm is established. An on demand distance vector routing protocol is established in one of the traffic direction for alarm transmission. The proposed system is used in military and forest fire application.

Keywords - Wireless Sensor Network (WSN), critical event monitoring, sleep scheduling, broadcasting delay

[1] Peng Guo,Tao Jiang Senior Member, IEEE, Qian Zhang, Fellow, IEEE, and Kui Zhang "Sleep Scheduling for Critical Event
Monitoring in Wireless Sensor Networks," IEEE Transactions On Parallel And Distributed Systems, VOL. 23 , NO. 2, February 2012.
[2] G. Lu, B. Krishnamachari, and C. Raghavendra, "An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in
Wireless Sensor Networks," Proc. 18th IEEE Int'l Parallel and Distributed Processing Symp., pp. 224-230, Apr. 2004.
[3] G. Lu, N. Sadagopan, B. Krishnamachari, and A. Goel, "Delay Efficient Sleep Scheduling in Wireless Sensor Networks," Proc.24th
IEEE Int'l Conf. Computer Comm., pp. 2470-2481, Mar.2005.
[4] N.A.Vasanthi and S.A., "Energy Efficient Sleep Schedule for Achieving Minimum Latency in Query Based Sensor Networks,"Proc.
IEEE Int'l Conf. Sensor Networks, Ubiquitous, and Trustworthy Computing, pp. 214-219, June 2006.
[5] M.I. Brownfield, K. Mehrjoo, A.S. Fayez, and N.J. Davis IV.,"Wireless Sensor Network Energy-Adaptive Mac Protocol," Proc.Third IEEE Consumer Comm. and Networking Conf., pp. 778-782,Jan. 2006.
[6] A. Keshavarzian, H. Lee, and L. Venkatraman, "Wakeup Scheduling in Wireless Sensor Networks," Proc. Seventh ACM Int'l Conf.
Mobile Ad Hoc Networking and Computing, pp. 322-333,May 2006.
[7] Y. Sun, S. Du, O. Gurewitz, and D.B. Johnson, "DW-MAC: A Low Latency, Energy Efficient Demand-Wakeup MAC Protocol for
Wireless Sensor Networks," Proc. Ninth ACM Int'l Conf. Mobile Ad Hoc Networking and Computing, pp. 53 -62, 2008.
[8] Y. Sun, O. Gurewitz, S. Du, L. Tang, and D.B. Johnson, "ADB: An Efficient Multihop Broadcast Protocol Based on Asynchronous
Duty-Cycling in Wireless Sensor Networks," Proc. Seventh ACM Conf. Embedded Networked Sensor Systems, pp. 43 -56, Nov.2009.
[9] N. Bouabdallah, M.E. Rivero-Angeles, and B. Sericola, "Continuous Monitoring Using Event-Driven Reporting for Cluster-Based
Wireless Sensor Networks," IEEE Trans. Vehicular Technology,vol. 58, no. 7, pp. 3460-3479, Sept. 2009.

Abstract: This graduation project aims to present an application that is able of replacing the traditional mouse with the human face as a new way to interact with the computer. Human activity recognition has become an important application area for pattern recognition. Here we focus on design of vision-based perceptual user interfaces. The concept of the second order change detection is implemented which sets the base for designing complete face-operated control systems ,where the mouse is replaced by 'nose' as pointer and 'blinking eyes' for clicking option. To select a robust facial feature, we use the pattern recognition paradigm of treating features. Using a support vector machine (SVM) classifier and person-independent (leave-one person-out) training, we obtain an average precision of 76.1 percent and recall of 70.5 percent over all classes and participants. The work demonstrates the promise of eye based activity recognition (EAR) and opens up discussion on the wider applicability of EAR to other activities that are difficult, or even impossible, to detect using common sensing modalities. The visual based human computer interaction is probably the most widespread area in HCI research. Different aspects of human responses can be recognized as a visual signal. One of the main research areas in this section is through Facial Expression Analysis and Gaze Detection (Eyes Movement Tracking).

Keywords—Ubiquitous computing, feature evaluation and selection, pattern analysis, signal processing.

[1] S. Mitra and T. Acharya, ―Gesture Recognition: A Survey,‖ IEEE Trans. Systems, Man, and Cybernetics, Part C: Applications and Rev., vol. 37, no. 3, pp. 311-324, May 2007.
[2] P. Turaga, R. Chellappa, V.S. Subrahmanian, and O. Udrea, ―Machine Recognition of Human Activities: A Survey,‖ IEEETrans.
Circuits and Systems for Video Technology, vol. 18, no. 11, pp. 1473-1488, Nov. 2008.
[3] B. Najafi, K. Aminian, A. Paraschiv-Ionescu, F. Loew, C.J. Bula, and P. Robert, ―Ambulatory System for Human Motion Analysis
Using a Kinematic Sensor: Monitoring of Daily Physical Activity in the Elderly,‖ IEEE Trans. Biomedical Eng., vol. 50, no. 6, pp.
711-723, June 2003.
[4] J.A. Ward, P. Lukowicz, G. Tro¨ ster, and T.E. Starner, ―Activity Recognition of Assembly Tasks Using Body-Worn Microphones
and Accelerometers,‖ IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 1553 -1567, Oct. 2006.
[5] N. Kern, B. Schiele, and A. Schmidt, ―Recognizing Context for Annotating a Live Life Recording,‖ Personal and Ubiquitous
Computing, vol. 11, no. 4, pp. 251-263, 2007.
[6] A. Bulling, J.A. Ward, H. Gellersen, and G. Tro¨ ster, ―Robust Recognition of Reading Activity in Transit Using Wearable
Electrooculography,‖ Proc. Sixth Int'l Conf. Pervasive Computing, pp. 19-37, 2008.
[7] S.P. Liversedge and J.M. Findlay, ―Saccadic Eye Movements and Cognition,‖ Trends in Cognitive Sciences, vol. 4, no. 1, pp. 6 -14, 2000.
[8] J.M. Henderson, ―Human Gaze Control during Real-World Scene Perception,‖ Trends in Cognitive Sciences, vol. 7, no. 11, pp.
498-504, 2003.
[9] A. Bulling, D. Roggen, and G. Tro¨ ster, ―Wearable EOG Goggles: Seamless Sensing and Context -Awareness in Everyday
Environments,‖ J. Ambient Intelligence and Smart Environments, vol. 1, no. 2,pp. 157-171, 2009.
[10] A. Bulling, J.A. Ward, H. Gellersen, and G. Tro¨ ster, ―Eye Movement Analysis for Activity Recognition,‖ Proc. 11th Int'lConf . Ubiquitous Computing, pp. 41-50, 2009.

Abstract: Since the secure communication for Wireless Sensor Network (WSNs) is a challenging problem because sensors are resources limited and cost is the most dominant factor in a energy consumption, for this we introduce an energy-efficient Virtual Energy-Based Encryption and Keying(VEBEK) scheme for WSNs that reduces the number of transmission needed for rekeying the packets.

Keywords- Authentication, Integrity, Non-Repudiation, RC4, Rekeying, VEBEK, WSNs.

[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, no. 4, pp. 393-422, Mar. 2002.

[2] C. Vu, R. Beyah, and Y. Li, "A Composite Event Detection in Wireless Sensor Networks," Proc. IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '07), Apr. 2007.

[3] S. Uluagac, C. Lee, R. Beyah, and J. Copeland, "Designing Secure Protocols for Wireless Sensor Networks," Wireless Algorithms, Systems, and Applications, vol. 5258, pp. 503-514, Springer, 2008.

[4] F. Stajano and R. Anderson. The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks wireless networks. In 7th International Workshop on Security Protocols, 1999.

[5] G.J. Pottie and W.J. Kaiser, "Wireless Integrated Network Sensors," Comm. ACM, vol. 43, no. 5, pp. 51-58, 2000.
[6] R. Roman, C. Alcaraz, and J. Lopez, "A Survey of Cryptographic Primitives and Implementations for Hardware-Constrained Sensor Network Nodes," Mobile Networks and Applications, vol. 12, no. 4, pp. 231-244, Aug. 2007.

[7] H. Hou, C. Corbett, Y. Li, and R. Beyah, "Dynamic Energy-Based Encoding and Filtering in Sensor Networks," Proc. IEEE Military Comm. Conf. (MILCOM '07), Oct. 2007.

[8] L. Eschenauer and V.D. Gligor, "A Key-Management Scheme for Distributed Sensor Networks," Proc. Ninth ACM Conf. Computer and Comm. Security, pp. 41-4, 2002.

[9] M. Eltoweissy, M. Moharrum, and

Abstract: The whole finance of the world revolves around currency. It may be physical or digital. Currency functions as a unit of account providing a common measure of goods and services being exchanged. The enormous use of paper currency has resulted in deforestation, which is leading to ecological imbalance. For conserving the space, time, and environment there is a need for an alternative currency. In this paper, ubiquitous virtual money is proposed, which is accessible throughout the environment. Ubiquitous currency is a form of electronic money that is spent like pocket change. The transactions can be made secure by the use of biometric identifiers. Keywords—ubiquitous, virtual money, banking, smart money, trackable money

[1] Manikandan, Madhusudhanan. J, Dr. Prasanna Venkatesan.V, Amrith.V, Martial Arokiadoss Britto "Smart Banking Environment based on context history" IEEE- International Conference on Recent Trends in Information Technology, ICRTIT 2011
[2] Mohammed A. Qadeer, Nadeem Akhtar, Shalini Govil, Anuja Varshney "A novel scheme for mobile payment using RFID-enabled Smart SIM card" International Conference on Future Computer and communication 2009
[3] Abdullahi Arabo "Secure Cash withdrawal through Mobile phone/Device " Proceedings of International Conference on Computer and communication engineering 2008
[4] Vishwas Patil and R.K.Shyamasundar "An efficient, secure and delegable Micro-Payment System " IEEE.
[5] Gianluigi Me and Maurizio Adriano Strangio "Mobile local macro-payments:security and prototyping" IEEE CS and IEEE ComSoc.

Abstract: Large scale reliable storage system with dynamic membership access is currently facing lot of problems like human configuration errors and it is strong enough only for the static set of replica...An membership service and dBQS carried out the dynamic membership access and dBQS is a novel distributed hash table differ from the usual DHT by providing byzantine fault tolerant and strong semantics. We develop two heuristic algorithm and automatic reconfiguration technique to maintain and carried out those membership services. Experimental result shows that the membership service works well and the membership service is able to manage large system and the cost to maintain the service is low.

Index terms- DHT, dBQS,Byzantine fault tolerant

[1] Birman. K and T. Joseph, "Exploiting Virtual Synchrony in Distributed Systems," Proc. 11th ACM Symp. Operating Systems Principles, pp. 123-138, Nov. 2007.
[2] Clement. A, M. Marchetti, E. Wong, L. Alvisi, and M. Dahlin,"Making Byzantine Fault Tolerant Systems Tolerate ByzantineFaults," Proc. Sixth USENIX Symp. Networked Systems Design and Implementation (NSDI '09), Apr. 2009.
[3] Cowling. J, D.R.K. Ports, B. Liskov, R.A. Popa, and A. Gaikwad, "Census: Location-Aware Membership Management for Large- Scale Distributed Systems," Proc. Ann. Technical Conf. (USENIX '09), June 2009
[4] Chen.K., "Authentication in a Reconfigurable Byzantine Fault Tolerant System," master's thesis, Massachusetts Inst. of Technology, July 2004.
[5] Castro.M and B. Liskov, "Practical Byzantine Fault Tolerance," Proc. Third Symp.Operating Systems Design and Implementation (OSDI '99), Feb. 1999.
[6] Dabek.F., M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica,"Wide-Area Cooperative Storage with CFS," Proc. 18th ACM Symp. Operating Systems Principles (SOSP '01), Oct. 2001.
[7] Douceur.J., "The Sybil Attack," Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), 2002.
[8] DeCandia.G, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, "Dynamo: Amazon's Highly Available Key-Value Store," Proc. 21st ACM Symp. Operating Systems Principles, pp. 205-220,2007.
[9] Lynch. N. and A.A. Shvartsman, "Rambo: A Reconfigurable Atomic Memory Service," Proc. 16th Int'l Symp. Distributed Computing (DISC '02), 2002.
[10] Rodrigo Rodrigues, Barbara Liskov, Member, IEEE, Kathryn Chen, Moses Liskov, and David Schultz "Automatic Reconfiguration for Large-Scale Reliable Storage Systems"-IEEE transaction on dependable and secure computing.

Abstract: Wireless Technology is at its peak when we talk about research and innovation. This field has become a hub of invention of new theories and structures. Mobile Ad-hoc Network is a special point of focus for the researchers. MANET is a collection of wireless mobile nodes which forms a dynamic temporary network without using any existing infrastructure. In recent time the market of mobile devices, laptops, hand held and portable devices is at its zenith so communication between such devices is an important issue. Routing is an essential part in the success of communication among these mobile structures. Routing protocols play an important role for finding an efficient and reliable route from source to destination. In the literature, there are numerous MANET routing protocols aiming to find the most suitable path from source to destination. In this paper, a comprehensive simulation based performance study and analysis is performed on various types of routing protocols over MANET. Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Temporally-Ordered Routing Algorithm (TORA), Optimized Link State Routing (OLSR) and Geographic Routing Protocol (GRP) has been considered for investigation in this paper based on OPNET simulation. Moreover the performance of these routing protocols will be measured on the basis of throughput, delay, load and data dropped metrics

Keywords - AODV, DSR, GRP, OLSR, TORA

[1] Nagham H. Saeed, Maysam F. Abbod and Hamed S. Al-Raweshidy, ""MANET Routing Protocol Taxonomy‟‟, Proc. of IEEE Conference on future Communication Networks (2012).
[2] G. Rajkumar, P. Kasiram and D. Parthiban, "Optimized QoS Metrics and performance comparation of DSR and AODV Routing Protocols", Proc. of IEEE Conference on advances in Engineering, Science and Management (ICAESM-2012), March 30-31, 2012.
[3] Avni Khatkar and Yudhvir Singh, "Performance Evaluation of Hybrid Routing Protocols in Mobile Adhoc Networks", Proc. of 2nd IEEE Conference on Advanced Computing & Communication Technologies (ICACC-2012).
[4] Mehdi Barati, Kayvan Atefi, Farshad Khosravi and Yashar Azab Daftari, "Performance Evaluation of Energy Consumption for AODV and DSR Routing Protocols in MANET", Proc. of IEEE Conference on Computer & Information Science (ICCIS-2012).
[5] Mina Vajed Khiavi, Shahram Jamali, Sajjad Jahanbakhsh Gudakahriz, "Performance comparison of AODV, DSDV, DSR, TORA routing protocols in MANETs", International Research Journal of Applied and Basic Sciences, Vol. 3(7), 2012.
[6] Parul Sharma, Arvind Kalia and Jawahar Thakur, "Performance analysis of AODV, DSR and DSDV Routing Protocols in Mobile Adhoc Networks (MANET)", Journal of Information Systems and Communication, Vol. 3, Issue 1, 2012.
[7] Manveen Singh Chadha, Ranbir Joon and Sandeep, "Simulation and Comparison of AODV, DSR and AOMDV Routing Protocols in MANETs", International Journal of Soft Computing and Engineering (IJSCE), Vol. 2, Issue 3, July 2012.
[8] Muhammad Shaffatul Islam, Md. Adnan Riaz, Mohammed Tarique, " Performance analysis of the routing protocols for video streaming over Mobile ad hoc networks", International Journal of Computer Networks & Communications (IJCNC), Vol. 4, No. 3, May 2012.
[9] Laxmi Shrivastava, Sarita S. Bhadauria and G.S. Tomar, "Performance Evaluation of Routing Protocols in MANET with different traffic loads", Proc. of IEEE Conference on Communication Systems and Network Technologies(CSNT 2011).
[10] Pragati, Rajender Nath, " Performance evaluation of AODV, LEACH, TORA protocols through simulation", International journal of advanced research in computer science and software engineering, Vol. 2, Issue 7, July 2012.

Abstract: Text Summarization is the process of generating a short summary for the document that contains the overall meaning. This paper explains the extractive technique of summarization which consists of selecting important sentences from the document and concatenating them into a short summary. This work presents a method for identifying some feature terms of sentences and calculates their ranks. The relevance measure of sentences is determined based on their ranks. It then uses a combination of Statistical and Linguistic methods to identify semantically important sentences for summary creations. Performance evaluation is done by comparing their summarization outputs with manual summaries generated by three independent human evaluators.

Keywords: - Generic text summarization, Relevance measure, Semantic Analysis, Term-frequency Rank.

[1] H. Dalianis, "SweSum-A Text Summarizer for Swedish", Technical Report, TRITA-NA-P0015, IPLab-174, KTH NADA, Sweden, 2000.
[2] N. McCracken, "IR Experiments with Lemur", Available at: http://www-2.cs.cmu.edu/~lemur/ [December 16, 2009]
[3] T. Chang and W. Hsiao, "A hybrid approach to automatic text summarization", 8th IEEE International Conference on Computer and Information Technology (CIT 2008), Sydney, Australia, 2008.
[4] Ghadeer Natshah, Yasmeen Ta‟amra, Bara Amar and Manal Tamini, "Text Summarization: Using combinational Statistical and Linguistic Methods"
[5] Vishal Gupta and Gurpreet Singh Lehal "A survey of Text summarization techniques "Journal of Emerging Technologies in Web Intelligence VOL 2 NO 3 August 2010.
[6] Suneetha Manne and S.Sammen Fatima‟s"A feature Terms based Method for Improving Text summarization with supervised POS Tagging".
[7] R.Shams, A.Elsayed and Q.M Akter, "A corpus-based evaluation of a domain-specific text to knowledge mapping prototype", A special issue of Journal of Computers, Academy Publisher, 2010(In Press)
[8] T. Chang and W. Hsiao, "A hybrid approach to automatic text summarization", 8th IEEE International Conference on Computer and Information Technology (CIT 2008), Sydney, Australia, 2008.
[9] Stanford NLP Group, "Stanford log-linear part of speech tagger", Available at: Http://nlp.stanford.edu/software/tagger.shtml [June 15, 2009]
[10] Chengcheng L.(2010).Automatic Text Summarization Based On Rhetorical Structure Theory. IEEE. 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

Abstract: Decoding of 3D multi-view video coded bit-streams that are transmitted over noisy channels can suffer from error propagation in the space, time and view domains. To improve the quality of reconstructed 3D video, we propose adaptive Error Concealment (EC) algorithms to conceal the erroneous blocks of intra-coded and inter-coded frames. Our proposed algorithms adapt to the motion characteristics of the 3D video and to the error patterns. We propose three adaptive EC algorithms for intra-frames, which are Adaptive Time Domain Error Concealment (ATDEC), Adaptive Space Domain Error Concealment (ASDEC) and a hybrid Adaptive Space-Time Domain Error Concealment (ASTDEC). We also propose three adaptive EC algorithms for inter-frames, which are Adaptive Inter-View Domain Error Concealment (AIVDEC), Adaptive Time Domain Error Concealment (ATDEC) and joint Adaptive Time and Inter-View Domain Error Concealment (ATIVDEC). Our simulation results show that the proposed adaptive EC algorithms can significantly improve the objective and subjective 3D video quality transmitted over noisy channels.

Keywords - Multi-view Coding, 3D Video, Error Concealment, Intra Frame, Inter Frame, Spatio-Temporal and Inter-view Correlation.

[1] K. Song, T. Chung, Y. Oh, and C.-S. Kim, Error concealment of multi-view video sequences using inter-view and intra-view correlations, J. Vis. Comun. Image Represent., vol. 20, pp. 281–292, May 2009.
[2] P. Nasiopoulos, L. Coria-Mendozal, H. Mansour, and A. Golikeri, An improved error concealment algorithm for intra-frames in H. 264/AVC, IEEE International Symposium on Circuits and Systems, ISCAS. IEEE, 2005, pp. 320–323.
[3] T. Chung, K. Song, and C. Kim, Error concealment techniques for multi-view video sequences, Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing. Springer-Verlag, 2007, pp. 619–627.
[4] W. ElShafai, B. Hrusovsky, M. El-Khamy, and M. El-Sharkawy, Joint Space-Time-View error concealment algorithms for 3D Multi- View video, 2011 18th IEEE International Conference on Image Processing (IEEE ICIP2011), Brussels, Belgium, Sep. 2011, pp. 2249–2252.
[5] B. Hrusovsky, J. Mochnac, and S. Marchevsky, Temporal-spatial error concealment algorithm for intra-frames in H. 264/AVC coded video, 2010 20th International Conference Radioelektronika. IEEE, 2010, pp. 1–4
[6] J. Seiler and A. Kaup, Adaptive joint spatio-temporal error concealment for video communication, 2008 IEEE 10th Workshop on Multimedia Signal Processing. IEEE, 2008, pp. 229–234.
[7] P. Merkle, A. Smolic, K. Muller, and T. Wiegand, Efficient prediction structures for multiview video coding, Circuits and Systems for Video Technology, IEEE Transactions on, vol. 17, no. 11, pp. 1461–1473, 2007.
[8] M. Hwang, J. Kim, D. Duong, and S. Ko, Hybrid temporal error concealment methods for block-based compressed video transmission, IEEE Transactions on Broadcasting, vol. 54, no. 2, pp. 198–207, 2008.
[9] Y. Chung, L. Chen, X. Chen, W. Yeh, and C. Bae, A novel intra-fame error concealment algorithm for H. 264 AVC, Third International Conference on Convergence and Hybrid Information Technology, 2008, ICCIT'08, vol. 1. IEEE, 2008, pp. 881–886.
[10] ftp://ftp.merl.com/pub/avetro/mvc-testseq.

Abstract: Ad hoc networks have been used in many applications which mandate a dynamic setup in the absence of fixed infrastructure. The design of ad hoc network has been mainly focuses on proper operation. It is possible that eventually a malicious node becomes easy to deploy in ad hoc n/w and they cause among other impact performance degradation. One attack that can deploy by malicious node is black hole attack. This paper reviews the problem of occurrence of black hole attack and its solution technique proposed enhancement in proactive routing protocol Destination Sequenced Distance Vector Routing protocol Using trust based and hop count method. Keywords: ad hoc networks, black hole, security, routing, DSDV.

[1] Umang Singh, "Secure Routing Protocols in Mobile Ad-hoc Networks-A Survey and Taxonomy" International Journal of Reviews in computing30th September 2011. Vol. 7

2] Tamilselvan, L. Sankaranarayanan, V. "Prevention of Black hole Attack in MANET",JournalOfNetworks, Vol.3, No.5, May2008

[3] E. A. Mary Anita and V. Vasudevan, Black Hole attack Prevention in multicast routing Protocols For MANETs Using Certificate Chaining, IJCA, Vol.1, No.12, pp. 22–29,2010

[4] Jiwen CAI, Ping YI, Jialin CHEN, Zhiyang WANG, Ning LIU , An Adaptive Approach to Detecting Black and Gray Hole Attacks in Ad Hoc Network . 2010 24th IEEE International Conference on Advanced Information Networking and Applications

[5] Wei Gong1,2, Zhiyang You1,2, Danning Chen2, Xibin Zhao2, Ming Gu2, Kwok-Yan Lam2,‟Trust Based Malicious Nodes Detection in MANET‟ . 978-1-4244-4589-9/09/$25.00 ©2009 IEEE

[6] N. Bhalaji1, Dr. A. Shanmugam2, Defense Strategy Using Trust Based Model to Mitigate Active Attacks in DSR Based MANET .JOURNAL OF ADVANCES IN INFORMATION TECHNOLOGY, VOL. 2, NO. 2, MAY 2011