iosr-JCE   Second International Conference on Emerging Trends in Engineering' 2013

Abstract: Information retrieval technology has been central to the success of the Web. For semantic web documents or annotations to have an impact, they will have to be com- patible with Web based indexing and retrieval technol- ogy. We discuss some of the underlying problems and issues central to extending information retrieval systems to handle annotations in semantic web languages. We also describe prototype systems to explore these ideas.

[1] Abiteboul, S., Quass, D., McHugh, J. Widom, J. and Wiener, J. "The Lorel query language for semistructured data.‟ International Journal on Digital Libraries 1, pages 68-88, April 1997.
[2] Arocena, G. and Mendelzon, A. "WebOQL: Re- structuring documents, databases and webs.‟ In Interna- tional Conference on Data Engineering, pages 24-33. IEEE Computer Society, 1998.
[3] Bar-Yossef, Z., Kanza, Y., Kogan, Y., Nutt, W. and Sagiv, Y.. "Quest: Querying semantically tagged docu- ments on the World Wide Web.‟ In Proc. of the 4th Workshop on Next Generation Information Technologies and Systems, volume NGITS'99, Zikhron-Yaakov (Is- rael), July 1999.
[4] Berners-Lee, T. and Fischetti, M. Weaving the Web: The Original Design and Ultimate Destiny of the World Wide Web by its Inventor. Harper, San Francisco. 1999.
[5] Berners-Lee, T., Hendler, J. and Lassila, O. "The Semantic Web.‟ Scientific American, May 2001.
[5a] Brin, Sergey and Lawrence Page, The anatomy of a large-scale hypertextual Web search engine, Proceedings of the 7th international conference on World Wide Web, Elsevier Science Publishers B. V. pp 107-117, Brisbane, Australia, 1998.
[6] Buneman, P., Khanna, S. and Tan, W-C. "Why and Where: A Characterization of Data Provenance.‟ Interna- tional Conference on Database Theory (ICDT) 2001.
[7] Chinenyanga, T. and Kushmerick, N. "Elixir: An expressive and efficient language for XML information retrieval.‟ In SIGIR Workshop on XML and Information Retrieval, 2001.
[8] Cost, R. S., Finin, T., Joshi, A., Peng, Y., Nicholas, C., Soboroff, I., Chen, H., Kagal, L., Perich, F., Zou, Y., and Tolia, S. "ITTALKS: A Case Study in the Semantic Web and DAML+OIL.‟ IEEE Intelligent Systems17(1):40-47, 2002.
[9] Davies, J., Weeks, R. and Krohn, U. "QuizRDF: Search technology for the Semantic Web.‟ In WWW2002Workshop on RDF and Semantic Web Applications, Ha- waii, 2002.
[10] Deutsch, A.,Fernandez, M., Florescu, D., Levy, A. and Suciu, D. "XML-QL: A query language for XML.‟ In Proceedings of the Eighth International World Wide Web Conference, 1999.

Abstract: Information is most important thing between two communicating entities so we require to provide security to information. Therefore in order to provide security to achieve data integrity, data confidentiality & authentication. To achieve data integrity message digest of plaintext is calculated by applying hash function. Hash functions are used in cryptographic hash algorithms. In this paper we describe formation of message digest by applying cryptographic hash algorithms (Whirlpoo1 & Secure Hash Algorithm-512) to original plaintext, Efficiency of cryptographic hash algorithms for maximum length message & minimum length message. Performance of cryptographic hash algorithms & comparative study of message digest. Hash functions H are transformations that take variable size input M & returns fixed size string which is called hash value h. When hash function are used in cryptography have some basic requirements such as input can be any length, output has a fixed length(x) is relatively easy to compute for any given x.H(x) is one way, H(x) is collision free, a hash function H is said to e one-way if it is to hard to invert, here "hard to invert" means that given a hash value h, it is computationally infeasible to find some input x such that H(x)=h.

Keywords: Cryptographic hash function, Message Digest, Secure Hash Algorithm, Whirlpool.

[1] Barreto, P. and V. Rijmen. 2003. The Whirlpool Hashing Function. Submitted to NESSIE, May.
[2] Barreto, Paulo S.L.M. & Rijmen, Vincent: The Whirlpool Hashing Function. Available:
http://paginas.terra.com.br/informatica/paulobarreto/WhirlpoolPage.html.
[3] Black, J., P. Rogaway, and T. Shrimpton. 2002. Black-Box Analysis of the Block-CipherBased Hash Function Constructions from PGV, Proceedings, Advances in Cryptology CRYPTO 002, New York: Springer-Verlag.
[4] Damgard, I. 1989. A Design Principle for Hash Functions, Proceedings, CRYPTO 89,New York: pringer-Verlag.
[5] Paulo Barreto, Vincent Rijmen, The Whirlpool Hashing Function page. http://planeta.terra.com.br/informatica/paulobarreto/WhirlpoolPage.html
[6] Stallings, William, Cryptography and Network Security, Prentice Hall, 1999.

Abstract: Originally developed for delivering distance learning programs, e-education systems in their current forms are powerful, web-based information systems with capabilities that match Enterprise Resource Planning (ERP) systems. By carrying out their deployments on an enterprise-level basis, many Higher Education Institutions (HEI) are able to leverage on their powerful functionalities and ERP-like integrative capabilities to put together academic and administrative systems (Twigg 2002).
Keywords: e-Education System Success Model; Perceived Organizational Benefits; Perceived Usefulness; Expectation Confirmation; Organizational IS Continua

[1] Ballantine, J., and Stray, S. 1998. "Financial appraisal and the IS/IT investment decision-making process". Journal of Information Technology, 13, pp. 3-14.
[2] Bentler, P., & Chou, C. 1987. "Practical issues in structural modeling". Sociological Methods and Research, 16, pp. 78-117.
[3] Bhattacherjee. 2001. "Understanding information systems continuance: An expectationconfirmation model". MIS Quarterly, 25 (3), pp. 351-370.
[4] Churchill, G. 1979. "A paradogm for developing better measures for marketing constructs". Journal of Marketing Research, 10, pp. 64-73.

Abstract: In recent years, on-demand routing protocols have attained more attention in mobile ad hoc networks as compared to other routing schemes due to their abilities and efficiency. There exist many on- demand routing protocols for mobile ad hoc networks (MANETS). Most of the protocols, however, use a single route and do not utilize multiple alternate paths. Multipath routing allows the establishment of multiple paths between a single source and single destination node and when a path breaks an alternate path is used instead of initiating a new route discovery, hence multipath routing represents a promising routing method for wireless mobile ad hoc networks. Multipath routing achieves load balancing and is more resilient to route failures. Recently, numerous on-demand multi-path routing protocols have been proposed for wireless mobile ad hoc networks. Performance evaluations of these protocols showed that they achieve lower routing overhead, lower end to-end delay and alleviate congestion in comparison with single path routing protocols. In this paper, we propose a new shortest multiple routing algorithm for MANETs. It is based on DSR, but which makes the destination nodes get the shortest unattached routes correspondingly is that only the destination nodes can respond to the routing request (RREQ), and the intermediate hosts rebroadcast the shorter RREQ packets with some conditions, besides, there are also some changes done for the route maintenance.

Keywords-Unipath Routing in MANETs, Multiple routing algorithm

[1] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva: "A Performance Comparison of Multi-Hop Wireless Ad-hoc Network Routing Protocols," In Proc. of the ACM/IEEE Mobi Com (1998).
[2] Carlo Kopp, Defense Analyst and Consulting Engineer: "Ad Hoc Networking: Published in "Systems‟," June 1999, pp 33-40.
[3] Perkins, C.E., Royer, E.M.: "Ad-hoc On-Demand Distance Vector Routing," Pro-ceding of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (1999)
[4] Johnson, D.B., and Malt], D.A.: "Dynamic Source Routing in Ad Hoc Wireless Networks," Mobile Computing. (1996) 153-181.
[5] Anastasi, G., E.Borgia, M.Conti, E.Gregori: IEEE 802.11 Ad-hoc networks: protocols, "Performance and open issues, Ad hoc Networking," IEEE Press Wiley, New York (2003).
[6] S.R. Das, C.E. Perkins, and E.M. Royer: "Performance comparison of two on demand routing protocols for Ad-hoc networks," Nineteenth Annual Joint Conference of the IEEE Computer and Communications leties, pages 3–12 (2000).
[7] Montaigne François, Schiel Jean-Christophe: "Beyond Mobile Ad-hoc Networks … Towards cooperative networks," EADS DS - SETOP 2008 –October 13th 2008.
[8] Murthy, S., Garcia-Luna-Aceves, J.J.: An Efficient Routing Protocol for Wireless Networks," Mobile Networks and Applications, Vol. 1, No. 2 (1996).
[9] Perkins, C.E., Bhagwat, P: "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," ACM SIGCOMM (1994) 234-244.
[10] Smt Rajashree.V. Biradar & Prof V. C.Patil, "Classification and Comparison of routing Techniques in Wireless Ad-hoc Networks," in the proceedings of international Symposium on Ad-hoc Ubiquitous Computing (ISHUC‟06), pp. 7-11 (2006).

Abstract: There exist many technologies supporting object-relational mapping (ORM) for J2EE technology. There is a comparison of Hibernate over JDBC in case of their performance. One of the major factor Project execution and control of project management has been considered as a case study. Performance in case of project execution and control improves with the help of ORM tool Hibernate. Keywords - Hibernate ,Java, J2EE, JDBC,ORM,.

[1] IEEE Recommended Practice for Software Design Specification, ANSI/IEEE Std 830-1998.

[2] IEEE Guide for Developing System Design Specifications, ANSI/IEEE Std 1233-1996.

[3] Chidamber and Kemerer: A metric suite for object oriented design IEEE Transactions on software Engineering, VOL. 20, NO. 6. JUNE 1994

[4] Rajib Mall,"Fundamentals of Software Engineering", (Prentice-Hall India).

[5] Herbert Schildt,"Java 2: The Complete Reference", Fifth Edition (Paperback).

[6] Inderjeet Singh, Beth Stearns, Mark Johnson, and the Enterprise Team,"Designing Enterprise Applications with the J2EETMPlatform", Second Edition.

[7] Piotr Ziemniak, Bartosz Sakowicz, Andrzej Napieralski "Object Oriented Application Cooperation Methods with RelationalDatabase (ORM) based on J2EE Technology"CADSM'2007, February 20-23, 2007, Polyana, UKRAINE.

[8] Rod Johnson ,"J2EE Development Frameworks " , Interface21, January 2005

[9] Hibernate Reference Documentation ,Version: 3.0.3

[10] Christian Bauer, Gavin King, "Hibernate in action" (Manning publications Co.)

Abstract: Data mining has been a popular research area for more than a decade due to its vast spectrum of applications. The aim of privacy preserving data mining researchers is to develop data mining techniques that could be applied on databases without violating the privacy of individuals. In this work, we propose methods for constructing the dissimilarity matrix of objects from different sites in a privacy preserving manner which can be used for privacy preserving clustering that require pair-wise comparison of individual private data objects horizontally distributed to multiple sites.

Keyword: Privacy, Data Mining, Distributed Clustering, Security.

[1] R. Agrawal and R. Srikant, "Privacy-Preserving Data Mining," Proc. 19th ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 2000, pp. 439-450.

[2] J. Han and M. Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann, 2001.

[3] J. Vaidya and C. Clifton. "Privacy-Preserving K-Means Clustering Over Vertically Partitioned Data.," In Proc. of the 9th ACM SIGKDD Intl. Conf. on Knowlegde Discovery and Data Mining, pages 206–215, Washington, DC, USA, August 2003.

[4] S. R. M. Oliveira, O. R. Zaïane, "Achieving Privacy Preservation When Sharing Data for Clustering," Proceedings of the International Workshop on Secure Data Management in a Connected World (2004) 67-82

[5] S. R. M. Oliveira, O. R. Zaïane, "Privacy Preserving Clustering By Data Transformation," Proceedings of the 18th Brazilian Symposium on Databases (2003) 304-318

[6].S. Meregu and J. Ghosh. "Privacy-Preserving Distributed Clustering Using Generative Models." In Proc. of the 3rd IEEE International Conference on Data Mining (ICDM'03), pages 211–218, Melbourne, Florida, USA, November 2003.

[7].J. Vaidya, C. Clifton, "Privacy Preserving Association Rule Mining in Vertically Partitioned Data," Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002) 639-644

[8].C. Clifton et al., "Tools for Privacy Preserving Distributed Data Mining," SIGKDD Explorations, vol. 4, no. 2, 2003, pp. 28-34. [9].S. R. M. Oliveira, O. R. Zaïane, "Privacy Preserving Clustering By Object Similarity-Based Representation and Dimensionality Reduction Transformation," Proceedings of the 2004 ICDM Workshop on Privacy and Security Aspects of Data Mining (2004) 40-46

Abstract: Always it is preferable to use on-demand infrastructure, provided by cloud computing instead of traditional. So the concept of Mobile Cloud Computing (MCC) come into focus. Mobile cloud computing is a technique or model in which mobile applications are built, powered and hosted using cloud computing technology. In Mobile Cloud computing we can store information regarding sender, data and receiver on cloud through mobile application. As we store more and more information on cloud by client, security issue will arise, so in this paper we have highlighted security issues in mobile cloud computing.

Keywords - Mobile cloud computing , Mobile computing, Cloud Computing , issues in Mobile Cloud Computing.

[1]http://andromida.hubpages.com/hub/cloud-computing-architecture.
[2] http://www.mobilecloudcomputingforum.com/

[3] MobiCloud: Building Secure Cloud Framework for Mobile Computing And Communication, 2010 Fifth IEEE International Symposium on Service Oriented System Engineering.
[4]http://www.readwriteweb.com/archives/why_cloud_computing_is_the_future_of_mobile.php.

[5] White Paper, "Mobile Cloud Computing Solution Brief," AEPONA, November 2010.

[6] SDSM: A Secure Data Service Mechanism in Mobile Cloud Computing 978-1-4577-0248-8/11/$26.00 ©2011 IEEE

[7] Jacson H. Christensen, "Using RESTful web-services and cloud computing to create next generation mobile applications," in Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications (OOPSLA), pp. 627-634, October 2009

[8] A Survey of Mobile Cloud Computing:Architecture, Applications, and Approaches by Hoang T. Dinh, Chonho Lee, Dusit Niyato. [9] J. Oberheide, K. Veeraraghavan, E. Cooke, J. Flinn, and F. Jahanian. "Virtualized in-cloud security services for mobile devices," in Proc 1st Workshop on Virtualization in Mobile Computing (MobiVirt), pp. 31-35, June 2008.

[10] G. Portokalidis, P. Homburg, K. Anagnostakis, and H. Bos, "Paranoid Android: versatile protection for smartphones," in Proc 26th Annual Computer Security Application Conference (ACSAC), pp. 347-356, September 2010.y and AdvancedTopics, Pearson Education.

Abstract:Recent advances in wireless communications and electronics have enabled the development of low cost, low-power, multifunctional wireless sensor nodes that are small in size and communicate in short distances. The sensor networks can be used for various application areas (e.g., habitat monitoring, health, military applications etc). An efficient deployment of Wireless Sensor Network depends on successful implementation of Quality of Service (QoS) framework. The current state of the art of wireless sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. Various challenges in deployment of QoS framework is discussed in detail. This article also points out the open research issues and intends to focus on new interests and developments in this field.

Keywords - Sensor Network, WSN (Wireless Sensor Network), Sensor Management Protocol, Communication Architecture.

[1] Römer, Kay, Friedemann Mattern (December 2004). "The Design Space of Wireless Sensor Networks". IEEE Wireless Communications Vol. 11 No. (6): pp54-61.
[2] Hadim, Salem, Nader Mohamed (2006). "Middleware Challenges and Approaches for Wireless Sensor Networks". IEEE Distributed Systems Online 7 (3). art. no. 0603-03001.

[3] Handbook of sensor networks; algorithms and architectures, Edited by Ivan Stojmenovic, Wiley-Interscience, 2005, 531 pages.

[4] Wireless Sensor Network A Systems Perspective, Nirupama Bulusu, Sanjay Jha, Artech House, Published July 2005

[5] Mobile, Wireless, and Sensor Networks : Technology, Applications, and Future Directions Rajeev Shorey, A. Ananda, Mun Choon Chan, Wei Tsang Ooi, 422 pages, March 2006.
[6] TinyOS Tutorial http://www.tinyos.net/tinyos-1.x/doc/tutorial/

[7] Cugola, G; Jacobsen, HA. "Using publish/subscribe middleware for mobile systems." ACM SIGMOBILE Mobile Computing and Communications Review, 2002.

[8] Oh, Songhwai and Sastry, Shankar. A hierarchical multiple tracking Algorithm for Sensor networks. Berkeley CA, Jan 2004.

[9] K. Martinez, P. Padhy, A. Elasify, G. Zhou, A. Riddoch,J. K. Hart, and H. L. R. Ong. Deploying a sensor networkin an extream environment. In Proceedings of SensorNetworks, Ubiquitous and Trustworthy Computing, pp 186–193, 2006.

[10] J. McCann, M. Huebscher, and A. Hoskins. Context as autonomic intelligence in a ubiquitous computing environment. International Journal of Internet Protocol Technology (IJIPT) special edition on Autonomic Computing, 2006.

Abstract: General-Purpose Operating Systems (GPOSes) are being used more and more extensively to support interactive, real-time, and distributed applications, as found in the multimedia domain. In fact, the wide availability of supported multimedia devices and protocols, together with the wide availability of libraries and tools for handling multimedia contents, make them an almost ideal platform for the development of this kind of complex applications. However, contrarily to Real-Time Operating Systems, General-Purpose ones used to lack some important functionality needed for providing proper scheduling guarantees to application processes. Recently, the increasing use of GPOSes for multimedia applications is gradually pushing OS developers towards enriching the kernel of a GPOS so as to provide more and more real-time functionality, thus enhancing the performance and responsiveness of hosted time-sensitive applications. In this chapter, an overview is performed over the efforts done in the direction of enriching GPOSes with real-time capabilities, with a particular focus on the Linux OS. Due to its open-source nature and wide diffusion and availability, Linux is one of the most widely used for such experimentations

Key Words: real time operating systems, distributed computational systems

[1] A Note on Distributed Computing
[2] Algorithms and Distributed
[3] Computing Distributed Computing: Introduction
[4] Distributed Computing Utilities, Grids & Clouds
[5] www.google.com
[6] Distributed Object Systems
[7] The Clouds Project: Designing and
[8] Implementing a Fault Tolerant
[9] Distributed Operating System.
[10] Proceedings: Distributed Computing (Fall 1980).

Abstract: In the today's world, security is required to transmit confidential information over the network. Security is also demanding in wide range of applications. Cryptographic algorithms play a vital role in providing the data security against malicious attacks. Encryption of data is an important topic for research, as secure and efficient algorithms are needed that allow optimized encryption and decryption of data. In this paper we propose a new encryption algorithm, called Reverse Encryption Algorithm (REA). Our new encryption algorithm (REA) is simple and fast enough for most applications. REA encryption algorithm provides maximum security and limits the added time cost for encryption and decryption.

Keywords - decryption, encryption, information security, REA

[1] H. Brown, Considerations in Implementing A Database Management System Encryption Security Solution, A Research Report presented to The Department of Computer Science at the University of Cape Town, 2003.

[2] S. Castano, M. Fugini, G. Martella, and P. Samarati, Database Security, Addison-Wesley, 1995.

[3] A. Ceselli, E. Damiani, S. D. C. D. Vimercati, S. Jajodia, S. Paraboschi, and P. Samarati, "Modeling and assessing inference exposure in encrypted databases," ACM Transactions on Information System Security, vol. 8, no. 1, pp. 119–152, 2005.

[4] J. Daemen and V. Rijmen, "Rijndael: The advanced encryption standard (AES)," Dr. Dobb's Journal, vol. 26, no. 3, pp. 137-139, Mar. 2001.

[5] E. Damiani, S. D. C. D. Vimercati, M. Finetti, S. Paraboschi, P. Samarati, and S. Jajodia, "Implementation of a storage mechanism for untrusted dbmss," IEE Security in Storage Workshop 2003, pp. 38-46, 2003.

[6] E. Damiani, S. D. C. D. Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, and P. Samarati, "Metadata management in outsourced encrypted databases," in The Second VLDB Workshop on Secure Data Management, Lecture Notes in Computer Science, pp. 16– 32, Springer, 2005.

[7] G. Davida, D. L. Wells, and J. B. Kam, "A database encryption system with subkeys," ACM Transactions on Database Systems, vol. 6, no. 2, pp. 312–328, 1981.

[8] M. R. Doomun and K. M. S. Soyjaudah, "Analytical comparison of cryptographic techniques for resource-constrained wireless security" International Journal of Network Security, vol. 9, no. 1, pp. 82-94, 2009.

[9] D. S. A. Elminaam, H. M. A. Kader, and M. M. Hadhoud, "Evaluating the performance of symmetric encryption algorithms," International Journal of Network Security, vol. 10, no. 3, pp. 213-219, 2010.

[10] D. S. A. Elminaam, H. M. A. Kader, and M. M. Hadhoud, "Evaluating the effects of symmetric cryptography algorithms on power consumption for different data types" International Journal of Network Security, vol. 11, no. 2, pp. 78-87, Sep. 2010.

Abstract: The aim of this paper is to describe the architecture and report a preliminary testing of a robotic magnetic navigation system that may serve to enable accurate GI endoscopic explorations with magnetically controllable video capsules. The robotic system considered here was recently developed for completely different (cardiovascular) applications, in order to safely maneuver endocardial catheters. The potential suitability of this type of system even for GI explorations, and in particular for controlling endoscopic capsules, was previously suggested, but never demonstrated. Following this suggestion, this paper describes the first investigation on the potentialities (and also the limitations) of the considered robotic system for such a possible new application, studied from both a theoretical and an experimental point of view.

Keywords- Capsule, Endoscopy, Magnetic Maneuvering

[1] IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, VOL. 56, NO. 5, MAY 2009 [2] G. J. Iddan and C. P. Swain, "History and development of capsule endoscopy,"
[2] Gastrointestinal. Endosc. Clin. North Amer., vol. 14, no. 1, pp. 1–9, 2004.
[3] P. Swain, "Wireless capsule endoscopy," Gut, vol. 52, pp. iv48–iv50, 2003.
[4] A. Glukhovsky, "Wireless capsule endoscopy," Sens. Rev., vol. 23, no. 2, pp. 128–133, 2003.