Cloud computing (CC) is new technology for hosting and delivering services over the Internet. It moves computing and data away from desktop and portable PCs into large data centers.CC is a Internet based computing, the entire data reside over a set of networked resources, this data can be accessed through virtual machines like i phone, PC etc.CC help to reduce hardware, maintenance and installation cost. But security and privacy is the two major issues in this field and it prevent users for trusting CC. Cloud computing share distributed resources in the open environment via the network, so it makes security problems .To keep user data highly confidentially against un-trusted servers and from malicious attacks is very important. Encryption is the one of the most secured way using prevent unauthorized access. Hence we provide a new method for Cloud Computing Security by applying RSA algorithm and Fermat's theorem together. Its help to build a new trusted cloud computing environment. By using Fermat's theorem can be speed up the RSA Encryption.

 

Keywords: -Cloud computing, Decryption, Encryption, Fermat's little theorem, RSA

[1] YashpalsinhJadeja, KiritModi,cloudcomputing-concepts,architecture,challenges, International Conference on Computing, Electronics and Electrical Technologies,vol.1,pp.877-880,2012
[2] Sameer Rajan, ApurvaJairath Cloud Computing: The Fifth generation of Computing ,International Conference onCommunication Systems and Network Technologies IN 2011
[3] florin ogigau-neamtiu, Cloud Computing Security Issues, journel of defense resource management.vol.3,issue 2(5),pp 141-148,2012
[4] PeeyushMathur, Nikhil Nishchal, Cloud Computing: New challenge to
[5] the entire computer industry, 2010 1st International Conference on Parallel, Distributed and Grid Computing (PDGC - 2010).

Our Indian public distribution system involves corruption and this is due to the involvement of manual work. Though the government is providing an AADHAR number for authentication, there also occurs some chance in the corruption of goods so in this paper we are providing an RFID card. This card is to identify that, only the card holder is using this card, facial recognition is also used. When the person enters the shop holding a card the camera recognize the image of the person in the database of the PC. If the image matches the required goods are delivered. A database is maintained to know the quantity of goods sold and are remaining in the stack. This information is send to the government via GSM. Amount of goods to be distributed are displayed on the LCD display.

 

Keywords: - Rfid Reader, Gsm, Facial Recognition, At Commands.

[1] Rajesh C. Pingle and P. B. Burial, "Automatic rationing for public distribution system using RFID and GSM module for preventing smuggling of goods", 2011.
[2] Z. Zyonar, Karl Kammelander, Peter Jung, "evolution towards 3rd Generation Systems", 1988.
[3] Jorg Eberspacher, Hans-Joerg Vogel, Christian Bettstetter,"GSM Architecture. Protocols and Services", 2008.
[4] RFID Journal,"Wal-mart is RFID process. Changes". http://www. Intrinsic-id.com/cryptocores.htm
[5] S. Lahiri, RFID Sourcebook, USA: IBM press, 2006.

Lignocellulosic Biomass is considered to be the best option for biofuels production, due to the energy and food security concerns related to the use of other wastes, but this biomass has limited digestibility due to many factors like particle size, crystallinity of cellulose, lignin content etc. Pre-treatments enhance the digestibility by reducing the effect of these factors. Different pretreatment types exist, but now microwave pretreatment (individual or combined with other pretreatments) is becoming common due to its better results. This paper reviews the advantages of using lignocellulosic biomass in terms of the biofuels obtained from it, common pretreatments applied on it, and the effects of microwave pretreatments (individual and combined) over it.

 

Keywords: - Biomass, Lignocellulose, Microwave, Pretreatment

[1] FatihDemirbas, Mustafa Balat, HavvaBalat, (2011), Biowastes-to-biofuels, Energy Conversion and Management, Volume 52, Issue 4, pp.1815-1828.

[2] C. Escamilla-Alvarado, E. Ríos-Leal, M.T. Ponce-Noyola, H.M. Poggi-Varaldo,Gas biofuels from solid substrate hydrogenogenic-methanogenic fermentation of the organic fraction of municipal solid waste, Process Biochemistry, Volume 47, Issue 11, November (2012), Pages 1572-1587.
[3] Hahn-Hagerdal, B., Galbe, M., Gorwa-Grauslund, M.F., Liden, G., Zacchi, G., (2006). Bio-ethanol – the fuel of tomorrow from the residues of today. Trends Biotechnol. 24, 549–556.
[4] UNEP. Converting Agriculture Biomass into a resource, 2009.

[5] C. Escamilla-Alvarado, F. Esparza-García, E. Ríos-Leal, R. Hernandez-Vera, M.T. Ponce-Noyola, H.M. Poggi-Varaldo, Gas Biofuels from Solid Substrate Hydrogenogenic-Methanogenic Fermentation of the Organic Fraction of Municipal Solid Waste, Journal of Biotechnology, Volume 150, November (2010), Pages 13-14.

Finding connected components of a graph is a fundamental problem in graph theory which arises in many different applications including data mining and network analysis. By increasing popularity of social networks and information systems, scale of real world graphs have increased to billions of nodes and edges. Thus, finding connected components of large scale graphs turned to be a computationally challenging task. Because of this, in recent years, there has been some works addressing this problem using the well-known MapReduce distributed large scale data processing framework. However, they do not have acceptable performance and sstill tere is great potential for imporvments. In this paper, we introduce a new approach for finding connected components of large scale graphs using MapReduce framework. Based on the results of the experiments on real-world datasets, we show that, by using the new algorithm, significant performance improvements have been gained. We also explain that the main idea of our algorithm is based on a general theory for effective utilization of computational resources provided by nodes in a MapReduce cluster to reduce communication and IO load.

 

Keywords: - Complex Networks, Connected Components, Large Scale Graph Processing, MapReduce

[1] J. Cohen, Graph twiddling in a MapReduce world, Computing in Science & Engineering, 11, 2009, 29-41.
[2] J. Dean and S. Ghemawat, MapReduce: simplified data processing on large clusters, Communications of the ACM, 51, 2008, 107-113.
[3] U. Kang, C. E. Tsourakakis, C. Faloutsos, Pegasus: A peta-scale graph mining system implementation and observations, Proc. 9th IEEE Interntional Conf. on Data Mining, Miami, FL, 2009, 229-238.
[4] U. Kang, C. E. Tsourakakis, C. Faloutsos, Pegasus: mining peta-scale graphs, Knowledge and Information Systems, 27, 2011, 303-325.
[5] J. Lin and M. Schatz, Design patterns for efficient graph algorithms in MapReduce, Proc. 8th ACM Conf. on Workshop on Mining and Learning with Graphs, 2010, 78-85.

The main element in any missile tracking system is the dynamic state estimator. kalman filter is the most popular estimate approach to recursive linear estimation. This paper proposes and investigates the use of this method in missile tracking system.

 

Keywords: - missile, tracking, position, estimation, kalman filter, Gaussian, Algorithm.

[1] Bayesian state estimation for tracking and guidance using the bootstrap filter, N Gordon, D Salmond, C Ewing, Jornal of Guidance, Control, and Dynamics, vol. 18, No. 6, Nov. – Dec. 1995.
[2] Tutorial on Particle Filters for OnlineNonlinear/Non-Gaussian Bayesian Tracking M. Sanjeev Arulampalam, Simon Maskell, Neil Gordon, and Tim Clapp.
[3] Kalman Filter – Wikipedia – the free encyclopedia, march, 2013.
[4] Understanding and Applying Kalman Filtering, Lindsay Kleeman, Department of Electrical and Computer Systems Engineering, Monash University, Clayton.

It is difficult in optical communication systems to predict the final signal at the customer side because of using various components and the effect of many features. Simulation helps to analyze and expect the performance before any actual hardware is done. In the proposed research, Optisystem 12th version software is used in order to analyze transmitting 40Gb/s, 10Gb/s for each channel, in four channels of coarse wavelength division multiplexing (CWDM) from the transmitter to the receiver based on extinction ratio and the distance of the optical fiber until 100km. An Erbium-Doped Fiber Amplifier (EDFA) is used for long distances. The objective of the simulation is to certify that the received signals are not affected by the noise and attenuation so they are undamaged and in good condition by using bit error rate (BER) analyzer. From the simulation obtained, maximum Q factor, eye height, and threshold decreased as the fiber length increased, and as the value of the extinction ratio increased, the eye height increased but threshold decreased. The results of the CWDM are presented in this paper.

 

Keywords: -Bit Error Rate (BER), Coarse Wavelength Division Multiplexing (CWDM), Erbium-Doped Fiber Amplifier (EDFA),

[1] Gerd Keiser, OPTICAL FIBER COMMUNICTION, 2013th ed. New Delhi, India: McGraw Hill Education.

[2] Jincy Johny and Sreenesh Shashidharan , "Design and Simulation of a Radio Over Fiber System and its Performance Analysis," IEEE Optical Networking Technologies and Data Security , pp. 536-539, 2012.

[3] Seoijin Park, R. Leavitt, R. Enck, V. Luciani, Y. Hu, P. J. S. Heim, D. Bowler, and M. Dagenais , "Semiconductor Optical Amplifier for CWDM Operating Over 1540–1620 nm," IEEE PHOTONICS TECHNOLOGY LETTERS, vol. 17, no. 5, pp. 980-982, MAY 2005.

[4] Atousa Assadihaghi, Hassan Teimoori, Ronald Millett, Abdessamad Benhsaien, Valery Tolstikhin, Trevor Hall, and Karin Hinzer , "O-band Semiconductor Optical Amplifier Design for CWDM Applications," IEEE, pp. 89-92, 2008.

[5] Kenneth C. Reichmann, Patrick P. Iannone, Xiang Zhou, Nicholas J. Frigo, and B. Roe Hemenway , "240-km CWDM Transmission Using Cascaded SOA Raman Hybrid Amplifiers With 70-nm Bandwidth," IEEE PHOTONICS TECHNOLOGY LETTERS, vol. 18, no. 2, pp. 328-330, JANUARY 2006.