Volume-1 Issue-2

S. No

Volume-1 Issue-2, December 2011, ISSN:  2249-8958 (Online)
Published By: Blue Eyes Intelligence Engineering & Sciences Publication Pvt. Ltd. 

Page No.

1.

Authors:

Gurdeepinder Singh, Rajni Bala

Paper Title:

Automatic Generation & Voltage Control of Interconnected Thermal Power System Including Load Scheduling Strategy

Abstract:   This paper deals with the automatic generation control (AGC) of three area interconnected thermal power systems with combination of the automatic voltage control using automatic voltage regulator (AVR). The interconnected thermal unit is considered with three area concept. The primary object of the AGC is to balance the total system generation against system load and losses, so that the desired frequency and power interchange with neighboring systems are maintained in order to minimize the transient deviations and to provide zero steady state error in appropriate short time. Further the role of automatic voltage regulator is to maintain the terminal voltage of synchronous generator in order to maintain the bus bar voltage. Otherwise bus bar voltage goes beyond permitted limit. The interaction between active and reactive power demand is also analyzed in this paper. In this paper Load scheduling strategy is also considered in combination with AGC and AVR, in which utility takes steps to control the peak demand of plant by shifting peak load of different consumers towards valley with the aim of system stability, minimize the generation cost, postpone/ delay construction of new plant. Literature survey also shows, almost no attempt is made to combine the AGC with load scheduling strategy.

Keywords:  Automatic Generation Control (AGC), Automatic Voltage Control (AVR), Area Control Error (ACE), Load Scheduling Strategy (LSS).

References:
1.        I.J. Nagrath, and D.P. Kothari,, “Power system engineering,”  Tata McGraw Hill Co., New Delhi, Ch: 8, 2001, pages 339-378.   
2.        Hadi Saadat, “power system analysis,” Tata Mcgraw hill, Ch: 12, 2002, pages 527-579.
3.        O.I. Elgard, “Electrical Energy System theory an Introduction”, McGraw-Hill, New Delhi, 2005, Ch: 9, pages 299-361.
4.        C. Concordia and L.K. Kirchmayer, “Tie-line Power and Frequency Control of Electric Power Systems-Part II”, AIEE Trans., Volume 73, part III A, 1954, pp. 133-146.
5.        V. Donde, M.A. Pai, and I.A. Hiskens, “Simulation and Optimization in an AGC System after deregulation,” IEEE transaction on Power System, vol.16, No. 3, 2001,  pp 481-488.
6.        S. Mukhopadhyay and A.K. Rajput, “Demand side management and load control: An Indian experience,” IEEE trans. on power and Energy Society General Meeting., 2010.
7.        D.N. Ewart, “Automatic Generation control- Performance under Normal Conditions,” System engineering for power: Status and Prospects, U.S Government Document, CONF-750867, 1975,  pp 1-14.
8.        A. I. Cohen , “An Optimization Method for Load Management Scheduling,” IEEE transactions on Power Systems, Vol. 3, No. 2, 1988 , pp. 612-618.
9.        G. V. Hicks and Jeyasurya, B, “An investigation of automatic generation control for an isolated transmission system,” IEEE Canadian Conference on Electrical and Computer Engineering, Vol. 2, 1997, pages: 31- 34.                                     
10.     Li Pingkang and Ma Yongzhen, “Some New Concept in Modern Automatic Generation Control Realization,” IEEE Trans. on Power System, 1998,  pp. 1232.
11.     C.C.A Rajan, “Demand side management using expert system,” IEEE Conference on Convergent Technologies for Asia-Pacific Region, 2003.
12.     Dong Yao and Zhiqiang Gao, “Load Frequency Control for Multiple-Area Power Systems,” American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA, 2009.
13.     Lim Yun and Philip Taylor, “Innovative Application of Demand Side Management to Power Systems,” First International Conference on Industrial and Information Systems, ICIIS 2006, pp. 8 - 11, Sri Lanka.

1-7

2.

Authors:

Anubhuti Khare, Manish Saxena, Rajesh Kourav

Paper Title:

Analysis of the Character statics of Video Streaming on WLAN Networks

Abstract:   The  bursty    nature    of  video    streaming applications  is due  to the frame-based  structure  of video and this has an important impact on the resource requirements  of the WLAN, affecting its  ability  to  provide  Quality  of  Service (QoS)    particularly  under  heavily  loaded  conditions.  In  this paper, we analyse the unique delay characteristic of video streaming applications in a WLAN environment. We show that the  “burstiness” of  video is  due  to  the  frame-based nature  of encoded video. We show how each  video  frame  is  transmitted as  a   burst  of   packets  that   is queued   at   the   Access   Point causing  the  delay  to  exhibit  a sawtooth-like characteristic over time that is related to the frame rate and frame structure of the encoded video. In this paper, not only do we consider the end-to- end delay, but more importantly we consider the total delay required to transmit the entire video frame. We present experimental results for VBR and CBR video streams and calculate the  upper  bounds  on  video  encoding parameters for streaming real-time interactive video over a WLAN.

Keywords:  WLAN, Videostreaming, Connectivity

References:
1.  J. Wexler, S. Taylor, “2004 Wireless LAN State of the Market Report”,Webtorials,Feb.2004,[Online].Available: http://www.webtorials.com/main/resource/papers/taylor/paper4/2004-WLAN.pdf
2.        Y. Wang, S. Wengers, J. Wen, A.K. Katsaggelos, “Error resilient video coding techniques”, IEEE Signal Processing Mag., vol. 17, no. 4, pp. 61-82, July 2000
3.        N. Cranley, M. Davis, “Delay Analysis of Video Streaming over IEEE 802.11b WLAN Networks”, submitted to IEEE Electronic Letters, 5th November 2005
4.        Darwing Streaming Server, http://developer.apple.com/darwin/projects/streaming/
5.        RTPTools, http://www.cs.columbia.edu/IRT/software/rtptools/ WinDump, http://windump.polito.it/ NetTime,  http://nettime.sourceforge.net/
6.        S. B. Moon, P. Skelly, D. Towsley, “Estimation and Removal of Clock Skew from Network Delay Measurements”, in  Proc. Of IEEE InfoComm’99, March 1999
7.        MPEG4IP, http://mpeg4ip.sourceforge.net/index.php
8.        “HintTrack,Format”, http://developer.apple.com/documentation/QuickTime/REF/Strea ming.29.htm#pgfId=19901
9.        N.  Cranley,  M.  Davis,  “Performance Evaluation  of  Resource Usage for Unicast Video Streaming over IEEE 802.11 WLAN Networks”, 5th Workshop on Applications and Services in Wireless Networks ASWN 2005, Paris, France, July 2005
10.     N. Cranley, M. Davis, “Performance Analysis of Network-level QoS  with Encoding Configurations for Unicast Video Streaming over IEEE 802.11 WLAN Networks”, WirelessCom 2005, Maui, Hawaii, June 2005
11.     J. Jun, P. Peddabachagari, M. Sichitiu, “Theoretical Maximum Throughput of IEEE 802.11 and its Applications”, in Proceedings of the Second IEEE International Symposium on Network Computing and Applications, Washington, DC, USA, 2003
12.     N. Cranley, M. Davis, “The Effects of Background Traffic on the  End-to-End  Delay  for  Video  Streaming  Applications over IEEE 802.11b WLAN Networks” submitted to The 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’06)

8-14

3.

Authors:

Anubhuti Khare, Manish Saxena, Rajesh Kourav

Paper Title:

Subatomic particle Sensitivity of Gigabyte Networks

Abstract:   We have presenting subatomic particle radiation testing of the    57710 network controller. It shows that there is a SEFI mode that could  cause the  internal network to  become unavailable every two to 1136 years with the TCP/IP protocol and every five to 2276 years using the UDP protocol based on location and solar activity. To use intersystem networks, devices will need network controllers and switches. These devices are likely to be affected by single-event effects, which could affect data communication. In this paper, we will present radiation data and performance analysis for using a Broadcom network controller in a neutron environment.

Keywords:  Networking, WLAN, Security

References:
1.        A. Komornicki, G.  Mullen-Schultz, and  D.  Landon, ―Roadrunner: Hardware and software overview,‖ 2009 [Online]. Available: http://www.redbooks.ibm.com/abstracts/REDP4477.html
2.        [Broadcom  BCM57710  product  brief,‖  2008  [Online]. Available: http://ko.broadcom.com/collateral/pb/57710 -PB05-R.pdf
3.        A. Silburt, A. Evans, I. Perryman, S.-J. Wen, and D. Alexandrescu, ―Design for soft error resiliency in internet core routers,‖ IEEE Trans.Nucl. Sci., vol. 56, no. 6, pp. 3551 –3555, Dec. 2009.
4.        T.-Y. Chuang, E. Schmidt, and S.-J. Wen, ―Platform neutron testing for single event upset (SEU),‖ in Proc. IEEE SELSE, Mar.2009 [Online].Available: http://selse5.selse.org/program.html
5.        A. Silburt, A. Evans, I. Perryman, S.-J. Wen, and D. Alexandrescu,―Specification and verification of soft error performance in reliable internet core routers,‖ IEEE Trans. Nucl. Sci., vol. 55, no. 4, pp.2389–2398, Aug. 2008.
6.        S. Buchner, ―Evaluation of commercial communication network pro- tocols for space application,‖ 2003.
7.        BCM57710/BCM57711  programmer’s   guide:   Highly integrated media access controller programmer’s guide,‖ BroadCom, Irvine, CA, Tech. Rep. 57710_57711-PG200R, 2009. Iperf,‖ 2010 [Online].  Available: http://sourceforge.net/projects/iperf/  
8.        F. Halsall, Data Communications, Computer Networks, and Open Sys- tems.   Reading, MA: Addison-Wesley, 1996.
9.        E. Normad and T. Baker, ―Altitude and latitude variations in avionicsSEU and atmospheric nuetron flux,‖ IEEE Trans. Nucl. Sci., vol. 40, no. 6, pp. 1484 1490, Dec. 1993.
10.     Smith, ―An approach to graphs of linear forms (Unpublished work style),‖ unpublished.
11.     E. H. Miller, ―A note on reflector arrays (Periodical  style—Accepted for publication),‖ IEEE Trans. Antennas Propagat., to be published.
12.     J. Wang, ―Fundamentals of erbium-doped fiber amplifiers arrays (Periodical style—Submitted for publication),‖ IEEE J. Quantum Electron., submitted for publication.
13.     J. Kaufman, Rocky Mountain Research Lab., Boulder, CO, private communication, May 1995.
14.     Y. Yorozu, M. Hirano, K. Oka, and Y. Tagawa, ―Electron spectroscopy studies          on            magneto-optical       media and                plastic substrate interfaces(Translation Journals style),‖ IEEE Transl. J. Magn.Jpn., vol. 2, Aug. 1987, pp. 740–741 [Dig. 9th Annu. Conf. Magnetics Japan, 1982, p. 301].
15.     M.  Young,  The  Techincal  Writers  Handbook.  Mill Valley, CA: University Science, 1989.
16.     (Basic Book/Monograph Online Sources) J. K. Author. (year, month, day). Title (edition) [Type of medium]. Volume(issue). Available: http://www.(URL)
17.     J.  Jones.  (1991,  May  Networks  (2nd  ed.)  [Online].  Available: http://www.atm.com
18.     (Journal Online Sources style) K. Author. (year, month). Title. Journal [Type of medium]. Volume(issue), paging if given.
19.     R. J. Vidmar. (1992, August). On the use of atmospheric plasmas as electromagnetic reflectors. IEEE Trans. Plasma Sci. [Online]. 21(3).

15-21

4.

Authors:

Anubhuti Khare, Manish Saxena , Arun Kumar Mishra

Paper Title:

String Model Resonator High Accuracy Measurement For F B G Sensors

Abstract:   Fibre Bragg grating (FBG) sensors are widely accepted as strain and vibration monitoring devices for advanced composite mechanical structures.This paper describes a string resonator that is used for the interrogation system of a Fiber Bragg Grating (FBG) strain sensor. For several years now, civil engineers have been collaborating with researchers in the field of optoelectronics, in efforts to develop fiber optic sensing and monitoring systems for civil engineering structures. Optoelectronics are the core of the telecommunications industry and are an important part of sensing in the aerospace industry. In the last ten to twenty years, optoelectronic technology has emerged in the fields of civil engineering, manufacturing and biomedicine, etc., in products such as fiber optic sensors.The strain on the fiber piece is calculated from the measured frequency based on that the natural frequency of a string is a function of the applied absolute strain. Existing research considered a fiber as a string, but a fiber is not a string in the strict sense due to its bending stiffness, thus the fiber should be modeled as a beam accompanied with an axial force. In the vibration modeling, the relationship between the strain and the natural frequency is derived, and then the resonance condition is described in terms of both the phase and the mode shape for sustaining resonant motion. Several experiments verify the effectiveness of the proposed model of the fiber.

Keywords:  Smart structure, resonator fiber Bragg grating sensor, Tunable Optical Filter, beam model, Demodulation technique, string model.

References:
1.        D. Kersey, T. A. Berkoff, and W. W. Morey, “Multiplexed Fiber Bragg Grating Strain-Sensor System with a Fiber Fabry-Perot Wavelength Filter”, Optics Letters, Vol.18, No.16, pp.1370-1372, 1993
2.        Byeongha Lee, “Absolute Strain Measurement Using Fiber Bragg Grating”, Ph.D Thesis, Univ. of Colorado, 1996
3.        Leonard Meirovitch, “Analytical Methods in Vibrations”, Macmillan Publishing, 1967
4.        Hill K O and Meltz G, “Fiber Bragg grating technology fundamentals and overview”, J. Lightwave Technol.”, 1997 15 1263-76.
5.        Stuart T. Smith, Vivek G. Badami, Jami S. Dale, and Ying Xu, “Elliptical Flexure Hinges”, Rev. Sci. Instrum., Vol.68, No.3, pp.1474-1483, 1997
6.        M. Song, S. B. Lee, S. S. Choi, and B. Lee, “Simultaneous measurement of temperature and strain using two fiber Bragg gratings embedded in a glass tube,” Opt. Fiber Technol. 3, 194– 196 ~1997!.
7.        H. J. Patrick, G. M. Williams, A. D. Kersey, J. R. Pedrazzani, and A. M. Vengsarkar, “Hybrid fiber Bragg gratingylong period fiber grating sensor for strainytemperature discrimination,” IEEE Photon. Technol. Lett. 8, 1223–1225 ~1996!.

22-27

5.

Authors:

Tripti Sharma, Khomlal Sinha

Paper Title:

Intrusion Detection Systems Technology

Abstract:   Network security is one of the most important nonfunctional requirements in a system [1]. Over the years, many software solutions have been developed to enhance network security and this paper provides an insight into one such solution which has become prominent in the last decade i.e. Intrusion Detection System (IDS) [2]. In this paper, we have proposed an overview of intrusion detection system and their classification with advantages and disadvantages, and also providing the basic requirement of intrusion detection system.

Keywords:  Host based IDS, Intrusion Detection System, misuse IDS, network security, texanomy, etc

References:
1.        S. Stanford Chen, S. Cheung, R. Crawford, M. Dilger, J. Frank, J. Hoagland, K. Levitt, C. Wee, R. Yip, and D. Zerkle, “Grids - a graph based intrusion detection system for large networks”, 19th National Information Systems Security Conference, 1996.
2.        R. Heady, G. Luger, A. Maccabe, and M. Servilla. The Architecture of a Network Level Intrusion Detection System. Technical report, Department of Computer Science, University of New Mexico, August 1990
3.        Khaled Labib, Computer security and intrusion detection, Crossroads, Volume 11, Issue 1, p.p. 212-219, August 2004
4.        S. Axelsson. Research in intrusion detection systems: A survey. In Technical Report 98-17 (revised in 1999) Chalmers University of Technology, 1999.
5.        Teresa F. Lunt. A survey of intrusion detection techniques. Computers & Security, 12(4): p.p. 405-418, 1993.
6.        Aurobindo Sundaram , An Introduction to Intrusion   Detection, Crossroads, Volume 2, Issue 4, Pages: 3 – 7, 1996
7.        Sandeep Kumar. Classification and Detection ofComputer Intrusions. Ph.D. Dissertation, August 1995.
8.        E. Biermann, E. Cloete and L. M. Venter, A comparison of Intrusion Detection systems, Computers & Security, Volume 20, Issue 8, Pages 676-683, December 2001,
9.        Lubomir Nistor, Rules definition for anomaly based intrusion detection, 4th National Information Systems Security Conference, 1999.
10.     Elisa Bertino, Ashish Kamra, Evimaria Terzi, and Athena Vakali. Intrusion detection in rbac-administered databases. In ACSAC, pages 170-182, 2005.

28-33

6.

Authors:

Latika Pinjarkar, Kamal Mehta

Paper Title:

A Report on Differential Delay Analysis for Bus Codec

Abstract:   Design of portable consumer electronic devices such as mobile phones, video game   and other embedded systems are increasingly demanding  low power consumption to maximize the battery life, reduce weight and increase reliability. These types of power sensitive devices are equipped with  microprocessors as the processing elements and memories as the storage units. With current complementary metal oxide semiconductor technology a large portion of power consumption is consumed as dynamic power. Bus encoding techniques  for low power consumption  have been studied in the last couple of decades. Which includes Frequent Value Encoding method,  Bus Invert Coding method and Gray Encoding Method .But these techniques could  not become the part of Computer architecture because data profile based analysis was not done and delay based analysis was not done. So these techniques are not compatible to  incorporate in the computer architecture. The contribution of  our  work is to  design  a methodology for optimizing   CMOS circuits  to incorporate  the bus codec techniques by doing the delay based analysis.   

Keywords:  Bus encoding, Differential Delay, Glitches, Inertial Delay

References:
1.       Ji Gu,Hui Guo “An efficient segment bus invert coding method for instruction memory  data bus switching reduction” in EURASIP journal on embedded systems vol. 2009.
2.       M.R.Stan,W.P.Burleson “Bus Invert coding for low power I/O” IEEE transactions on VLSI systems,Vol 3,No 1,pp 49-58, 1995.
3.       M.S.Elrabaa,I.S.Abu Khater,and M.I. Elmasry, “Advanced  Low Power Digital CircuitsTechniques.Boston:Kluwer”  Academic Publishers, 1997.
4.       F.A. Najm, “ A Survey of power estimation techniques in VLSI circuits”.IEEE transactions on VLSI systems, vol 2,NO.4.pp 446 -455, 1994.
5.       T. Raja,V.D.Agrawal,M.L. Bushnell, “Variable input delay  CMOS logic for low power design” in proc. 18 th international conference on VLSI design, pp 596-604, 2005.
6.       Yuanlin Lu,V.D.Agrawal, “CMOS leakage and glitch minimization for  power performance tradeoff ” in journal of low power electronics Vol-2 ,pp 1-10,2006.
7.       T. Raja,V.D.Agrawal,M.L. Bushnell, “ Transister sizing of logic gates to maximize input delay variability ” in journal of low power electronics Vol-2,pp 121-128,2006.
8.       N.Mahapatra,A .Tareen and S.V.Garimella “ Comparison and Analysis of Delay Elements” in proc.   of IEEE Computer Society  Annual Workshop on VLSI , pp 81-86, 2000.
9.       T. Raja,V.D.Agrawal,M.L. Bushnell, “ Design of variable input delay gates for low dynamic power circuits ” . in  Proc. the international workshop on power and timing modeling, optimization and simulation, pp 436-445,2005.     
10.     V.D.Agrawal, “ Low power design by hazard filtering ” in proc. Of international conference on VLSI design , pp 193-197,1997 . 
11.     Tezaswi Raja “ Minimum dynamic power CMOS design with variable input delay logic”.

34-36

7.

Authors:

R. Karmakar, A.Biswas, S.Mukherjee, A.Deyasi

Paper Title:

Calculating Transmission Coefficient of Double Quantum Well Triple Barrier Structure having Parabolic Geometry using Propagation Matrix Method

Abstract:   Transmission probability of a parabolic double quantum well triple barrier structure in presence of finite thick contact barriers is computed using propagation matrix method for GaAs/AlxGa1-xAs material composition. This provides the idea of tunneling at energies less than barrier potential. Effect of different barrier thicknesses and well widths are independently studied on transmission coefficient, and also for a specified structure, material composition of barriers is varied to observe the tunneling effect. Propagation matrix method is used for simulation purpose, and computation is performed considering effective mass mismatch at junctions following BenDaniel Duke boundary conditions. Conduction band discontinuity is also incorporated in the analysis by virtue of that consideration. Contact and middle barrier widths are varied for the same composition for different applications.

Keywords:  Effective Mass Mismatch, Parabolic Quantum Well, Propagation Matrix, Transmission Coefficient 

References:
1.       A.R.Sugg and J.P.C.Leburton, “Modeling of modulation-doped multiple-quantum-well structures in applied electric fields using the transfer-matrix technique”, IEEE Journal of Quantum Electronics, Vol. 27, 1991, pp.  224-231.
2.       D.Joel and M.R.Singh, "Resonant tunneling in photonic double quantum well heterostructures", Nanoscale Research Letters, Vol. 5, 2010, pp. 484-488.
3.       A.Svizhenko, M.P.Anantram, T.R.Govindan and B.Biegel, “Two-dimensional quantum mechanical modeling of nanotransistors”, Journal of Applied Physics, Vol.91, 2002, pp. 2343-2354.
4.       G.B.Morrison and D.T.Cassidy, "A probability-amplitude transfer-matrix method for calculating the distribution of light in semiconductor lasers", IEEE Journal of Quantum Electronics, Vol. 39, 2003, pp. 431-437.
5.       K.Mukherjee and N.R.Das, "Effect of barrier asymmetry on tunneling current in double barrier quantum well structure", International Conference on Emerging Trends in Electronic and Photonic Devices & Systems, 2009.
6.       K.Talele and D.S.Patil, “Analysis of wavefunction, energy and transmission coefficients in GaN/AlGaN superlattice nanostructures”, Progress In Electromagnetics Research, Vol. 81, 2008, pp. 237-252.
7.       H.Yamamoto, "Resonant tunneling condition and transmission coefficient in a symmetrical one-dimensional rectangular double-barrier system", Applied Physics A: Materials Science & Processing, vol 42, 1987, pp. 245-248.
8.       C.E.Simion and C.I.Ciucu, “Triple–barrier resonant tunneling: a transfer matrix approach”, Romanian Reports in Physics, Vol.59, 2007, pp. 805-817.
9.       A.K.Ghatak, K.Thyagarajan, and M.R.Shenoy, “A novel numerical technique for solving the one-dimensional Schrödinger equation using matrix approach - application to quantum well structures”, IEEE Journal of Quantum Electronics, Vol.24, 1988, pp. 1524-1531.
10.     S.Adachi, “GaAs, AlAs and AlxGa1-xAs: Material Parameters for use in Research and device Applications”, Journal of Applied. Physics, vol. 58, 1985, R1.
11.     H.Cruz, “Resonant tunneling through parabolic quantum wells achieved by means of short period superlattices”, Solid State Communications, vol. 85, 1993, pp. 65-68.
12.     T.Yamaguchi, M.Kato and K.Tada, “A new variational method for calculating eigenenergy in various quantum wells on the basis of effective well width”, IEEE LEOS Conference Proceedings, vol. 2, 1994, pp. 293-294.   
13.     W.P.Yuen, “Exact analytic analysis of finite parabolic quantum wells with and without a static electric field”, Physical Review B, vol. 48, 1993, pp. 17316-17320.
14.     S.H.Pan, “Interband optical transitions of a parabolic quantum well in the presence of an applied midinfrared field”, Physical Review B, vol. 48, 1993, pp. 2292–2297.
15.     S.L.Chuang and D.Ahn, “Optical transitions in a parabolic quantum well with an applied electric field -analytical solutions”, Journal of Applied Physics, vol. 65, 1989, 2822-2826.
16.     V.K.Arora and H.N.Spector, “Electrical and optical properties of parabolic semiconducting quantum wells”, Surface Science, vol. 176, 1986, pp. 669-678.
17.     K.J.Wahlstrand and J.H.Yee, “Fourier series method applied to different shaped quantum well laser potentials”, Journal of Applied Physics, vol. 71, 1992, pp. 3894-3897.
18.     R.P.G.Karunasiri and K.L.Wang, “Infrared absorption in parabolic multiquantum well structures”, Superlattices and Microstructures, vol 4, 1988, pp. 661-664.
19.     D.L.Mathine, S.K.Myjak and G.N.Maracas, “A computational Fourier series solution of the BenDaniel-Duke Hamiltonian for arbitrary shaped quantum wells”, IEEE Journal of Quantum Electronics, vol. 31, 1995, pp. 1216-1222.
20.     J.G.S.Demers and R.Maciejko, “Propagation matrix formalism and efficient linear potential solution to Schrödinger’s equation”, Journal of Applied Physics, vol. 90, 2001, pp. 6120-6129. 
21.     T.P.Horikis, “Eigenstate calculation of arbitrary quantum structures”, Physics Letters A, vol. 359, 2006, pp. 345-348.

37-41

8.

Authors:

P. Satish Kumar, Ch. Lokeshwar Reddy, V. Ramu

Paper Title:

Space Vector PWM Algorithm for Diode Clamped Multi-level Inverters using Fractal Structure

Abstract:   In this paper a space vector pulse width modulation algorithm for diode clamped multilevel inverter fed induction motor using the fractal structure has been proposed and applied for three-level and five-level inverters. In this method, fractal structure is used to represent the space vector of multilevel inverters. The switching sequence is determined without using look up tables, so the memory of the controller can be saved. The 1switching times of voltage vectors are calculated at the same manner as two-level SVPWM. It is easy to implement the triangularisation algorithm, which is used to locate the tip of the reference voltage vector. Thus, the proposed method reduces the execution time and complexity of multi-level SVPWM. This method can be extended to n-level inverter also. Based on above method, the simulation is carried out for three-level and five-level inverter fed induction motor and results are presented   and analyzed. The obtained total harmonic distortions for three-level and five-level inverters are 5.70% and 3.61% respectively.

Keywords:  Fractal structure, Induction motor, Multi-level inverters, Modulation index, SVPWM, THD.

References:
1.       J.S.Lai and F.J. Peng, “Multilevel converters- a new breed of power converters,” IEEE Transactions on Industry Applications, Vol.32, pp.509-517, May/June 1996.
2.       A.Nabae, I.Takahashi and Akagi, “A new neutral point PWM inverters” IEEE Transactions on Industry Applications, Vol. 1A-17, pp.518-523, Sept./Oct.1981.
3.       Yo-Han Lee, Bum-Seok Suh and Dong-Seok Hyun, “ A novel PWM scheme for a three-level voltage source inverter with GTO thyristors” IEEE Transactions on Industry Applications, Vol.32, No.2, pp.260-268, April 1996.
4.       B.P. Gc Grath, D.G. Holmes and T.A. Lipo, “Optimized space vector switching sequences for multilevel inverters,” Proc. IEEE APEC, Anaheim, CA, pp.1123-1129, March 2001.5.       E. D. Karatsivos, G. A. Adamidis, T. G. Nathenas, “A New Space Vector Modulation Strategy for Multilevel Inverters,” XIX International Conference on Electrical
Machines - ICEM, Rome, pp.01-07 , 2010
6.       P.Satish Kumar, J.Amarnath and S.V.L. Narasimham, “An effective space-vector PWM method for Multi-level inverter based on two-level inverter,” International Journal of Computer and Electrical Engineering, Vol. 2, No. 2, pp.243-250, April 2010.
7.       Yie-Tone Chen and Kuo-Hsien Liu, “Analysis and Implementation of a Simplified Optimized Space Vector Modulation Strategy for Multilevel Inverter Based on the Equivalent Inverter”, International Conference on Power Electronics and Drive Systems- PEDS, pp.381-386, 2-5, Nov.2009.
8.       P.Satish Kumar, J.Amarnath and S.V.L. Narasimham, “A qualitative space vector PWM algorithm for a five-level neutral point clamped inverter,” ICGST-ACSE Journal, Vol. 9, Issue-1, pp.43-50, June 2009.
9.       F.Z. Peng, “A generalized multilevel inverter topology with self voltage balancing,” IEEE Transactions on Industry Applications, Vol.37, pp.611-618, March/April 2001.
10.     M. Steimer and J.K. Steinke, “Five-level GTO inverter for large induction motor drives,” Conf. Rec. IEEE-IAS Annual Meeting, pp.595-601, Oct.1991.
11.     Anish Gopinath and M.R. Baiju, “Space vector PWM for multilevel inverters-a fractal approach,” Conf. PEDS, pp. 842-849, 2007.
12.     Heinz Otto Peitgen, Harmut Jurgens, Dietmar Soupe, “Chaos and Fractals- New Frontiers of Science,” Second edition, Springer.

42-49

9.

Authors:

Anubhuti Khare, Manish Saxena, Rishabh Dubey

Paper Title:

Mimo-Ofdm Wireless Systems: Basics, Perspectives, And Challenges

Abstract:   Multiple-input multiple-output (MIMO) wireless technology in combination with orthogonal frequency division multiplexing (MIMOOFDM) is an attractive air-interface solution for next-generation wireless local area networks (WLANs), wireless metropolitan area networks (WMANs), and fourth-generation mobile cellular wireless systems. This article provides an overview of the basics of MIMO-OFDM technology and focuses on space-frequency signalling, receiver design, multiuser systems, and hardware implementation aspects. We conclude with a discussion of relevant open areas for further research.

Keywords:   MIMO , MIMOOFDM.

References:
1.        A. J. Paulraj, R. U. Nabar, and D. A. Gore, Introduction to Space-Time Wireless Communications, Cambridge, UK: Cambridge Univ. Press, 2003.
2.        A. J. Paulraj and T. Kailath, “Increasing Capacity in Wireless Broadcast Systems Using Distributed Transmission/ Directional Reception,” U.S. Patent no. 5,345,599, 1994.
3.        G. J. Foschini, “Layered Space-Time Architecture for Wireless Communication in a Fading Environment when Using Multielement Antennas,” Bell Labs Tech. J., Autumn 1996, pp. 41–59.
4.        I. E. Telatar, “Capacity of Multi-Antenna Gaussian Channels,”Euro. Trans. Telecommun., vol. 10, no. 6, Nov./Dec. 1999, pp. 585–95.
5.        V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space- Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction,” IEEE Trans. Info. Theory, vol. 44, no. 2, Mar. 1998, pp. 744–65.
6.        L. Zheng and D. N. C. Tse, “Diversity and Multiplexing: A Fundamental Trade-off in Multiple Antenna Channels,” IEEE Trans. Info. Theory, vol. 49, no. 5, May 2003, pp. 1073–96.
7.        G. G. Raleigh and J. M. Cioffi, “Spatio-Temporal Coding for Wireless Communication,” IEEE Trans. Commun., vol. 46, no. 3, 1998, pp. 357–66.
8.        H. Bölcskei, D. Gesbert, and A. J. Paulraj, “On the Capacity of OFDM-Based Spatial Multiplexing Systems,” IEEE Trans. Commun., vol. 50, no. 2, Feb. 2002, pp. 225–34.
9.        M. Borgmann and H. Bölcskei, “Interpolation-Based Efficient Matrix Inversion for MIMO-OFDM receivers,” Proc. 38th Asilomar Conf. Signals, Syst., and Computers, Pacific Grove, CA, Nov. 2004, pp. 1941–47.
10.     I. E. Telatar and D. N. C. Tse, “Capacity and Mutual Information of Wideband Multipath Fading Channels,” IEEE Trans. Info. Theory, vol. 46, no. 4, July 2000, pp. 1384–1400.
11.     H. Bölcskei and A. J. Paulraj, “Space-Frequency Coded Broadband OFDM Systems,” Proc. IEEE Wireless Commun. and Networking Conf., Chicago, IL, Sept. 2000, pp. 1–6.
12.     [G. Caire, G. Taricco, and E. Biglieri, “Bit-Interleaved Coded Modulation,” IEEE Trans. Info. Theory, vol. 44, no. 3, May 1998, pp. 927–46.
13.     X. Ma and G. B. Giannakis, “Full-Diversity Full-Rate Complex-Field Space-Time Coding,” IEEE Trans. Sig. Processing, vol. 51, no. 11, Nov. 2003, pp. 2917–30.
14.     M. Borgmann and H. Bölcskei, “Noncoherent Space- Frequency Coded MIMO-OFDM,” IEEE JSAC, vol. 23, no. 9, Sept. 2005, pp. 1799–1810.
15.     G. Caire and S. Shamai (Shitz), “On the Achievable Throughput of a Multiantenna Gaussian Broadcast Channel,” IEEE Trans. Info. Theory, vol. 49, no. 7, July 2003, pp. 1691–1706.
16.      M. E. Gärtner and H. Bölcskei, “Multi-User Space- Time/Frequency Code Design,” Proc. IEEE ISIT, Seattle, WA, July 2006.
17.     S. Visuri and H. Bölcskei, “Multiple Access Strategies for Frequency-Selective MIMO Channels,” IEEE Trans. Info. Theory, Sept. 2006 (to appear).
18.     D. Perels et al., “ASIC Implementation of a MIMOOFDM Transceiver for 192 Mb/s WLANs,” Euro. Solid- State Circuits Conf., Sept. 2005, pp. 215–18.
19.     A. P. Burg, “VLSI Circuits for MIMO Communication Systems,” Ph.D. dissertation, ETH Zurich, Switzerland, 2006.
20.     M. Borgmann and H. Bölcskei, “On the Capacity of Noncoherent Wideband MIMO-OFDM Systems,” IEEE Int’l. Symp. Info. Theory, Adelaide, Australia, Sept. 2005, pp. 651–55.

50-55

10.

Authors:

K. Satyanarayana, J. Amarnath, A. Kailasa Rao

Paper Title:

Hybrid PWM Algorithm Based Vector Controlled Induction Motor Drive to Achieve Superior Waveform Quality

Abstract:   This paper presents a Hybrid PWM Algorithm Based Vector Controlled Induction Motor Drive to Achieve Superior Waveform Quality. The proposed algorithm uses six basic bus-clamping PWM (BBCPWM) sequences along with the conventional SVPWM (CSVPWM) sequence and these switching sequences have been developed by using the concept of imaginary switching times without using the angle and sector information. The proposed Hybrid PWM(HPWM) algorithm selects a suitable PWM sequence which results in lowest rms current ripple over a given sampling time interval. To validate the proposed HPWM algorithm, numerical simulation studies have been carried out and the results have been presented and compared.

Keywords:  CSVPWM, BBCPWM, HPWM, Induction motor, vector control.

References:
1.       F. Blaschke “The principle of field orientation as applied to the new transvector closed loop control system for rotating-field machines," Siemens Review, 1972, pp 217-220.
2.       Heinz Willi Vander Broeck, Hnas-Christoph Skudelny and Georg Viktor Stanke, “Analysis and realization of a pulsewidth modulator based on voltage space vectors” IEEE Trans. Ind. Applicat., vol. 24, no. 1, Jan/Feb 1988, pp. 142-150.
3.       Ahmet M. Hava, Russel J. Kerkman and Thomas A. Lipo, “Simple analytical and   graphical methods for carrier-based PWM-VSI drives” IEEE Trans. Power Electron. vol. 14, no. 1, Jan 1999, pp. 49-61.
4.       Dae-Woong Chung, Joohn-Sheok Kim and Seung-Ki Sul, “Unified voltage modulation technique for real-time three-phase power conversion” IEEE Trans. Ind. Applicat., vol. 34, no. 2, Mar/Apr 1998, pp. 374-380
5.       G.Narayanan , Di Zhao, H. Krishnamurthy and Rajapandian Ayyanar, “Space vector based hybrid techniques for reduced current ripple” IEEE Trans. Ind. Applic., Vol.55, No.4, pp.1614-1626, April 2008.
6.       D. Casadei, G. Serra, A. Tani, and L. Zarri, “theoretical and experimental analysis for the RMS current ripple Minimization in induction motor drives controlled by SVM technique”  IEEE Trans. Ind. Electron., vol.51, no.5, pp.1056,-1065, Oct, 2004.
7.       Di Zhao, V.S.S. Pavan Kumar Hari, G. narayanan and R, Ayyanar, “space-vector-based hybrid Pulsewidth modulation techniques for reduced harmonic distortion and switching losses” IEEE. Trans. Power Electron., vol.25, no.3, pp.760-774, March, 2010.
8.       T. Brahmananda Reddy, J. Amarnath and D. Subbarayudu, “Improvement of DTC performance by using hybrid space vector Pulsewidth modulation algorithm” International Review of Electrical Engineering, Vol.4, no.2, pp. 593-600, Jul-Aug, 2007.

56-63

11.

Authors:

Anubhuti Khare, Manish Saxena, Vijendra Singh Mandloi

Paper Title:

Performance Analysis of V-Blast Based MIMO-OFDM System with Various Detection Techniques

Abstract:   This paper presents the performance analysis of V-BLAST based multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) system with respect to bit error rate per signal to noise ratio (BER/SNR) for various detection techniques viz zero forcing (ZF), minimum mean square error (MMSE) and maximum likelihood (ML). A 2X2 MIMO-OFDM system is used for the performance evaluation. The simulation results shows that the performance of V-BLAST based detection techniques is much better than the conventional methods.

Keywords:  Vertical Bell Labs Layered Space-Time (V-BLAST); multiple input multiple output (MIMO); orthogonal frequency division multiplexing (OFDM); bit error rate (BER); signal to noise ratio (SNR).

References:
1.       S. Cui, A. J. Goldsmith, and A. Bahia (August, 2004). "Energy-efficiency of MIMO and Cooperative MIMO in Sensor Networks". IEEE journal Select. Areas of Communication. 22 (6): 1089–1098.
2.       Sam P. Alex and Lousy M.A. Jalloul, "Performance Evaluation of MIMO in IEEE802.16e/WiMAX", IEEE J. of Selected Topics in Signal Processing, VOLUME 2, NUMBER 2, April, 2008.
3.       R. Xu and F. C. M. Lau, “Performance analysis for MIMO systems using zero forcing detector over fading channels,” IEE Proc. Communications, vol. 153, no. 1,2, pp. 74 – 80, February 2006.
4.       Al-Dhahir, “FIR Channel-Shortening Equalizers for MIMO ISI Channels”, IEEE Trans. Communication vol. 49, pp.213-218, Feb. 2001.
5.       Al-Dhahir, “FIR Channel-Shortening Equalizers for MIMO ISI Channels”, IEEE Trans. Communication vol. 49, pp.213-218, Feb. 2001.
6.       Xu Zhu and Ross D. Murch,” Performance Analysis of Maximum Likelihood Detection in a MIMO Antenna System”, IEEE Transactions on Communications, VOLUME 50, NUMBER 2, FEBRUARY 2002.
7.       Proakis, John G. (1995). Digital Communications. Singapore: McGraw Hill. ISBN 0-07-113814-5.
8.       B. Yang, Z. Cao, and K. Letaief, “Analysis of Low-Complexity Windowed DFT-Based MMSE Channel Estimation for OFDM Systems,” IEEE Trans. Communication., VOLUME 49, pp. 1977–1987, Nov. 2001.
9.       W. Y an, S. Sun and Z. Lei, “A low complexity VBLAST OFDM detection algorithm for wireless LAN systems,” IEEE Communication. Letter, VOLUME 8 , pp. 347-376, June 2004.
10.     W. Y an, S. Sun and Z. Lei, “A low complexity VBLAST OFDM detection algorithm for wireless LAN systems,” IEEE Communication. Letter, VOLUME 8 , pp. 347-376, June 2004.

64-67

12.

Authors:

Anubhuti Khare, Manish Saxena, Heena A Jain

Paper Title:

AMBTC-Compressed Image Using Genetic Algorithm

Abstract:   In this paper, we present an image-hiding scheme based on genetic algorithm. The secret messages are embedded into a compressed image of AMBTC. Genetic algorithm is enveloped to find the best substitution of AMBTC bitmap. The proposed scheme provides high visual quality of the stego-image. The enhanced system of the proposed scheme increases embedding capacity while retaining good quality of the stego-image. Experimental results show that the proposed scheme outperform the comparative schemes.

Keywords:  AMBTC, Genetic Algorithm

References:
1.        C. C. Chang, T. S. Chen and L. Z. Chung, “A steganographic method based upon JPEG and quantization table modification,” Information Sciences, vol. 141, pp. 123- 138, 2002.
2.        C. C. Chang, C. Y. Lin, and Y. H. Fan, “Lossless Data Hiding for Color Images Based on Block Truncation Coding,“ Pattern Recognition, vol. 41, no. 7, pp. 2347-2357, Jul. 2008.
3.        E. J. Delp and O. R. Mitchell, “Image coding using block truncation coding,” IEEE Transactions on Communications, vol. 27, pp. 1335-1342, 1979.
4.        A. Eskicioglu and L. Litwin, “Transform domain analysis of DES,” IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 2065-2073, 1999.
5.        A. Eskicioglu and L. Litwin, “Cryptography,” IEEE Potentials, vol. 20, no. 1, pp. 36-38, 2001.
6.        M. Jo and H. D. Kim, “A digital image watermarking scheme based on vector quantisation,” IEICE Transactions on Information and Systems, vol. E85-D, no. 6, pp. 1054- 1056, 2002.
7.        H. K. Pan, Y. Y. Chen and Y. C. Tseng, “A secure data hiding scheme for two-color images,”  roceedings of IEEE Fifth Symposium on Computers and Communications, Antibes, France, pp. 750-755, July 2000.
8.        J. Spaulding, H. Noda, M. N. Shirazi and E. Kawaguchi, “BPCS steganography using EZW lossy compressed images,” Pattern Recognition Letters, vol. 23, pp. 1579- 1587, 2002.
9.        P. Tsai, Y. C. Hu, and C. C. Chang, “An image hiding technique using block truncation coding,” Proceedings of Pacific Rim Workshop on Digital Steganography, Kitakyushu, Japan, pp. 54-64, July 2002.
10.     R. G. Van Schyndel, A. Z. Tirkel and C.F. Osborne, “A digital watermark,” Proceedings of theIEEE International Conference on Image Processing, vol. 2, Austin, Texas, USA, pp. 86-90, 1994.

68-71

13.

Authors:

Abha Tamrakar, Vinti Nanda

Paper Title:

Compression of Watermarked Relational Database for Security and Optimization of Storage Consumption

Abstract:   Today’s competitive world demands speed. If we are slow then we will be a loser. Providing security speedily is the aim of this paper. Relational database are very important for satisfying today’s informational needs. More crucial phase is preventing its ownership rights. In earlier existing system security was provided by sending the encrypted relational database to the client system without compressing its size hence doesn’t increases the speed of transfer rate. To overcome this limitation we are using compression technique which will provide security as well increases the speed of data transfer between clients to server system. 

Keywords:  Compression, ownership rights, Speed, watermarked relational data.

References:
1.        N.Settipalli, R Manjula, ‘‘Securing   Watermarked relational  Encryption  and Decryption” ARPN Journal Vol. 1,pp. 70-74, May 2011.
2.        Y. Li, V. Swarup, and S. Jajodia, “Fingerprinting Relational Databases: Schemes and Specialties.” Vol. no. 2, pp. 456-460, March 2005.
3.        R. Sion, M. Atallah, and S.Prabhkar, “Right Protection for Relational Data.” IEEE  Trans. Knowledge and Data Engineering, Vol. 16 no.6, June 2004.
4.        D. Gross-Amblard, “Query-Preserving Watermarking of Relational Databases and XMLDocuments.” In PODS ‘03: Proceedings of the 22nd ACM SIGMOD-SIGACT
SIGART Symposium on Principles of Database Systems, pp. 191-201. ACM Press, 2003.
5.        A. Deshpande, J. Gadge, “New Watermarking Technique for Relational Databases.” Department of Computer Engineering, Thadomal Shahani  Engineering College, Mumbai, ICETET-2009.
6.        W. Ng and H. Lau, “Effective Approaches for Watermarking XML Data.” Department of Computer Science, the Hong Kong University of Science and Technology, Hong Kong, 2005.
7.        M. Atallah and S. Lonardi. “Authentication of LZ-77 Compressed Data.” In Proceedings of the ACM Symposium on Applied Computing, Florida, USA, 2003.
8.        R. Agrawal, J. Kiernan, “Watermarking Relational Databases.” IBM Almaden Research Center, china, 2002.
9.        F. P. Gonzalez and J.  R. Hernandez, “A Tutorial on Digital Watermarking.” Dept. Tecnologıas de las Communications, ETSI Telecom., Universidad de Vigo, Spain, 1999.
10.     F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn, “Attacks on Copyright Marking System.” Notes in Computer Science, Portland, Oregon, USA, 14 17 April, 1998.

72-76

14.

Authors:

Tripti Sharma, Bhupesh Kumar Dewangan

Paper Title:

Next Generation: Par of Cloud and Grid

Abstract:   In this paper we are showing the par of cloud and grid by comparing different fields. The main aim of this paper is to show the differences in terms of security, performance and resources used by both technologies. A Cloud computing technique is a cost-efficient computing approach in which the records or information and applications can be accessed from a Web browser by customers. A Computational Grid is a collection of heterogeneous computers and resources spread across multiple administrative domains with the intend of providing users easy access to these resources .This paper helps Grid and Cloud system users and administrators to have a clear difference between Grid and Cloud computing according to security, performance and resources.

Keywords:  cloud computing, grid computing, security, performance, Resources.

References:
1.       David Munoz Sanchez, Comparison between security solutions in Cloud and Grid Computing.
2.       Ian Foster, Yong Zhao, Ioan Raicu, Shiyong Lu, Cloud Computing and Grid Computing 360-Degree Compared.
3.       Derrick Kondo, Bahman Javadi, Paul Malecot, Franck Cappello, David P. Anderson, Cost-Benefit Analysis of Cloud Computing versus Desktop Grids.
4.       Judith M. Myerson . Cloud computing grid computing. March 2009. EECSDepartment. University of California, Technical Report No. UCB/EECS-2009-28, http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-28.html
5.       Ian Foster, What is the Grid? A Three Point Checklist.
6.       Copyright © Members of the EGEE-II Collaboration, 2006, an EGEE Comparative study: Grids and Clouds Evolution or Revolution.
7.       Kynetix Management Guide, Cloud Computing A Strategy Guide for Board Level Executives.
8.       Business Adoption of Cloud Computing . A berdeen Group.
9.       Government of India portal. [Online] Available  http://www.india.gov.in    
10.     Cloud computing-Resource management for effective  E- governance – Savita Bhatnagar.
11.     Pant Durgesh, Sharma M.K ,”Cloud Computing “, CSI Communication-2009,pp10-13,Vol-32,Issue 10.
12.     Manish Pokharel and Jong Sou Park, “Cloud Computing Future solution for e-Governance” .
13.     Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online  Michael Miller.
14.     Cloud Application Architectures: Building Applications & Infrastructure in the Cloud (Theory in Practice) George  Reese.
15.     Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance (Theory in Practice) by Tim Mathe.
16.     Dot Cloud: The 21st Century Business Platform Built on Cloud Computing Peter Fingar.
17.     www.cloudforum.org
18.     www.amazonwebservices.com
19.     http://www.trigyn.com/Default.aspx
20.     http://www.sinlung.com/2011/09/e-governance-gaining- ground-in.html
21.     http://soliver-reflectiveteacher.blogspot.com/
22.     http://t3.gstatic.com/images?q

77-80

15.

Authors:

Swati Devabhaktuni, S.V.Jayaram Kumar

Paper Title:

Performance Analysis of Self-Excited Induction Generator Driven At Variable Wind Speeds

Abstract:   This paper discusses steady state analysis and performance characteristics of a three-phase induction generator self excite with capacitor per phase. It is shown that for this mode of operation, there are certain ranges over which the values of the terminal capacitor, C, machine speed and load impedance have to be kept in order to maintain self excitation. In general, the performance characteristics are strongly influenced by the value of C and guidelines are suggested for selecting its proper value. This paper also presents the theoretical and experimental results of self excited induction generator under varying rotor speed operation of research. Three phase 3.7kW induction machine excited with symmetrical capacitor bank and loaded with symmetrical three phase resistive load, was the subject of investigation. Experimentally obtained results have been compared with calculated performance curves and very good agreement between them has been achieved.

Keywords:  wind turbine, self-excited induction generator, steady state analysis, performance characteristics

References:
1.        S.M.Alghuwainmen,”Steady-state analysis of self-excited induction generator including transformer saturation”,IEEE transactions on energy conversion,Vol.14,No.3,sep1999.
2.        T.F.Chan,L.L.Lai,”Steady state analysis and perfoamance of a single-phase self regulated self-xcitedinductionge”,IEEEproc.generation and transmission distribution,,Mar’02.
3.        S.M.Alghuwainmen,”Steady-state analysis of an isolated self-excited induction generator driven by regulated and unregulated turbine”,IEEE transactions on energy conversion,Vol.14,No.3,september1999.
4.        K.S.Sandhu,D.Joshi,”Steady state analysis of self-excited induction generator using phasor-diagram based iterative model”,WSEAS transactions on power systems,Issue12,volume3,December2008.
5.        A.I.Aloah,M.A.Alkanhal,”Analysis of three phase self excited induction generator under static and dynamic loads”IEEEProc.,1991.
6.        T.F.Chan,”Self-excited induction generators driven by regulated and unregulated wind turbines”,IEEE transactions on energy conversion,Vol.11,No.2,June1996

81-86

16.

Authors:

Jitender Sharma, Amit Kumar Garg

Paper Title:

Analysis of Tahoe: A TCP Variant

Abstract:   Internet has emerged as the basic need of the time. Internet has influenced every part of our life. Shopping, communication, entertainment, business, information, education all aspects of one’s life are available on internet There has been a tremendous increase, almost an exponential rise, in the number of internet users in the recent times, which resulted in the form of  congestion problem over the wide area network (WAN). Window size  is an important parameter to avoid congestion. The basic idea of this work is to simulate TCP Tahoe using NS2 at different delay times and window size, to find which is best suited window size for this variant, depending on the parameters like bandwidth and delay time.

Keywords:  RTT, AIMD, TCIP/IP, FAST TCP, TCP RENO, TCP TAHOE, TCP VEGAS, CWND.

References:
1.       C. Jin et al., “FAST TCP: From Theory to Experiments,” IEEE Network, vol. 19, no. 1, pp. 4– 11, Jan./Feb. 2005.
2.       J. Wang, D. X. Wei, and S. H. Low, ”Modelling and Stability of FAST TCP,” in Proc. IEEE INFOCOM 2005, Miami, FL, Mar. 2005.
3.       C. Jin, D. Wei, and S. H. Low, ”FAST TCP for high-speed long-distance networks,” Internet draft draft-jwl-tcp-fast-01.txt. [Online].               http://netlab.caltech.edu/pub/papers/draft-jwl-tcp-fast-01.txt.
4.       David X., Wei Cheng Jin, Steven H. Low Sanjay Hegde, “FAST TCP: Motivation, Architecture, Algorithms, Performance,” IEEE/ACM Transactions on Networking, 14(6):1246-1259, Dec 2006.
5.       Cheng Peng Fu, Bin Zhou, Jian Ling Zhang, “Modeling TCP Veno Throughput over Wired/Wireless Networks,” IEEE COMMUNICATIONS LETTERS, VOL. 11 NO. 9, SEPTEMBER 2007.
6.       Tomoya Hatano, Hiroshi Shigeno and Ken-ichi Okada, “TCP-friendly congestion Control for High Speed Network,” Proceedings of the 2007 International Symposium on Applications and the Internet (SAINT'07), 0-7695-2756-6/07 $20.00 © 2007 IEEE.
7.       Lori A. Dalton, Ciji Isen, “A Study on High Speed TCP Protocols,” IEEE Communications Societ, Globecom 2004.
8.       Liansheng Tan, Cao Yuan, Moshe Zukerman, “FAST TCP: Fairness and Queuing Issues,” IEEE COMMUNICATIONS LETTERS, VOL. 9, NO. 8, AUGUST 2005.
9.       T. V. Lakshman, Member, IEEE, and Upamanyu Madhow, Senior Member,IEEE, “The Performance of TCP/IP for Networks with High Bandwidth-Delay Products
and Random Loss,” IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 5, NO. 3, JUNE 1997.
10.     http://en.wikipedia.org/wiki/Transmission_Control_Protocol
11.     By Steven H. Low, Fernando Paganini, and John C. Doyle, “Internet Congestion Control,” IEEE Control Systems Magazine, 0272-1708/02/$17.00©2002 IEEE.

87-92

17.

Authors:

A.Akbar Motie Birjandi, Mohsen Pourfallah

Paper Title:

Optimal coordination of Overcurrent and Distance Relays by a New Particle Swarm Optimization Method

Abstract:   Nowadays, overcurrent relays play more important impression role on protection of power systems and the existence of distance relay accost of overcurrent relay causes protection increment and also complicating coordination between these relays. In recent years, intelligent optimal methods are being used more in comparison of mathematic optimal methods because of advantages -such as solving non linear problems; up speed; avoid using complicated mathematic problems, etc. For coordination of relays, at first, with detection of critical points, short circuit is done in those locations, then problem constraints are generated and the problem is solved by new method. In this paper, new method - named LP-PSO- has been suggested. This model is a combination of Linear Programming and Particle Swarm Optimization. The aim of LP (Linear Programming) is to decrease object function in any way that there are some constraints. Executed studies and comparison of results with other optimal method –Genetic algorithm -presents that coordination of relays has been done favorable.

Keywords:  Overcurrent and Distance relay, Optimal coordination, PSO algorithm, Linear programming.

References:
1.       A.J. Urdaneta, R. Nadira and L.G.Perez , "Optimal coordination of directional overcurrent relays in interconnected power systems," IEEE Trans. Power Deliv. Vol.3 pp.903-911, 1988.
2.       A.J. Urdaneta, H. Restrepo, S.Marquez and J. Sanchez, "Coordination of directional overcurrent relay timing using linear Programming," IEEE Trans. Power Deliver. vol.1, pp.122–129, 1996.
3.       B. Chattopadhyay, M.S. Sachdev and T.S. Sidhu, "An online relay coordination algorithm for adaptive protection using linear programming technique," IEEE Trans. Power Deliv. vol.11, pp. 165–173, 1996.
4.       A.J. Urdaneta and L.G. Perez, "Presolve analysis and interior point solution of the linear programming coordination problem of directional overcurrent relays," Electric Power and Energy Systems vol.23, pp. 819-825, 2000.
5.       C.W. So and K.K. Li, "Overcurrent relay coordination by evolutionary programming", Electric Power Systems Research, vol.53, pp.83–90.
6.       C.W. So, K.K. Li, K.T. Lai and      K.Y. Fung, "Application of genetic algorithm for overcurrent relay coordination", IEE 6th International Conference on Developments in Power System Protection , Nottingham , UK, pp. 66–69, March 1997.
7.       H.H. Zeineldin, E.F. El-Saadany and M.M.A. Salama, "Optimal coordination of overcurrent relays using a modified particle swarm optimization",Electric Power  Systems Research76, pp.988–995, 2006.
8.       J.Kennedy, R.Eberhart, “Particle swarm optimization”, Proc. IEEE Int. Conf, 1995.

93-98

18.

Authors:

Rashmi Bahal, Shyam Akashe, Arun Agrawal

Paper Title:

Probabilistic Analytical Framework To Minimize Expected Leakage By Employing A Dual Vth Design Technique

Abstract:   The growing demand in the multimedia rich applications are motivating the low-power and high-speed circuit designer to work more closely towards the design issues arising from the design trade-offs in power and speed. This paper targets the modeling and simulation of leakage currents and its minimization approach by Dual Vt approach. We consider the optimal selection of Vth under a statistical model of threshold variation. Probabilistic analytical models are introduced to account for the impact of Vth uncertainty on leakage power and timing slack. Using this model, we show that the non-probabilistic analysis significantly underestimates the leakage power.

Keywords:  Dual Vth, high-speed, leakage current, Probabilistic analytical models

References:
1.       S. Narendra, D. Blaauw, A. Devgan, F. Najm, “Leakage issues in IC    design: trends, estimation, and avoidance,”Proc. of ICCAD, 2003.
2.       J. Kao, S. Narendra, A. Chandrakasan, “Subthreshold Leakage Modeling and Reduction Techniques,” ICCAD,2002, pp. 141-149.
3.       S. Sirichotiyakul, et al, “Stand-by power minimization through simultaneous threshold voltage selection and circuit sizing,” DAC, 1999, pp. 436-441.
4.       Asenov, S. Kaya, JH. Davies, “Intrinsic threshold voltage fluctuations in decanano MOSFETs due to local oxide thickness variations,” IEEE Transactions on Electron Devices, vol.49, no.1, Jan. 2002, pp.112-19.
5.       M. Orshansky, L. Milor, P. Chen, K. Keutzer, C. Hu, “Impact of spatial intrachip gate length variability on the performance of high-speed digital circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Volume: 21 Issue: 5 , pp. 544-553, May 2002.
6.       W. Feller, “Probability Theory and its Applications,” John Wiley & Sons, second ed., vol. II. 1971.
7.       T. Sakurai, A.R. Newton, “Alpha-power law MOSFET model and its applications to CMOS inverter delay and other formulas,” IEEE Journal of Solid-State Circuits, Volume: 25 Issue: 2, pp. 584-594, April 1990.
8.       J.D. Warnock, et al., “The circuit and physical design of the POWER4 microprocessor,” IBM J. of R&D, Vol. 46, pp. 27-52, Jan. 2002.
9.       M. Ketkar and S. S. Sapatnekar, "Standby Power Optimization via Transistor Sizing and Dual Threshold Voltage Assignment," in Proc. International Conference on Computer-Aided Design, 2002, pp. 375-378.
10.     M. Mani, A. Devgan, and M. Orshansky, "An Efficient Algorithm for Statistical Minimization of Total Power Under Timing Yield Constraints," in Proc. Design Automation Conference, 2005, pp. 309-314.
11.     S. Mukhopadhyay, C. Neau, R. T. Cakici, A. Agarwal, C. H. Kim, and K. Roy,"Gate Leakage Reduction for Scaled Devices Using Transistor Stacking," IEEE Transactions on VLSI Systems, vol. 11, no. 4, pp. 716-730, 2003.
12.     S. Mukhopadhyay and K. Roy, "Accurate Modeling of Transistor Stacks to Effectively Reduce Total Standby Leakage in Nano-Scale CMOS Circuits," in Proc. Symposium on VLSI Circuits, 2003, pp. 53-56.
13.     D. Nguyen, A. Davare, M. Orshansky, D. Chinney, B. Thompson, and K. Keutzer,"Minimization of Dynamic and Static Power Through Joint Assignment of Threshold Voltages and Sizing Optimization," in Proc. of the International Symposium on Low Power Electronics and Design, 2003.
14.     P. Pant, R. K. Roy, and A. Chatterjee, "Dual-Threshold Voltage Assignment withTransistor Sizing for Low Power CMOS circuits," IEEE Transactions on
VLSISystems, vol. 9, no. 2, pp. 390-394, April 2001.
15.     K. Zhang et al., “SRAM design on 65-nm CMOS technology with dynamic sleep transistor for leakage reduction,” IEEE J. Solid-State Circuits, vol. 40, no. 4, Apr.2005, pp. 895-901.
16.     N. Azizi et al, “Low-leakage asymmetric-cell SRAM,”IEEE Trans. on VLSI Systems, vol. 11, no. 4, Aug. 2003, pp.701-715.
17.     C. H. Kim et al, “A forward body-biased low-leakage SRAM cache:   device, circuit and architecture considerations,” IEEE Trans. On VLSI Systems, vol. 13, no.3, Mar. 2005, pp. 349-357.
18.     C. Kim and K. Roy, “Dynamic Vt SRAM: a leakage tolerant cache memory for low voltage microprocessor,” inProc. ISLPED, 2002, pp. 251–254.
19.     H. Qin et al, “SRAM leakage suppression by minimizing standby supply voltage,” in Proc. of ISQED, 2004, pp.56-60.
20.     K. Zhang et al, "A 3-GHz 70Mb SRAM in 65nm CMOS technology with integrated column-based dynamic power Supply," in Proc. ISSCC, 2005, pp. 474–475.

99-105

19.

Authors:

Manojeet Roy, Ajay Kushwaha

Paper Title:

Mining for Web User Need

Abstract:   Two fundamental issues regarding the effectiveness of information gathering from the Web: mismatch and overload. Mismatch means some useful and interesting data has been overlooked, whereas overload means some gathered data is not what users want. Classification and clustering has become an increasingly popular method of multivariate analysis over the past two decades, and with it has come a vast amount of published material. Since there is no journal devoted exclusively to cluster analysis as a general topic and since it has been used in many fields of study. Traditional techniques related to information retrieval (IR) have touched upon the fundamental issues [1], [2].However; IR-based systems neither explicitly describe how the systems can act like users nor discover exotic knowledge from very large data sets to answer what users really want. it is challenging to use semantic relations of “kind-of”, “part-of”, and “related-to” and synthesize commonsense and expert knowledge in a single computational model.

Keywords:  Web mining, clustering, similarity search.

References:
1.       R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval.Addison Wesley, 1999.
2.       D.A. Grossman and O. Frieder Information Retrieval Algorithms and Heuristics. Kluwer Academic, 1998.
3.       M.N. Garofalakis, R. Rastogi, S. Seshadri, and K. Shim, “Data Mining and the Web: Past, Present and Future,” Proc. ACM CIKM
4.       Int’l Workshop Web Information and Data Management, pp. 43-47,1999.
5.       K.S. Jones, “Information Retrieval and Artificial Intelligence,”Artificial Intelligence, vol. 114, nos. 1-2, pp. 257-281, 1999.
6.       S.M. Madria, S.S. Bhowmick, W.K. Ng, and E.-P. Lim, “ResearchIssues in Web Data Mining,” Proc. First Int’l Conf. Data Warehousingand Knowledge Discovery, pp. 303-312, 1999.
7.       S.K. Pal and V. Talwar, “Web Mining in Soft ComputingFramework: Relevance, State of the Art and Future Directions,”IEEE Trans. Neural Networks, vol. 13, no. 5,
pp. 1163-1177, 2002.
8.       J. Srivastava, R. Cooley, M. Deshpande, and P.-N. Tan, “Web Usage Mining: Discovery and Applications  of Usage Pattern from Web Data,” SIGKDD Explorations, vol. 1, no. 2, pp. 12-23, 2002.
9.       N. Zhong, J. Liu, and Y.Y. Yao, “In Search of the Wisdom Web,” Computer, vol. 35, no. 11, pp. 27-31, Nov. 2002.
10.     S. Tsumoto and S. Hirano, “Visualization of Rule’s Similarity Using Multidimensional Scaling,” Proc. Third IEEE Int’l Conf. Data Mining, pp. 339-346, 2003.
11.     T.Y. Yan, M. Jacobsen, H. Garcia-Molina, and U. Dayal, “From User Access Patterns to Dynamic Hypertext Linking,” Proc. Fifth Int’l World Wide Web Conf., 1996.

106-110

20.

Authors:

R. M.  Potdar, Anil Mishra, Somesh Yadav

Paper Title:

Real Time Squint Eye Detection

Abstract:   This paper provides a survey on Real Time Squint Eye Detection. This is due to defective binocular vision which causes Vision loss in the turned eye. The eyes need to be straight for the brain to combine the images seen by the two eyes into a single picture. This gives us 3-D vision, which allows us to judge depth. Any turn of the eye can interrupt 3-D vision, if an eye turns in, it can reduce the total field of vision. Over the years, many methodologies have been developed to detect squint eye. In this paper, we have proposed an overview on squint eye detection system and their classification with some drawback and basic assumption for squint eye detection[1][2].

Keywords:  Hough transform, image Processing, modelling, projection function, segmentation.

References:
1.        R. Effert, J.C. Barry, A. Kaupp and M. Dahm, Eine neue photographische Methode zur Messung von Schielwinkeln bei Sauglingen und Kleinkindern, Klinische Monatsblatter fur Augenheilkunde, 198:284-289,1991.
2.        R. Effert, J.C. Barry, A. Kaupp, M. Kleine, New method for the assessment of eye deviations in strabismus. Chibret International Journal of Opthalmology, 9(2):49-6 1 , 1992.
3.        J.C. Barry, R. Effert, and A. Kaupp, Objective measurement of strabismus in infants and children through photographic reflection pattern evaluation, Ophthalmology, 99(3):320-328, 1992.
4.        T. Lehmann, A. Kaupp, D. Meyer-Ebrecht, R. Effert, Automatische Schielwinkelmessung durch Hough-Transformation und Kreuz-Kovarianz- Filterung, In: S.J. Poppl, H. Handels (Hrsg.), Mustererkennung 1993, pp. 237-244, Springer-Verlag, Berlin, 1993.
5.        P.V.C. Hough, A method and means for recognizing complex pattern, US Patent 3069654, 1962.
6.        T. Lehmann, A. Kaupp, D. Meyer-Ebrccht, R. Effert, Automatische Schielwinkelmessun 5 durch Hough-Transformation und Kreuz-Ko arianz-Filterung, In: S.J. Poppl, H. Handels :Hrsg.),Must e re rkennung 1993, p p . 237-244, Si tringer-Verlag, Berlin, 1993.
7.        J.C. Barry, R. Effert, A. Kaupp, D. Meyer-Ebrecht, H. Skopnik, B. Sommer, S. Uberhofen,M. Reim, Screening for microtropia in infants and toddlers with digital Purkinje I-IV reflection pattern evaluation: experience with a novel computer system. In: H. Kaufmann (Ed.) Tran.:uctions 2lst meeting European Strabismological
ILssociation, pp. 287-292, Salzburg 1993.
8.        A.G. Bennett and R.B. Rabbetts, Clinica' Visual Optics, Butterworths, London, 1988.
9.        G. Schroder: Technische Optik, Vogel-Bucliverlag, Wurzburg, 1987.
10.     E. Hecht and A. Zajac, Optics, Addison- Wesley Publ. Comp., Reading Ma., 1974.
11.     D.H. Ballard and C.M. Brown, Computer Vision,Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1982.
12.     H.D. Luke, Signalibertrugung. Springer- Verlag,Berlin, 3. Auflage, 1988.
13.     W.K. Pratt, Digital Image Processing, Wiley-Interscience Publication, New York, 1978

111-114

21.

Authors:

Gurudatt Kulkarni, Prasad Khatawkar, Jayant Gambhir

Paper Title:

Cloud Computing-Platform as Service

Abstract:   Cloud computing is an increasingly popular paradigm for accessing computing resources. In practice, cloud service providers tend to offer services that can be grouped into three categories: software as a service, platform as a service, and infrastructure as a service. This paper discuss the characteristics and benefits of cloud computing. The advantages in using the cloud for start-up and small businesses that lack infrastructure have been shown to far outweigh the disadvantages. Cloud platform services, also known as Platform as a Service (PaaS), provide a computing platform or solution stack on which software can be developed for later deployment in a cloud.

Keywords:  PaaS, SaaS, Cloud, Auto-scaling.

References:
1.       http://www.ibm.com/developerworks/opensource/library/os-springroo4/index.html
2.       “Detailed reference to security and geoprocessing services” ,byron ludwig and serena coetzee, Department of computer science, University of Pretoria, Pretoria, 0002
3.       “Cloud Computing Platform as Service”, InformationWeek 16 Oct. 2, 2009.
4.       “THE IMPROVEMENT OF PAAS PLATFORM”, ZENG SHU-QING; XU JIE-BIN; DEPT. OF COMPUTER. SCI. & TECHNOLOGY, SOUTH CHINA UNIVERSITY OF TECHNOLOGY. GUANGXHOU, CHINA, NETWORKING AND DISTRIBUTED COMPUTING.
5.       “CLOUD COMPUTING: AN ANALYSIS”, THAKUR RAMJIRAM SINGH, INTERNATIONAL JOURNAL OF ENTERPRISE COMPUTING & BUSINESS SYSTEMS, VOL. 1 ISSUE 2
JULY 2011.
6.       “Controlling the Cloud: Requirements for    Cloud Computing”, F5 Networks’ perspective on cloud computing: definition, architecture, and development,  Lori MacVittie
7.       L. Wang, G. Laszewski, M. Kunze and J. Tao, “Cloud computing: a perspective study”, J New Generation Computing, 2010, pp 1-11.
8.       http://www.esscloud.com/paasBenefits.html
9.       http://www.theresearchpedia.com/research-articles/top-10-benefits-of-paas

115-120

22.

Authors:

H. B. Kekre, Tanuja Sarode, Sudeep D. Thepade, Supriya Kamoji

Paper Title:

Performance Comparison of Various Pixel Window Sizes for Colorization of Grayscale Images using LBG, KPE, KFCG and KEVR in Kekre’s LUV Color Space

Abstract:   Colorization is a computer aided process of adding colors to a grayscale image or videos. The paper presents the use of assorted window sizes and their impact on colorization of grayscale images using four different Vector Quantization (VQ) Codebook generation techniques used with Kekre’s LUV color space. Also the paper analyses performance of Vector Quantization Algorithms Linde Buzo and Gray Algorithm (LBG) , Kekre’s Proportionate Error (KPE) Algorithm, Kekre’s Fast Codebook Generation Algorithm (KFCG) and Kekre’s Error Vector Rotation (KEVR) Algorithm  for colorization of grayscale images. Experimentation is conducted on Kekre’s LUV color space for the different pixel windows of sizes 1x2, 2x1, 2x2, 2x3, 3x2, 3x3, 1x3, 3x1, 2x4, 4x2, 1x4 and 4x1 to compare results obtained across various grid sizes. The results shows that the KPE performs better for colorization with pixel window sizes 1x2 and 2x1 in Kekre’s LUV color space.

Keywords:  Colorization, Color spaces, Vector Quantization, LBG, KPE, KEVR, KFCG.

References:
1.        G V. Karthikeyani, K. Duraisamy, Mr.P.Kamalkakkannan, "Conversion of grayscale image to color image with and without texture synthesis", IJCSNS International journal of Computer science and network security, Vol.7 No.4 April 2007.
2.        E.Reinhard, M. Ashikhmin, B. Gooch and P Shirley, “Colour Transfer between images”, IEEE Transactions on Computer Graphics and Applications 21, 5, pp. 34-41.
3.        Rafael C. Gonzalez & Paul Wintz, “ Digital Image Processing”, Addison Wesley Publications,    May 1987.
4.        A. Hertzmann, C. E Jacobs, N. Oliver, B. Curless and D.H. Salesin, “image Anologies”, in the proceedings of ACM SIGGRAPH 2002, pp. 341-346.
5.        G. Di Blassi, and R. D. Reforgiato, “Fast colourization of gray images”, In proceedings of Eurographics Italian Chapte, 2003.
6.        H.B.Kekre, Sudeep. D. Thepade,  “Color traits transfer to gray scale images”, in Proc of IEEE International conference on Emerging Trends in Engineering and Technology, ICETET 2008 Raisoni College of Engg, Nagpur.
7.        R. M. Gray, "Vector quantization", IEEE ASSP Mag., pp. 4-29, Apr11984.
8.        Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans.Commun., vol. COM-28, no. 1, pp. 84¬95, 1980.
9.        H. B. Kekre, Tanuja K. Sarode, "New Fast Improved Codebook Generation Algorithm for Color Images using Vector Quantization," International Journal of Engineering and Technology, vol.1, No.1, pp. 67-77, September 2008.
10.     H. B. Kekre, Tanuja K. Sarode, "An Efficient Fast Algorithm to Generate Codebook for Vector Quantization," First International Conference on Emerging Trends in Engineering and Technology, ICETET-2008, held at Raisoni College of Engineering, Nagpur, India, July 2008, Available at online IEEE Xplore.
11.     Ahmed A. Abdelwahab, Nora S. Muharram, "A Fast Codebook Design  Algorithm Based on a Fuzzy Clustering Methodology", International Journal of Image and Graphics, vol. 7, no. 2 pp. 291¬302, 2007.
12.     H. B. Kekre, Tanuja K. Sarode, "Speech Data Compression using Vector Quantization", WASET International Journal of Computer and Information Science and Engineering (IJCISE), vol. 2, No. 4, pp.: 251-254, Fall 2008. available: http://www.waset.org/ijcise.
13.     C. Garcia and G. Tziritas, "Face detection using quantized skin color regions merging and wavelet  packet analysis," IEEE Trans. Multimedia, vol. 1, no. 3, pp. 264-277, Sep. 1999.
14.     H. B. Kekre, Tanuja K. Sarode, Bhakti Raul, "Color Image Segmentation using Kekre's Fast Codebook Generation Algorithm Based on Energy Ordering Concept", ACM International Conference on Advances in Computing, Communication and Control (ICAC3-2009), 23-24 Jan 2009, Fr. Conceicao Rodrigous College of Engg., Mumbai. Available on online ACM portal.
15.     Dr.H.B. Krkre, Sudeep D. Thepade, “Image Blending in Vista Creation using Kekre’s LUV Color Space”, In Proc. of SPIT-IEEE Colloquium, Mumbai, Feb  4-5,2008.
16.     H. B. Kekre, Tanuja K. Sarode, "Speech Data Compression using  Vector Quantization", WASET International Journal of Computer and Information Science and Engineering (IJCISE), vol. 2, No. 4, 251¬254, Fall 2008. available: http://www.waset.org/ijcise.
17.     H. B. Kekre, Ms. Tanuja K. Sarode, Sudeep D. Thepade, "Image Retrieval using Color-Texture Features from DCT on VQ Codevectors obtained by Kekre's Fast Codebook Generation", ICGST-International Journal on Graphics, Vision and Image Processing (GVIP),Volume 9, Issue 5, pp.: 1-8, September 2009. Available online at
http://www.icgst.com/gvip/Volume9/Issue5/P1150921752.html.
18.     H.B.Kekre, Tanuja K. Sarode, Sudeep D. Thepade, "Color-Texture   Feature based Image Retrieval using DCT applied on Kekre's Median Codebook", International Journal on Imaging (IJI),Available online at www.ceser.res.in/iji.html.
19.     Dr. H. B. Kekre, Sudeep D. Thepade, Nikita Bhandari, “Colorization of Greyscale images using Kekre’s Bioorthogonal Color Spaces and Kekre’s  Fast Codebook Generation “,CSC Advances in Multimedia An international journal (AMU), volume 1, Issue 3, pp.49-58, Available at
www.cscjournals.org/csc/manuscript/journals/AMIJ/volume1/Issue3/AMU-13.pdf.
20.     Dr. H. B. Kekre, Sudeep D. Thepade,Adib Parkar, “A Comparison of Harr Wavelets and Kekre’s Wavelets for Storing Color Information in a Greyscale Images”, International Journal of Computer Applications(IJCA), Volume 1, Number 11, December 2010,pp 32-38. Available at
www.ijcaonline.org/archives/volume11/number11/1625-2186.
21.     Dr. H. B. Kekre, Sudeep D. Thepade,Archana Athawale, Adib Parkar, “Using Assorted Color Spaces and pixel window sizes for Colorization of Grayscale images’,ACM International Conferences and workshops on emerging Trends in Technology(ICWET 2010), Thakur College of Engg. And Tech.,Mumbai,26-27 Feb 2010.
22.     H. B. Krekre,Sudeep Thepade, Adib Parkar, “A comparison of Kekre’s Fast Search and Exhaustive Search for various grid sizes used for coloring a Grayscale Image” Second International conference on signal Acquisition and Processing, (ICSAP2010), IACSIT,Banglore,pp.53-57,9-10 Feb 2010.
23.     Dr. H.B. Kekre, Dr.Tanuja Sarode, Dr. Sudeep Thepade , Ms. Supriya Kamoji “Analysing Assorted Window Sizes with LBG and KPE Codebook Generation Techniques for Grayscale Image Colorization”, International Journal of Computer Science and Information Security (IJCSIS) , Vol 9, Issue 6, pp 134-138.
24.     Dr. H.B.  Kekre,  Dr.Tanuja Sarode,  Dr. Sudeep Thepade ,   Ms. Supriya Kamoji  “Performance Analysis of Various Window Sizes for Colorization of Grayscale Images using LBG and KFCG Vector Quantization Codebooks in RGB and Kekre’s LUV Color Spaces”  International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume 1, Issue 4, pp 148-153.
25.     H. B. Kekre, Tanuja K. Sarode, "New Clustering algorithm for vector quantization using rotation of error vector", International Journal of computer and Information Security, Vol .7,No 3,2010.

121-125

23.

Authors:

Poonam Yerpude

Paper Title:

Vector Approximation File: Cluster Bounding in High-Dimension Data Set

Abstract:   In many modern application ranges high-dimensional feature vectors are used to model complex data sets. We have proposed an overview about efficient indexing method for high-dimensional database using an filtering approach known as vector approximation approach which supports the nearest neighbor search efficiently And A cluster distance bound based on separating hyper planes, that complements our index in electively retrieving clusters that contain data entries closest to the query. The Creation of approximation for Vectors for use in similarity (also known the retrieval of k-nearest neighbor) is examined.

Keywords:  Similarity Search, indexing, vector quantization, clustering, Nearest Neighbor search.

References:
1.        Kriegel H.-P. Berchtold S. S3: Similarity search in cad database systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 564{567, Tuscon, Arizona, 1997.
2.        P. Bernstein, M. Brodie, S. Ceri, D. DeWitt,M. Franklin, H. Garcia-Molina, J. Gray, J. Held,J. Hellerstein, H. Jagadish, M. Lesk, D. Maier,J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ull-man. The Asilomar report on database research. ACM Sigmod Record, 27(4), December 1998.
3.        S. Berchtold, D. A. Keim, and H. P. Kreigel. The X-tree: An index structure for high-dimensional data. In 22nd. Conference on Very Large Databases, pages 28{39, Bombay, India, 1996.
4.        R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for [4]similarity-search methods in high-dimensional spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 194{205,New York City, New York, August 1998.
5.        H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989.
6.        S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM Symp. on Principles of Database Systems, pages 78{86, Tuscon, Arizona, June 1997.
7.        V. Gaede and O. Gunther. multidimensional access methods. ACM Computing Surveys, 30:170{231, 1998.
8.        R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 194{205,New York City, New York, August 1998.
9.        Zimek, A. (2008). Correlation Clustering. http://edoc.ub.uni-muenchen.de/8736/.
10.     Kriegel, H.-P.; Kröger, P., Zimek, A. (March 2009). "Clustering High Dimensional Data: A survey on Subspace Clustering, Pattern-based Clustering, and Correlation
Clustering". ACM Transactions on Knowledge Discovery from Data (TKDD) 3 (1): 1–58.:10.1145/1497577.1497578. http://doi.acm.org/10.1145/1497577.1497578
11.     Böhm, C., Kailing, K., Kröger, P., Zimek, A. (2004). "Computing Clusters of Correlation Connected Objects". Proc. ACM SIGMOD International Conference on Management of Data (SIGMOD'04), Paris, France. pp. 455–467.:10.1145/1007568.1007620. http://doi.acm.org/10.1145/1007568.1007620.
12.     R. Weber, H. Schek, and S. Blott, “A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces.”in VLDB, August 1998, pp. 194–205.
13.     A. Gersho and R. M. Gray, Vector Quantization and Signal Compression Kluwer Academic Publishers, 1992.
14.     T. Zhang, R. Ramakrishnan, and M. Livny, “BIRCH: An efficient data clustering method for very large databases.” in SIGMOD, 1996, pp. 103–114.
15.     K. Chakrabarti and S. Mehrotra. The hybrid tree: An index structure for high dimensional feature spaces. In Proc. Int. Conf. Data Engineering, pages 440{447, Sydney, Australia, 1999.

126-130

24.

Authors:

Naveen Choudhary

Paper Title:

Deadlock Free Routing in Irregular Interconnection Networks for Complex SoCs

Abstract:  Networks-on-Chip (NoC) is recently proposed as an alternative communication infrastructure/Interconnection Network for address the high communication demands of the complex futuristic SoCs. Most researchers advocate the use of traditional regular networks like meshes as architectural templates which gained a high popularity in general-purpose parallel computing.  However, most SoC platforms are special-purpose tailored to the domain-specific requirements of their application. They are usually built from a large diversity of heterogeneous components which communicate in a very specific, mostly irregular way.  In such systems the size and nature of cores may vary quite widely making the topology irregular. Moreover regular topologies can become irregular due to faults in links and switches. In such scenario topology agnostic routing algorithms are generally required. In this paper, a survey of various deadlock free table based routing function is presented. The paper presents survey of deadlock free routing function with and without the availability of virtual layers

Keywords:  Interconnection Networks, System on Chip, Routing, Deadlock, Virtual Layers

References:
1.        O. T. Skeie, I.Theiss, “Layered Shortest Path (lash) Routing in Irregular SAN.”, In Proceedings of  the International Symposium on Parallel and Distributed Processing (IPDPS), pp. 162-169, 2002.
2.        J.C.Sancho, A. Robles, J. Flich, P. Lopez, J. Duato, “Effective Methodology for Deadlock-Free Minimal Routing in Infiniband Networks. In International Conference On Parallel Processing, Aug.   2002.
3.        T.Skeie, O. Lysne, A. Robles, J. Flich, P. Lopez, J. Duato, “ Lash-tor: A Generic Transition-Oriented  Routing Algorithm”, In IEEE International Conference on Parallel and Distributed Systems, July 2004.
4.        M.Koibuchi, A. Jouraku, K. Watanable, H. Amano, “Descending Layers Routing: A Deadlock-Free  Deterministic Routing using Virtual Channels in System Area Networks with Irregular Topologies”, In International Conference on Parallel Processing, pp. 527-536, 6-9 Oct. 2003.
5.        J.Flich, J. C. Sancho, A. Robles, P. Lopez, J. Duato, “Improving Infiniband  Routing through Multiple Virtual Networks. In Proceedings of the 4th International Symposium on High Performance Computing,  pp. 49-63, 2002.
6.        M. D. Schroeder et al., “Autonet: A High-Speed Self-Configuring Local Area Network Using Point-to-Point Links”, In Journal on Selected Areas in Communications, vol. 9, Oct. 1991.
7.        A. Jouraku, A. Funahashi, H. Amano, M. Koibuchi, “L-turn routing: An Adaptive Routing in Irregular Networks”, In the International Conference on Parallel Processing, pp. 374-383, Sep. 2001.
8.        Y.M. Sun, C.H. Yang, Y.C Chung, T.Y. Hang, “An Efficient Deadlock-Free Tree-Based Routing  Algorithm for Irregular Wormhole-Routed Networks Based on Turn Model”, In International Conference on Parallel Processing, vol. 1, pp. 343-352, Aug. 2004.
9.        J. Wu, L. Sheng, “Deadlock-Free Routing in Irregular Networks Using Prefix Routing”,  DIMACS Tech. Rep. 99-19, Apr. 1999.
10.     J.C.Sancho et al., “A Flexible Routing Scheme for Networks of Workstations”, In  the International Conference on High Performance Computing, Oct. 2000.
11.     V. L.Cherkasova, T.Rokicki, “Fibre Channel Fabrics: Evaluation and Design”, In Proceedings of the 29th International Conference on System Sciences, Vol. 1, pp.
53-62, 3-6 Jan. 1996.
12.     J. Duato, S. Yalamanchili, L. Ni, “Interconnection Networks: An Engineering Approach”, Elsevier, 2003.
13.     A. Mejia, J. Flich, J. Duato, S.A. Reinemo, T. Skeie, “ Segment Based Routing: An Efficient Fault-Tolerant Routing Algorithm for Meshes and Tori”, In IEEE Proceeding of 20th International  Conference on Parallel and Distributed Processing Symposium (IPDPS 2006), April 2006.
14.     J. Flich, A. Mejia, P. L’opez, J. Duato, “Region-Based Routing: An Efficient Routing Mechanism to Tackle Unreliable Hardware in Network on Chips”, In IEEE Proceeding on Networks on Chip, pp.183- 194, May 2007.
15.     M. Ali, M. Welzl, S. Hellebrand, “A Dynamic Routing Mechanism for Network on Chip”, In IEEE Proceeding of 23rd NORCHIP Conference, pp. 70-73, Nov. 2005.
16.     16. J. C. Sancho, A. Robles, “Improving the Up*/down* Routing Scheme for Networks of Workstations”, In the Proceedings of Euro-Par 2000, Aug. 2000.

131-136

25.

Authors:

Shailesh R. Thakare, C.A. Dhawale, Ajay B.Gadicha

Paper Title:

Design Distributed Database Strategies for SQMD Architecture

Abstract:   Database is not static but rapidly grows in size. These issues include how to allocate data, communication of the system, the coordination among the individual system, distributed transition control and query processing, concurrency control over distributed relation, design  of global user interface, design of component system in different physical location, integration of  existing database system security. The system architecture makes use of software portioning of the database based on data clustering, SQMD (Single Query Multiple Database) architecture, a web services interface and virtualization software technologies.  The system allows uniform access to concurrently distributed database, using SQMD architecture. In this Paper explain Design Strategies of Distributed Database for SQMD architecture.

Keywords:  SQMD, Global User Interface

References:
1.       Kangseak Kin, Rajarshi Guha,Marton E.Pierce,Geoffrey C.Fox,Divid J.Wild Kevin E.Gilbert”SQMD:Architecture for Scalable, Distributed Database System built on Virtual Private Ser vers”,{Kakim rguha, Marpire, gef, djwild, gilben}@indiana.edu
2.       Dixu “Distributed Database System Design” Minnesota State University Kankato.
3.       Ahmet Uyar, Wenjun Wu, Hasan Bulut, Geoffrey Fox. Service-Oriented Architecture for Building a Scalable
4.       Videoconferencing System March 25 2006 to appear in book "Service-Oriented Architecture - Concepts & Cases" published by Institute of Chartered Financial Analysts of India (ICFAI) University.
6.       Apache Axis2, http://ws.apache.org/axis2/
7.       Ballester, P.J., Graham-Richards, W., J. Comp. Chem., 2007, 28, 1711-1723.
8.       Cassandra project, http://code.google.com/p/the-cassandra-project/
9.       Chaitanya K. Baru, Gilles Fecteau, Ambuj Goyal, Hui-I Hsiao, Anant Jhingran, Sriram Padmanabhan, George P. Copeland,
10.     Walter G. Wilson. DB2 Parallel Edition. IBM System Journal, Volume 34, pp 292-322, 1995.
11.     Chembiogrid (Chemical Informatics and Cyberinfrastructure Collaboratory),
12.     http://www.chembiogrid.org/wiki/index.php/Main_Page
13.     Ciaccia, P., Patella, M., Zezula, P., Proc. 23rd Intl. Conf. VLDB, 1997.
14.     Community Grids Lab (CGL), http://communitygrids.iu.edu
15.     Dalby, A., Nourse, J., Hounshell, W., Gushurst, A., Grier, D., Leland, B., Laufer, J., J. Chem. Inf. Comput. Sci., 1992, 32,

137-140