iosr-JCE   Volume-8 ~ Issue-6

Abstract:The emerging global competition and increasing costs are a great challenge to industries. New cost effective training methods are explored to cope with this demand. In-depth knowledge of the functions in a factory is of vital importance for greater safety and better efficiency. Desktop and web-based e-learning applications offer industrialists new tools to raise maintenance-related knowledge and competence. Simulated learning through virtual 3D animations let employees comprehend the internal mechanisms of the equipment and the co-relation between the different parts. The evolution of Web technologies in recent years has enabled the use of Virtual Reality (VR) modelling for visualization of manufacturing processes creating a Virtual Environment (VE). The VR modelling language (VRML), which has become the standard for transmitting 3D virtual worlds across the Internet, can be used to control, interact and monitor manufacturing processes visually thus imparting training from a desktop computer. This paper deals with the simulation of the production of steel beams and columns presented to the subcontractors from a parent company.
Keywords: 3D animations, interactivity, Simulated Learning, Virtual Environment,VRML

[1]. VRML Applications in Construction: Internet based Emerging Construction Technologies http://rebar.ecn.purdue.edu/ect/links/technologies/internet/vrml.aspx
[2]. Burdea, G. and Coiffet, P., Virtual Reality Technology (2nd ed. Wiley Interscience, 2003).
[3]. Vince, J. Virtual Reality Systems (Addison-Wesley, 1995).
[4]. Arts and Humanities Data Service (2002). Creating and using virtual reality: A guide for the arts and humanities. Retrieved February 21, 2004, from http://vads.ahds.ac.uk/guides/vr_guide
[5]. Beier, K. P. (2004). Virtual reality: A short introduction. Retrieved February 20, 2004, from http://www-vrl.umich.edu/intro/index.html
[6]. Schofield, D. 1995. Virtual Reality Technology and its Application.
[7]. Ames A., Nadeau D., Moreland J., VRML 2.0 Sourcebook (2nd edition, John Wiley & Sons, Inc., 1997).
[8]. Web 3D Repository, http://www.web3d.org/vrml/vrml.htm
[9]. Cosmo Player, http://www.ca.com/cosmo/
[10]. Cortona, http://www.parallelgraphics.com/products/cortona/

Abstract:Text mining, sometimes alternately referred to as text data mining, roughly equivalent to text analytics, refers to the process of deriving high-quality information from text. High-quality information is typically derived through the devising of patterns and trends through means such as statistical pattern learning. Text mining is the discovery of interesting knowledge in text documents. Many data mining techniques have been proposed for mining useful patterns in text documents. It is a challenging issue to find accurate knowledge (or features) in text documents to help users to find what they want. In existing, Information Retrieval (IR) provided many term-based methods to solve this challenge. The term-based methods suffer from the problems of polysemy and synonymy. The polysemy means a word has multiple meanings, and synonymy is multiple words having the same meaning. In proposed to use pattern (or phrase)-based approaches should perform better than the term-based ones. The proposed approach can improve the accuracy of evaluating term weights because discovered patterns are more specific than whole documents.
Keywords: Text mining, text classification, pattern mining, pattern evolving, information filtering.

[1] Y.Li, C. Zhang, and J.R. Swan, "An Information Filtering Modelon the Web and Its Application in Jobagent," Knowledge-Based
Systems, vol. 13, no. 5, pp. 285-296, 2000.
[2] Y. Li and N. Zhong, "Interpretations of Association Rules by Granular Computing," Proc. IEEE Third Int'l Conf. Data
Mining(ICDM '03), pp. 593-596, 2003.
[3] X. Li and B. Liu, "Learning to Classify Texts Using Positive and Unlabeled Data," Proc. Int'l Joint Conf. Artificial Intelligence
(IJCAI'03), pp. 587-594, 2003.
[4] Y. Li, W. Yang, and Y. Xu, "Multi-Tier Granule Mining for Representations of Multidimensional Association Rules," Proc. IEEE
Sixth Int'l Conf. Data Mining (ICDM '06), pp. 953-958, 2006.
[5] Y. Li and N. Zhong, "Mining Ontology for AutomaticallyAcquiring Web User Information Needs," IEEE Trans. Knowledge and
Data Eng., vol. 18, no. 4, pp. 554-568, Apr. 2006.
[6] Y. Li, X. Zhou, P. Bruza, Y. Xu, and R.Y. Lau, "A Two-Stage Text Mining Model for Information Filtering," Proc. ACM 17th
Conf. Information and Knowledge Management (CIKM '08), pp. 1023-1032,2008.
[7] H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C.Watkins, "Text Classification Using String Kernels," J. Machine
Learning Research, vol. 2, pp. 419-444, 2002.
[8] A. Maedche, Ontology Learning for the Semantic Web. Kluwer Academic, 2003.
[9] C. Manning and H. Schu¨ tze, Foundations of Statistical Natural Language Processing. MIT Press, 1999.
[10] I. Moulinier, G. Raskinis, and J. Ganascia, "Text Categorization: A Symbolic Approach," Proc. Fifth Ann. Symp. Document
Analysis and Information Retrieval (SDAIR), pp. 87-99, 1996.

Abstract:We propose a steganography technique which embeds the secret messages in frequency domain. Unlike the space domain approaches, secret messages are embedded in the high frequency coefficients resulted from Discrete Wavelet Transform. A cryptography algorithm is used to convert the secret messages to an unreadable form before embedding. These algorithms keep the messages from stealing, destroying from unintended users on the internet and hence provide satisfactory security. Blowfish algorithm is used for encryption and decryption of text message using a secret-key block cipher. Blowfish is an evolutionary improvement over DES, 3DES, etc designed to increase security and to improve performance. This algorithm uses a variable key size up to 448 bits.
Keywords: Steganography, security, information hiding cryptography, wavelet transform.

[1] "A Multilayered Secure, Robust and High Capacity Image Steganographic Algorithm" World of Computer Science and Information
Technology Journal (WCSIT) ISSN: 2221-0741 Vol. 1, No. 6, 239-246, 2011
[2] Image encryption and decryption using blowfish algorithm World Journal of Science and Technology 2012, 2(3):151-156 ISSN:
2231 – 2587
[3] A DWT Based Approach for Image Steganography International Journal of Applied Science and Engineering 2006. 4, 3:275-290
[4] Applied Mathematical Sciences, Vol. 6, 2012, no. 79, 3907 - 3915A "New Method in image Steganography with Improved Image
Quality".
[5] World Applied Sciences Journal 13 (3): 507-516, 2011 ISSN 1818-4952 " Improvement of Embedding Capacity and Quality of
DWT-Based Audio Steganography Systems"

Abstract:These days, a lot of companies all over the world have interest in large scale Software Development in a distributive manner. The question is how does distributed development works? There are stakeholders from different national and organizational cultures and time zones are involved in developing software. Today, it is not possible to meet members of software development teams regular in a face-to- face interaction, especially stakeholders from different national and organizational cultures. People work together in development projects to accomplish project goals from different geographical locations. It must be overcome various barriers. Beginning with the geographical dispersion of the globally distributed teams, the different time zones and the various cultures and languages, there often communication problems can occur. This paper discusses some key principles for managing large scale software project development.
Keywords: Globalization, Project Management, LSDLC, Risk Certification, Quality Control

[1]. Rushby, J. Software Verification and System Assurance. Proc. 7th IEEE Int. Conf. on Software Engineering and Formal Methods.
Hanoi, Vietnam. 2009.
[2] Sommerville, I. ‗Designing for Recovery: New Challenges for Large-scale Complex IT Systems'.Keynote address, 8th IEEE
Conference on Composition-based Software Systems. Madrid. 2008.
[3] http://sites.google.com/site/iansommerville/keynote-talks/DesigningForRecovery.pdf Sillitto, H. ‗Design Principles for Ultra-Large
Scale (ULS) Systems'. Proc. 20th INCOSE International Symposium, Chicago, July 2010.
[4] Cohen, S. A Software System Development Life Cycle Model for Improved Stakeholders' Communication andCollaboration. Int. J.
of Computers, Communications & Control. Vol. V, No. 1, pp. 20-4. 2010.
[5] p. Sage and James D. Palmer, Software Systems Engineering (New York: John Wiley & Sons, 1990).
[6] B. Curtis, H. Krasner, and N. Iscoe. A field study of the software design process for large systems. Communications of the ACM,
31(11):1268–1287, 1988.
[7] Software Engineering Advice from Building Large-Scale Distributed Systems Jeff Dean, http://labs.google.com/people/jeff
[8] Project management,Ian Sommerville 2000 Software Engineering, 6th edition.
[9] Managing the Software Process, Watts S. Humphrey, SEI Series in Software Engineering, Addison-Wesley, August 1990.
[10]. Reference Model for Frameworks of Software Engineering Environments, European Computer Manufacturer's Association, TR/55,
1991.

Abstract:Today several daily activities such as communication, education, E-commerce, Entertainment and tasks are carried out by using the internet. To perform such web activities users have to register regarding the websites. In registering websites, some intruders write malicious programs that waste the website resources by making automatic false enrolments that are called as bots. These false enrolments may adversely affect the working of websites. So, it becomes necessary to differentiate between human users and Web bots (or computer programs) is known as CAPTCHA. CAPTCHA is based on identifying the distorted text, the color of image, object or the background. This paper examines CAPTCHAs and its working and literature Review. This paper also provides classification of CAPTCHAs, its application areas and guidelines for generating a captcha.

[1] L. von Ahn, M. Blum, and J. Langford, "Telling Human and Computers Apart Automatically," in Communications of the ACM,
vol. 47,February 2004, no. 2, pp. 57-60. DOI:10.1145/966389.966390
[2] L. von Ahn, M. Blum, N. Hopper, and J. Langford, The CAPTCHA web page: http://www.CAPTCHA.net,2000.
[3] Ahn, L. von, Blum, M., Hopper, N. J., & Langford, J., (2003), "CAPTCHA: Using hard AI problems for security", Proceedings of
Eurocrypt 2003.
[4] Shirali-Shahreza, M.H. & Shirali-Shahreza, M., (2007) "Multilingual CAPTCHA", ICCC 2007 IEEE International Conference on
Computational Cybernetics, 19–21 October, Gammarth, Tunisiali, pg 136.
[5] M. Blum, L. von Ahn, and J. Langford, The CAPTCHA Project (Completely Automated Public Turing Test to Tell Computers and
Humans Apart), School of Computer Science, Carnegie- Mellon University, November 2000,http://www.CAPTCHA.net.
[6] M.H. Shirali-Shahreza and M. Shirali-Shahreza, "Persian/Arabic Baffletext CAPTCHA," Journal of University Computer Science
(J.UCS), vol. 12, no. 12, December 2006, pp.1783- 1796. DOI: 10.3217/jucs-012- 12-1783
[7] H.S. Baird and J.L. Bentley, "Implicit CAPTCHAs," Proceedings SPIE/IS&T Conference on Document Recognition and Retrieval
XII (DR&R2005), San Jose, 2005, pp. 191-196. DOI: 10.1117/12.590944
[8] Yadava P, Sahu C and Shukla S. (2011), "Time-Variant CAPTCHA: Generating Strong CAPTCHA Security by Reducing Time to
Automated Computer Programs",JETCIS VOL. 2, NO. 12, pp 701 704.
[9] Kurt Alfred Kluever. Evaluating the Usability and Security of a Video CAPTCHA. Master's thesis, Rochester Institute of
Technology, Rochester, NY, August 2008.
[10] H.S. Baird and K. Popat, "Human Interactive Proofs and DocumentImage Analysis," Proceedings of the 5th IAPR International
Workshop on Document Analysis Systems, Princeton, LNCS 2423, 2002, pp. 507- 518.

Abstract:Recognition of handwritten Bangla numerals finds numerous applications in postal system automation, passports and document analysis and even for number plate identification. However, the recognition rate requires high and reliable accuracy for practical applications. This paper delineate a robust hybrid system for recognition of handwritten Bangla numerals for the automated postal system, which performed feature extraction using k-means clustering, Baye's theorem and Maximum a Posteriori, then the recognition is performed using Support Vector Machine . Recognition of handwritten numerals, such as postal codes, reveal all kinds of local and global deformations: distortions, different writing styles, thickness variations, wide variety of scales, limited amount of rotation, added noise, occlusion and missing parts. This paper shows that the proposed method is better than other system.
Keywords: K-means clustering, Bayes' theorem, MAP, PCA, SVM and OCR.

[1] B. B. Chaudhuri, U. Pal, "A Complete Printed Bangla OCR System", Pattern Recognition, Vol. 31, No. 5, pp. 531-549, 1998
[2] U. Pal, B.B. Chaudhuri, Indian script character recognition: a survey, Pattern Recognition 37, pp:1887–1899, year:2004
[3] U. Pal, On the development of an optical character recognition (OCR) system for printed Bangla script, Ph.D. Thesis, 1997.
[4] U. Pal, B.B. Chaudhuri, Automatic recognition of unconstrained offline Bangla hand- written numerals, in: T. Tan, Y. Shi, W. Gao
[5] (Eds.), Advances in Multimodal Interfaces, Lecture Notes in Computer Science, vol. 1948, Springer, Berlin, pp. 371–378,year:
2000.
[6] K. Roy, S. Vajda, U. Pal, B.B. Chaudhuri, A system towards Indian postal automation, in: Proceedings of the Ninth International
[7] Workshop on Frontiers in Handwritten Recognition, (IWFHR-9 2004), pp. 580–585, year: October 2004.
[8] U. Pal, A. Belad, Ch. Choisy, Touching numeral segmentation using water reservoir concept, Pattern Recognition Lett. 24, 261–
272, year: 2003.
[9] YingWen, Yue Lu, Pengfei Shi, "Handwritten Bangla numeral recognition system and its application to postal automation ".
Pattern Recognition 40, pp:99 – 107. year:2007.
[10] J.-X. Dong, A. Krzyzak, C.Y. Suen, Fast SVM training algorithm with decomposition on very large data sets, IEEE Trans. Pattern
Anal.

Abstract: Cloud computing has the great potential to dramatically change the landscape of the current IT industry. Cloud services are provided based on user request. In cloud environment user's data are usually processed remotely in unknown machines that users do not own or operate. Control of user's data is reduced on data sharing under remote machines. Centralized monitoring applications are not suitable for highly dynamic data access environment. Data access management can be done through the cloud service providers. The Cloud Information Accountability framework used to keep track of the actual usage of the users' data in the cloud. It combines the aspects of access control, usage control and authentication. The data are sending along with access control policies and logging policies enclosed in JAR files, to cloud service providers. Current framework does not provide authentication and integrity.
Keywords: Cloud computing, Accountability, CIA Framework, JAR Files, Data sharing

[1] Smitha Sundareswaran, Anna C. Squicciarini, and Dan Lin, "Ensuring Distributed Accountability for Data Sharing in the Cloud".
IEEE Transactions on Dependable And Secure Computing, Vol. 9, No. 4, July/August 2012.
[2] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, "Provable Data Possession at Untrusted
Stores," Proc. ACM Conf. Computer and Comm. Security, pp. 598-609, 2007.
[3] A. Pretschner, M. Hilty, F. Schuo¨ tz, C. Schaefer, and T. Walter, "Usage Control Enforcement: Present and Future," IEEE Secu rity
& Privacy, vol. 6, no. 4, pp. 44-53, July/Aug. 2008.
[4] A. Pretschner, F. Schuo tz, C. Schaefer, and T. Walter, "Policy Evolution in Distributed Usage Control," Electronic Notes
Theoretical Computer Science, vol. 244, pp. 109-123, 2009.
[5] R. Hasan, R. Sion, and M. Winslett, "The Case of the Fake Picasso: Preventing History Forgery with Secure Provenance," Proc.
Seventh Conf. File and Storage Technologies, pp. 1-14, 2009.
[6] P.T. Jaeger, J. Lin, and J.M. Grimes, "Cloud Computing and Information Policy: Computing in a Policy Cloud?," J. Information
Technology and Politics, vol. 5, no. 3, pp. 269-283, 2009.
[7] F. Martinelli and P. Mori, "On Usage Control for Grid Systems," Future Generation Computer Systems, vol. 26, no. 7, pp. 1032 -
1042, 2010.
[8] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, "Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud
Computing," Proc. European Conf. Research in Computer Security (ESORICS), pp. 355-370, 2009.
[9] A. Squicciarini, S. Sundareswaran, and D. Lin, "Preventing Information Leakage from Indexing in the Cloud," Proc. IEEE Int'l
Conf. Cloud Computing, 2010.
[10] S. Pearson and A. Charlesworth, "Accountability as a Way Forward for Privacy Protection in the Cloud," Proc. First Int'l Conf .
Cloud Computing, 2009.

Abstract: Sensor Networks have been heralded as one of 21 most enabling technologies for 21st century by Business Week. In recent times wireless sensor networks have received significant attention from researchers due to its unlimited potential. However despite all this effort at providing improved services in these areas, issues still remain unsolved and many more have arised based on the proffered solutions. This paper is focused on presenting to the reader arising issues in wireless sensor networks. We have concentrated on grouping issues in Wireless sensor network into three broad groups namely; the technical issues, the design issues, the system issues, the communication protocol issues, topology issues, key management issues, other wsn issues and recent and research issues. By solving these issues, we can close the wide gap between Wireless Sensor Network Technology invention and its deployment on the field.
Keywords: Challenges, Enabling technologies, Issues, Research areas, Wireless sensor networks

[1] "Henry Ohiani Ohize, Emerging Issues in Wireless Sensor Networks, Ohize , 2011
[2] H. Karl and A. Willig, Protocols and Architectures for Wireless Sensor Networks, John Wiley and Sons Ltd, The Atrium, Souther n
Gate, Chichester, West Sussex, England, 2005.
[3] D. Culler, D. Estrin, and M. Srivastava, "Overview of Sensor Networks", IEEE Computer, August 2004.
[4] K. Martinez, J. K. Hart, and R. Ong, "Environmental sensor networks", IEEE Computer Journal,Vol. 37 (8), 50-56, August 2004.
[5] A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk , and J. Anderson, "Wireless sensor networks for habitat monitoring",
Proceedings of the 1st ACM International workshop on Wireless sensor networks and applications, Atlanta, Georgia, USA, 88-97,
2002.
[6] http://en.wikipedia.org/wiki/Sensor_Networks
[7] Akyildiz, I.F., W. Su, Y. Sankarasubramaniam, E. Cayirci, "A Survey on Sensor Networks", IEEE Communications Magazine,
August, 102-114(2002).
[8] Gowrishankar.S 1, T.G.Basavaraju 2, Manjaiah D.H 3, Subir Kumar Sarkar 4 "Issues in Wireless Sensor Networks", 2008
[9] Q. Jiang and D.Manivannan, "Routing Protocols for Sensor Networks", In proceedings of Consumer Communications and
Networking Conference, 5-8 January, pp 93-98.
[10] Ian f .Alkyildiz and Mehmet Can Varun, Ian f .Alkyildiz series in communications and networking, "wireless sensor networks
book"

Abstract: A considerable challenge in image segmentation in real world images is intensity inhomogenity. The existing image segmentation algorithms rely on region based and it typically features similarity of image intensities in the region of interest. Due to the presence of intensity non uniformity the segmentation results are not accurate. So this survey paper gives a novel region based techniques for image segmentation in the presence of intensity inhomogenity. Intensity non uniformity occurs in real world images due to various factors such as spatial variations on illumination, imperfections of imaging devices, noise and of low contrast, causes many problems in image processing and computer vision. Image segmentation is a very difficult task in the presence of non uniformity of intensities. Intensity non uniformity is caused by the overlaps between the ranges of intensities in the region to be segmented. This paper covers segmentation techniques to overcome the intensity inhomogenity with the help of Level Set Method. The aim is to implement a level set approach for active contour image segmentation for MRI images. No requirement about object's shape and allowances for very flexible topology change are key advantages for this method. As an application our method can be used for segmentation and bias correction of magnetic resonance images with accurate results.
Keywords: Contour, Image Segmentation, Intensity Inhomogenity, and Level set Method, MRI images

[1] Tranos Zuva,Oludayo O,Olugbara,Sunday O,Ojo and Seleman Ngwira,Image Segmentation Available Techniques,Developmaents and Open Issues, Canadian Journal on Image processing and Computer Vision Vol 2 No:3 March 2011 .
[2] StanleyOsher and J. Sethian, Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi
formulations, J. Comp.Phys., vol. 79, no. 1, pp. 12–49, Nov. 1988
[3] Kan Cheng, Lixu Gu, and Jianrong Xu,A Novel Shape Prior Based Level Set Method for Liver Segmentation From MR Images,
Proceedings of the 5th International Conference on Information Technology and Application in Biomedicine, in conjunction with The
2nd International Symposium & Summer School on Biomedical and Health Engineering Shenzhen, China, May 30-31, 2008
[4] Samir BARA,Mounir Ait Kerroum,Ahmed Hammouch and Driss Aboutajdine,Variational Image Segmentation Models:Application to medical images MRI, -978-1-61284-732-0/11/$26.00 ©2010 IEEE
[5] Kaihua Zhang a, Lei Zhang a, 1 and Su Zhang,A Variational Multi Phase Level Set Approach To Simultaneous Segmentation And
Bias Correction
[6] Pan Lin, Chong-Xun Zheng, Yong Yang,Model-Based Medical Image Segmentation: A Level Set Approach,Proceedings of the 5th
World Congress on Intelligent Control and Automation. June 15-19, 2004, Hangzhou. P.R.China
[7] Zongjie Cao, Yiming Pi, Xiaobo Yang, Jintao Xiong, a Variational Level Set SAR Image Segmentation Approach Based on Statistical
Model
[8] Chunming Li, RuiHuang, Zhaohua Ding, Chris Gatenby, Dimitris Metaxas,and John Gore, A Variational Level Set Approach to
Segmentation and Bias Correction of Images with Intensity Inhomogeneity,D. Metaxas et al. (Eds.): MICCAI 2008, Part II, LNCS
5242, pp. 1083–1091, 2008. Springer-Verlag Berlin Heidelberg 2008
[9] El Hadji S. Diop, Silèye O. Ba, Taha Jerbi and Valérie Burdin,Variational and Shape Prior -based Level Set Model for Image
Segmentation
[10] Luminita A. Vese & Tony F. Chan, A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model, International Journal of Computer Vision 50(3), 271–293, 2002© 2002 Kluwer Academic Publishers. Manufactured in the Netherlands

Abstract: The Peer-to-peer networks popularity is increasing day by day for its resource allocation system like file sharing, Skype etc .The system is extremely fast because of its fully decentralized nature. Although this is efficient system but this system's security is vulnerable and can be attacked anytime by attackers. This paper describes P2P's most challenging threat Sybil attack. Generally Sybil attack is defined as an attack by a malicious user who creates multiple identities and act as separate and real nodes. These fake nodes are called Sybil nodes. After creating these fake IDs, malicious user can control the network by controlling the nodes which contains resources. They can also change the resources and can attack node's routing table, they can damage node's communication on the network. This paper describes possible solutions against this attack by using existing SyMon protocol with our proposed "Associate membership" method .By implementing the proposed model performance will increase to defense against Sybil attack.
Keywords: Associate membership, P2P, Security, Sybil attack, SyMon.

[1] J. Douceur. The Sybil attack. In IPTPS, 2002.
[2] Jyothi B.S and Dharanipragada Janakira, SyMon: An approach to defense Sybil Attack in structured P2P network.
[3] T. S. E. Ng and H. Zhang. Predict the network distance of internet with coordinates-base method. IEEE, 2002.
[4] R. Bazzi and G. Konjevod. The establish of different id in overlay networks. ACM PODC, 2005.
[5] J. Newsome, E. Shi, D. Song, and A. Perrig. Sybil attack in sensor networks Analysis and defenses. ACM/IEEE IPSN, 2004.
[6] G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-resist DHT routing. The European Symposium Research,
2005.
[7] H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Defense against Sybil attacks by using Sybil Guard based on social networks.
Technical Report IRP-TR-06-01, Intel Research Pittsburgh, June 2006.
[8] H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. Nearly optimal solution using Sybil limit based on social network. Technical
Report TRA2/08, SNU, School of Computing, Mar. 2008.
[9] W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibilities of server less distributed system on an existing set of desktop
PC. In ACM SIGMETRICS, 2000.
[10] A. Cheng and E. Friedman. Sybil proof reputation system. In ACMSIGCOMM seminar on Economics of P2P Networks, 2005.

Abstract: Wireless sensor networks consisting of a large number of low power, low cost sensor node that communicate wirelessly. Such sensor networks can be used in wide range of applications such as military sensing and tracking, health monitoring etc, when the sensing field is too far from the station, transmitting data over long distance using multi-hop may weaken the security strength. To overcome this problem, mobile sinks (MS) are used. Mobile sinks plays a vital role in many wireless sensor applications for efficient data collection and localized sensor reprogramming. MS prolong the lifetime of the sensor network. Security became a critical issue when sensor network with MS are deployed in hostile environment. For providing more security against clone attack and Sybil attack, the proposed scheme implements mobile sink server to offer better security. In Sybil attack, the malicious device illegitimately taking on multiple identities whereas in, clone attack, adversaries may easily capture and compromise sensors and deploy unlimited number of clones of the compromised nodes. Based on the parameters such as bandwidth utilization, speed and time, the malicious act by the adversary are detected. And MS is assigned randomly once it is exposed to threat.
Keywords: Distributed. Security, Wireless Sensor networks, AODV, Mobile Sink.

[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: A survey," The International Journal of
Computer and Telecommunications Networking Computer Networks, vol. 38, no. 4, pp. 393-422, March 2002.
[2] I. Chatzigiannakis, A. Kinalis, and S. Nikoletseas, "Sink mobility protocol for data collection in wireless sensor networks," Proc. of
the 4th ACM International Workshop on Mobility Management and Wireless Access (MOBIWAC'06), pp. 52-59, 2006.
[3] S. Basagni, A. Carosi, E. Melachrinoudis, C. Petrioli, and Z. M. Wang, "Protocols and model for sink mobility in wireless sensor
networks," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 10, no. 4, pp. 28-30, 2006..
[4] L. Cheng, Y. Chen, C. Chen, and J. Ma, "Query-based data collection in wireless sensor networks with mobile sinks," Proc. of the
2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, pp. 1157-
1162, 2009.
[5] B. Parno, A. Perrig, and V. D. Gligor, "Distributed detection of node replication attacks in sensor networks," Proc. of the 2005
IEEE Symposium on Security and Privacy (S&P'05), pp. 49–63, 2005.
[6] W. Du, J. Deng, Y. S. Han, and P. K. Varshney, "A pairwise key pre-distribution scheme for wireless sensor networks," In ACM
CCS 2003, pages 42{51,Oct. 2003}.
[7] Yunxia Chen and Qing Zhao "On the Lifetime of Wireless Sensor Networks," IEEE communications letters, vol. 9, no. 11, pp. 976-
978, November 2005.
[8] Charles E. Perkins and Elizabeth M. Royer, "Ad-hoc On-Demand Distance Vector Routing," Proceeding of the 2nd IEEE
Workshop on Mobile Computing Systems and Applications (WMCSA'99), New Orleans, LA, USA, February 1999, pages 90-100.
[9] Murat Demirbas and Youngwhan song, "An RSSI-based Scheme for Sybil Attack Detectionin Wireless Sensor
Networks,"Proceeding of the 2006 International symposium on World of Wireless, Mobile and Multimedia Networks
(WOWMOM'06), pages 564- 570.
[10] Kai Xing, Fang Liu, Xiuzhen Cheng, David H.C. Du, "Real-Time Detection of Clone Attacks in Wireless Sensor Networks," icdcs,
pp.3-10, 2008 The 28th International Conference on Distributed Computing Systems, 2008.

Abstract: 3D technology is broadly divided in to reconstructing 3D images (3DI) from given 2D images (2DI) and 3D visualization (3DV) using stereo pairs (SP). Literature Review revealed that many satisfactory techniques were developed for reconstructing 3DI from given 2DI and a reasonably good 3D reconstruction is possible. When a stereopair is viewed through a slot no attachments are needed as the basic law of stereoscopy is fulfilled, but focusing strains the eyes. The present work alienates the strain by positioning the stereopairs at an angle parallel to the plane of the stereopair. Different geometric parameters namely the distance between the plane of the eyes and the plane of stereo pair (L), distance between the stereopairs (s), width of the stereopairs (b), the inclination of the stereopairs with the plane of the stereopair (theta) were tried and for each trial the distance between the plane of stereo pair and the plane of 3DV window (L1) and the width of the window (d) are measured / computed. The ratio L1/L = R is also computed. The optimum values of the parameters L,s,b, theta resulting a minimum value of R are arrived at. 3DV using the above geometric parameters with and without tilting of stereo pairs revealed that the 3DV with tilting offered a considerable reduction in straining the eyes. Various results obtained through the experimental work are presented and discussed. The present work reveals that 3DV using distorted Stereopairs offers less strain to the eyes compared to undistorted stereopairs, enhancing the ease of 3DV.
Keywords: 3D Visualization, Stereoscopy, Stereopairs

[1] IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.11, November 2009 234 Manuscript received
November 5, 2009 Manuscript revised November 20, 2009 Efficient 3D Object Visualization via 2D Images Kitara Kadhim Al-
Shayeh and† and Muzhir Shaban Al-Ani††, †Al-Zaytoonah University of Jordan, Department of MIS, Amman - Jordan
††Amman Arab University, Faculty of IT, Amman - Jordan - 11953
Development Of A Cost Effective 3d Window For Stereoscopic 3d Visualization Using Distorted
www.iosrjournals.org 91 | Page
[2] N. Sandyarani, Dr. V.Vaithyanathan "AN EXPERT SYSTEM FOR STEREOSCOPIC 3D VISUALISATION (WITHOUT THE
APPLICATION OF CONVENTIONAL ATTACHMENTS TO THE EYES) OF COMPUTER GENERATED STEREOPAIRS"
was accepted and published in the International Journal of Computer Science, Newyork, USA. ISSN 1549-3636, Journal of
Computer Science 5 (12): 1051-1057, 2009
[3] A. Bardera et al. "Image Segmentation Using Access Entropy", Journal Signal Processing Systems, vol.54, no.1-3, pp 205-214,
2009.
[4] Meisam Aliroteh and Tim McInerney, "SketchSurfaces: Sketch Line Initialized Deformable Surfaces for Efficient and Controllabl e
Interactive 3D Medical Image Segmentation", Third International Symposium on Visual Computing (ISVC07), LNCS 4841, Lack
Tahoe, Nevada/California, November 26-28, pp 542-553, 2007.
[5] Manuel Ferre et al., "3D Image Visualization and Its Performance in Teleoperation", HCI International Conference (HCII 2007),
Peking, China; 22.07.2007 - 27.07.2007; in: "Virtual Reality, Vol.14, LNCS 4563, R. Shumaker (Hrg.); Springer, Volume 14, LNCS
4563 (2007), pp 669-707, 2007.
[6] K. Krechetova et al., "3D Medical Image Visualization and Volume Estimation of Pathology Zones", NBC - 14th Nordic-Baltic
Conference on Biomedical Engineering and Medical Physics, Latvia (IFMBE Proceedings) Vol. 20, pp 532-535, 2008.
[7] N. Sandyarani, Dr. V. Vaithyanathan "DEPTH FIELD COMPUTATIONS USING NON -LINEAR PROJECTION METHODS" –
Paper published in the proceedings of the International Conference on Computing Communication and Networking (ICCCN –
2008), December 18 – 20, 2008, Chettinad College of Engineering & Technology, Karur, TamilNadu conducted by the IEEE
Madras Section & IEEE CS Madras Chapter. (http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4787757) – IEEE Explore.
[8] N. Sandyarani, Dr. V. Vaithyanathan "DEPTH COMPUTATIONS USING DATA IN THE FORM OF INTENSITY OF PIXELS
FOR ENHANCED COMPUTER VISION" – Paper published in the proceedings of the International Conference on Computing
Communication and Networking (ICCCN – 2008), December 18 – 20, 2008, Chettinad College of Engineering & Technology,
Karur, TamilNadu conducted by the IEEE Madras Section & IEEE CS Madras Chapter.
(http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4787729) – IEEE Explore.
[9] N. Sandyarani, Dr. V. Vaithyanathan "Design and Development Of A High Quality Window For 3D Visualization " - paper
accepted for publication at the international conference on computational intelligence and multimedia applications- 2007 at Mepco
Sivskasi Engg college-India.
[10] Dr. M. Narayana Rao & V. Vaithyanathan "VISUAL COMPUTING OF PARAMETERS / ATTRIBUTES OF GEOMETRIC
SOLIDS USING COLOR GRADATION / QUEUING THEORY AND ITS APPLICATIONS IN ENGINEERING GRAPHICS" –
Paper published in the proceedings of the International Conference on Computing Communication and Networking (ICCCN –
2008), December 18 – 20, 2008, Chettinad College of Engineering & Technology, Karur, TamilNadu conducted by the IEEE
Madras Section & IEEE CS Madras Chapter. (http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4787756) – IEEE Explore.

Abstract: Online databases called the web databases comprise the deep web. Pages in deep web are dynamically generated on receiving a user query which is submitted through the query interface. Extracting data from these deep web pages automatically are very important in many applications which deal with multiple databases. But extracting structured data from these pages is a challenging problem due to the underlying intricate structures of such pages. Until now, a large number of techniques have been proposed to address this problem, but all of them have several limitations. The proposed work automatically extracts structured data from the deep web by first identifying the data regions and segmenting it into Query Result Records (QRRs) in the web page. It then aligns the QRRs into a table such that data values of the corresponding attributes are put into the same column. The proposed system makes use of both the tag and value data for the alignment to be accurate. It also handles non contiguous QRRs due to presence of auxiliary information and processes nested structures that may exist in the QRRs.
Keywords: Data extraction, Deep web, Nested structure, Structured data.

[1] BrightPlanet.com. The deep web: Surfacing hidden value. Accessible at http://brightplanet.com, July 2000.
[2] I. Muslea, S. Minton, and C. Knoblock, "Hierarchical Wrapper Induction for Semistructured Information Sources", Autonomous
Agents and Multi-Agent Systems, vol. 4, nos. ½, pp. 93-114, 2001.
[3] W. Cohen and L. Jensen, "A Structured Wrapper Induction System for Extracting Information from Semi-Structured Documents",
Proc. IJCAI Workshop Adaptive Text Extraction and Mining, 2001.
[4] V. Crescenzi, G. Mecca, and P. Merialdo, "Roadrunner: Towards Automatic Data Extraction from Large Web Sites", Proc. 27th Int'l
Conf. Very Large Data Bases, pp. 109-118, 2001.
[5] C.H. Chang and S.C. Lui, "IEPAD: Information Extraction Based on Pattern Discovery", Proc. 10th World Wide Web Conf., pp. 681- 688, 2001.
[6] K. Simon and G. Lausen, "ViPER: Augmenting Automatic Information Extraction with Visual Perceptions", Proc. 14th ACM Int'l
Conf. Information and Knowledge Management, pp. 381-388, 2005.
[7] H. Zhao, W. Meng, Z. Wu, V. Raghavan and C. Yu, " Fully Automatic Wrapper Generation for Search Engines", Proc. 14th World
Wide Web Conf., pp. 66-75, 2005.
[8] B. Liu and Y. Zhai, "NET – A System for Extracting Web Data from Flat and Nested Data Records",. Proc. 6th Int'l Conf., Web
Information Systems Engg, pp. 487-495, 2005.
[9] Y. Zhai and B. Liu, "Structured Data Extraction from the Web Based on Partial Tree Alignment", IEEE Trans., Knowledge and Data
Engg., vol. 18, no. 12, pp. 1614-1628, Dec. 2006.
[10] Weifeng Su, Jiying Wang, Frederick H. Lochovsky and Yi Liu, "Combining Tag and Value Similarity for Da ta Extraction and
Alignment", IEEE Trans., Knowledge and Data Engg., vol. 24, no. 7, pp. 1186-1200, Jul. 2012.

Abstract: A W3C standard for processing RDF data is a SPARQL query language, a technique that is used to encode data in meaningful manner. We investigate the foundations of SPARQL query optimization by grouping into individual clusters using common substructures in the multiple SPARQL queries, propose a comprehensive set of query rewriting rules for the clustered group and finally Query execution provide the final result of optimized query. The proposed technique is efficient and scalable for multiple SPARQL query.
Keywords: RDF, Multiple SPARQL, Common substructures

[1] P. Roy, S. Seshadri, S. Sudarshan, and S. Bhobe. Efficient and extensible algorithms for multi query optimization. In SIGMOD, 2000.
[2] M. Stocker, A. Seaborne, and A. Bernstein. SPARQL basic graph pattern optimization using selectivity estimation. In WWW, 2008.
[3] D. J. Abadi, A. Marcus, S. R. Madden, and K. Hollenbach. Scalable semantic web data management using vertical partitioning. In
VLDB, 2007.
[4] T. Neumann and G. Weikum. RDF-3X: a RISC-style engine for RDF. In PVLDB, 2008.
[5] M. Atre, V. Chaoji, M. J. Zaki, and J. A. Hendler. Matrix "bit" loaded: A scalable lightweight join query processor for RDF data. In
WWW,2010.
[6] A. Kementsietsidis, F. Neven, D. V. de Craen, and S. Vansummeren. Scalable multi-query optimization for exploratory queries over
federated scientific databases. PVLDB, 2008.
[7] M. Hong, A. J. Demers, J. Gehrke, C. Koch, M. Riedewald, and W. M. White. Massively multi-query join processing in
publish/subscribe systems. In SIGMOD, 2007.
[8] K. O'Gorman, D. Agrawal, and A. E. Abbadi. Multiple query Optimization by cache-aware middleware using query teamwork. In
ICDE, 2002.
[9] A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review.ACM Comput. Surv., 1999.
[10] M. Schmidt, M. Meier, and G. Lausen. Foundations of SPARQL query optimization. In ICDT, 2010.